solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
def gcd(a,b):
if a == 0:
return b
if b == 0:
return a
r = 1
while r > 0:
r = a % b
a = b
b = r
return a
n=int(input())
a=list(map(int,input().split()))
x=a[0]
for i in range(1,n):
x=gcd(x,a[i])
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
l=make_divisors(x)
print(len(l))
| 9 | PYTHON3 |
#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;
while (cin >> a >> b) {
int deg[100] = {};
deg[0]++; deg[1]++;
deg[a - 1]++; deg[b - 1]++;
while (cin >> a >> b, a) {
deg[a - 1]++; deg[b - 1]++;
}
bool ok = true;
for (int i = 0; i < 100; i++) {
ok &= deg[i] % 2 == 0;
}
cout << (ok ? "OK" : "NG") << endl;
}
return 0;
}
| 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
int n,m,k;
int mp[11][1010];
int bel[11],tot,sum[11];
int Next(int x)
{
memset(sum,0,sizeof(sum));
int p=x;
while(x<=m)
{
bool flag=1;
for(int i=1;i<=n;i++)
{
sum[bel[i]]+=mp[i][x];
if(sum[bel[i]]>k)
flag=0;
}
if(!flag)
break;
x++;
}
if(p==x)
return -1;
return x;
}
int main()
{
int minn=2e9;
scanf("%d %d %d",&n,&m,&k);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%1d",&mp[i][j]);
for(int i=(1<<(n-1))-1;i>=0;i--)
{
bel[1]=tot=1;
for(int j=2;j<=n;j++)
{
if(i&(1<<(j-2)))
bel[j]=bel[j-1];
else
bel[j]=++tot;
}
int x=1,ans=0;
while(x!=-1&&x<=m)
x=Next(x),ans++;
if(x!=-1)
minn=min(minn,ans+tot-2);
}
printf("%d\n",minn);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, ki;
long long m, memo[150][20000], mod = 1000000007;
long long modPow(long long xi, long long ni, long long modi) {
long long res = 1;
while (ni > 0) {
if (ni & 1) res = (res * xi) % modi;
xi = (xi * xi) % modi;
ni >>= 1;
}
return res;
}
const int MAX_N = 300;
long long DPcombination[MAX_N + 1][MAX_N + 1];
void combination(int n) {
for (int i = 0; i <= n; i++) {
DPcombination[i][0] = 1LL;
for (int j = 1; j < i; j++)
DPcombination[i][j] =
(DPcombination[i - 1][j - 1] + DPcombination[i - 1][j]) % mod;
DPcombination[i][i] = 1LL;
}
}
int main() {
cin >> n >> m >> ki;
for (int i = 0; i < 150; i++)
for (int j = 0; j < 20000; j++) memo[i][j] = -1;
combination(200);
memo[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= n; j++) {
long long comb = DPcombination[n][j], po = m / n;
if (m % n >= i + 1) po++;
long long res = modPow(comb, po, mod);
for (int k = 0; k <= ki; k++) {
if (memo[i][k] != -1 && k + j <= ki) {
if (memo[i + 1][k + j] == -1) memo[i + 1][k + j] = 0;
memo[i + 1][k + j] = (memo[i + 1][k + j] + (res * memo[i][k])) % mod;
}
}
}
}
cout << memo[n][ki] << endl;
return 0;
}
| 10 | CPP |
a, b = map(int, input().split())
while a != 0 and b != 0:
c = 2 * a
d = 2 * b
if a >= d: a %= d
elif b >= c: b %= c
else: break
print(a, b) | 8 | PYTHON3 |
D = int(input())
c = [int(x) for x in input().split()]
s = [[int(x) for x in input().split()] for _ in range(D)]
T = [int(input())-1 for _ in range(D)]
last = [-1 for _ in range(26)]
satisfy = 0
for day, t in enumerate(T):
last[t] = day
loss = sum(c[i]*(day-last[i]) for i in range(26))
satisfy += s[day][t] - loss
print(satisfy) | 0 | PYTHON3 |
n,m,a,b=map(int,(input().split(' ')))
if b>=m*a:
print(n*a)
else:
if ((n//m)*b+(n%m)*a) >n//m*b+b:
print(n//m*b+b)
else:
print((n//m)*b+(n%m)*a)
| 7 | PYTHON3 |
#include <stdio.h>
int main(void)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a==1&&b==1)
printf("Open\n");
else if(c==1)
printf("Open\n");
else
printf("Close\n");
return 0;
} | 0 | CPP |
a, b, c, d = map(int, input().split())
print(max([a * b, c * d])) | 0 | PYTHON3 |
#include <bits/stdc++.h>
const long long int M = 1e9 + 7;
using namespace std;
int main() {
long long int n;
scanf("%*d");
while (~scanf("%lld", &n)) {
long long int x, i, sum = 0, xr = 0;
for (i = 0; i < n; i++) scanf("%lld", &x), sum += x, xr ^= x;
sum += xr;
printf("2\n%lld %lld\n", xr, sum);
}
return 0;
}
| 9 | 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 |
a,b,c=sorted(map(int,input().split()))
print(b-a + c-b)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void setmax(T& x, T y) {
x = max(x, y);
}
template <typename T>
void setmin(T& x, T y) {
x = min(x, y);
}
const double PI = acos(-1.0);
const long long INF = 1e9 + 47;
const long long LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string s;
cin >> s;
string t = s;
sort(t.begin(), t.end());
if (t.back() == 'a') {
t.back() = 'z';
cout << t << endl;
return 0;
}
for (int i = (0); i < ((int)((s).size())); ++i)
if (s[i] == 'a') {
cout << s[i];
} else {
int id = (int)((s).size());
for (int j = (i); j < ((int)((s).size())); ++j)
if (s[j] == 'a') {
id = j;
break;
}
for (int j = (i); j < (id); ++j) {
cout << (char)(s[j] - 1);
}
for (int j = (id); j < ((int)((s).size())); ++j) {
cout << s[j];
}
cout << endl;
return 0;
}
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| 7 | CPP |
T = int(input())
def solve():
n, x = map(int, input().split())
a = list(map(int, input().split()))
if n == x:
if sum(a) & 1 == 1:
print('Yes')
else:
print('No')
return
odd = 0
for num in a:
if num & 1 == 1:
odd += 1
even = n - odd
# 1, 3, 5, 7
if odd == 0:
print('No')
return
if x >= odd:
if odd & 1 == 0:
x -= odd-1
else:
x -= odd
else:
if x % 2 == 0:
x = 1
else:
print('Yes')
return
if even >= x:
print('Yes')
else:
print('No')
for _ in range(T):
solve() | 7 | PYTHON3 |
S=input()
k=S.count('H')
k1=S.count('Q')
k2=S.count('9')
D=k+k1+k2
if D>=1:
print('YES')
else:
print('NO')
| 7 | PYTHON3 |
n = int(input())
a = []
b = []
c = []
ab = []
ac = []
bc = []
abc = []
ashowed = 0
bshowed = 0
cshowed = 0
for i in range(n):
x,y = input().split()
x = int(x)
if 'A' in y:
ashowed += 1
if 'B' in y:
bshowed += 1
if 'C' in y:
cshowed += 1
abc.append(x)
else:
ab.append(x)
elif 'C' in y:
cshowed += 1
ac.append(x)
else:
a.append(x)
elif 'B' in y:
bshowed += 1
if 'C' in y:
cshowed += 1
bc.append(x)
else:
b.append(x)
else:
cshowed += 1
c.append(x)
if (not ashowed*bshowed*cshowed):
print(-1)
else:
price = 10000000000000
if (a != [] and bc != []):
price = min(price, min(a)+min(bc))
if (b != [] and ac != []):
price = min(price, min(b)+min(ac))
if (c != [] and ab != []):
price = min(price, min(c)+min(ab))
if (a != [] and b != [] and c != []):
price = min(price, min(a)+min(b)+min(c))
if (ab != [] and bc != []):
price = min(price, min(ab)+min(bc))
if (ac != [] and bc != []):
price = min(price, min(ac)+min(bc))
if (ab != [] and ac != []):
price = min(price, min(ab)+min(ac))
if (abc != [] ):
price = min(price, min(abc))
print(price)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int ans = 0;
bool f = 0;
cin >> s;
for (int i = 1; i < s.size(); i++)
if (s[i] == 'K' && s[i - 1] == 'V')
ans++, i++;
else if (s[i] == s[i - 1])
if (s[i] == 'V' && s[i + 1] == 'K')
;
else
f = 1;
f ? cout << ans + 1 : cout << ans;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 5;
const int MOD = 1e9 + 7;
int n, pw[22], dp[MAX][22][2];
int get_g(int e2, int e3) {
int g_ = pw[e2];
if (e3 > 0) g_ *= 3;
return g_;
}
int F(int i, int e2, int e3) {
if (i == n + 1) {
return e2 == 0 && e3 == 0;
}
int &ans = dp[i][e2][e3];
if (ans != -1) return ans;
ans = 0;
int g_ = get_g(e2, e3);
for (int x = 0; x < 2; x++) {
for (int y = 0; y < 2; y++) {
if (e2 - x < 0 || e3 - y < 0) continue;
if (x + y < 2) {
int g = get_g(e2 - x, e3 - y);
int value = (n / g) - (n / g_);
if (g == g_) value = (n / g) - (i - 1);
value = max(0, value);
int v = 1LL * value * F(i + 1, e2 - x, e3 - y) % MOD;
ans = (ans + v) % MOD;
}
}
}
return ans;
}
int main() {
scanf("%d", &n);
memset(dp, -1, sizeof(dp));
pw[0] = 1;
for (int i = 1; i <= 20; i++) pw[i] = pw[i - 1] * 2;
int k = log2(n);
int ans = F(2, k, 0);
if (3 * (1 << (k - 1)) <= n) ans = (ans + F(2, k - 1, 1)) % MOD;
printf("%d\n", ans);
return 0;
}
| 11 | CPP |
s=input()
t=s.replace("BC","D")
a=0
ans=0
for i in t:
if i=="A":
a+=1
elif i=="D":
ans+=a
else:
a=0
print(ans) | 0 | PYTHON3 |
N = list(map(int,list(input())))
ans = 0
skfl = 0
nf = 0
for i in range(1, len(N) + 1):
if i != len(N):
if N[-(i+1)] >= 5:
nf = 1
if N[-i] + skfl + nf > 5:
ans += 10 - N[-i] - skfl
skfl = 1
else:
ans += N[-i] + skfl
skfl = 0
nf = 0
print(ans+skfl) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Rule1 {
bool operator()(const int &o1, const int &o2) { return o1 % 10 > o2 % 10; }
};
int main() {
int n, k;
while (cin >> n >> k) {
int o[100005];
int p[100005];
int q[100005];
int i;
int sum = 0;
for (i = 0; i < n; i++) {
cin >> o[i];
p[i] = o[i];
}
sort(o, o + n, Rule1());
for (i = 0; i < n; i++) {
if ((o[i] % 10) == 0) break;
while ((o[i] % 10) != 0) {
int cha;
p[i] = (o[i] / 10 + 1) * 10;
cha = p[i] - o[i];
if (k >= cha) {
o[i] = p[i];
k -= cha;
} else {
o[i] = o[i] + k;
k = 0;
}
if (k == 0) break;
if (k > 0 && i == n - 1) break;
}
if (i == n - 1) break;
}
if (k > 0) {
for (i = 0; i < n; i++) {
int chaa;
chaa = 100 - o[i];
if (k >= chaa) {
o[i] = 100;
k -= chaa;
} else {
o[i] += k;
k = 0;
}
if (k == 0) break;
if (i == n - 1) break;
}
}
for (i = 0; i < n; i++) {
int gao;
gao = o[i] / 10;
sum += gao;
}
cout << sum << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1100005;
int n, o, maxc, qzl, qzr, qznum, qzmin, e, ll, rr;
long long ans;
pair<pair<int, int>, pair<int, int> > range[maxn], range2[maxn];
double vx, vy, obx, oby, k, b[maxn], nowy1, nowy2, cc, ccc[maxn];
int a[1005][1005], ee[maxn];
struct tree {
tree *lchild, *rchild;
int min, delta;
} * root;
double dis(const double &x1, const double &y1, const double &x2,
const double &y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
bool equal(const double &a, const double &b) { return (abs(a - b) <= 1e-9); }
bool cmp(int a, int b) {
double v1 = ccc[a];
double v2 = ccc[b];
if (equal(v1, v2))
return range[a].first < range[b].first;
else
return v1 < v2;
}
void maketree(tree *&node, int left, int right) {
tree *p;
p = new tree;
p->lchild = 0;
p->rchild = 0;
p->delta = 0;
p->min = 0;
node = p;
if (left == right) return;
maketree(node->lchild, left, (left + right) / 2);
maketree(node->rchild, (left + right) / 2 + 1, right);
}
void downit(tree *p) {
if (p->delta != 0) {
if (p->lchild != 0) {
p->lchild->delta = max(p->lchild->delta, p->delta);
p->rchild->delta = max(p->rchild->delta, p->delta);
p->lchild->min = max(p->lchild->min, p->delta);
p->rchild->min = max(p->rchild->min, p->delta);
}
p->delta = 0;
}
}
void update(tree *p) { p->min = min(p->lchild->min, p->rchild->min); }
void doit(tree *p, int l, int r) {
if ((l > qzr) || (r < qzl)) return;
downit(p);
if ((l == qzl) && (r <= qzr)) {
qzl = r + 1;
qzmin = min(qzmin, p->min);
} else {
doit(p->lchild, l, (l + r) / 2);
doit(p->rchild, (l + r) / 2 + 1, r);
update(p);
}
}
void ddt(tree *p, int l, int r) {
if ((l > qzr) || (r < qzl)) return;
downit(p);
if ((l == qzl) && (r <= qzr)) {
qzl = r + 1;
if (qznum > p->min) {
p->delta = qznum;
p->min = max(p->min, qznum);
}
downit(p);
} else {
ddt(p->lchild, l, (l + r) / 2);
ddt(p->rchild, (l + r) / 2 + 1, r);
update(p);
}
}
void pushmax(int l, int r, int c) {
qzl = l;
qzr = r;
qznum = c;
ddt(root, 1, o);
}
int getmin(int l, int r) {
qzl = l;
qzr = r;
qzmin = 2147483647;
doit(root, 1, o);
return qzmin;
}
int getnum() {
int e = 0;
char ch;
while (true) {
ch = getchar();
if ((ch >= '0') && (ch <= '9'))
e = e * 10 + ch - 48;
else
break;
}
return e;
}
int main() {
scanf("%d %lf %lf\n", &n, &vx, &vy);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) a[i][j] = getnum();
if (vx == 0) {
ans = 0;
for (int i = 1; i <= n; i++) {
maxc = 0;
for (int j = 1; j <= n; j++) maxc = max(maxc, a[i][j]);
ans += (long long)maxc;
}
printf("%I64d\n", ans);
} else {
int left, right, mid;
obx = (-vx) * 10000000;
oby = (-vy) * 10000000;
k = vy / vx;
o = 0;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++) {
++o;
b[o] = j - k * i;
}
sort(b + 1, b + o + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
left = 1;
right = o;
while (left <= right) {
mid = (left + right) / 2;
nowy1 = k * (i - 1) + b[mid];
nowy2 = k * i + b[mid];
cc = max(nowy1, nowy2);
if ((cc > (j - 1)) || (equal(cc, j - 1)))
right = mid - 1;
else
left = mid + 1;
}
ll = left;
left = 1;
right = o;
while (left <= right) {
mid = (left + right) / 2;
nowy1 = k * (i - 1) + b[mid];
nowy2 = k * i + b[mid];
cc = min(nowy1, nowy2);
if ((cc < j) || (equal(cc, j)))
left = mid + 1;
else
right = mid - 1;
}
rr = right;
range[(i - 1) * n + j] = make_pair(make_pair(i, j), make_pair(ll, rr));
ccc[(i - 1) * n + j] = dis(obx, oby, i, j);
}
for (int i = 1; i <= n * n; i++) ee[i] = i;
sort(ee + 1, ee + n * n + 1, cmp);
maketree(root, 1, o);
ans = 0;
for (int i = 1; i <= n * n; i++) {
pair<pair<int, int>, pair<int, int> > td = range[ee[i]];
e = getmin(td.second.first, td.second.second - 1);
ans += (long long)(max(a[td.first.first][td.first.second] - e, 0));
pushmax(td.second.first, td.second.second - 1,
a[td.first.first][td.first.second]);
}
printf("%I64d\n", ans);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n,m;
map<int,int> mp;
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
++mp[x];
}
bool check=true;
scanf("%d",&m);
for (int i=1;i<=m;i++)
{
int x;
scanf("%d",&x);
--mp[x];
if (mp[x]<0) check=false;
}
if (check) cout << "YES" << endl; else cout << "NO" << endl;
return 0;
}
| 0 | CPP |
n = str(input())
print (min(len(n), n.count('a') * 2 - 1))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
//define/typeDef
#define all(a) a.begin(), a.end()
#define double long double
#define int long long
#define NIL 0
#define INF LLONG_MAX
#define loop(n) for(int i=0;i<n; i++)
#define rloop(n) for(int i=n-1; i>=0; i--)
using namespace std;
map<int, bool> vis;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int k, l, r, t, x, y;
cin >> k >> l >> r >> t >> x >> y;
if (x >= y) {
int t1 = (k + y - r + x - 1) / x;
if (k - t1 * x < l) {
return cout << "No\n", 0;
}
int k1 = k - t1 * x;
if (x == y)
return cout << "Yes\n", 0;
if (k1 + y > r)
return cout << "No\n", 0;
int t2 = (k1 - l) / (x - y) + 1;
--t2;
cout << (t1 + t2 >= t ? "Yes\n" : "No\n");
} else {
while (t > 0) {
if (k + y <= r) {
k += y;
}
int t1 = (k - l) / x;
k -= t1 * x;
if (t1 == 0) {
return cout << "No\n", 0;
}
if (vis[k])
return cout << "Yes\n", 0;
vis[k] = true;
t -= t1;
}
return cout << "Yes\n", 0;
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e18;
const int N = 2e6 + 5;
long long f[N], tot;
bool ck(long long x) {
long long t = sqrt(x);
return t * t < x;
}
int main() {
for (long long i = 2; i <= 1000000; i++) {
long long x = i * i;
while (x <= M / i) {
x *= i;
if (ck(x)) f[++tot] = x;
}
}
sort(f + 1, f + 1 + tot);
tot = (unique(f + 1, f + 1 + tot) - f - 1);
int t;
scanf("%d", &t);
while (t--) {
long long n;
scanf("%lld", &n);
printf("%lld\n",
n - (long long)(upper_bound(f + 1, f + 1 + tot, n) - f - 1) -
(long long)sqrt(n));
}
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n, k;
long long memo[2010][2010];
long long dp(int i, int nm) {
if (!nm) return 1;
if (memo[i][nm] != -1) return memo[i][nm];
long long ans = 0;
for (int j = i; j <= n; j += i) {
if (j % i == 0) ans += dp(j, nm - 1);
}
return memo[i][nm] = ans % mod;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
memset(memo, -1, sizeof memo);
cin >> n >> k;
cout << dp(1, k) << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
const int M = 2005;
vector<int> adj[M];
int vis[M], mp[M];
pair<long long, long long> dfs(int p, int x) {
pair<long long, long long> ans = {2134567891, 0};
if (vis[x]) return {0, x};
for (auto y : adj[x])
if (y != p) {
pair<long long, long long> now = dfs(x, y);
now.first += 1;
ans = min(ans, now);
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t, tt = 1;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < (n + 2); i++) adj[i].clear();
memset((vis), 0, sizeof(vis));
memset((mp), 0, sizeof(mp));
for (int i = 0; i < (n - 1); i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
int k1, k2, val;
cin >> k1;
for (int i = 0; i < (k1); i++) {
cin >> val;
vis[val] = 1;
}
cin >> k2;
for (int i = 0; i < (k2); i++) {
cin >> val;
mp[val] = 1;
;
}
cout << "B " << val << endl;
fflush(stdout);
int x;
cin >> x;
int y = dfs(0, x).second;
cout << "A " << y << endl;
fflush(stdout);
cin >> x;
if (mp[x])
cout << "C " << y << endl;
else
cout << "C -1" << endl;
fflush(stdout);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:10000000000")
using namespace std;
const int maxN = 800 + 2;
const int K = 16;
const double INF = 1e9;
int q = 0;
int n;
int r1x1 = 1, r1y1 = 1, r1x2 = 1, r1y2 = 1, r2x1 = 1, r2y1 = 3, r2x2 = 3,
r2y2 = 3;
int querry(int x1, int y1, int x2, int y2) {
cout << "? " << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
int res = 0;
cin >> res;
return res;
}
int get(int x1, int y1, int x2, int y2) {
x1 = max(x1, 1);
x2 = min(x2, n);
y1 = max(y1, 1);
y2 = min(y2, n);
assert(q <= 200);
q++;
return querry(x1, y1, x2, y2);
}
int main() {
cin >> n;
int gr = 0;
for (int k = K; k >= 0; k--) {
if (get(1, 1, gr + (1 << k), n) != 2) {
gr += (1 << k);
}
}
gr++;
int gl = n + 1;
for (int k = K; k >= 0; k--) {
if (get(gl - (1 << k), 1, n, n) != 2) {
gl -= (1 << k);
}
}
gl--;
int gu = 0;
for (int k = K; k >= 0; k--) {
if (get(1, 1, n, gu + (1 << k)) != 2) {
gu += (1 << k);
}
}
gu++;
int gd = n + 1;
for (int k = K; k >= 0; k--) {
if (get(1, gd - (1 << k), n, n) != 2) {
gd -= (1 << k);
}
}
gd--;
int lr = gl - 1;
for (int k = K; k >= 0; k--) {
if (get(gl, gd, lr + (1 << k), gu) < 1) {
lr += (1 << k);
}
}
lr++;
if (get(gl, gd, lr, gu) == 1 && get(lr + 1, gd, gr, gu) == 1) {
int ll1 = gr + 1;
for (int k = K; k >= 0; k--) {
if (get(ll1 - (1 << k), gd, gr, gu) < 1) {
ll1 -= (1 << k);
}
}
ll1--;
int lu1 = gd - 1;
for (int k = K; k >= 0; k--) {
if (get(gl, gd, lr, lu1 + (1 << k)) < 1) {
lu1 += (1 << k);
}
}
lu1++;
int ld1 = gu + 1;
for (int k = K; k >= 0; k--) {
if (get(gl, ld1 - (1 << k), lr, gu) < 1) {
ld1 -= (1 << k);
}
}
ld1--;
int x11 = gl, y11 = ld1, x12 = lr, y12 = lu1;
lu1 = gd - 1;
for (int k = K; k >= 0; k--) {
if (get(ll1, gd, gr, lu1 + (1 << k)) < 1) {
lu1 += (1 << k);
}
}
lu1++;
ld1 = gu + 1;
for (int k = K; k >= 0; k--) {
if (get(ll1, ld1 - (1 << k), gr, gu) < 1) {
ld1 -= (1 << k);
}
}
ld1--;
int x21 = ll1, y21 = ld1, x22 = gr, y22 = lu1;
cout << "! " << x11 << " " << y11 << " " << x12 << " " << y12 << " " << x21
<< " " << y21 << " " << x22 << " " << y22 << endl;
return 0;
}
int lu = gd - 1;
for (int k = K; k >= 0; k--) {
if (get(gl, gd, gr, lu + (1 << k)) < 1) {
lu += (1 << k);
}
}
lu++;
if (get(gl, gd, gr, lu) == 1 && get(gl, lu + 1, gr, gu) == 1) {
int lr1 = gl - 1;
for (int k = K; k >= 0; k--) {
if (get(gl, gd, lr1 + (1 << k), lu) < 1) {
lr1 += (1 << k);
}
}
lr1++;
int ll1 = gr + 1;
for (int k = K; k >= 0; k--) {
if (get(ll1 - (1 << k), gd, gr, lu) < 1) {
ll1 -= (1 << k);
}
}
ll1--;
int x11 = ll1, y11 = gd, x12 = lr1, y12 = lu;
int ld1 = gu + 1;
for (int k = K; k >= 0; k--) {
if (get(gl, ld1 - (1 << k), gr, gu) < 1) {
ld1 -= (1 << k);
}
}
ld1--;
lr1 = gl - 1;
for (int k = K; k >= 0; k--) {
if (get(gl, ld1, lr1 + (1 << k), gu) < 1) {
lr1 += (1 << k);
}
}
lr1++;
ll1 = gr + 1;
for (int k = K; k >= 0; k--) {
if (get(ll1 - (1 << k), ld1, gr, gu) < 1) {
ll1 -= (1 << k);
}
}
ll1--;
int x21 = ll1, y21 = ld1, x22 = lr1, y22 = gu;
cout << "! " << x11 << " " << y11 << " " << x12 << " " << y12 << " " << x21
<< " " << y21 << " " << x22 << " " << y22 << endl;
return 0;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007;
const long double PI = 3.14159265;
long long int powerWithMod(long long int base, long long int exponent,
long long int MODulus = LLONG_MAX) {
long long int ansult = 1;
base %= MODulus;
while (exponent > 0) {
if (exponent % 2 == 1) ansult = (ansult * base) % MODulus;
exponent >>= 1;
base = (base * base) % MODulus;
}
return ansult;
}
long long int gcdExtended(long long int a, long long int b, long long int *x,
long long int *y) {
cout << a << " " << b << " " << *x << " " << *y << "\n";
if (a == 0) {
*x = 0, *y = 1;
return b;
}
long long int x1, y1;
long long int gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
cout << "AFTER " << a << " " << b << " " << *x << " " << *y << "\n";
return gcd;
}
long long int MODInverse(long long int a, long long int m) {
long long int x, y;
long long int g = gcdExtended(a, m, &x, &y);
cout << g << " " << x << " " << y << "\n";
long long int ans = (x % m + m) % m;
return ans;
}
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long int n, a = 0, x, m = 0;
cin >> n;
for (int i = 1; i <= n; i++) cin >> x, a += x, m = max(x, m);
cout << max(m, (a + n - 2) / (n - 1)) << "\n";
return 0;
}
| 7 | CPP |
#include<iostream>
#include<string>
using namespace std;
int main(){
int m;
string map[5];
cin>>m;
for(int i=0;i<5;i++) map[i]="*****";
for(int i=0;i<m;i++){
for(int j=0;j<5;j++){
for(int k=0;k<5;k++){
cin>>map[j][k];
}
}
int ans=0;
for(int y=0;y<5;y++){
for(int x=0;x<5;x++){
for(int sy=1;y+sy-1<5;sy++){
for(int sx=1;x+sx-1<5;sx++){
bool f=true;
for(int j=0;j<sy;j++){
for(int k=0;k<sx;k++){
if(map[y+j][x+k]=='0') f=false;
}
}
if(f&&ans<sy*sx) ans=sx*sy;
}
}
}
}
cout<<ans<<endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define sz(a) int(a.size())
const int MOD = 1e9+7;
int res[22][1<<21];
int n, C [22][22];
int dp(int id, int wom) {
if (id < 0) return 1;
if (res[id][wom] != -1) return res[id][wom];
int w = 0;
for (int j = 0; j < n; j++) {
if (wom&(1<<j) && C[id][j]) {
w += dp(id-1, wom^(1<<j));
if (w >= MOD) w -= MOD;
}
}
return res[id][wom] = w;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cin >> C[i][j];
}
memset(res, -1, sizeof(res));
cout << dp(n-1, (1<<n)-1) << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int i, j, k, l, n, m, second, t;
struct lo {
int id;
long double x, y;
} p;
vector<lo> v;
long double angle(lo a) {
long double alpha = atan2(a.y, a.x);
alpha += 3.141592653589;
return alpha;
}
bool comp(lo a, lo b) { return angle(a) < angle(b); }
int main() {
long double ans;
cin >> n;
for (i = 1; i <= n; i++) {
long double a, b;
cin >> a >> b;
p.id = i, p.x = a, p.y = b;
v.push_back(p);
}
sort(v.begin(), v.end(), comp);
ans = 2 * 3.141592653589 - (angle(v[n - 1]) - angle(v[0]));
int a = v[n - 1].id, b = v[0].id;
for (i = n - 1; i > 0; i--)
if (ans > (angle(v[i]) - angle(v[i - 1])))
ans = (angle(v[i]) - angle(v[i - 1])), a = v[i].id, b = v[i - 1].id;
cout << a << " " << b;
}
| 9 | CPP |
s=input().split()
n=int(s[0])
k=int(s[1])
p=input().split()
while (n>=k>=1) and ( p[k-1]=='0'):
k=k-1
while ((n-1)>=k>=1)and(p[k]==p[k-1]):
k+=1
print(k) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
map<int, int> mp;
int main() {
ios::sync_with_stdio(false);
int b, q, l, m;
cin >> b >> q >> l >> m;
mp.clear();
while (m--) {
int a;
cin >> a;
mp[a] = 1;
}
if (abs(b) > l)
cout << 0 << endl;
else if (b == 0) {
if (mp[0] == 1)
cout << 0 << endl;
else
cout << "inf" << endl;
} else if (q == 1) {
if (mp[b] == 1)
cout << 0 << endl;
else
cout << "inf" << endl;
} else if (q == -1) {
if (mp[b] && mp[-b])
cout << "0" << endl;
else
cout << "inf" << endl;
} else if (q == 0) {
if (!mp[0])
cout << "inf" << endl;
else if (mp[b])
cout << 0 << endl;
else
cout << 1 << endl;
} else {
long long cnt = 0;
long long i = b;
while (abs(i) <= l) {
if (!mp[i]) cnt++;
i *= q;
}
cout << cnt << endl;
}
return 0;
}
| 8 | CPP |
def do(s, x, y):
cnt = 0
for c in s:
if int(c) == x:
cnt += 1
x, y = y, x
if x != y and cnt % 2==1:
cnt -= 1
return cnt
def solve():
s = input()
res = 0
for i in range(10):
for j in range(10):
res = max(res, do(s, i, j))
print(len(s) - res)
tc = int(input())
for _ in range(tc):
solve() | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:400000000")
int n, m;
double a, b;
double ya[100010], yb[100010], l[100010];
double da[100010];
int main() {
cin >> n >> m >> a >> b;
double L2 = ((b - a) * (b - a));
for (int i = 0; i < (n); i++) {
cin >> ya[i];
da[i] = sqrt(a * a + ya[i] * ya[i]);
}
for (int i = 0; i < (m); i++) cin >> yb[i];
for (int i = 0; i < (m); i++) cin >> l[i];
int cur = 0;
double best = 1000000007LL;
int A = -1, B = -1;
int lowlim = 0;
for (int i = 0; i < (m); i++) {
double dist1 = 1000000007LL;
for (int j = lowlim; j < (n); j++) {
double d1 = da[j] + sqrt(L2 + ((yb[i] - ya[j]) * (yb[i] - ya[j])));
if (dist1 <= d1) break;
dist1 = d1;
lowlim = j;
}
double dist = dist1 + l[i];
if (dist < best) {
best = dist;
A = lowlim;
B = i;
}
}
cout << A + 1 << " " << B + 1;
}
| 10 | CPP |
h,m,i,n,k = map(int, input().split())
time = (i-h)*60-m+n
print(time-k) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
long long x[maxn + 5], y[maxn + 5];
int n = 1;
long long ax, ay, bx, by, xs, ys, t;
long long caldis(int a, int b) { return abs(x[a] - x[b]) + abs(y[a] - y[b]); }
int solve(int id, long long t) {
if (t < 0) return 0;
long long tt = t;
int now = 1;
for (int i = id + 1; i <= n; ++i) {
t -= caldis(i, i - 1);
if (t < 0) break;
++now;
}
int ans = now;
now = 1;
t = tt;
for (int i = id - 1; i >= 1; --i) {
t -= caldis(i, i + 1);
if (t < 0) break;
++now;
}
ans = max(ans, now);
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin >> x[1] >> y[1] >> ax >> ay >> bx >> by;
cin >> xs >> ys >> t;
for (int i = 2;; ++i) {
x[i] = ax * x[i - 1] + bx;
y[i] = ay * y[i - 1] + by;
if (x[i] - xs + y[i] - ys > t) break;
++n;
}
int ans = 0;
for (int i = 1; i <= n; ++i)
ans = max(ans, solve(i, t - abs(x[i] - xs) - abs(y[i] - ys)));
cout << ans << endl;
return 0;
}
| 8 | CPP |
m, n = map(int, input().split())
b = []*m
for _ in range(m):
b.append([int(x) for x in input().split()])
rows = [1]*m
cols = [1]*n
for i in range(0, m):
for j in range(0, n):
if b[i][j] == 0:
rows[i] = 0
cols[j] = 0
a = [[1 for i in range(n)] for j in range(m)]
for i in range(0, m):
for j in range(0, n):
if rows[i] == 0 or cols[j] == 0:
a[i][j] = 0
rows = [0]*m
cols = [0]*n
for i in range(0, m):
for j in range(0, n):
if a[i][j] == 1:
rows[i] = 1
cols[j] = 1
bnew = [[0 for i in range(n)] for j in range(m)]
for i in range(0, m):
for j in range(0, n):
if rows[i] == 1 or cols[j] == 1:
bnew[i][j] = 1
if bnew == b:
print("YES")
for i in range(m):
for x in a[i]:
print(x, end = " ")
print()
else:
print("NO")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100 + 77;
int n, m, S, T, t, Es[N], Et[N], d[N][N], dp[N], f[N];
bool E[N][N];
vector<int> V[N];
int main() {
memset(d, 50, sizeof d);
memset(dp, 50, sizeof dp);
scanf("%d %d %d %d", &n, &m, &S, &T);
dp[T] = 0;
for (int i = 1; i <= n; ++i) d[i][i] = 0;
for (int v, u, i = 1; i <= m; ++i)
scanf("%d %d", &v, &u), E[v][u] = d[v][u] = 1;
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (d[i][k] + d[k][j] < d[i][j]) d[i][j] = d[i][k] + d[k][j];
scanf("%d", &t);
for (int i = 1; i <= t; ++i) scanf("%d %d", Es + i, Et + i);
for (int _ = 1; _ <= n; ++_) {
for (int k = 1; k <= t; ++k) {
int st = Es[k], en = Et[k];
memset(f, 63, sizeof f);
for (int i = 0; i <= n; ++i) V[i].clear();
for (int i = 1; i <= n; ++i)
if (d[st][i] + d[i][en] == d[st][en] && d[st][i] <= n)
V[d[st][i]].push_back(i);
f[en] = dp[en];
for (int i = n; i >= 0; --i) {
for (int x : V[i]) {
f[x] = -1;
for (int y = 1; y <= n; ++y)
if (E[x][y] && d[st][x] + d[y][en] + 1 == d[st][en])
f[x] = max(f[x], f[y]);
if (f[x] == -1) f[x] = dp[x];
f[x] = min(f[x], dp[x]);
}
if ((int)V[i].size() == 1)
dp[V[i][0]] = min(dp[V[i][0]], f[V[i][0]] + 1);
}
}
}
if (dp[S] >= n) dp[S] = -1;
printf("%d\n", dp[S]);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int MN = 520;
const int MA = MN/2;
const int MP = 10000;
vl pr;
vl md;
bitset<MP> bs;
ll mat[MN][MN];
void pre() {
for(int i=2;i<MP;i++) {
if(!bs[i]) {
if(i >= MN) {
pr.push_back(i);
}
for(int j=2;j*i<MP;j++) {
bs.set(i*j);
}
}
}
for(int i=0;i<MN;i++) {
md.push_back(i+1);
}
for(int i=0;i<500;i++) {
for(int j=0;j<500;j++) {
ll da = j-i;
ll db = j+i;
da += MN;
ll go;
if((db&1)) {
go = pr[da/2]*pr[(da+1)/2]*md[db/2]*md[(db+1)/2]*2+1;
} else {
go = pr[da/2]*md[db/2]*2;
}
mat[i][j] = go;
}
}
}
int main() {
ios::sync_with_stdio(0);cin.tie(0);
int n;
cin >> n;
pre();
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
if(j > 0) {cout << " ";}
cout << mat[i][j];
}
cout << '\n';
}
}
| 0 | CPP |
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
inp = lambda: sys.stdin.readline().rstrip("\r\n")
inin=lambda : int(inp())
inar=lambda : list(map(int,inp().split()))
inst=lambda : inp().decode().strip()
_T_=inin()
for _t_ in range(_T_):
n=inin()
a=inar()
if a[0]+a[1]>a[n-1]:
print(-1)
else:
print(1,2,n) | 7 | PYTHON3 |
n=int(input())
a='abba'
ans=list(())
while(len(ans)<n):
ans+=a
for i in range(0,n):
print(ans[i],end="")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
if (k >= m) {
cout << 0 << endl;
return 0;
}
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x > 1) v.push_back(x);
}
sort(v.begin(), v.end(), greater<int>());
int sum = 0;
for (int i = 0; i < k; i++) {
if (i == v.size()) {
cout << -1 << endl;
return 0;
}
sum += v[i];
if (sum + k - i - 1 >= m) {
cout << i + 1 << endl;
return 0;
}
}
for (int i = k; i < v.size(); i++) {
sum += v[i];
sum -= 1;
if (sum >= m) {
cout << i + 1 << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int neigh[2][2] = {{0, 1}, {1, 0}};
char a[100][100];
short d[40][1 << 20][2];
int n;
int solve(int xx, int bit, int op) {
int i, j, k, ans, bit1, tmp, x, y;
vector<pair<int, int> > aa;
if (xx == n + n - 2) {
return 0;
}
if (d[xx][bit][op] != 20000) return d[xx][bit][op];
aa.clear();
for (i = 0; i < n; i++)
if (((1 << i) & bit) != 0) {
aa.push_back(make_pair(i, xx - i));
}
if (op == 0)
ans = -20000;
else
ans = 20000;
for (i = 0; i < 26; i++) {
bit1 = 0;
for (j = 0; j < aa.size(); j++)
for (k = 0; k < 2; k++) {
x = aa[j].first + neigh[k][0];
y = aa[j].second + neigh[k][1];
if ((x >= 0) && (x < n) && (y >= 0) && (y < n) &&
(a[x][y] == 'a' + i)) {
bit1 |= (1 << x);
}
}
if (bit1 == 0) continue;
tmp = solve(xx + 1, bit1, 1 - op);
if (i == 0)
tmp++;
else if (i == 1)
tmp--;
if (op == 0) {
if (tmp > ans) ans = tmp;
} else {
if (tmp < ans) ans = tmp;
}
}
d[xx][bit][op] = ans;
return ans;
}
int main() {
int i, j, k, tmp;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%s", a[i]);
for (i = 0; i < n + n; i++)
for (j = 0; j < (1 << n); j++)
for (k = 0; k < 2; k++) d[i][j][k] = 20000;
tmp = solve(0, 1, 1);
if (a[0][0] == 'a')
tmp++;
else if (a[0][0] == 'b')
tmp--;
if (tmp == 0)
printf("DRAW\n");
else if (tmp > 0)
printf("FIRST\n");
else
printf("SECOND\n");
}
| 8 | CPP |
import math
from collections import deque, defaultdict
from sys import stdin, stdout
input = stdin.readline
# print = stdout.write
listin = lambda : list(map(int, input().split()))
mapin = lambda : map(int, input().split())
n = int(input())
a = listin()
for i in range(n):
if a[i] >= 0:
a[i] = - a[i] - 1
if n%2:
k = min(a)
for i in range(n):
if a[i] == k:
a[i] = -a[i]-1
break
print(*a) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
int main(){
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
sort(a, a+n);
ll ans = 0;
if(!(n % 2)){
rep(i, n/2){
ans -= 2*a[i];
ans += 2*a[n-1-i];
}
ans += a[n/2-1];
ans -= a[n/2];
} else {
ll ans1 = 0, ans2 = 0;
rep(i, n/2){
ans1 -= 2*a[i];
ans1 += 2*a[n-1-i];
ans2 -= 2*a[i];
ans2 += 2*a[n-1-i];
}
ans1 -= a[n/2];
ans1 += a[n/2-1];
ans2 -= a[n/2+1];
ans2 += a[n/2];
ans = max(ans1,ans2);
}
cout << ans << endl;
return 0;
}
| 0 | CPP |
n=int(input())
a=[int(i) for i in input().split()]
d=sum(a)
e=1
f=[]
for i in range(0,len(a)):
if(a[i]%2!=0):
f.append(a[i])
if(len(f)==0):
print(0)
else:
while(e>0):
if(d==0):
e=0
elif(d%2==0):
d=d-min(f)
f.remove(min(f))
else:
e=0
print(d)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string line = "\n";
long long c1, c2, x, y;
bool canPresent(long long v) {
long long like1 = v - v / x;
long long like2 = v - v / y;
long long both = v - v / x - v / y + v / (x * y);
long long good = like1 + like2 - both;
if (good < c1 + c2 || like1 < c1 || like2 < c2) {
return false;
}
long long rem1 = c1 - (like1 - both);
long long rem2 = c2 - (like2 - both);
if (rem1 + rem2 > both) {
return false;
}
if (rem1 > both) {
return false;
}
both -= rem1;
if (rem2 > both) {
return false;
}
return true;
}
int main() {
cin.tie(NULL), ios_base::sync_with_stdio(0);
cin >> c1 >> c2 >> x >> y;
long long low = 0;
long long high = 1e18;
while (high > low + 1) {
long long mid = (high + low) / 2;
if (canPresent(mid)) {
high = mid;
} else {
low = mid;
}
}
cout << high << line;
return 0;
}
| 8 | CPP |
n = int(input())
i =(int(x) for x in input().split())
L=sorted(i)
for x in L :
print (x ,end=' ')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long ans = 0, n, m, q;
int f[500005];
int getfather(int v) {
if (f[v] == v) return v;
return f[v] = getfather(f[v]);
}
int main() {
cin >> n >> m >> q;
int r, c;
int cnt = n + m;
for (int i = 1; i <= n + m; i++) f[i] = i;
for (int i = 1; i <= q; i++) {
cin >> r >> c;
c += n;
int fx = getfather(r), fy = getfather(c);
if (fx != fy) {
f[fx] = fy;
cnt--;
}
}
cout << cnt - 1 << endl;
return 0;
}
| 8 | CPP |
n = int(input())
a = '\n'.join(input() for _ in range(n))
print('YES\n' + a.replace('OO', '++', 1) if a.find('OO') != -1 else 'NO') | 7 | PYTHON3 |
n = int(input())
l = []
for i in range(n):
a = str(input())
b = set(list(a))
c = sorted(list(a), key=lambda i: ord(i))
if len(a) == len(b) and ord(c[-1]) - ord(c[0]) == len(a) - 1:
l.append("Yes")
else:
l.append("No")
for i in l:
print(i)
| 7 | PYTHON3 |
n, m = map(int, input().split())
names = ['Malvika', 'Akshat']
print(names[min(n, m) % 2])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void deb(istream_iterator<string> it) { cout << endl; }
template <typename T, typename... Args>
void deb(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ", ";
deb(++it, args...);
}
const int mod = 998244353;
const int mxn = 3e5 + 9;
const long double eps = 1e-9;
long long bigmod(long long a, long long b) {
if (b == 0) return 1 % mod;
long long x = bigmod(a, b / 2);
x = (x * x) % mod;
if (b % 2 == 1) x = (x * a) % mod;
return x;
}
long long n, k, m, ans = 0, value = 0;
long long a[mxn], b[mxn];
map<long long, vector<long long> > mp;
int fillup(int id) {
vector<long long> v;
long long last = mp[a[id]][mp[a[id]].size() - 1];
for (int i = id; i <= last; i++) {
last = max(last, mp[a[i]][mp[a[i]].size() - 1]);
b[i] = value;
}
return last;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
mp[a[i]].push_back(i);
}
memset(b, -1, sizeof(b));
for (int i = 1; i <= n; i++) {
int x = fillup(i);
if (x >= n) break;
value++;
i = x;
}
cout << bigmod(2, value) << "\n";
return 0;
}
| 11 | CPP |
import io
import os
import collections
import math
import functools
import itertools
import bisect
import heapq
from sys import stdin, stdout, stderr
from collections import *
from math import *
from functools import *
from itertools import *
from heapq import *
from bisect import bisect_left, bisect_right, insort_left, insort_right
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
def get_ints(): return list(map(int, input().split()))
def get_int(): return int(input())
def get_str(): return "".join(list(map(chr, input()))[:-1])
def eprint(*args): stderr.write(", ".join(map(str, args)) + "\n")
def print(*args): stdout.write(" ".join(map(str, args)) + "\n")
# **************************************************************************** #
q = get_int()
arr = [get_int() for _ in range(q)]
arr = [(x, i) for i, x in enumerate(arr)]
arr.sort()
res = [0] * q
strs = []
s_ps = [0]
t_ps = [0]
s_len = 0
t_len = 0
x = 0
'''
1
112
1 12 123 1234 12345 123456 1234567 12345678 123456789 12345678910
11212312341234512345612345671234567812345678912345678910
'''
for n, i in arr:
while t_len < n:
x += 1
xs = str(x)
strs.append(xs)
s_len += len(xs)
s_ps.append(s_len)
t_len += s_len
t_ps.append(t_len)
nn = n - t_ps[-2]
si = bisect_left(s_ps, nn) - 1
ss = strs[si] if si < len(strs) else None
sci = nn - s_ps[si] - 1
sc = ss[sci]
#eprint(n, nn, i, strs, s_ps, t_ps, x, si, ss, sci, sc)
res[i] = sc
for r in res:
print(r)
| 11 | PYTHON3 |
for t in range(int(input())):
n, m = map(int, input().split())
a = [int(x) for x in input()]
left = []; right = []; k = -1
for i in range(n):
if a[i] == 1:
k = i
left.append(n+1 if k == -1 else i - k)
k = -1
for i in range(n - 1, -1, -1):
if a[i] == 1:
k = i
right.insert(0, n+1 if k == -1 else k - i)
for i in range(n):
if left[i] != 0 and left[i] == right[i]:
a[i] = 0
else:
a[i] = 1 if min(left[i], right[i]) <= m else 0
print(''.join([str(x) for x in a])) | 7 | PYTHON3 |
number = int(input())
first = 'I '
last = ' it'
for i in range(number):
if i % 2 == 0:
first += 'hate'
else:
first += 'love'
if number > 1 and i < number - 1:
first += ' that I '
first += last
print(first) | 7 | PYTHON3 |
n, m = map(int, input().split())
p = [0] * n
for i in range(m):
a = list(map(int, input().split()))
q = max(a)
for t in range(n):
if a[t] == q:
r = t
break
p[t] += 1
q = max(p)
for i in range(n):
if p[i] == q:
print(i + 1)
break
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n), b(100050);
int x = 1;
multiset<int> S;
for (int i = 0; i < n; ++i) {
cin >> a[i];
auto ut = S.find(b[a[i]]);
if (ut != S.end()) {
S.erase(ut);
}
b[a[i]] += 1;
S.insert(b[a[i]]);
if (S.size() <= 1) {
x = i + 1;
} else if (S.size() == 2) {
ut = --S.end();
auto it = S.begin();
if (*it == 1) {
x = i + 1;
}
if (*ut == *it + 1) {
x = i + 1;
}
} else if (S.size() > 2) {
ut = --S.end();
auto it = S.begin();
auto it2 = S.begin();
++it2;
if (*it2 == *ut && *it == 1) {
x = i + 1;
}
auto ut2 = ut;
--ut2;
if (*ut2 == *it && *it + 1 == *ut) {
x = i + 1;
}
}
}
cout << x << '\n';
}
| 8 | CPP |
def println(arr):
for j in range(len(arr)):
print(arr[j], end=" ")
def func(arr_1, arr_2):
result_1 = []
result_2 = []
arr_1, arr_2 = sorted(arr_1), sorted(arr_2)
for q in range(len(arr_1)):
result_1.append(arr_1[q])
result_2.append(arr_2[q])
println(result_1)
print()
println(result_2)
print()
return
n = int(input())
for i in range(n):
k = int(input())
oj = list(map(int, input().split()))
br = list(map(int, input().split()))
func(oj, br)
| 7 | PYTHON3 |
__author__ = 'dougct'
def main():
n = int(input())
x = 0
ans = 0
energy = 0
heights = map(int, input().split())
for h in heights:
energy += x - h
if energy < 0:
ans += -energy
energy = 0
x = h
print(ans)
if __name__ == '__main__':
main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int> > edge[100005];
long long sum[100005];
long long sum2[100005];
long long up[100005];
long long up2[100005];
int s[100005];
int lca[100005][20];
int dep[100005];
long long dist[100005];
void dfs(int v, int u) {
s[v] = 1;
lca[v][0] = u;
for (int i = 0; i < edge[v].size(); i++) {
if (edge[v][i].first == u) continue;
int x = edge[v][i].first;
dfs(x, v);
sum[v] += sum[x] + 1LL * s[x] * edge[v][i].second;
sum2[v] += sum2[x] +
1LL * s[x] * edge[v][i].second % 1000000007 * edge[v][i].second +
2LL * edge[v][i].second * sum[x];
sum[v] %= 1000000007;
sum2[v] %= 1000000007;
s[v] += s[x];
}
}
void dfs2(int v, int u, int c) {
if (u != -1) {
dep[v] = dep[u] + 1;
dist[v] = dist[u] + c;
long long x = sum2[v] + 2LL * c * sum[v] + 1LL * c * c % 1000000007 * s[v];
x %= 1000000007;
long long y = sum[v] + 1LL * c * s[v];
y %= 1000000007;
long long q = (sum2[u] + up2[u] - x + 1000000007) % 1000000007;
long long r = (sum[u] + up[u] - y + 1000000007) % 1000000007;
up[v] = (r + 1LL * (n - s[v]) * c) % 1000000007;
up2[v] =
(q + 2LL * r * c + 1LL * c * c % 1000000007 * (n - s[v])) % 1000000007;
}
for (int i = 0; i < edge[v].size(); i++)
if (u != edge[v][i].first) dfs2(edge[v][i].first, v, edge[v][i].second);
}
int calc(int a, int b) {
if (dep[a] > dep[b]) swap(a, b);
for (int i = 0; i < 20; i++) {
if ((((dep[b] - dep[a]) >> i) & 1)) {
b = lca[b][i];
}
}
if (a == b) return a;
for (int i = 19; i >= 0; i--) {
if (lca[a][i] != lca[b][i]) {
a = lca[a][i];
b = lca[b][i];
}
}
return lca[a][0];
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
edge[a].push_back(make_pair(b, c));
edge[b].push_back(make_pair(a, c));
}
dfs(1, -1);
dfs2(1, -1, -1);
int q;
scanf("%d", &q);
for (int i = 0; i < 19; i++)
for (int j = 1; j <= n; j++)
if (lca[j][i] == -1)
lca[j][i + 1] = -1;
else
lca[j][i + 1] = lca[lca[j][i]][i];
for (int i = 0; i < q; i++) {
int u, v;
scanf("%d%d", &u, &v);
int x = calc(u, v);
long long d = dist[u] + dist[v] - dist[x] * 2;
d %= 1000000007;
if (x == v && u != v) {
long long a =
up2[v] + 2LL * d * up[v] + 1LL * d * d % 1000000007 * (n - s[v]);
a %= 1000000007;
printf("%lld\n",
(sum2[u] + up2[u] - 2 * a + 1000000007 + 1000000007) % 1000000007);
} else {
long long a =
sum2[v] + 2LL * d * sum[v] + 1LL * d * d % 1000000007 * (s[v]);
a %= 1000000007;
printf("%lld\n",
(2 * a - sum2[u] - up2[u] + 1000000007 + 1000000007) % 1000000007);
}
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a[] = {"zero", "one", "two", "three", "four",
"five", "six", "seven", "eight", "nine"};
string b[] = {",", ",", "twenty", "thirty", "forty",
"fifty", "sixty", "seventy", "eighty", "ninety"};
string c[] = {"ten", "eleven", "twelve", "thirteen", "fourteen",
"fifteen", "sixteen", "seventeen", "eighteen", "nineteen"};
int n;
cin >> n;
int x = n / 10;
int y = n % 10;
if (n >= 0 && n <= 9) {
cout << a[n] << endl;
} else if (n >= 10 && n <= 19) {
cout << c[y] << endl;
} else if (y == 0) {
cout << b[x] << endl;
} else {
cout << b[x] << "-" << a[y] << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10;
long long n, Q, c[31][N], ans[31][N];
struct rec {
long long l, r, d;
} q[N];
void update(long long l, long long r, long long d) {
for (long long i = 30; i >= 0; i--)
if (d & (1ll << i)) c[i][l]++, c[i][r + 1]--;
}
void init() {
for (long long i = 0; i <= 30; i++)
for (long long j = 1; j <= n; j++) c[i][j] = c[i][j - 1] + c[i][j];
for (long long i = 0; i <= 30; i++)
for (long long j = 1; j <= n; j++) c[i][j] = (c[i][j] > 0);
memcpy(ans, c, sizeof(c));
for (long long i = 0; i <= 30; i++)
for (long long j = 1; j <= n; j++) c[i][j] = c[i][j - 1] + c[i][j];
}
bool check(long long l, long long r, long long d) {
for (long long i = 30; i >= 0; i--)
if ((!(d & (1ll << i))) && (c[i][r] - c[i][l - 1] == r - l + 1))
return false;
return true;
}
signed main() {
scanf("%lld%lld", &n, &Q);
for (long long i = 1; i <= Q; i++) {
scanf("%lld%lld%lld", &q[i].l, &q[i].r, &q[i].d);
update(q[i].l, q[i].r, q[i].d);
}
init();
for (long long i = 1; i <= Q; i++)
if (!check(q[i].l, q[i].r, q[i].d)) {
puts("NO");
return 0;
}
puts("YES");
for (long long i = 1; i <= n; i++) {
long long ret = 0;
for (long long j = 0; j <= 30; j++)
if (ans[j][i]) ret += (1 << j);
printf("%lld ", ret);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int p, x, tt, tmp, cnt;
int b[1000005];
string s[10];
bool flag;
int main() {
scanf("%d %d", &p, &x);
flag = false;
for (int i = 1; i <= 9; i++) {
b[p] = i;
tt = 0;
for (int j = p - 1; j >= 1; j--) {
tmp = b[j + 1] * x + tt;
tt = tmp / 10;
b[j] = tmp % 10;
}
if ((b[1] * x + tt) % 10 == b[p] && b[1] != 0 && b[1] * x + tt < 10) {
flag = true;
cnt++;
for (int j = 1; j <= p; j++) s[cnt] += (char)(48 + b[j]);
}
}
if (flag) {
sort(s + 1, s + cnt + 1);
cout << s[1] << endl;
} else
printf("Impossible\n");
return 0;
}
| 8 | CPP |
for i in range(int(input())):
n = int(input())
a = list(map(int , input().split()))
f = 0
r = []
r.append(a[0])
for i in range(1 , len(a)):
if a[i] not in r:
r.append(a[i])
for i in r:
print(i , end = ' ')
print('') | 8 | PYTHON3 |
# Acceptance of input
import sys
f_i = sys.stdin
V, E = map(int, f_i.readline().split())
adj = [[] for i in range(V)]
for l_i in f_i:
s, t = map(int, l_i.split())
adj[s].append(t)
adj[t].append(s)
# dfs traverse
prenum = [1] + [None] * (V - 1)
parent = [0] * V
lowest = [V] * V
import collections
path = collections.deque()
path.append(0)
cnt = 1
while path:
u = path[-1]
adj_v = adj[u]
for v in adj_v:
if not prenum[v]:
parent[v] = u
path.append(v)
cnt += 1
prenum[v] = cnt
adj[u].remove(v)
adj[v].remove(u)
break
if u == path[-1]:
for v in adj_v:
lowest[u] = min(lowest[u], prenum[v])
adj[u].remove(v)
adj[v].remove(u)
p = parent[u]
lowest[p] = min(lowest[u], lowest[p])
path.pop()
# output
ans = set()
for u in range(1, V):
p = parent[u]
if prenum[p] <= lowest[u]:
ans.add(p)
if parent.count(0) >= 3:
ans.add(0)
else:
ans.discard(0)
ans = list(ans)
ans.sort()
if ans:
print(*ans, sep = '\n') | 0 | PYTHON3 |
n = int(input())
for i in range(n):
s = input()
l = len(s)
j = 0
ret = []
while j < l:
ret.append(s[j])
j += 2
ret.append(s[-1])
ret = ''.join(ret)
print(ret) | 7 | PYTHON3 |
#double underscore makes a class variable or a class method private\
mod = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
n = ii()
l1 = il()
l2 = il()
sm1=0
sm2=0
for i in range(n):
sm1,sm2=max(l1[i]+sm2,sm1),max(l2[i]+sm1,sm2)
print(max(sm1,sm2)) | 9 | PYTHON3 |
# coding: utf-8
n, m = [int(i) for i in input().split()]
stu = []
for i in range(n):
stu.append([int(ch) for ch in input()])
best = []
for i in range(m):
best.append(max([stu[j][i] for j in range(n)]))
ans = 0
for i in range(n):
for j in range(m):
if stu[i][j] == best[j]:
ans += 1
break
print(ans)
| 7 | PYTHON3 |
n,m,a = map(int,input().split())
nn = int(n / a) + (1 if n % a else 0)
mm = int(m / a) + (1 if m % a else 0)
print(nn * mm) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 0;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
for (int i = 0; i < n; i++) {
if (arr[i] == 1) s++;
if (arr[i] == 0 && arr[i + 1] == 1 && arr[i - 1] == 1) s++;
}
cout << s;
return 0;
}
| 7 | CPP |
n=int(input())
m=1
z=0
mm=2
while m<=n:
z=z+1
n=n-m
m=m+mm
mm=mm+1
print(z)
| 7 | PYTHON3 |
for tc in range(int(input())):
alist=list(map(int, input().split()))
def f(a,b,c,d):
if b>=a:
return b
if c-d<=0:
return -1
if (a-b)/(c-d)!=int((a-b)/(c-d)):
te=(c)*(int((a-b)/(c-d))+1)
else:
te=(c)*(int((a-b)/(c-d)))
return (b+te)
print(f(alist[0],alist[1],alist[2],alist[3])) | 7 | PYTHON3 |
n,x=map(int,input().split())
rez=0
d=1
while d*d<=x:
if x%d==0 and x!=1 and x//d<=n:
if x//d!=d:
rez+=2
else:
rez+=1
elif x==1:
rez=1
d+=1
print(rez) | 7 | PYTHON3 |
# A. Temporarily unavailable
# Link https://codeforces.com/contest/1282/problem/A
t = int(input())
for _ in range(t):
a,b,c,r = map(int,input().split())
s1 = min(a,b)
e1 = max(a,b)
s = max(c-r,s1)
e = min(c+r,e1)
print(e1-s1- (e-s if e>s else 0))
| 7 | PYTHON3 |
for _ in range(int(input())):
n, x, m = map(int, input().split())
a = (x, x)
for i in range(m):
l, r = map(int, input().split())
if not (l > a[1] or r < a[0]):
a = (min(a[0], l), max(a[1], r))
print(a[1] - a[0] + 1) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> vec[100100];
int arr[100100];
long long sum = 0, sum1 = 0, sumn = 0, ans = 0, maxi = 0;
bool visit[100100];
void dfs(int node) {
visit[node]++;
sum++;
sum1 += (long long)vec[node].size();
for (int i = 0; i < vec[node].size(); i++) {
int x = vec[node][i];
if (!visit[x]) dfs(x);
}
}
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < k; i++) scanf("%d", &arr[i]);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d%d", &x, &y);
vec[x].push_back(y);
vec[y].push_back(x);
}
for (int i = 0; i < k; i++) {
sum = 0, sum1 = 0;
dfs(arr[i]);
ans += ((sum - 1) * sum - sum1) / 2;
sumn += sum;
maxi = max(maxi, sum);
}
sum1 = 0;
for (int i = 1; i <= n; i++)
if (!visit[i]) {
dfs(i);
}
sumn = n - sumn;
ans += (sumn)*maxi;
ans += ((sumn - 1) * sumn - sum1) / 2;
cout << ans << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ans = 0, b[105] = {0}, a;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> a;
b[a] = 1;
}
ans = b[x];
for (int i = 0; i < x; i++) ans += !b[i];
cout << ans << endl;
return 0;
}
| 7 | CPP |
from collections import Counter
from collections import defaultdict
import math
import random
import heapq as hq
from math import sqrt
import sys
from functools import reduce
def input():
return sys.stdin.readline().strip()
def iinput():
return int(input())
def tinput():
return input().split()
def rinput():
return map(int, tinput())
def rlinput():
return list(rinput())
mod = int(1e9)+7
def factors(n):
return set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))
# ----------------------------------------------------
def upperbound(a, ele):
l = 0
r = len(a)-1
ans = -1
while l <= r:
mid = (l+r)//2
if a[mid] <= ele:
l = mid+1
else:
ans = a[mid]
r = mid-1
return ans
if __name__ == "__main__":
for _ in range(iinput()):
s = input()
t = input()
n, m = len(s), len(t)
ds = defaultdict(list)
for i in range(n):
ds[s[i]].append(i)
ans = 0
i = 0
while i < m:
j = i
curr_idx = -1
found = False
while j < m and t[j] in ds:
got = False
nxt = upperbound(ds[t[j]], curr_idx)
if nxt != -1:
curr_idx = nxt
got = True
if not got:
found = True
break
j += 1
if not found and j < m:
ans = -1
break
ans += 1
i = j
print(ans)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> mark(40, 0);
long long mult = 1, i = 0;
while (mult < n) {
i++;
mult *= 3;
}
for (; i >= 0; i--) {
long long val = (n / mult) % 3;
if (val > 1) {
break;
}
if (val) {
mark[i] = 1;
}
mult /= 3;
}
if (i != -1) {
i++;
mult *= 3;
while (mark[i]) {
i++;
mult *= 3;
}
mark[i] = 1;
n = 0;
for (; i < 40; i++) {
if (mark[i]) n += mult;
mult *= 3;
}
}
cout << n << '\n';
}
}
| 9 | CPP |
n, _ = map(int, input().split())
nums = sorted(map(int, input().split()))
print(min(b - a for a, b in zip(nums, nums[n - 1:])))
| 7 | PYTHON3 |
n, m, a, b = list(map(int, input().split()))
l = n // m
r = n // m if n % m == 0 else n // m + 1
l *= m
r *= m
print(min(a * (r - n), b * (n - l)))
| 7 | PYTHON3 |
n = int(input(''))
a = [int(x) for x in input().split()]
if len(a) == 1 or (len(a) == 2 and a[0] == a[1]):
print('-1')
else:
for i in range(1,n):
if sum(a[0:i]) != sum(a[i:n]):
print(i)
print(*range(1, i+1), end=' ')
break | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int L = 20;
int n, pre[N][L], lvl[N];
vector<int> adj[N];
int lca(int u, int v) {
if (lvl[u] > lvl[v]) swap(u, v);
for (int l = (int)(L)-1; l >= ((int)0); l--)
if (lvl[pre[v][l]] >= lvl[u]) v = pre[v][l];
if (u == v) return u;
for (int l = (int)(L)-1; l >= ((int)0); l--)
if (pre[u][l] != pre[v][l]) {
u = pre[u][l];
v = pre[v][l];
}
assert(u != v);
return pre[u][0];
}
int cum[N];
int get(int x) {
x += 2;
int ans = 0;
while (x) {
ans += cum[x];
x -= x & (-x);
}
return ans;
}
void add(int x, int delta) {
x += 2;
while (x < N) {
cum[x] += delta;
x += x & (-x);
}
}
int t = 1, d[N], f[N];
void dfs(int u) {
d[u] = t++;
for (int v : adj[u]) dfs(v);
f[u] = t;
}
struct edge {
int u, v, c;
};
vector<edge> path[N];
int dp[N];
void dpDfs(int u) {
int ans = 0;
for (int v : adj[u]) {
dpDfs(v);
ans += dp[v];
}
int cost = 0;
for (auto p : path[u]) {
int add = p.c - get(d[p.u]) - get(d[p.v]);
cost = max(cost, add);
}
dp[u] = ans + cost;
add(d[u], cost);
add(f[u], -cost);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int m;
cin >> n >> m;
for (int i = 0; i < (int)(n - 1); i++) {
cin >> pre[i + 2][0];
lvl[i + 2] = 1 + lvl[pre[i + 2][0]];
adj[pre[i + 2][0]].push_back(i + 2);
}
pre[1][0] = 1;
for (int l = 0; l < (int)(L - 1); l++)
for (int u = 0; u < (int)(n + 1); u++) pre[u][l + 1] = pre[pre[u][l]][l];
dfs(1);
while (m--) {
int u, v, c;
cin >> u >> v >> c;
int p = lca(u, v);
path[p].push_back((edge){u, v, c});
}
dpDfs(1);
cout << dp[1] << endl;
return 0;
}
| 10 | CPP |
n,k=map(int,input().split())
l=list(map(int, input().split()))
i=0
while i<n and l[i]>=l[k-1] and l[i]>0:
i+=1
print(i) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1;
int reva[N], b[N], bb[N];
int t[N], la[N], ra[N], lb[N], rb[N], x[N], y[N];
struct FenwickTree {
vector<int> vals[N], f[N];
void pushUpdate(int i, int val, int n) {
for (; i < n; i = (i | (i + 1))) {
vals[i].push_back(val);
}
}
void pushGet(int r, int val) {
for (; r >= 0; r = (r & (r + 1)) - 1) {
vals[r].push_back(val);
}
}
void pushGet(int l, int r, int lval, int rval) {
pushGet(r, rval);
pushGet(r, lval - 1);
pushGet(l - 1, rval);
pushGet(l - 1, lval - 1);
}
void build(int n) {
for (int i = 0; i < n; i++) {
sort(vals[i].begin(), vals[i].end());
vals[i].resize(unique(vals[i].begin(), vals[i].end()) - vals[i].begin());
f[i].resize(vals[i].size());
}
}
void update(int i, int val, int delta, int n) {
for (; i < n; i = (i | (i + 1))) {
for (int j = lower_bound(vals[i].begin(), vals[i].end(), val) -
vals[i].begin();
j < f[i].size(); j = (j | (j + 1))) {
f[i][j] += delta;
}
}
}
int get(int r, int val) {
int res = 0;
for (; r >= 0; r = (r & (r + 1)) - 1) {
for (int j = lower_bound(vals[r].begin(), vals[r].end(), val) -
vals[r].begin();
j >= 0; j = (j & (j + 1)) - 1) {
res += f[r][j];
}
}
return res;
}
int get(int l, int r, int lval, int rval) {
return get(r, rval) - get(r, lval - 1) -
(get(l - 1, rval) - get(l - 1, lval - 1));
}
};
FenwickTree fenTree;
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int value;
cin >> value;
reva[value] = i;
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
bb[i] = b[i];
}
for (int i = 1; i <= m; i++) {
cin >> t[i];
if (t[i] == 1) {
cin >> la[i] >> ra[i] >> lb[i] >> rb[i];
} else {
cin >> x[i] >> y[i];
}
}
for (int i = 1; i <= n; i++) {
fenTree.pushUpdate(i, reva[b[i]], n + 1);
}
for (int i = 1; i <= m; i++) {
if (t[i] == 1) {
fenTree.pushGet(lb[i], rb[i], la[i], ra[i]);
} else {
fenTree.pushUpdate(x[i], reva[b[x[i]]], n + 1);
fenTree.pushUpdate(y[i], reva[b[y[i]]], n + 1);
swap(b[x[i]], b[y[i]]);
fenTree.pushUpdate(x[i], reva[b[x[i]]], n + 1);
fenTree.pushUpdate(y[i], reva[b[y[i]]], n + 1);
}
}
fenTree.build(n + 1);
for (int i = 1; i <= n; i++) {
b[i] = bb[i];
fenTree.update(i, reva[b[i]], 1, n + 1);
}
for (int i = 1; i <= m; i++) {
if (t[i] == 1) {
cout << fenTree.get(lb[i], rb[i], la[i], ra[i]) << "\n";
} else {
fenTree.update(x[i], reva[b[x[i]]], -1, n + 1);
fenTree.update(y[i], reva[b[y[i]]], -1, n + 1);
swap(b[x[i]], b[y[i]]);
fenTree.update(x[i], reva[b[x[i]]], 1, n + 1);
fenTree.update(y[i], reva[b[y[i]]], 1, n + 1);
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
solve();
}
| 11 | CPP |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
const int INF = 1e9;
int H, W;
bool f;
void check(int y, int x, int py, int px, int total, vector< vector<int> > &v, vector<int> &h, vector<int> &w){
int sum = 0, ty, tx;
while(y < H - 1 && x < W - 1){
if(v[y][x] == INF) { ty = y; tx = x; }
else sum += v[y][x];
y += py; x += px;
}
v[ty][tx] = total - sum;
h[ty]--; w[tx]--;
}
vector< vector<int> > solve(vector< vector<int> > v, vector<int> &h, vector<int> &w){
int cnt = 0;
REP(i, H) REP(j, W) if(v[i][j] == INF) ++cnt;
while(cnt != 0){
bool flg = false;
REP(i, H) if(h[i] == 1) { check(i, 0, 0, 1, v[i][W - 1], v, h, w); --cnt; flg = true; }
REP(i, W) if(w[i] == 1) { check(0, i, 1, 0, v[H - 1][i], v, h, w); --cnt; flg = true; }
if(!flg) { return vector< vector<int> >(); }
}
f = true;
return v;
}
int main() {
bool t = false;
while(cin >>H && H){
cin >>W;
++H; ++W;
f = false;
vector< vector<int> > v(H, vector<int>(W));
vector<int> w(W, 0), h(H, 0);
REP(i, H){
REP(j, W){
string s; cin >>s;
if(s != "?") v[i][j] = atoi(s.c_str());
else { v[i][j] = INF; h[i]++; w[j]++; }
}
}
if(t) cout <<endl;
t = true;
vector< vector<int> > ans = solve(v, h, w);
if(f) { REP(i, H) REP(j, W) if(v[i][j] == INF) cout <<ans[i][j] <<endl; }
else cout <<"NO" <<endl;
}
return 0;
} | 0 | CPP |
n = int(input())
matrix = [[0 for x in range(n)] for y in range(n)]
def updateFirstRow(n):
for i in range(n):
matrix[0][i] = 1
def createMatrix(n):
for i in range(1, n):
for j in range(n):
matrix[i][j] = matrix[i - 1][j] + matrix[i][j-1]
updateFirstRow(n)
createMatrix(n)
print(matrix[n-1][n-1])
| 7 | PYTHON3 |
import io
import os
DEBUG = False
def dfs(trie, root, preorder=None, postorder=None):
stack = [root]
seen = set()
while stack:
nodeId = stack.pop()
if nodeId not in seen:
if preorder:
preorder(nodeId)
stack.append(nodeId)
seen.add(nodeId)
for c, childId in reversed(trie[nodeId]):
stack.append(childId)
else:
if postorder:
postorder(nodeId)
def solve(N, PC, K, A):
ROOT = 0
trie = {ROOT: []} # nodeId to list of (character, nodeId)
parent = {}
for i, (p, c) in enumerate(PC, 1): # i starts from 1
trie[p].append((c, i))
assert i not in trie
trie[i] = []
parent[i] = p
terminal = set(A)
# Sort children of each node by character
for children in trie.values():
children.sort()
# DFS
offset = 0
ancestor = []
dist = {}
def getDistPre(nodeId):
nonlocal offset
best = None
if nodeId != 0:
assert nodeId in parent
best = 1 + dist[parent[nodeId]]
if nodeId in terminal:
best = min(best, ancestor[-1] + offset + 1)
ancestor.append(min(ancestor[-1], best - offset))
if nodeId in terminal:
offset += 1
else:
# Is root
best = 0
ancestor.append(0)
dist[nodeId] = best
def getDistPost(nodeId):
ancestor.pop()
dfs(trie, ROOT, preorder=getDistPre, postorder=getDistPost)
if DEBUG:
def printNode(nodeId, word):
return (
str(nodeId)
+ "\t"
+ word
+ ("$" if nodeId in terminal else "")
+ "\t"
+ "dist: "
+ str(dist[nodeId])
)
return str(nodeId) + "\t" + word + ("$" if nodeId in terminal else "")
def printGraph(nodeId, path):
W = 8
depth = len(path)
for ch, childId in trie[nodeId]:
path.append(ch)
print(
(
" " * (W * depth)
+ "└"
+ ch.center(W - 1, "─")
+ str(childId)
+ ("$" if childId in terminal else "")
).ljust(50)
+ printNode(childId, "".join(path))
)
printGraph(childId, path)
path.pop()
printGraph(ROOT, [])
out = []
for a in A:
out.append(str(dist[a]))
return " ".join(out)
if __name__ == "__main__":
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
N, = list(map(int, input().split()))
PC = []
for i in range(N):
p, c = input().decode().split()
PC.append((int(p), str(c)))
K, = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = solve(N, PC, K, A)
print(ans)
| 13 | PYTHON3 |
# 3 17 4
# k n w
# k = each price
# n = money he has
# w = bananas
# ans = money required
k,n,w = map(int,input().split())
a=[]
for i in range(w+1):
a.append(k*i)
s = sum(a)
ans = s-n
if n>=s:
print("0")
else:
print(abs(ans))
| 7 | PYTHON3 |
def mi():
return map(int, input().split())
def gcd(a,b):
if b<a:
a,b = b,a
if a==0:
return b
return gcd(a,b%a)
n,k = mi()
a = list(mi())
g =0
for i in a:
g = gcd(g,i)
t = g%k
ans = [t]
c = 1
t+=g
while True:
if ans[0]==t%k:
break
ans.append(t%k)
c+=1
t+=g
print (c)
ans.sort()
for i in ans:
print (i, end = ' ')
| 9 | PYTHON3 |
#from fractions import Fraction
from collections import defaultdict
from math import*
import os
import sys
from io import BytesIO, IOBase
from heapq import nlargest
from bisect import*
import copy
import itertools
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)
def input(): return sys.stdin.readline().rstrip("\r\n")
#-------------above part copied-----------------------
t=int(input())
while t:
t-=1
n=int(input())
arr=list(map(int,input().split()))
if arr[0]+arr[1]>arr[-1]:
print("-1")
else:
print("1 2",n) | 7 | PYTHON3 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, functools
inf = float('inf')
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def LS(): return input().split()
def endl(): return print('\n')
graph = collections.defaultdict(list)
visited = set()
def grayCode (n):
return n ^ (n >> 1);
def intiGraph(m):
for _ in range(m):
u,v = LI()
graph[u-1].append(v-1)
graph[v-1].append(u-1)
def brackSeq(n):
seq = ['(', ')'] * n
random.shuffle(seq)
s = []
r = []
balance = 0
prev = 0
for pos in range( len(seq) ):
balance += 1 if seq[pos] == '(' else -1
if balance == 0:
if seq[prev] == '(':
r.extend( seq[ prev : pos + 1 ] )
else:
r.append('(')
s.append( [ ')' if v == '(' else '(' for v in seq[ prev + 1 : pos ] ] )
prev = pos + 1
for lst in reversed(s):
r.append(')')
r.extend(lst)
return r
################## Main (Author - 9th) ##################
for _ in range(I()):
n = I()
ans = set()
for i in range(500):
x = brackSeq(n)
x = "".join(x)
if x not in ans:
ans.add(x)
if len(ans) == n:
break
for i in ans:
print(i)
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Tue Jun 30 06:45:54 2020
@author: Dark Soul
"""
q=int(input(''))
matrix=[]
for i in range(q):
matrix.append(list(map(int, input().split())))
for i in range(q):
t=matrix[i]
t.sort()
if t[0]==t[1]:
if t[1]==t[2] or t[2]-t[1]==1:
print(0)
else:
print(2*(t[2]-t[1]-2))
elif t[1]==t[2]:
if t[1]-t[0]==1:
print(0)
else:
print(2*(t[1]-t[0]-2))
else:
t[0]=t[0]+1
t[2]=t[2]-1
print(abs(t[1]-t[0])+abs(t[1]-t[2])+abs(t[2]-t[0])) | 7 | PYTHON3 |
import math
bills = [100, 20, 10, 5, 1]
n = int(input())
s = 0
for b in bills:
s += n // b
n %= b
print(s)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
long long phi(long long md) {
long long result = md;
for (long long p = 2; p * p <= md; p++) {
if (md % p == 0) {
while (md % p == 0) {
md = md / p;
}
result = result / p * (p - 1);
}
}
if (md > 1) {
result = result / md * (md - 1);
}
return result;
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
long long a, m;
scanf("%lld%lld", &a, &m);
printf("%lld\n", phi(m / (gcd(a, m))));
}
}
| 10 | CPP |
def steps():
new=[]
for i in range(5):
lis=list(map(int,input().split()))
new.append(lis)
for i in range(1,6):
for j in range(1,6):
if new[i-1][j-1]==1:
row=i
column=j
else:
step_row=3-row
step_col=3-column
if step_row<0:
step_row=-(step_row)
if step_col<0:
step_col=-(step_col)
print(step_row+step_col)
steps()
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.