solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T>
ostream &operator<<(ostream &s, vector<T> P) {
s << "{ ";
for (int i = 0; i < P.size(); ++i) {
if (i > 0) s << ", ";
s << P[i];
}
return s << " }" << endl;
}
template <class T1, class T2>
ostream &operator<<(ostream &s, map<T1, T2> P) {
s << "{ ";
for (typeof(P.begin()) it = P.begin(); it != P.end(); ++it) {
if (it != P.begin()) s << ", ";
s << '<' << it->first << "->" << it->second << '>';
}
return s << " }" << endl;
}
const double INF = 1e10;
const double EPS = 1e-9;
const double PI = acos(-1.0);
double torad(int deg) { return (double)(deg)*M_PI / 180; }
struct Point {
double x, y;
Point(double x = 0.0, double y = 0.0) : x(x), y(y) {}
friend ostream &operator<<(ostream &s, const Point &p) {
return s << '(' << p.x << ", " << p.y << ')';
}
};
Point operator+(Point p, Point q) { return Point(p.x + q.x, p.y + q.y); }
Point operator-(Point p, Point q) { return Point(p.x - q.x, p.y - q.y); }
Point operator*(Point p, double a) { return Point(p.x * a, p.y * a); }
Point operator*(double a, Point p) { return Point(a * p.x, a * p.y); }
Point operator*(Point p, Point q) {
return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);
}
Point operator/(Point p, double a) { return Point(p.x / a, p.y / a); }
Point rot(Point p, double ang) {
return Point(cos(ang) * p.x - sin(ang) * p.y,
sin(ang) * p.x + cos(ang) * p.y);
}
Point rot90(Point p) { return Point(-p.y, p.x); }
double cross(Point p, Point q) { return p.x * q.y - p.y * q.x; }
double dot(Point p, Point q) { return p.x * q.x + p.y * q.y; }
double norm(Point p) { return dot(p, p); }
double abs(Point p) { return sqrt(dot(p, p)); }
bool eq(Point p, Point q) { return abs(p - q) < EPS; }
struct Line : vector<Point> {
Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {
this->push_back(a);
this->push_back(b);
}
};
struct Line_Equation {
double a, b, c;
Line_Equation(double a = 1.0, double b = 1.0, double c = 0.0)
: a(a), b(b), c(c) {}
friend ostream &operator<<(ostream &s, const Line_Equation &l) {
return s << l.a << "x + " << l.b << "y + " << l.c << " = 0";
}
};
struct Circle : Point {
double r;
Circle(Point p = Point(0.0, 0.0), double r = 0.0) : Point(p), r(r) {}
friend ostream &operator<<(ostream &s, const Circle &e) {
return s << "((" << e.x << ", " << e.y << "), " << e.r << ')';
}
};
Point proj(Point p, Line l) {
double t = dot(p - l[0], l[1] - l[0]) / norm(l[1] - l[0]);
return l[0] + (l[1] - l[0]) * t;
}
double distance(Point p, Line l) { return abs(p - proj(p, l)); }
vector<Point> crosspoint(Line l, Line m) {
vector<Point> res;
double d = cross(m[1] - m[0], l[1] - l[0]);
if (abs(d) < EPS) return vector<Point>();
res.push_back(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);
return res;
}
vector<Point> crosspoint(Circle e, Circle f) {
vector<Point> res;
double d = abs(e - f);
if (d < EPS) return vector<Point>();
double rcos = (d * d + e.r * e.r - f.r * f.r) / (2.0 * d);
double rsin = sqrt(e.r * e.r - rcos * rcos);
Point dir = (f - e) / d;
Point p1 = e + dir * Point(rcos, rsin);
Point p2 = e + dir * Point(rcos, -rsin);
res.push_back(p1);
if (!eq(p1, p2)) res.push_back(p2);
return res;
}
vector<Point> crosspoint(Circle e, Line l) {
vector<Point> res;
Point p = proj(e, l);
double rcos = abs(e - p);
if (rcos > e.r + EPS) return vector<Point>();
double rsin = sqrt(e.r * e.r - rcos * rcos);
Point dir = (l[1] - l[0]) / abs(l[1] - l[0]);
Point p1 = p + dir * rsin;
Point p2 = p - dir * rsin;
res.push_back(p1);
if (!eq(p1, p2)) res.push_back(p2);
return res;
}
Line_Equation konjiku(Circle e, Circle f) {
return Line_Equation((e.x - f.x) * 2.0, (e.y - f.y) * 2.0,
(e.r * e.r - e.x * e.x - e.y * e.y) -
(f.r * f.r - f.x * f.x - f.y * f.y));
}
int main() {
Point res;
Point a, b, c;
int ra, rb, rc;
while (cin >> a.x >> a.y >> ra >> b.x >> b.y >> rb >> c.x >> c.y >> rc) {
vector<Point> alt;
if (ra == rb && ra == rc) {
Point mid1 = (a + b) / 2;
Point dir1 = rot90(b - a);
Line l1(mid1, mid1 + dir1);
Point mid2 = (a + c) / 2;
Point dir2 = rot90(c - a);
Line l2(mid2, mid2 + dir2);
alt = crosspoint(l1, l2);
} else if (ra == rb || ra == rc) {
if (ra == rc) {
swap(b, c);
swap(rb, rc);
}
Point mid1 = (a + b) / 2;
Point dir1 = rot90(b - a);
Line l1(mid1, mid1 + dir1);
Point ica = (c * ra + a * rc) / (rc + ra);
Point eca = (c * ra - a * rc) / (-rc + ra);
Point cen2 = (ica + eca) / 2;
double rad2 = abs(ica - eca) / 2;
Circle c2(cen2, rad2);
alt = crosspoint(c2, l1);
} else {
Point iab = (a * rb + b * ra) / (ra + rb);
Point eab = (a * rb - b * ra) / (-ra + rb);
Point cen1 = (iab + eab) / 2;
double rad1 = abs(iab - eab) / 2;
Circle c1(cen1, rad1);
Point ica = (c * ra + a * rc) / (rc + ra);
Point eca = (c * ra - a * rc) / (-rc + ra);
Point cen2 = (ica + eca) / 2;
double rad2 = abs(ica - eca) / 2;
Circle c2(cen2, rad2);
alt = crosspoint(c1, c2);
}
double Min = INF;
for (int i = 0; i < alt.size(); ++i) {
double da = abs(alt[i] - a), db = abs(alt[i] - b), dc = abs(alt[i] - c);
if (Min > da && da > ra && db > rb && dc > rc) {
Min = abs(alt[i] - a);
res = alt[i];
}
}
if (Min < INF - EPS)
cout << fixed << setprecision(5) << res.x << " " << res.y << endl;
}
return 0;
}
| 9 | CPP |
for t in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
visited=[False for i in range(n+1)]
i=0
j=n-1
flag,count=0,0
k=1
mini=9999999999
while(i<=j):
if(a[i]==k):
i+=1
k+=1
count+=1
elif(a[j]==k):
j-=1
k+=1
count+=1
else:
while(i<=j):
mini=min(mini,a[i])
i+=1
if(mini==k):
count+=1
elif(mini<k):
count=mini
for i in range(n):
if(visited[a[i]]==True):
flag=-1
break
visited[a[i]]=True
for i in range(n-count):
if(i==flag):
print(1,end='')
else:
print(0,end='')
for i in range(n-count,n):
print(1,end='')
print() | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T modinv(T a, T n) {
T i = n, v = 0, d = 1;
while (a > 0) {
T t = i / a, x = a;
a = i % x;
i = x;
x = d;
d = v - t * x;
v = x;
}
return (v + n) % n;
}
long long modpow(long long n, long long k, long long mod) {
long long ans = 1;
while (k > 0) {
if (k & 1) ans = (ans * n) % mod;
k >>= 1;
n = (n * n) % mod;
}
return ans % mod;
}
template <class T>
string str(T Number) {
string Result;
ostringstream convert;
convert << Number;
Result = convert.str();
return Result;
}
int StringToNumber(const string &Text) {
istringstream ss(Text);
int result;
return ss >> result ? result : 0;
}
template <class T>
inline vector<pair<T, int> > FACTORISE(T n) {
vector<pair<T, int> > R;
for (T i = 2; n > 1;) {
if (n % i == 0) {
int C = 0;
for (; n % i == 0; C++, n /= i)
;
R.push_back(make_pair(i, C));
}
i++;
if (i > n / i) i = n;
}
if (n > 1) R.push_back(make_pair(n, 1));
return R;
}
template <class T>
inline T TOTIENT(T n) {
vector<pair<T, int> > R = FACTORISE(n);
T r = n;
for (int i = 0; i < R.size(); i++) r = r / R[i].first * (R[i].first - 1);
return r;
}
template <class T>
inline T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
int U[1010 + 1][1010 + 1], D[1010 + 1][1010 + 1], L[1010 + 1][1010 + 1],
R[1010 + 1][1010 + 1];
int n, m, q, a[1010 + 1][1010 + 1], b[1010 + 1], seq[1010 + 1];
struct DS {
int f[1010 + 1];
void init(int n) {
for (int i = 0; i <= n + 1; ++i) f[i] = i;
}
int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }
void merge(int x, int y) { f[find(x)] = find(y); }
} lf, rf;
inline bool cmp(int x, int y) { return b[x] < b[y]; }
int calc(int n, int x) {
for (int i = 1; i <= n; ++i) seq[i] = i;
sort(seq + 1, seq + n + 1, cmp);
lf.init(n), rf.init(n);
int ret = 0;
for (int i = n; i > 0; --i) {
int l = lf.find(seq[i] - 1) + 1, r = rf.find(seq[i] + 1) - 1;
if (l <= x && x <= r) ret = max(ret, (r - l + 1) * b[seq[i]]);
lf.merge(seq[i], seq[i] - 1), rf.merge(seq[i], seq[i] + 1);
}
return ret;
}
int main(int argc, char *argv[]) {
ios ::sync_with_stdio(false);
cin >> n >> m >> q;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) cin >> a[i][j];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
if (a[i][j]) {
U[i][j] = U[i - 1][j] + 1;
L[i][j] = L[i][j - 1] + 1;
} else
U[i][j] = L[i][j] = 0;
for (int i = n; i > 0; --i)
for (int j = m; j > 0; --j)
if (a[i][j]) {
D[i][j] = D[i + 1][j] + 1;
R[i][j] = R[i][j + 1] + 1;
} else
D[i][j] = R[i][j] = 0;
while (q--) {
int op, x, y;
cin >> op >> x >> y;
if (op == 1) {
a[x][y] ^= 1;
for (int i = x; i <= n; ++i)
if (a[i][y])
U[i][y] = U[i - 1][y] + 1;
else
U[i][y] = 0;
for (int j = y; j <= m; ++j)
if (a[x][j])
L[x][j] = L[x][j - 1] + 1;
else
L[x][j] = 0;
for (int i = x; i > 0; --i)
if (a[i][y])
D[i][y] = D[i + 1][y] + 1;
else
D[i][y] = 0;
for (int j = y; j > 0; --j)
if (a[x][j])
R[x][j] = R[x][j + 1] + 1;
else
R[x][j] = 0;
} else {
int ans = 0;
for (int i = 1; i <= m; ++i) b[i] = U[x][i];
ans = max(ans, calc(m, y));
for (int i = 1; i <= m; ++i) b[i] = D[x][i];
ans = max(ans, calc(m, y));
for (int i = 1; i <= n; ++i) b[i] = L[i][y];
ans = max(ans, calc(n, x));
for (int i = 1; i <= n; ++i) b[i] = R[i][y];
ans = max(ans, calc(n, x));
cout << ans << endl;
}
}
fclose(stdin);
fclose(stdout);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
string killme[t];
int count = 0;
for (int i = 0; i < t; i++) {
string s;
cin >> s;
int length = s.length();
if (length % 2 != 0) {
killme[count] = "NO";
count += 1;
continue;
}
int mid = length / 2;
string halfand = s.substr(0, mid);
string half = s.substr(mid);
if (halfand.compare(half) == 0) {
killme[count] = "YES";
count += 1;
} else {
killme[count] = "NO";
count += 1;
}
}
for (int z = 0; z < t; z++) cout << killme[z] << "\n";
return 0;
}
| 7 | CPP |
def readintlst():
return list(map(int, input().split(' ')))
def readcharlst():
return list(input().split(' '))
def readn():
return int(input())
for _ in range(readn()):
n, k = readintlst()
mat = [[0] * n for _ in range(n)]
i = j = 0
kk = k
while k:
k -= 1
mat[i][j] = 1
i+=1
j+=1
if i == n:
i = 0
j += 1
j %= n
# rmax, rmin = 0, n
# for r in mat:
# sm = sum(r)
# rmax = max(rmax, sm)
# rmin = min(rmin, sm)
# cmax, cmin = 0, n
# for c in list(zip(*mat)):
# sm = sum(c)
# cmax = max(cmax, sm)
# cmin = min(cmin, sm)
# ans = (rmax - rmin)**2 + (cmax - cmin)**2
ans = 0 if kk % n == 0 else 2
print(ans)
for r in mat:
print(''.join(map(str, r)))
| 10 | PYTHON3 |
n = int(input())
nums = list(input().split())
gift = [0]*n
for x in range (0,len(nums)):
gift[int(nums[x])-1] = int(x+1)
print(' '.join(map(str, gift))) | 7 | PYTHON3 |
N = int(input())
current = 0
max_current = 0
for n in range(N):
X, E = map(int, input().split())
current -= X
current += E
max_current = max(max_current, current)
print(max_current) | 7 | PYTHON3 |
n,m=map(int,input().split())
m=(m%int(n*(n+1)/2))
for i in range(1,m+1):
if((m-i)>=0):
m-=i
else:
break
print(m) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int gcd(int a ,int b){
if(b>a){
swap(a,b);
}
return b?gcd(b,a%b):a;
}
int main(){
int n;
cin >> n ;
vector<int> a(n);
rep(i,n){
cin >> a[i];
}
vector<int> l(n),r(n);
rep(i,n-1) l[i+1] = gcd (l[i],a[i]);
for(int i=n-1;i>=1;--i) r[i-1] = gcd(r[i],a[i]);
int ans = 1;
rep(i,n) ans = max(ans,gcd(l[i],r[i]));
cout << ans << endl;
return 0;
} | 0 | CPP |
import heapq
n, m = map(int, input().split())
a = list(map(int, input().split()))
result = []
for i in range(n):
e = a[:i]
heapq._heapify_max(e)
count = 0
while sum(e) + a[i] > m:
heapq._heappop_max(e)
count += 1
result.append(count)
print(' '.join(map(str, result)))
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, q;
int perm[300005];
int pos[3000005];
int x, y;
bool bad[300005];
int tree[300005];
int t;
int op;
void update(int x, int val) {
while (x <= n) {
tree[x] += val;
x += x & (-x);
}
}
int read(int x) {
int sum = 0;
while (x > 0) {
sum += tree[x];
x -= x & (-x);
}
return sum;
}
void correct(int num) {
if (num <= 0 || num > n) return;
bool now;
if (pos[num - 1] < pos[num])
now = false;
else
now = true;
if (now == bad[num]) return;
if (now) {
bad[num] = true;
update(num, 1);
} else {
bad[num] = false;
update(num, -1);
}
}
int main() {
int j;
scanf("%d", &n);
pos[0] = n + 1;
for (int i = 1; i <= n; i++) {
scanf("%d", perm + i);
pos[perm[i]] = i;
}
for (int i = 1; i <= n; i++) {
correct(i);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d%d%d", &t, &x, &y);
if (t == 1) {
printf("%d\n", read(y) - read(x) + 1);
} else {
j = pos[perm[x]];
pos[perm[x]] = pos[perm[y]];
pos[perm[y]] = j;
j = perm[x];
perm[x] = perm[y];
perm[y] = j;
correct(perm[x]);
correct(perm[x] - 1);
correct(perm[x] + 1);
correct(perm[y]);
correct(perm[y] - 1);
correct(perm[y] + 1);
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s,t,ans;
bool check(string x,string y){
for(int i=0;i<x.size();i++){
if(x[i]!='?'&&x[i]!=y[i])return 0;
}
return 1;
}
int main(){
cin>>s>>t;
ans="~";
for(int i=(int)s.size()-(int)t.size();i>=0;i--){
string st=s.substr(i,t.size());
if(check(st,t)){
s.replace(i,t.size(),t);
for(int j=0;j<s.size();j++)if(s[j]=='?')s[j]='a';
cout<<s<<endl;
return 0;
}
}
cout<<"UNRESTORABLE"<<endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline void out(int a) { printf("%d\n", a); }
inline void out(int a, int b) { printf("%d %d\n", a, b); }
inline void outf(double a) { printf("%3.lf\n", a); }
inline void outf(double a, double b) { printf("%3.lf %3.lf\n", a, b); }
inline void base() {
ios_base::sync_with_stdio(false);
cin.tie(0);
}
long long dua[55];
int find(long long a) {
for (int i = 0; i < 51; i++) {
if (a == dua[i]) return i;
}
return -1;
}
long long pow(int a, int b) {
long long tmp = 1;
for (int i = 0; i < b; i++) {
tmp *= a;
}
return tmp;
}
int main() {
base();
long long ans[55];
ans[1] = 1;
dua[0] = 1;
dua[1] = 2;
for (int i = 2; i < 51; i++) {
ans[i] = 2 * ans[i - 1] + 1;
dua[i] = 2 * dua[i - 1];
}
long long a, b;
cin >> a >> b;
long long tmp = 2;
while (b % tmp == 0) {
tmp *= 2;
}
cout << find(tmp) << endl;
return 0;
}
| 8 | CPP |
import copy
import itertools
import string
import sys
###
def powmod(x, p, m):
if p <= 0:
return 1
if p <= 1:
return x%m
return powmod(x*x%m, p//2, m) * (x%m)**(p%2) % m
###
def to_basex(num, x):
while num > 0:
yield num % x
num //= x
def from_basex(it, x):
ret = 0
p = 1
for d in it:
ret += d*p
p *= x
return ret
###
def l4(x):
ret = 1
while x > 4:
ret += 1
x += 3
x //= 4
return ret
def core():
n = int(input())
# print(n)
ans = 0
for _ in range(n):
k, a = (int(x) for x in input().split())
# print(k, a)
ans = max(ans, l4(a) + k)
print(ans)
core()
| 7 | PYTHON3 |
a, b = list(map(int,input().split(' ')))
print(a + b)
| 14 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
deque<char> vc;
int main() {
char a;
while (scanf("%c", &a) != EOF) {
vc.push_back(a);
while (scanf("%c", &a) && a != '\n') {
if (vc.empty())
vc.push_back(a);
else if (a != vc.back())
vc.push_back(a);
else {
while (a == vc.back()) {
vc.pop_back();
if (vc.empty()) break;
}
}
}
while (!vc.empty()) {
printf("%c", vc.front());
vc.pop_front();
}
printf("\n");
}
return 0;
}
| 7 | CPP |
def main():
def solve(mid,g):
for t,d in zip(x,y):
if s[mid]==t:
mid-=(d<'R')or-1
return mid==g
n,q,s,*z=open(0).read().split()
x,y=z[::2],z[1::2]
n,q=int(n),int(q)
s=' %s '%s
ok=0
ng=n+1
while abs(ok-ng)>1:
mid=(ok+ng)//2
if solve(mid,0):
ok=mid
else:
ng=mid
a=ok
ok=n+1
ng=0
while abs(ok-ng)>1:
mid=(ok+ng)//2
if solve(mid,n+1):
ok=mid
else:
ng=mid
print(max(0,ok-a-1))
if __name__=='__main__':
main() | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[500005];
cin >> n;
int m = -1;
long long ans = 0;
for (int k = 0; k < n; ++k) {
cin >> a[++m];
while (m >= 2 && a[m - 1] <= min(a[m - 2], a[m])) {
ans += min(a[m - 2], a[m]);
a[m - 1] = a[m];
--m;
}
}
for (int k = 1; k < m; ++k) {
ans += min(a[k - 1], a[k + 1]);
}
cout << ans << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const long long linf = 4000000000000000000LL;
const long long inf = 998244353;
const long double pi = 3.1415926535;
void pv(vector<int> a) {
for (auto& x : a) cout << x << " ";
cout << '\n';
}
void pv(vector<long long> a) {
for (auto& x : a) cout << x << " ";
cout << '\n';
}
void pv(vector<vector<int> > a) {
for (int i = (0); i < (int(a.size())); ++i) {
cout << i << '\n';
pv(a[i]);
cout << '\n';
}
}
void pv(vector<vector<long long> > a) {
for (int i = (0); i < (int(a.size())); ++i) {
cout << i << '\n';
pv(a[i]);
}
cout << '\n';
}
void pv(vector<string> a) {
for (auto& x : a) cout << x << '\n';
cout << '\n';
}
void setIO(string second) {
ios_base::sync_with_stdio(0);
cin.tie(0);
if (int(second.size())) {
freopen((second + ".in").c_str(), "r", stdin);
if (second != "test1") freopen((second + ".out").c_str(), "w", stdout);
}
}
vector<long long> r, p, b;
long long solve(int l, int r, vector<int> t1, vector<int> t2) {
if (int(t1.size()) == 0 && int(t2.size()) == 0) {
return r - l;
}
if (int(t1.size()) == 0 || int(t2.size()) == 0) {
long long ans = r - l;
if (int(t1.size()) == 0) swap(t1, t2);
int d1 = 0, d2 = 0;
if (int(t1.size())) {
d1 = t1[0] - l;
for (int i = (0); i < (int(t1.size()) - 1); ++i) {
d1 = max(d1, t1[i + 1] - t1[i]);
}
d1 = max(d1, r - t1[int(t1.size()) - 1]);
}
ans += r - l - d1;
return ans;
}
long long ans = 0;
int d1 = 0, d2 = 0;
if (int(t1.size())) {
d1 = t1[0] - l;
for (int i = (0); i < (int(t1.size()) - 1); ++i) {
d1 = max(d1, t1[i + 1] - t1[i]);
}
d1 = max(d1, r - t1[int(t1.size()) - 1]);
}
if (int(t2.size())) {
d2 = t2[0] - l;
for (int i = (0); i < (int(t2.size()) - 1); ++i) {
d2 = max(d2, t2[i + 1] - t2[i]);
}
d2 = max(d2, r - t2[int(t2.size()) - 1]);
}
ans = 3 * r - 3 * l - d1 - d2;
ans = min(ans, (long long)2 * r - 2 * l);
return ans;
}
int main() {
setIO("");
int n;
cin >> n;
for (int i = (0); i < (n); ++i) {
int x;
char y;
cin >> x >> y;
if (y == 'R') {
r.push_back(x);
} else if (y == 'P') {
p.push_back(x);
} else {
b.push_back(x);
}
}
if (int(p.size()) == 0) {
long long d1 = 0, d2 = 0;
if (int(r.size())) d1 = r.back() - r[0];
if (int(b.size())) d2 = b.back() - b[0];
cout << d1 + d2 << '\n';
return 0;
}
int i = 0, j = 0;
vector<int> t1, t2;
while (i < int(r.size()) && r[i] < p[0]) {
t1.push_back(r[i++]);
}
while (j < int(b.size()) && b[j] < p[0]) {
t2.push_back(b[j++]);
}
long long ans = 0;
if (int(t1.size())) ans += p[0] - t1[0];
if (int(t2.size())) ans += p[0] - t2[0];
for (int k = (1); k < (int(p.size())); ++k) {
t1.clear();
t2.clear();
while (i < int(r.size()) && r[i] < p[k]) {
t1.push_back(r[i++]);
}
while (j < int(b.size()) && b[j] < p[k]) {
t2.push_back(b[j++]);
}
ans += solve(p[k - 1], p[k], t1, t2);
}
if (int(r.size())) ans += max(0LL, r.back() - p.back());
if (int(b.size())) ans += max(0LL, b.back() - p.back());
cout << ans << '\n';
}
| 11 | CPP |
t = int(input())
lst = []
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
count2 = 0
for i in range(n):
count = 0
x = a[i] - min(a)
y = b[i] - min(b)
count += min(x, y) + abs(x - y)
count2 += count
print(count2)
| 8 | PYTHON3 |
import sys, math
def input():
return sys.stdin.readline()[:-1]
def main():
q = int(input())
for _ in range(q):
n = int(input())
a = list(map(int,input().split()))
p = [[] for k in range(n+1)]
for k in range(n):
p[a[k]].append(k)
ans = 1000000000
for e in p:
if len(e) >= 2:
for l in range(len(e)-1):
ans = min(ans,1+abs(e[l]-e[l+1]))
if ans == 1000000000:
print(-1)
else:
print(ans)
if __name__ == '__main__':
main()
| 9 | PYTHON3 |
#-------------Program--------------
#----Kuzlyaev-Nikita-Codeforces----
#------------notcontest------------
#----------------------------------
t=int(input())
for i in range(t):
a,b,c=map(int,input().split())
f=min(b,c//2);b-=f
print(3*(f+min(a,b//2))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16000000")
using namespace std;
const int Maxn = 2000005;
int n, p, M, m;
int N;
vector<int> neigh[Maxn];
int lef[Maxn], rig[Maxn];
int cur, tim[Maxn], low[Maxn];
vector<int> S;
bool onStack[Maxn];
int incomp[Maxn];
int numcomp;
vector<int> ans;
int Not(int v) { return v <= p + M + 1 ? p + M + 1 + v : v - (p + M + 1); }
int Spec(int ind) { return p + 1 + ind; }
void Connect(int v) {
tim[v] = low[v] = ++cur;
S.push_back(v);
onStack[v] = true;
for (int i = 0; i < neigh[v].size(); i++) {
int u = neigh[v][i];
if (!tim[u]) {
Connect(u);
low[v] = min(low[v], low[u]);
} else if (onStack[u])
low[v] = min(low[v], tim[u]);
}
if (low[v] == tim[v]) {
numcomp++;
int u;
do {
u = S.back();
S.pop_back();
onStack[u] = false;
incomp[u] = numcomp;
} while (u != v);
}
}
int main() {
scanf("%d %d %d %d", &n, &p, &M, &m);
N = 2 * (p + M + 1);
for (int i = 0; i < M; i++) {
neigh[Not(Spec(i))].push_back(Not(Spec(i + 1)));
neigh[Spec(i + 1)].push_back(Spec(i));
}
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
neigh[Not(x)].push_back(y);
neigh[Not(y)].push_back(x);
}
for (int i = 1; i <= p; i++) {
scanf("%d %d", &lef[i], &rig[i]);
neigh[i].push_back(Spec(lef[i] - 1));
neigh[i].push_back(Not(Spec(rig[i])));
neigh[Spec(rig[i])].push_back(Not(i));
neigh[Not(Spec(lef[i] - 1))].push_back(Not(i));
}
for (int i = 0; i < m; i++) {
int u, v;
scanf("%d %d", &u, &v);
neigh[u].push_back(Not(v));
neigh[v].push_back(Not(u));
}
for (int i = 1; i <= N; i++)
if (!tim[i]) Connect(i);
for (int i = 1; i <= N; i++)
if (incomp[i] == incomp[Not(i)]) {
printf("-1\n");
return 0;
}
int pnt = 0;
while (incomp[Spec(pnt)] < incomp[Not(Spec(pnt))]) pnt++;
for (int i = 1; i <= p; i++)
if (incomp[i] < incomp[Not(i)]) ans.push_back(i);
printf("%d %d\n", int(ans.size()), pnt);
for (int i = 0; i < ans.size(); i++)
printf("%d%c", ans[i], i + 1 < ans.size() ? ' ' : '\n');
return 0;
}
| 12 | CPP |
for i in range(int(input())):
n = int(input())
x = [int(i) for i in input().split(" ")]
x = set(x)
if max(x) - min (x) < len(x) :
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
long long n, a, i, e = -1, o, d;
scanf("%I64d %I64d", &n, &a);
d = n / 2;
o = n + 2;
for (i = 1; i <= d; i++) {
e = e + 2;
o = o - 2;
if (e == a || o == a) break;
}
printf("%I64d", i);
return 0;
}
| 7 | CPP |
t = int(input())
for i in range(t):
n = int(input())
k1 = 0
while n % 3 == 0:
n = n // 3
k1 += 1
k2 = 0
while n % 2 == 0:
n = n // 2
k2 += 1
if n != 1 or k2 > k1:
print(-1)
else:
print(k1 - k2 + k1) | 8 | PYTHON3 |
n, v = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
for i in range(n):
c.append(b[i] / a[i])
k = min(c)
up = sum(a) * k
if up < v:
print(up)
else:
print(v)
| 7 | PYTHON3 |
t=int(input())
for _ in range(t):
n, m = map(int, input().split())
s=[]
for _ in range(n):
s.append(input())
p=set()
for j in range(m):
for k in 'abcdefghijklmnopqrstuvwxyz':
p.add(s[0][:j]+k+s[0][j+1:])
for i in range(1,n):
w=s[i]
p2=set()
for j in range(m):
for k in 'abcdefghijklmnopqrstuvwxyz':
p2.add(w[:j]+k+w[j+1:])
p.intersection_update(p2)
if len(p)==0:
print(-1)
else:
print(list(p)[0])
| 12 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
long long N;
int main(void) {
long long i, j, Icase, k = 0;
cin >> N;
for (i = 1;; i *= 3) {
if (N % i) {
long long Ans = N / i + 1;
cout << Ans << endl;
return 0;
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
template <typename Tp>
void in(Tp &x) {
char ch = getchar(), f = 1;
x = 0;
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') f = -1, ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
x *= f;
}
template <typename Tp>
Tp chkmax(Tp &x, Tp y) {
return x > y ? x : x = y;
}
template <typename Tp>
Tp chkmin(Tp &x, Tp y) {
return x < y ? x : x = y;
}
template <typename Tp>
Tp Max(Tp x, Tp y) {
return x > y ? x : y;
}
template <typename Tp>
Tp Min(Tp x, Tp y) {
return x < y ? x : y;
}
using std::make_pair;
using std::pair;
using std::priority_queue;
using std::vector;
const int MAXN = 1000010;
int n, m;
int p[MAXN];
pair<int, int> inter[MAXN << 1], two[MAXN * 3];
bool del[MAXN];
priority_queue<pair<int, int>, vector<pair<int, int> >,
std::greater<pair<int, int> > >
q;
int tot, tot2;
void add(int x, int y) {
int L = inter[x].first, R = inter[y].first;
if (q.empty()) return;
int t = q.top().second;
while (del[t]) {
q.pop();
if (q.empty()) return;
t = q.top().second;
}
t = p[t];
R--;
two[++tot2] = make_pair(t - R, 0);
two[++tot2] = make_pair(t - L, 1000000003 + t - R);
}
int main() {
in(n);
in(m);
for (int i = (1), i_END_ = (m); i <= i_END_; i++) {
int l, r;
in(l);
in(r);
in(p[i]);
inter[++tot] = make_pair(l, i);
inter[++tot] = make_pair(r, -i);
}
std::sort(inter + 1, inter + tot + 1);
for (int i = (1), i_END_ = (tot); i <= i_END_; i++) {
if (i != 1 && inter[i - 1].first < inter[i].first) add(i - 1, i);
if (inter[i].second > 0)
q.push(make_pair(p[inter[i].second], inter[i].second));
else
del[-inter[i].second] = true;
}
for (int i = (1), i_END_ = (n); i <= i_END_; i++) {
int t;
in(t);
two[++tot2] = make_pair(t, 1);
}
int k = 0, b = 0;
std::sort(two + 1, two + tot2 + 1);
for (int i = (1), i_END_ = (tot2); i <= i_END_; i++) {
pair<int, int> now = two[i];
if (!two[i].second) {
k++;
b += 1 - two[i].first;
} else if (two[i].second >= 2) {
int x = two[i].second - 1000000003;
k--;
b -= 1 - x;
b += two[i].first - x + 1;
} else {
printf("%d\n", k * two[i].first + b);
}
}
return 0;
}
| 10 | CPP |
l,r=map(int,input().split())
if r-l>2018:
print("0")
exit()
ans=2018
for i in range(l,r):
for j in range(i+1,r+1):
ans=min(ans,(j*i)%2019)
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int Imx = 2147483647;
const long long Lbig = 2e18;
const int mod = 1e9 + 7;
struct fastio {
char s[100000];
int it, len;
fastio() { it = len = 0; }
inline char get() {
if (it < len) return s[it++];
it = 0;
len = fread(s, 1, 100000, stdin);
if (len == 0)
return EOF;
else
return s[it++];
}
bool notend() {
char c = get();
while (c == ' ' || c == '\n') c = get();
if (it > 0) it--;
return c != EOF;
}
} _buff;
inline long long getnum() {
long long r = 0;
bool ng = 0;
char c;
c = _buff.get();
while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
if (c == '-') ng = 1, c = _buff.get();
while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
if (x < 0) putchar('-'), x = -x;
register short a[20] = {}, sz = 0;
while (x) a[sz++] = x % 10, x /= 10;
if (sz == 0) putchar('0');
for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
char c = _buff.get();
while (c == ' ' || c == '\n') c = _buff.get();
return c;
}
int n;
int lv[100111];
struct edge {
int x, y, l, id;
bool operator<(const edge &t) const {
if (l != t.l) return l < t.l;
return lv[x] > lv[t.x];
}
} e[100111];
vector<int> con[100111];
void dfs(int x, int pre = -1) {
for (int i = 0; i < con[x].size(); i++) {
int u = con[x][i];
if (u == pre) continue;
lv[u] = lv[x] + 1;
dfs(u, x);
}
}
int f[100111], sz[100111];
int gf(int x) { return f[x] == x ? x : f[x] = gf(f[x]); }
void un(int x, int y) {
x = gf(x);
y = gf(y);
f[y] = x;
sz[x] += sz[y];
}
long long lsz[100111], rsz[100111];
int main() {
n = getnum();
for (int i = 1; i <= n; i++) f[i] = i, sz[i] = 1;
for (int i = 1; i < n; i++) {
int x, y, l;
x = getnum(), y = getnum(), l = getnum();
e[i].x = x;
e[i].y = y;
e[i].l = l;
e[i].id = i;
con[x].push_back(y);
con[y].push_back(x);
}
lv[1] = 1;
dfs(1);
for (int i = 1; i < n; i++) {
if (lv[e[i].x] < lv[e[i].y]) swap(e[i].x, e[i].y);
}
sort(e + 1, e + n);
for (int i = 1; i < n;) {
int r = i;
while (e[r].l == e[i].l) r++;
for (int j = i; j < r; j++) {
int x = e[j].x, y = e[j].y;
lsz[j] = sz[gf(x)];
un(x, y);
}
for (int j = i; j < r; j++) {
int x = e[j].x, y = e[j].y;
rsz[j] = sz[gf(x)] - lsz[j];
}
i = r;
}
long long mx = 0, cnt = 0;
for (int i = 1; i < n; i++) {
if (lsz[i] * rsz[i] > mx) {
mx = lsz[i] * rsz[i];
cnt = 1;
} else if (lsz[i] * rsz[i] == mx) {
cnt++;
}
}
vector<int> v;
for (int i = 1; i < n; i++)
if (1ll * lsz[i] * rsz[i] == mx) v.push_back(e[i].id);
sort(v.begin(), v.end());
putnum(mx * 2), putchar(' '), putnum(cnt), putchar('\n');
for (int i = 0; i < v.size(); i++) putnum(v[i]), putchar(' ');
return 0;
}
| 10 | CPP |
#include<bits/stdc++.h>
#define MAX_N 1001
#define rank dfasfds
using namespace std;
int par[MAX_N],rank[MAX_N];
void init(int n){for(int i=0;i<n;i++)par[i]=i,rank[i]=0;}
int find(int x){
if(par[x]==x)return x;
return par[x]=find(par[x]);
}
void unite(int x,int y){
x=find(x),y=find(y);
if(x==y)return;
if(rank[x]<rank[y])par[x]=y;
else{
par[y]=x;
if(rank[x]==rank[y])rank[x]++;
}
}
bool same(int x,int y){return find(x)==find(y);}
struct edge{
int a,b,c;
bool operator < (edge t) const{return c<t.c;}
};
int n,m;
edge e[10001];
int solve(){
int cnt=0,used[1001];
init(n+1);
for(int i=0;i<m;i++){
if(same(e[i].a,e[i].b)) continue;
unite(e[i].a,e[i].b);
used[cnt++]=e[i].c;
}
return cnt==n-1? used[(n-1)/2]:1e9;
}
int main(){
while(1){
cin>>n>>m;
if(!n&&!m)return 0;
for(int i=0;i<m;i++)cin>>e[i].a>>e[i].b>>e[i].c;
sort(e,e+m);
cout<<solve()<<endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
char s[1000000];
const int ati = 2 * '0';
int main() {
int n = 0;
for (int i = 0; scanf("%c", s + i) != EOF; i++, n++)
;
char x, y;
long long cnt = 0;
long long ans = 1;
for (int i = 1; i < n; i++) {
if (s[i - 1] + s[i] - ati == 9) {
cnt = 1;
x = s[i - 1];
y = s[i];
while (i < n - 2 && x == s[i + 1] && y == s[i + 2]) {
cnt++;
i += 2;
}
if (i < n - 1 && s[i + 1] == x) {
cnt++;
ans *= cnt;
}
} else {
cnt = 0;
x = '0';
y = '0';
}
}
cout << ans << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
pair<int, int> ev[N];
long long x[N], p[N];
long long st[N], pref[N];
int main() {
int dist, b, n;
scanf("%d %d %d", &dist, &b, &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &ev[i].first, &ev[i].second);
}
ev[n++] = make_pair(0, 0);
ev[n++] = make_pair(dist, 0);
sort(ev, ev + n);
for (int i = 0; i < n; i++) {
x[i] = ev[i].first;
p[i] = ev[i].second;
}
for (int i = 0; i < n - 1; i++) {
if (x[i + 1] - x[i] > b) {
cout << -1 << endl;
return 0;
}
}
long long ans = 0;
pref[0] = 0;
int e = 0;
for (int i = 0; i < n - 1; i++) {
long long need = x[i + 1] - x[i];
while (e > 0 && p[i] <= p[st[e - 1]]) {
e--;
}
st[e] = i;
if (e >= 1) {
pref[e] = pref[e - 1] + (x[st[e]] - x[st[e - 1]]) * p[st[e]];
}
e++;
int low = 0, high = e - 1;
while (low < high) {
int mid = (low + high) >> 1;
if (x[st[mid]] <= x[i] - b) {
low = mid + 1;
} else {
high = mid;
}
}
int pos = low;
long long can = b - (x[i] - x[st[pos]]);
if (can >= need) {
ans += need * p[st[pos]];
continue;
}
ans += can * p[st[pos]];
need -= can;
low = pos + 1, high = e - 1;
while (low < high) {
int mid = (low + high) >> 1;
if (x[st[mid]] - x[st[pos]] >= need) {
high = mid;
} else {
low = mid + 1;
}
}
ans += pref[low - 1] - pref[pos];
need -= x[st[low - 1]] - x[st[pos]];
ans += p[st[low]] * need;
}
cout << ans << endl;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
pair<long long, long long> ps[300010];
long long x;
int main() {
cin >> x;
if (x == 1) {
puts("1\n1 1");
return 0;
}
ps[0].first = 1, ps[0].second = x;
bool f1 = 0;
long long c = 2, f2 = 0;
int t = 1;
while (1) {
long long re = x - 1ll * c * (c - 1) * (2 * c - 1) / 6;
long long p = 1ll * c * (c - 1) / 2;
re += 1ll * c * p;
long long m1 = re % (1ll * c * c - p);
long long m = re / (1ll * c * c - p);
if (c > m) break;
if (!m1) {
if (c == m)
f2 = c;
else
ps[t++] = make_pair(c, m);
}
c++;
}
if (f2)
cout << (2 * t + 1) << endl;
else
cout << (2 * t) << endl;
for (int i = 0; i < t; i++) {
cout << ps[i].first << " " << ps[i].second << endl;
}
if (f2) cout << f2 << " " << f2 << endl;
for (int i = t - 1; i >= 0; i--) {
cout << ps[i].second << " " << ps[i].first << endl;
}
return 0;
}
| 10 | CPP |
counter = 0
unique_chars = []
username = input()
for char in username:
if char not in unique_chars:
unique_chars.append(char)
if len(unique_chars) %2:
print("IGNORE HIM!")
else:
print("CHAT WITH HER!")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma gcc optimize("Ofast")
#pragma gcc target("avx2")
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int t;
cin >> t;
vector<int> nxt(128);
nxt['L'] = 0, nxt['R'] = 1, nxt['U'] = 2, nxt['D'] = 3;
vector<int> di{0, 0, -1, 1};
vector<int> dj{-1, 1, 0, 0};
while (t--) {
int n, m;
cin >> n >> m;
auto valid = [&](int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m;
};
vector<vector<char>> a(n, vector<char>(m));
vector<vector<int>> in(n, vector<int>(m));
using node = pair<int, pair<int, int>>;
vector<vector<node>> dp(n, vector<node>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
int ni = i + di[nxt[a[i][j]]];
int nj = j + dj[nxt[a[i][j]]];
if (valid(ni, nj)) {
++in[ni][nj];
}
dp[i][j] = {0, {i, j}};
}
}
node ans = {0, {-1, -1}};
queue<pair<int, int>> q;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (in[i][j] == 0) {
q.emplace(i, j);
ans = {dp[i][j].first + 1, dp[i][j].second};
}
}
}
while (!q.empty()) {
auto [i, j] = q.front();
q.pop();
int ni = i + di[nxt[a[i][j]]];
int nj = j + dj[nxt[a[i][j]]];
if (valid(ni, nj)) {
--in[ni][nj];
dp[ni][nj] = max(dp[ni][nj], {dp[i][j].first + 1, dp[i][j].second});
ans = max(ans, {dp[ni][nj].first + 1, dp[ni][nj].second});
if (in[ni][nj] == 0) {
q.emplace(ni, nj);
}
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (in[i][j] > 0) {
in[i][j] = 0;
node mx = dp[i][j];
int cnt = 1;
int ni = i + di[nxt[a[i][j]]];
int nj = j + dj[nxt[a[i][j]]];
int pi = i, pj = j;
while (ni != i || nj != j) {
in[ni][nj] = 0;
mx = max(mx, dp[ni][nj]);
++cnt;
pi = ni, pj = nj;
ni = pi + di[nxt[a[pi][pj]]];
nj = pj + dj[nxt[a[pi][pj]]];
}
ans = max(ans, {mx.first + cnt, mx.second});
}
}
}
cout << ans.second.first + 1 << ' ' << ans.second.second + 1 << ' '
<< ans.first << '\n';
}
}
| 12 | CPP |
numwords = int(input())
for i in range(numwords):
temp = input()
if len(temp) > 10:
temp = temp[0]+str(len(temp)-2)+temp[-1]
print(temp)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct L {
int l, x, r;
};
int log2(int gg) {
for (int i = 0; i < 31; i++) {
if ((1 << i) > gg) return i;
}
}
using namespace std;
vector<L> a[70007];
int tell[1000008];
int main() {
for (int i = 0; i < 70007; i++) a[i].clear();
int n, m, o = 1;
scanf("%d%d", &n, &m);
memset(tell, 0, sizeof(tell));
for (int i = 0; i < m; i++) {
int nnn = 0;
scanf("%d", &nnn);
if (nnn == 1) {
int t;
L tmp;
scanf("%d%d%d%d", &t, &tmp.l, &tmp.r, &tmp.x);
a[t].push_back(tmp);
} else {
int t, s;
o++;
scanf("%d%d", &t, &s);
int l = s - 1, r = s, ans = 0;
for (int i = t; i <= n; i++) {
for (int j = 0; j < a[i].size(); j++) {
if (!(a[i][j].r <= l || a[i][j].l > r)) {
if (tell[a[i][j].x] != o) {
tell[a[i][j].x] = o;
ans++;
}
}
}
l = log2(l) + l;
r = log2(r) + r;
}
printf("%d\n", ans);
}
}
}
| 8 | CPP |
s=input()
s1="1111111"
s2="0000000"
if(len(s)>=7 ):
if(s1 in s or s2 in s):
print("YES")
else:
print("NO")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<int> v;
int a[n + 7][m + 7];
bool vis[n + 7][m + 7];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
vis[i][j] = false;
v.push_back(a[i][j]);
}
}
sort(v.begin(), v.end());
for (int pos = 0; pos < m; pos++) {
bool ok = false;
for (int i = 0; i < n; i++) {
if (ok) {continue;}
for (int j = 0; j < m; j++) {
if (ok) {continue;}
if (a[i][j] == v[pos] && !vis[i][j]) {
swap(a[i][j], a[i][pos]);
vis[i][pos] = true;
ok = true;
}
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << a[i][j] << ' ';
}
cout << endl;
}
}
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
}
| 8 | CPP |
A, Y = map(int, input().split())
ans = 0
while A<=Y:
ans+=1
A*=2
print(ans) | 0 | PYTHON3 |
n = int(input())
s = input()
keys = [0] * 256
res = 0
for i in range(0, len(s)-1, 2):
if s[i] != s[i + 1].lower():
if keys[ord(s[i + 1].lower())] == 0:
res += 1
else:
keys[ord(s[i + 1].lower())] -= 1
keys[ord(s[i])] += 1
print(res)
| 7 | PYTHON3 |
#include<iostream>
#include<cstdio>
using namespace std;
int n;
int main(){
scanf("%d",&n);
printf("%d",(n-1)>>1);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 7;
bool f[1 << 21];
int t, n, a[N], b[N];
int main() {
cin >> t;
while (t--) {
cin >> n;
memset(f, 0, sizeof(f));
for (int i = 1; i <= n; i++) scanf("%d", a + i);
for (int i = 1, k = 0; k < n; i++) {
bool w = 1;
for (int j = 1; j <= n; j++)
if (f[i + a[j]]) {
w = 0;
break;
}
if (w) {
b[++k] = i;
for (int j = 1; j <= n; j++) f[i + a[j]] = 1;
}
}
puts("YES");
for (int i = 1; i <= n; i++) printf("%d%c", b[i], " \n"[i == n]);
}
}
| 7 | CPP |
def BtoD(binary):
binary1 = binary
decimal, i, n = 0, 0, 0
while(binary != 0):
dec = binary % 10
decimal = decimal + dec * pow(2, i)
binary = binary//10
i += 1
return(decimal)
num = BtoD(int(input()))
a = [1, 4, 16, 64, 256, 1024, 4096, 16384, 65536, 262144, 1048576, 4194304, 16777216, 67108864, 268435456, 1073741824, 4294967296, 17179869184, 68719476736, 274877906944, 1099511627776, 4398046511104, 17592186044416, 70368744177664, 281474976710656, 1125899906842624, 4503599627370496, 18014398509481984, 72057594037927936, 288230376151711744, 1152921504606846976, 4611686018427387904, 18446744073709551616, 73786976294838206464, 295147905179352825856, 1180591620717411303424, 4722366482869645213696, 18889465931478580854784, 75557863725914323419136, 302231454903657293676544, 1208925819614629174706176, 4835703278458516698824704, 19342813113834066795298816, 77371252455336267181195264, 309485009821345068724781056, 1237940039285380274899124224, 4951760157141521099596496896, 19807040628566084398385987584, 79228162514264337593543950336, 316912650057057350374175801344, 1267650600228229401496703205376]
for i in range(len(a)):
if a[i] >= num:
print(i)
break | 7 | PYTHON3 |
d1,d2,d3=map(int,input().split(" "))
r1=d1+d3+d2
r2=2*d1+2*d2
r3=2*d1+2*d3
r4=2*d2+2*d3
l=[r1,r2,r3,r4]
print(min(l))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[5][5];
int r = 0, c = 0, i, j;
for (i = 0; i <= 4; i++) {
for (j = 0; j <= 4; j++) {
cin >> a[i][j];
if (a[i][j] == 1) {
r = i;
c = j;
}
}
}
cout << abs(r - 3 + 1) + abs(c - 3 + 1) << "\n";
return 0;
}
| 7 | CPP |
for _ in range(int(input())):
n,m=map(int,input().split())
a=n%m
if(a==0):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
from math import log
n,m=int(input()),int(input())
if int(log(m,2))<n:
print(m)
else:
print(m%(2**n)) | 7 | PYTHON3 |
t = int(input())
for ii in range(t):
l, r = map(int, input().split())
if r % 2 == 0:
print(r // 2, r)
else:
print(r // 2, r - 1)
| 7 | PYTHON3 |
n = int(input())
a = list(map( int, input().split()))
a.sort()
print(a[-1] + 1 - a[0] - n) | 7 | PYTHON3 |
n=int(input())
a=0
b=0
c=0
for i in range(n):
l=list(map(int,input().split()))
a+=l[0]
b+=l[1]
c+=l[2]
if(a==0 and b==0 and c==0):
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int ask(int a) {
int b;
printf("? %d\n", a);
fflush(stdout);
scanf("%d", &b);
return b;
}
int main() {
int n;
scanf("%d", &n);
int s = ask(1) - ask(1 + n / 2);
if (s == 0) {
printf("! 1\n");
return 0;
}
int l, r;
l = 1;
r = 1 + n / 2;
while (l != r) {
int mid = (l + r) / 2;
int c = ask(mid) - ask((mid + n / 2) % (n + 1));
if (c * s > 0)
l = mid + 1;
else {
if (c == 0) {
printf("! %d\n", mid);
fflush(stdout);
return 0;
} else {
r = mid;
}
}
}
printf("! -1\n");
fflush(stdout);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
struct TW
{
int w,s,v;
bool operator < (const TW &h) const
{
if (s!=h.s)return s < h.s;
if (w!=h.w)return w < h.w;
return v > h.v;
}
} a[N];
int n;
#define lint long long
lint f[20001], f_[20001];
int main()
{
cin >> n;
for (int i=1; i<=n; ++i)
{
cin >> a[i].w >> a[i].s >> a[i].v;
a[i].s += a[i].w;
}
sort (a+1, a+1+n);
for (int i=1; i<=n; ++i)
{
for (int j=a[i].w ; j <= a[i].s; ++j)
f_[j] = f[j - a[i].w] + a[i].v;
for (int j=1; j<=20000; ++j)
f[j] = max(f[j], f_[j]);
}
lint ans = 0;
for (int i=1; i<=20000; ++i)
ans = max(ans, f[i]);
cout << ans;
} | 0 | CPP |
n = int(input())
from math import sqrt
ans = -1
for i in range(2, int(sqrt(n)) + 1):
if n%i == 0:
ans = i
break
if ans == -1:
print(n)
else:
while n%ans == 0:
n /= ans
if n > 1:
print(1)
else:
print(ans) | 7 | PYTHON3 |
import sys
input = sys.stdin.readline
n = int(input())
lst = list(map(int, input().split()))
lst = sorted(lst)
dupl = 1
maxx = 1
for i in range(1, n):
if lst[i] == lst[i-1]:
dupl += 1
maxx = max(maxx, dupl)
else:
dupl = 1
if n == 1: print("YES")
elif maxx > n-(n//2): print("NO")
else: print("YES")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const int SINF = 1 << 30;
const int N = 100003;
int bt[N];
void update(int x, int c) {
for (; x < N; x += (x & (-x))) bt[x] += c;
}
int query(int x) {
int res = 0;
for (; x > 0; x -= (x & (-x))) res += bt[x];
return res;
}
struct Person {
int t, s, f, i;
};
inline bool operator<(const Person& a, const Person& b) { return a.t < b.t; }
Person p[N];
long long res[N];
int x = 1, dir = 0;
long long t = 0, nt = INF;
int k = 0;
set<pair<int, int> > s;
void move(long long ct) {
x += dir * ct;
t += ct;
if (!s.empty()) {
int a = query(x);
dir = ((int)s.size() - a >= a ? 1 : -1);
if (dir == 1)
nt = t + s.lower_bound(pair<int, int>(x, -SINF))->first - x;
else
nt = t + x - (--s.lower_bound(pair<int, int>(x, -SINF)))->first;
} else {
dir = 0;
nt = INF;
}
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%d%d%d", &p[i].t, &p[i].s, &p[i].f);
p[i].i = i;
}
sort(p, p + n);
while (true) {
if (s.empty() && k == n) break;
if (k == n || nt <= p[k].t) {
if (dir == 1) {
set<pair<int, int> >::iterator it =
s.lower_bound(pair<int, int>(x, -SINF));
int y = it->first;
while (it != s.end() && it->first == y) {
if (it->second > 0) {
int i = it->second - 1;
update(p[i].f, 1);
s.insert(pair<int, int>(p[i].f, -i));
} else
res[p[-it->second].i] = nt;
update(it->first, -1);
s.erase(it++);
}
} else {
set<pair<int, int> >::iterator it =
--s.lower_bound(pair<int, int>(x, -SINF));
int y = it->first;
while (it->first == y) {
if (it->second > 0) {
int i = it->second - 1;
update(p[i].f, 1);
s.insert(pair<int, int>(p[i].f, -i));
} else
res[p[-it->second].i] = nt;
update(it->first, -1);
if (it == s.begin()) {
s.erase(it);
break;
}
s.erase(it--);
}
}
move(nt - t);
} else {
if (p[k].s == x + dir * (p[k].t - t)) {
update(p[k].f, 1);
s.insert(pair<int, int>(p[k].f, -k));
} else {
update(p[k].s, 1);
s.insert(pair<int, int>(p[k].s, k + 1));
}
move(p[k].t - t);
++k;
}
}
for (int i = 0; i < n; ++i) printf("%lld\n", res[i]);
return 0;
}
| 11 | CPP |
import math
y=[]
y1=[]
n=int(input())
for i in range(n):
a,b,c,d,k=map(int,input().split())
a=int(math.ceil(a/c))
b=int(math.ceil(b/d))
if (a+b)>k:
y.append(-1)
y1.append(0)
else:
y.append(a)
y1.append(b)
for i in range (n):
if y[i]==-1:
print(y[i])
else:
print(y[i]," ",y1[i])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int T, n, ans;
double sx, sy, d[2010];
bool gg[2010];
struct Node {
double x, y, jj;
Node operator+(const Node &u) const { return (Node){x + u.x, y + u.y}; }
Node operator-(const Node &u) const { return (Node){x - u.x, y - u.y}; }
double operator*(const Node &u) const { return x * u.x + y * u.y; }
Node operator/(const double &u) const { return (Node){x / u, y / u}; }
bool operator==(const Node &u) const {
return fabs(x - u.x) < 1e-8 && fabs(y - u.y) < 1e-8;
}
void calc() {
if (fabs(y) > 1e-8) jj = atan(x / y);
}
bool operator<(const Node &u) const {
if (fabs(y) < 1e-8) {
if (fabs(u.y) < 1e-8) return x < u.x;
return 1;
}
if (fabs(u.y) < 1e-8) return 0;
return jj < u.jj;
}
void out() { printf(" %.3f %.3f\n", x, y); }
} node[2010];
struct Xn {
Node u, v;
void rot() {
swap(v.x, v.y);
v.x = -v.x;
}
};
vector<Node> use;
inline double cj(Node u, Node v) { return u.x * v.y - u.y * v.x; }
inline double lenf(Node u, Node v) {
return (u.x - v.x) * (u.x - v.x) + (u.y - v.y) * (u.y - v.y);
}
inline double len(Node u, Node v) { return sqrt(lenf(u, v)); }
inline double dx(Node u, Xn v) {
return fabs(cj(u - v.u, v.v)) / len(v.u, v.u + v.v);
}
inline bool check(Xn u) {
u.rot();
int i, j;
double t;
for (i = 1; i <= n; i++) {
d[i] = (node[i] - u.u) * u.v / sqrt(u.v * u.v);
}
sort(d + 1, d + n + 1);
t = d[1] + d[n];
for (i = 2; i < n; i++) {
if (fabs(d[i] + d[n - i + 1] - t) > 1e-8) return 0;
}
return 1;
}
int main() {
int i, j;
T = 1;
while (T--) {
use.clear();
ans = sx = sy = 0;
memset(gg, 0, sizeof(gg));
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%lf%lf", &node[i].x, &node[i].y);
sx += node[i].x;
sy += node[i].y;
}
sx /= (double)n;
sy /= (double)n;
for (i = 1; i <= n; i++) {
node[i].x -= sx;
node[i].y -= sy;
}
for (i = 1; i <= n; i++) {
if (gg[i]) continue;
for (j = i + 1; j <= n; j++) {
if (gg[j]) continue;
if (fabs(node[i].x + node[j].x) < 1e-8 &&
fabs(node[i].y + node[j].y) < 1e-8)
break;
}
if (j <= n) gg[i] = gg[j] = 1;
}
for (i = 1, j = 0; i <= n; i++) {
if (gg[i]) continue;
node[++j] = node[i];
}
n = j;
if (n <= 2) {
puts("-1");
return 0;
}
for (i = 1; i <= n; i++) {
for (j = i + 1; j <= n; j++) {
use.push_back((node[i] + node[j]) / 2.0);
use[use.size() - 1].calc();
}
}
sort(use.begin(), use.end());
for (i = 0; i < use.size(); i = j) {
for (j = i + 1; j < use.size(); j++) {
if (fabs(cj(use[i], use[j])) > 1e-8) break;
}
if (j - i >= n / 2) {
ans += check((Xn){(Node){0, 0}, use[i]});
}
}
printf("%d\n", ans);
}
}
| 10 | CPP |
S = input()
print("Yes" if 2 * S.count("hi") == len(S) else "No") | 0 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
neg_sum=sum(x<0 for x in a)
a=list(map(lambda x: abs(x),a))
m=min(a)
s=sum(a)
if neg_sum%2 : s-=m*2
print(s) | 0 | PYTHON3 |
for i in range(int(input())):
n, k = map(int, input().split())
i = list(map(int, input().split()))
sum = 0
median = abs(-n//2)
if n == 1:
for p in range(n*k):
sum = sum + i[p]
elif n == 2:
for p in range(0,n*k,2):
sum = sum + i[p]
else:
for p in range(k*(median-1), n * k, n-median+1):
sum = sum + i[p]
print(sum)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
int n, m;
int a[MAXN];
bool input() {
scanf("%d %d", &n, &m);
if ( !n && !m ) return 0;
for (int i = 0 ; i < n ; i++ ) {
scanf("%d", &a[i]);
}
return 1;
}
void solve() {
int mx = 0;
for (int i = 0 ; i < n ; i++ ) {
for (int j = i + 1 ; j < n ; j++ ) {
if ( a[i] + a[j] <= m ) {
mx = max(mx, a[i]+a[j]);
}
}
}
if (mx == 0) puts("NONE");
else printf("%d\n", mx);
}
int main(){
while(input()) {
solve();
}
} | 0 | CPP |
n = int(input())
if n % 2 == 1:
print(int((-n-1)/2))
else:
print(int(n/2)) | 7 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
arr=list(map(int,input().split()))
l=list(map(int,input().split()))
tmp=[]
for i in range(n):
if l[i]!=0:
continue
else:
tmp.append(arr[i])
tmp.sort(reverse=True)
cnt=0
new_l=[0 for i in range(n)]
for i in range(n):
if l[i]!=0:
new_l[i]=arr[i]
else:
new_l[i]=tmp[cnt]
cnt+=1
print(new_l[i],end=" ")
print("")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long num[5005];
int two[5005];
int dp[5005];
int main() {
int n;
scanf("%d", &n);
for (int i = (1); i <= (n); i++) {
scanf("%lld", &num[i]);
while (~num[i] & 1) ++two[i], num[i] >>= 1;
}
int mn = n - 1;
for (int i = (1); i <= (n); i++) {
dp[i] = 1;
for (int j = (1); j <= (i - 1); j++) {
if (two[i] && !(two[i] < i - j || two[i] - two[j] == i - j) ||
num[j] % num[i] != 0)
continue;
dp[i] = max(dp[i], dp[j] + 1);
}
mn = min(mn, n - dp[i]);
}
printf("%d\n", mn);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll const M = 1e9 + 7;
int main() {
ll n, h, tot = 1, rem = 0;
cin >> n >> h;
for (ll i = 0, a; i < n; ++i) {
cin >> a;
ll need = h - a;
if (need < 0 || abs(need - rem) > 1) return puts("0"), 0;
if (rem + 1 != need) tot = tot * (need + 1) % M;
rem = need;
}
cout << tot * (rem <= 1) << endl;
return 0;
}
| 10 | CPP |
input()
l, r = [0], [0]
for a, b in (lambda a: zip(a, reversed(a)))([0] + list(map(int, input().split())) + [0]):
l.append(min(a, l[-1] + 1))
r.append(min(b, r[-1] + 1))
print(max(map(min, zip(l[1:], reversed(r[1:])))))
| 8 | PYTHON3 |
N = int(input())
ans = [(0,0),(0,1),(1,0),(1,1)]
for i in range(N):
ans.append((i+1,i+2))
ans.append((i+2,i+1))
ans.append((i+2,i+2))
print(len(ans))
for row in ans:
print(*row)
| 9 | PYTHON3 |
a = [int(s) for s in input().split()]
if a[0]//a[1] == 0:
k = -1
print(-1)
else:
if a[0]%2 != 0:
a[0] += 1
k = a[0]/2
while k%a[1] != 0:
k += 1
if k != -1:
print (int(k))
| 7 | PYTHON3 |
#include <iostream>
using namespace std;
int main()
{
int c[3], sum, de;
bool oc[30];
while (cin >> c[0] >> c[1] >> c[2]){
de = 0;
sum = c[0] + c[1];
for (int i = 1; i <= 10; i++){
oc[i] = false;
}
for (int i = 0; i < 3; i++){
oc[c[i]] = true;
}
for (int i = 0; i < (20 - sum) && i < 10; i++){
if (oc[i + 1] == false) de++;
}
if (de > 3) cout << "YES" << endl;
else cout << "NO" << endl;
}
return (0);
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[16] = {1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0};
int main() {
int n;
cin >> n;
cout << a[n - 1];
}
| 10 | CPP |
matrix = []
for i in range(0, 5):
st = input("")
s = list(st.split(" "))
lis = [int(x) for x in s]
matrix.append(lis)
for k in range(0, 5):
for j in range(0, 5):
if matrix[k][j] == 1:
total = abs(k - 2) + abs(j - 2)
else:
continue
print(total)
| 7 | PYTHON3 |
z=int(input())
for i in range(z):
x,y=input().split(' ')
if int(x)%int(y)==0:
print(0)
else:
print(int(y)- (int(x)%int(y))) | 10 | PYTHON3 |
n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
scanf("%d%d",&a,&b);
printf("%s",a==b?"Yes":"No");
}
| 0 | CPP |
n=int(input())
s=input()
if(s.count('1')):
print("HARD")
else:
print("EASY") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400009, BLOCK = 250, BLOCK_NUM = MAXN / BLOCK + 10;
long long A[MAXN], B[MAXN];
int N, Q;
int tour[MAXN], from[MAXN], to[MAXN];
int mapp[MAXN];
pair<long long, long long> pnts[MAXN];
int ptr[BLOCK_NUM], sz[BLOCK_NUM];
long long inc[BLOCK_NUM];
vector<int> G[MAXN];
bool bad(pair<long long, long long> p0, pair<long long, long long> p1,
pair<long long, long long> p2) {
return 1.0L * (p1.first - p0.first) * (p2.second - p0.second) -
1.0L * (p2.first - p0.first) * (p1.second - p0.second) >=
0;
}
long long val(int i, long long x) { return pnts[i].first * x + pnts[i].second; }
void build(int k) {
int l = k * BLOCK, r = min((k + 1) * BLOCK, N) - 1;
for (int i = l; i <= r; ++i) A[i] += inc[k];
inc[k] = 0;
ptr[k] = sz[k] = 0;
for (int i = l; i <= r; ++i) {
pair<long long, long long> p(B[mapp[i]], A[mapp[i]] * B[mapp[i]]);
while (sz[k] > 1 && bad(pnts[l + sz[k] - 2], pnts[l + sz[k] - 1], p))
--sz[k];
pnts[l + (sz[k]++)] = p;
}
}
long long get(int k) {
int l = k * BLOCK;
ptr[k] = min(ptr[k], sz[k] - 1);
while (ptr[k] < sz[k] - 1 &&
val(l + ptr[k], inc[k]) < val(l + ptr[k] + 1, inc[k]))
++ptr[k];
return val(l + ptr[k], inc[k]);
}
void dfs(int u) {
static int timer = 0;
from[u] = timer++;
for (auto &v : G[u]) dfs(v);
to[u] = timer;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
scanf("%d %d", &N, &Q);
for (int v = 2; v <= N; ++v) {
int u;
scanf("%d", &u);
G[u].push_back(v);
}
dfs(1);
for (int u = 1; u <= N; ++u) {
int first;
scanf("%d", &first);
A[from[u] << 1] += first, A[to[u] << 1] -= first;
}
for (int u = 1; u <= N; ++u) {
int second;
scanf("%d", &second);
B[from[u] << 1] += second, B[to[u] << 1] -= second;
}
for (int i = 2; i < 2 * N; i += 2) A[i] += A[i - 2], B[i] += B[i - 2];
for (int i = 1; i < 2 * N; i += 2) A[i] = A[i - 1], B[i] = -B[i - 1];
N *= 2;
for (int i = 0; i <= N - 1; ++i) mapp[i] = i;
for (int l = 0; l < N; l += BLOCK) {
sort(mapp + l, mapp + min(N, l + BLOCK),
[&](int x, int y) { return B[x] < B[y]; });
build(l / BLOCK);
}
for (int _ = 0; _ <= Q - 1; ++_) {
int type, v, x;
scanf("%d %d", &type, &v);
int lo = from[v] * 2, hi = to[v] * 2 - 1;
int lo_k = lo / BLOCK, hi_k = hi / BLOCK;
int lo_r = lo_k * BLOCK + BLOCK - 1, hi_l = hi_k * BLOCK;
if (type == 1) {
scanf("%d", &x);
if (lo_k == hi_k) {
for (int i = lo; i <= hi; ++i) A[i] += x;
build(lo_k);
continue;
}
assert(lo_r < hi_l);
for (int i = lo; i <= lo_r; ++i) A[i] += x;
build(lo_k);
for (int k = lo_k + 1; k <= hi_k - 1; ++k) inc[k] += x;
for (int i = hi_l; i <= hi; ++i) A[i] += x;
build(hi_k);
} else {
long long ans = 0;
if (lo_k == hi_k) {
for (int i = lo; i <= hi; ++i)
ans = max(ans, (A[i] + inc[lo_k]) * B[i]);
printf("%I64d\n", ans);
continue;
}
assert(lo_r < hi_l);
for (int i = lo; i <= lo_r; ++i)
ans = max(ans, (A[i] + inc[lo_k]) * B[i]);
for (int i = hi_l; i <= hi; ++i)
ans = max(ans, (A[i] + inc[hi_k]) * B[i]);
for (int k = lo_k + 1; k <= hi_k - 1; ++k) ans = max(ans, get(k));
printf("%I64d\n", ans);
}
}
return 0;
}
| 13 | CPP |
#E
import re
s = "+"+input()
c = 0
k = [0 for i in range(6)]
while c<len(s):
find_1 = re.search(r'^([\+\-])x\^([2-5])', s[c:])
if find_1:
k[int(find_1.group(2))] = int(str(find_1.group(1))+"1")
c += find_1.end()
continue
find_2 = re.search(r'^([\+\-][1-9][0-9]*)x\^([2-5])', s[c:])
if find_2:
k[int(find_2.group(2))] = int(str(find_2.group(1)))
c += find_2.end()
continue
find_3 = re.search(r'^([\+\-][1-9][0-9]*)x', s[c:])
if find_3:
k[1] = int(str(find_3.group(1)))
c += find_3.end()
continue
find_4 = re.search(r'^([\+\-])x', s[c:])
if find_4:
k[1] = int(str(find_4.group(1))+"1")
c += find_4.end()
continue
find_5 = re.search(r'^([\+\-][1-9][0-9]*)', s[c:])
if find_5:
k[0] = int(str(find_5.group(1)))
c += find_5.end()
continue
#print(k)
#
ans = ""
que = list(range(abs(k[0]), -abs(k[0])-1, -1))
#print(que)
while True:
buf = [0 for i in range(6)]
n = que[0]
p = 5
while(k[p] == 0): p-=1
# print(p)
if p==0: break
buf[p] = k[p]
while p>0:
p -= 1
buf[p] = k[p] + n * buf[p+1]
# print(k)
# print(buf)
if buf[0] == 0:
k = buf[1:]+[0]
if n < 0:
ans += "(x+"+str(-n)+")"
else:
ans += "(x"+str(-n)+")"
else:
que.pop(0)
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int m = 1000005;
int main() {
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> cnt(m);
for (int x : a) {
// 重複処理
if (cnt[x] != 0) {
cnt[x] = 2;
continue;
}
for (int i = x; i < m; i += x) cnt[i]++;
}
int ans = 0;
for (int x : a) {
if (cnt[x] == 1) ans++;
}
cout << ans << endl;
} | 0 | CPP |
n = int(input())
s = sorted([int(x) for x in input().split()])
i = n-1
while i >= 0 :
if sum(s[i:]) > sum(s[:i]) :
break
i -= 1
print(n-i)
| 7 | PYTHON3 |
import sys,math,string
input=sys.stdin.readline
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
n,c=M()
l=L()
s=0
for i in range(n-1,0,-1):
if(l[i]-l[i-1] > c ):
print(s+1)
exit()
else:
s+=1
print(s+1)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> d;
bool g[200000];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
if (n % 2 == 0) {
printf("Marsel");
return 0;
}
for (int i = 1; i * i <= m; i++)
if (m % i == 0) {
d.push_back(i);
if (m / i != i) d.push_back(m / i);
}
sort(d.begin(), d.end());
for (int i = 0; i < d.size(); i++) {
g[i] = false;
for (int j = 0; j < i; j++)
if ((d[j] >= k) && (d[i] % d[j]) == 0 &&
((d[i] / d[j]) % 2 == 0 || (!g[j]))) {
g[i] = true;
break;
}
}
if (g[d.size() - 1])
printf("Timur");
else
printf("Marsel");
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct sb {
int x;
int y;
} thing[25];
int way[25][25];
int ans[25];
int dp[1 << 24];
int pre[1 << 24];
int main() {
cin >> thing[0].x >> thing[0].y;
int n;
cin >> n;
int all = (1 << n) - 1;
for (int i = 1; i <= n; i++) {
cin >> thing[i].x >> thing[i].y;
}
for (int i = 0; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
way[i][j] = way[j][i] =
(thing[i].x - thing[j].x) * (thing[i].x - thing[j].x) +
(thing[i].y - thing[j].y) * (thing[i].y - thing[j].y);
}
}
memset(dp, 0x3f3f3f3f, sizeof(dp));
dp[0] = 0;
for (int i = 0; i <= all; i++) {
if (dp[i] != 0x3f3f3f3f) {
for (int j = 1; j <= n; j++) {
if (!(i & (1 << (j - 1)))) {
int t = (i | (1 << (j - 1)));
int tmp = dp[i] + 2 * way[0][j];
if (dp[t] > tmp) {
dp[t] = tmp;
pre[t] = i;
}
for (int k = 1; k <= n; k++) {
if (!(t & (1 << (k - 1)))) {
int t2 = (t | (1 << (k - 1)));
tmp = dp[i] + way[0][j] + way[j][k] + way[k][0];
if (dp[t2] > tmp) {
dp[t2] = tmp;
pre[t2] = i;
}
}
}
break;
}
}
}
}
printf("%d\n", dp[all]);
int father = all;
int son = pre[father];
int cnt = 0;
while (father) {
int realson = son ^ father;
ans[cnt++] = 0;
for (int i = 1; i <= n; i++) {
if (realson & (1 << (i - 1))) {
ans[cnt++] = i;
}
}
father = son;
son = pre[father];
}
ans[cnt] = 0;
for (int i = cnt; i >= 0; i--) {
printf("%d", ans[i]);
if (i == 0)
printf("\n");
else
printf(" ");
}
return 0;
}
| 9 | CPP |
c=0
for n in range(int(input())):
s=0
q=list(map(int,input().split()))
for a in q:
s=s+a
if s >= 2:
c+=1
print(c) | 7 | PYTHON3 |
from collections import Counter
n,m = map(int,input().split())
s = input()
d = Counter(s)
a = max(d.values())
if a<=m:
print("Yes")
else:
print("No") | 7 | PYTHON3 |
(lambda math,itertools:[(lambda N:print((1<<int(math.log2(N)+1e-12+1))-1)if N&N+1else(lambda w:[list(itertools.takewhile(lambda i:N%i or[print(N//i),w.__setitem__(0,0)][1],(i for i in range(2,int(math.sqrt(N))+1)))),w[0]and print(1)])([1]))(int(input()))for t in range(int(input()))])(__import__('math'),__import__('itertools')) | 9 | PYTHON3 |
#include <bits/stdc++.h>
bool is_prime(int n) {
if (n < 2) {
return false;
}
for (int d = 2; d * d <= n; d++) {
if (n % d == 0) {
return false;
}
}
return true;
}
int main() {
int n;
std::cin >> n;
int m = n, cross = 0;
while (!is_prime(m + cross)) {
cross++;
}
assert(2 * cross <= n);
std::cout << m + cross << std::endl;
for (int i = 1; i <= n; i++) {
std::cout << i << ' ' << i % n + 1 << std::endl;
}
int jump = std::max(2, cross);
for (int i = 1; i <= cross; i++) {
assert(i < 1 + jump);
assert(i + jump <= n);
std::cout << i << ' ' << i + jump << std::endl;
}
}
| 10 | CPP |
x, y = list(map(int, input().split(' ')))
for i in range(y):
if x % 10 == 0:
x = x // 10
else:
x = x - 1
print(x) | 7 | PYTHON3 |
t = int(input())
for _ in range(t):
n, s, k = map(int, input().split())
# new learning
se = set(map(int, input().split()))
i = 0
while True :
if (s-i >0 and s - i not in se) or (s +i <=n and s + i not in se) :
print(i)
break
else:
i+=1
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j;
cin >> n >> m;
for (i = 1; i <= n; i++) {
if (i % 4 == 2) {
for (j = 1; j < m; j++) {
cout << ".";
}
cout << "#" << endl;
} else if (i % 4 == 0) {
cout << "#";
for (j = 1; j < m; j++) {
cout << ".";
}
cout << endl;
} else {
for (j = 1; j <= m; j++) {
cout << "#";
}
cout << endl;
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int main() {
int a[4];
int total = 0;
for (int i = 0; i < 4; i++) {
scanf("%d", &a[i]);
total += a[i];
}
if (total & 1) {
printf("NO\n");
return 0;
}
total /= 2;
sort(a, a + 4);
if (a[3] == total) {
printf("YES\n");
return 0;
} else if (a[3] < total) {
if (a[3] + a[0] == total)
printf("YES\n");
else
printf("NO\n");
} else {
printf("NO\n");
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, i, j, k, x, y = 0;
cin >> n >> m;
map<long, long> c;
for (i = 1; i <= m; i++) {
if (i % 5 == 0)
c[5]++;
else if (i % 5 == 1)
c[1]++;
else if (i % 5 == 2)
c[2]++;
else if (i % 5 == 3)
c[3]++;
else if (i % 5 == 4)
c[4]++;
}
for (i = 1; i <= n; i++) {
x = i % 5;
y = y + c[5 - x];
}
cout << y << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, inf = 1e9;
int n, P[N], Q[N];
int S, T, final[N], nex[N * 8], to[N * 8], tot = 1, f[N * 8];
void _link(int x, int y, int w) {
to[++tot] = y, nex[tot] = final[x], final[x] = tot;
f[tot] = w;
}
void link(int x, int y, int w) {
_link(x, y, w), _link(y, x, 0);
}
int vis[N], ans;
int dis[N], cur[N];
void dinic() {
static queue<int> Q;
memset(cur, 0, sizeof cur);
memset(dis, 127, sizeof dis);
dis[S] = 0; Q.push(S);
while (Q.size()) {
int x = Q.front(); Q.pop();
for(int i = final[x]; i; i = nex[i]) if(f[i]){
int y = to[i];
if(dis[x] + 1 < dis[y]) {
dis[y] = dis[x] + 1;
Q.push(y);
}
}
}
}
int go(int x, int w) {
if (x == T) return w;
int used = 0;
if (cur[x] == 0) cur[x] = final[x];
for(int i = cur[x]; i; i = nex[i]) {
if (f[i]) {
int y = to[i];
if (dis[x] + 1 == dis[y]) {
int take = go(y, min(w - used, f[i]));
f[i] -= take;
f[i ^ 1] += take;
used += take;
if (used == w) return w;
}
}
cur[x] = i;
}
return used;
}
int lab[N], lab2[N];
int labcnt;
int main() {
int g = clock();
cin >> n;
for(int i = 1; i <= n; i++) scanf("%d", &P[i]), P[i]++;
for(int i = 1; i <= n; i++) scanf("%d", &Q[i]), Q[i]++;
S = n + n + 1, T = S + 1;
for(int i = 1; i <= n; i++) if(!vis[i]) {
labcnt++;
int t = i;
vis[t] = 1;
lab[t] = labcnt;
while (vis[P[t]] == 0) {
// _link(P[t], t, inf);
// _link(t, P[t], inf);
t = P[t];
vis[t] = 1;
lab[t] = labcnt;
}
}
memset(vis, 0, sizeof vis);
for(int i = 1; i <= n; i++) if(!vis[i]) {
labcnt++;
int t = i; vis[t] = 1;
lab2[t] = labcnt;
while (vis[Q[t]] == 0) {
// _link(Q[t] + n, t + n, inf);
// _link(t + n, Q[t] + n, inf);
t = Q[t];
vis[t] = 1;
lab2[t] = labcnt;
}
}
ans = n;
for(int i = 1; i <= n; i++) {
if (P[i] == i && Q[i] == i) {
ans --;
} else {
if (P[i] == i && Q[i] != i) { //n+i默认Q[i]（在S集合），否则就有1的代价
link(S, lab2[i], 1);
} else
if (P[i] != i && Q[i] == i) { //i默认P[i]（在T集合）
link(lab[i], T, 1);
} else
if (P[i] != i && Q[i] != i && P[i] != Q[i]) { //同时选i有1的代价
link(lab[i], lab2[i], 1);
} else { // P[i] == Q[i] 选法相同有1的代价
_link(lab[i], lab2[i], 1);
_link(lab2[i], lab[i], 1);
}
}
}
cerr << labcnt << endl;
while (dinic(), dis[T] <= inf) {
ans -= go(S, inf);
// cerr << ans << endl;
}
cout << ans << endl;
cerr << clock() - g << endl;
}
| 0 | CPP |
import sys
sys.setrecursionlimit(10**9)
H, W = map(int, input().split())
S = [list(input()) for _ in range(H)]
cntblack, cntwhite = 0, 0
visited = [[False] * W for _ in range(H)]
def count(h, w):
global cntblack, cntwhite
if visited[h][w]: return
visited[h][w] = True
if S[h][w] == ".": cntwhite += 1
else: cntblack += 1
for ny, nx in ((1,0),(0,1),(-1,0),(0,-1)):
ny += h
nx += w
if not (0 <= ny < H and 0 <= nx < W): continue
if S[ny][nx] == S[h][w]: continue
count(ny, nx)
ans = 0
for h in range(H):
for w in range(W):
cntblack, cntwhite = 0, 0
count(h, w)
ans += cntblack * cntwhite
print(ans)
| 0 | PYTHON3 |
n=int(input())
start=1
f=0
while True:
x=(start*(start+1))//2
if x==n:
break
else:
start+=1
if x>n:
f=1
break
if f==1:
print("NO")
else:
print("YES") | 7 | PYTHON3 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define eps 1e-10
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
using namespace std;
typedef long long ll;
typedef pair<long double,int> pii;
#define P(a,b) make_pair(a,b)
inline void open(const char *s)
{
#ifndef ONLINE_JUDGE
char str[20];
sprintf(str,"in%s.txt",s);
freopen(str,"r",stdin);
// sprintf(str,"out%s.txt",s);
// freopen(str,"w",stdout);
#endif
}
inline int rd()
{
static int x,f;
x=0;f=1;
char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
return f>0?x:-x;
}
const int N=40010;
int n,b[N];pii a[N];
struct line{
int A,B,C;
inline void rev(){A=-A;B=-B;C=-C;}
inline void sw(){swap(A,B);}
inline void read(){A=rd();B=rd();C=rd();}
}L[N];
inline bool cmp(line a,line b){return a.A*b.B>b.A*a.B;}
namespace TA{
#define lowbit(x) (x&-x)
int tr[N];
inline void clear(){memset(tr,0,sizeof tr);}
inline void insert(int x,int d){for(;x<=n;x+=lowbit(x))tr[x]+=d;}
inline int query(int x){int res=0;for(;x;x-=lowbit(x))res+=tr[x];return res;}
}
inline void gao()
{
fo(i,1,n)if(L[i].B<0)L[i].rev();
sort(L+1,L+n+1,cmp);
// fo(i,1,n)printf("%d %d %d\n",L[i].A,L[i].B,L[i].C);
long double l=-1e9,r=1e9;
while(r-l>eps){
// l=1.;r=1.;
long double mid=.5*(l+r);
fo(i,1,n)a[i]=P((1.*L[i].C-mid*L[i].A)/(1.*L[i].B),i);
// fo(i,1,n)printf("%.5Lf ",a[i].first);puts("");
sort(a+1,a+n+1);
int cnt=0;
TA::clear();
fo(i,1,n){
cnt+=TA::query(a[i].second);
TA::insert(a[i].second,1);
}
// cout<<cnt<<endl;
ll hh=((ll)n*(n-1)/2ll+1)/2ll;
if(cnt>=hh)r=mid;
else l=mid;
}
printf("%.10Lf ",(r+l)*.5);
}
int main()
{
n=rd();fo(i,1,n)L[i].read();
long double ans;
gao();fo(i,1,n)L[i].sw();
gao();
puts("");
return 0;
}
| 0 | CPP |
import sys
n=input()
x=input().split(' ')
for i in x:
if i =='1':
print("HARD")
sys.exit()
print("EASY")
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.