solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
b = list(map(int,input().split()))
count = {}
for i,j in enumerate(b):
if j-i in count:
count[j-i]+=j
else:
count[j-i]=j
print(max(count.values())) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, x, y;
int v[10];
char c[10];
char cmd;
int main() {
ios::sync_with_stdio(0);
cin >> n;
cin >> x >> y;
v[0] = v[2] = v[4] = v[7] = -2e9;
v[1] = v[3] = v[5] = v[6] = 2e9;
c[0] = c[1] = c[2] = c[3] = c[4] = c[5] = c[6] = c[7] = '@';
for (int i = 1; i <= n; i++) {
cin >> cmd >> a >> b;
if (a == x) {
if (b < y) {
if (v[0] < b) {
v[0] = b;
c[0] = cmd;
}
} else {
if (v[1] > b) {
v[1] = b;
c[1] = cmd;
}
}
} else if (b == y) {
if (a < x) {
if (v[2] < a) {
v[2] = a;
c[2] = cmd;
}
} else {
if (v[3] > a) {
v[3] = a;
c[3] = cmd;
}
}
} else if (a - b == x - y) {
if (a < x) {
if (v[4] < b) {
v[4] = b;
c[4] = cmd;
}
} else {
if (v[5] > b) {
v[5] = b;
c[5] = cmd;
}
}
} else if (a + b == x + y) {
if (a < x) {
if (v[6] > b) {
v[6] = b;
c[6] = cmd;
}
} else {
if (v[7] < b) {
v[7] = b;
c[7] = cmd;
}
}
}
}
if (c[0] == 'R' || c[0] == 'Q') {
cout << "YES";
return 0;
}
if (c[1] == 'R' || c[1] == 'Q') {
cout << "YES";
return 0;
}
if (c[2] == 'R' || c[2] == 'Q') {
cout << "YES";
return 0;
}
if (c[3] == 'R' || c[3] == 'Q') {
cout << "YES";
return 0;
}
if (c[4] == 'B' || c[4] == 'Q') {
cout << "YES";
return 0;
}
if (c[5] == 'B' || c[5] == 'Q') {
cout << "YES";
return 0;
}
if (c[6] == 'B' || c[6] == 'Q') {
cout << "YES";
return 0;
}
if (c[7] == 'B' || c[7] == 'Q') {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 10;
long long a[15], b[15], c[15];
long long read() {
long long x = 0, t = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') t = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * t;
}
int main() {
for (long long i = 1; i <= N; i++) {
long long x = i, l = 1, r = 0;
while (x--) l *= 10, r = r * 10 + 9;
l /= 10;
a[i] = (r - l + 1) * i;
b[i] = b[i - 1] + a[i];
c[i] = c[i - 1] + (b[i - 1] + i + b[i]) * (r - l + 1) / 2;
}
long long T = read();
while (T--) {
long long n = read();
long long pos = lower_bound(c + 1, c + N + 1, n) - c;
n -= c[pos - 1];
long long l = 1, r = 0;
long long x = pos, t = b[pos - 1];
while (x--) l *= 10, r = 10 * r + 9;
l /= 10;
long long L = l;
while (l <= r) {
long long mid = (l + r) >> 1;
long long cnt = mid - L + 1;
if ((2 * t + pos + cnt * pos) * cnt / 2 >= n)
r = mid - 1;
else
l = mid + 1;
}
long long cnt = l - L;
n -= (2 * t + pos + cnt * pos) * cnt / 2;
pos = lower_bound(b + 1, b + N + 1, n) - b;
n -= b[pos - 1];
long long ans = 1;
for (long long i = 1; i < pos; i++) ans *= 10;
t = (n - 1) / pos;
n -= t * pos;
ans += t;
n = pos - n;
while (n--) ans /= 10;
printf("%lld\n", ans % 10);
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<vector<bool> > pic, ray, vis;
vector<int> ans;
int cnt;
void floodfill(int x, int y) {
if (vis[x][y] || !pic[x][y]) return;
vis[x][y] = true;
if (!pic[x - 2][y] && !pic[x + 2][y]) {
if (!pic[x][y - 1] && (!pic[x - 2][y + 5] || !pic[x + 2][y + 5]))
ray[x][y] = true;
if (!pic[x][y + 1] && (!pic[x - 2][y - 5] || !pic[x + 2][y - 5]))
ray[x][y] = true;
}
if (!pic[x][y - 2] && !pic[x][y + 2]) {
if (!pic[x - 1][y] && (!pic[x + 5][y - 2] || !pic[x + 5][y + 2]))
ray[x][y] = true;
if (!pic[x + 1][y] && (!pic[x - 5][y - 2] || !pic[x - 5][y + 2]))
ray[x][y] = true;
}
if (ray[x][y] && !ray[x - 1][y - 1] && !ray[x - 1][y + 1] &&
!ray[x + 1][y - 1] && !ray[x + 1][y + 1])
++cnt;
floodfill(x - 1, y);
floodfill(x + 1, y);
floodfill(x, y - 1);
floodfill(x, y + 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
pic = ray = vis = vector<vector<bool> >(n + 4, vector<bool>(m + 4));
char c;
n++, m++;
for (int i = 2; i <= n; ++i) {
for (int j = 2; j <= m; ++j) {
cin >> c;
pic[i][j] = (c == '1');
}
}
for (int i = 2; i <= n; ++i) {
for (int j = 2; j <= m; ++j) {
if (pic[i][j] && !vis[i][j]) {
cnt = 0;
floodfill(i, j);
ans.push_back(cnt);
}
}
}
sort(ans.begin(), ans.end());
cout << ans.size() << '\n';
for (vector<int>::iterator it = ans.begin(); it != ans.end(); ++it)
cout << *it << ' ';
return 0;
}
| 12 | CPP |
a, b = map(int, input().split())
ans = 0
while a and b:
if a % b == 0 or b % a == 0:
print(max(a // b, b // a) + ans)
exit(0)
if a - b > 0:
ans += a // b
a, b = a % b, b
else:
ans += b // a
a, b = a, b % a
if a % b == 0:
ans += a // b
else:
ans += b // a
print(ans)
| 7 | PYTHON3 |
def vzlomy(lst):
a = list()
for elem in lst:
a.append(tuple((100 * int(elem[1]) - 50 * int(elem[2]) + int(elem[3]) + int(elem[4]) + int(elem[5]) + int(
elem[6]) + int(elem[7]), elem[0])))
return max(a, key=lambda item: item[0])[1]
n = int(input())
z = list()
for i in range(n):
s = input().split()
z.append(s)
print(vzlomy(z))
| 7 | PYTHON3 |
#
n, t = int(input()), list(map(int, input().split()))
k = n // 2
a, b = t[: k], t[k: ]
u, v, m = sum(a), sum(b), max(t)
a, b = list(enumerate(a, 1)), list(enumerate(b, k + 1))
i, d = 0, abs(u - v) - m
if u > v: a, b = b, a
while d > 0:
if a[i][1] < b[i][1]:
d -= 2 * (b[i][1] - a[i][1])
a[i], b[i] = b[i], a[i]
if d < 1: break
i += 1
print(len(a))
print(' '.join(str(i) for i, r in a))
print(len(b))
print(' '.join(str(i) for i, r in b)) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000100;
const int INF = 1 << 28;
int n;
int a[MAX_N];
long long rec(int n) {
if (n == 0) return 0;
int m = 1;
while (m <= n) m <<= 1;
m--;
int d = m - n;
long long r = 0;
for (int i = (d); i <= (n); i++) {
a[i ^ m] = i;
r += m;
}
r += rec(d - 1);
return r;
}
long long solve() { return rec(n); }
int main() {
cin >> n;
cout << solve() << endl;
for (int i = (0); i < (n + 1); i++) cout << a[i] << ((i == n) ? '\n' : ' ');
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 42;
struct binarytree {
long long value;
vector<long long> connected_nodes;
};
void sol() {
int n, m;
cin >> n >> m;
int ans = 0;
for (long long i = 0; i < n; i++) {
int t;
cin >> t;
ans += t;
}
if (ans == m) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a = 1;
cin >> a;
while (a--) {
sol();
}
}
| 7 | CPP |
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
for _ in range(int(input())):
n=int(input())
prev=[int(input())]
ans=[[1]]
for i in range(1,n):
z=int(input())
if z==1:
prev.append(1)
else:
while prev[-1]!=z-1:
prev.pop()
if not prev:
break
if prev:
prev[-1]+=1
else:
prev=[z]
ans.append(prev.copy())
for item in ans:
print(*item,sep=".")
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = 'x' in file.mode or 'r' not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b'\n') + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# endregion
if __name__ == '__main__':
main() | 9 | PYTHON3 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = d = 0
for i in range(m):
while b[i] - d > a[c]:
d += a[c]
c += 1
print(c + 1, b[i] - d)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500100;
char s[maxn], r[maxn];
int n, d;
unsigned long long int p[maxn], hashed[maxn], rhash[maxn];
bool ok(int ed, int d) {
ed++;
int st = ed - d + 1;
if (st < 0) return true;
if ((rhash[ed] - rhash[st - 1] * p[d]) * p[st - 1] !=
hashed[ed] - hashed[st - 1])
return true;
return false;
}
bool dfs(int x, int t) {
if (x == n) {
puts(r);
return true;
}
for (r[x] = (t ? s[x] : 'a'); r[x] <= 'z'; r[x]++) {
hashed[x + 1] = hashed[x] + r[x] * p[x];
rhash[x + 1] = rhash[x] * 175 + r[x];
if (ok(x, d) && ok(x, d + 1) && dfs(x + 1, t && (r[x] == s[x])))
return true;
}
return false;
}
int main() {
cin >> d;
cin >> s;
n = strlen(s);
int i = n - 1;
for (; i >= 0 && s[i] == 'z'; i--) s[i] = 'a';
if (i < 0) {
cout << "Impossible" << endl;
return 0;
}
s[i]++;
p[0] = 1;
for (int i = 1; i < n + 100; i++) p[i] = p[i - 1] * 175;
if (dfs(0, 1) == false) cout << "Impossible" << endl;
return 0;
}
| 10 | CPP |
/* � Ashiq Uddin Pranto
Department of Computer Science and Engineering
BATCH 27
University Of Rajshahi,Bangladesh
*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define FOR(x,y) for(ll i=x;i<=y;i++)
#define pb(x) push_back(x)
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vii vector<int>
#define vll vector<ll>
#define matrix(x) vector<vector<x>>
#define vss vector<string>
#define PI (2*acos(0.0))
#define sqr(x) ((x)*(x))
#define sf(a) scanf("%d",&a)
#define sfl(a) scanf("%lld",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sffl(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define ms(a,b) memset(a, b, sizeof(a))
#define ff first
#define ss second
#define lcm(a, b) ((a)*((b)/__gcd(a,b)))
#define all(a) a.begin(),a.end()
#define readfile freopen("input.txt","r",stdin);
#define writefile freopen("output.txt","w",stdout);
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define gap " "
#define mx 104
#define inf (ll)1e17
#define WHITE 1
#define GRAY 2
#define BLACK 3
#define EMPTY_VALUE -1
#define mod 1000000007
#define MOD(a,b) (a%b + b)%b
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
void eff()
{
ll l,r,d;
sfffl(l,r,d);
if(l>r) swap(l,r);
if(d==0)
{
if(l==r)
{
printf("YES\n");
return;
}
else{
printf("NO\n");
return;
}
}
if((l*(d+1))>=r)
{
printf("YES\n");
return;
}
else{
printf("NO\n");
return;
}
}
int main()
{
// fastio
ll test = 1;
sfl(test);
for(ll i=0;i<test;i++)
{
// printf("Case %lld: ",i+1);
eff();
}
// cout<<check(81);
return 0;
} | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x;
cin >> y;
if (x > 0 && y > 0) {
cout << "0 " << x + y << " " << x + y << " 0" << endl;
} else if (x < 0 && y > 0) {
cout << x - y << " 0 "
<< "0 " << y - x << " " << endl;
} else if (x < 0 && y < 0) {
cout << x + y << " 0 "
<< "0 " << x + y << endl;
} else {
cout << "0 " << y - x << " " << x - y << " 0" << endl;
}
return 0;
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
long long n,x,tot,ans,a[100010];
int main()
{
cin>>n;
for(int i=1;i<=n+1;i++)cin>>a[i];
for(int i=1;i<=n;i++)
{
cin>>x;
if(a[i]>=x)ans+=x;
else
{
x-=a[i];ans+=a[i];
tot=min(x,a[i+1]);
ans+=tot;a[i+1]-=tot;
}
}
cout<<ans;
return 0;
} | 0 | CPP |
N=int(input())
for i in range(1,10):
j=N//i
if 0<j<10 and j*i==N:
print('Yes')
exit()
print('No') | 0 | PYTHON3 |
t = int(input())
for rep in range(t):
n = int(input())
d = {}
um = []
for j in range(1,n+1):
temp = list(map(int,input().split()))
f = 0
for k in range(1,temp[0]+1):
if temp[k] not in d:
d[temp[k]] = 0
f = 1
break
if f==0:
um.append(j)
if len(um) == 0:
print("OPTIMAL")
else:
print("IMPROVE")
for j in range(1,n+1):
if j not in d:
print(um[0],j)
break | 8 | PYTHON3 |
import sys
vec = [True]*100
vec[ord('A')-ord('A')] = False
vec[ord('O')-ord('A')] = False
vec[ord('Y')-ord('A')] = False
vec[ord('E')-ord('A')] = False
vec[ord('U')-ord('A')] = False
vec[ord('I')-ord('A')] = False
vec[ord('a')-ord('A')] = False
vec[ord('o')-ord('A')] = False
vec[ord('y')-ord('A')] = False
vec[ord('e')-ord('A')] = False
vec[ord('u')-ord('A')] = False
vec[ord('i')-ord('A')] = False
x = sys.stdin.read(1)
s = ""
while 65 <= ord(x) and ord(x) <= 122:
if vec[ord(x)-ord('A')]:
s += '.'+ (x if ord(x)>90 else x.lower())
x = sys.stdin.read(1)
print(s)
| 7 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
team = dict([(i,0) for i in range(2,101)])
for target in range(2,101):
l,r=0,n-1
while(l<r):
if arr[l]+arr[r]==target:
team[target]+=1
l+=1
r-=1
elif arr[l]+arr[r]>target:
r-=1
else:
l+=1
maxm = -10**18
for key in team:
maxm = max(team[key],maxm)
print(maxm)
| 9 | PYTHON3 |
n, x, y = list(map(int, input().split()))
a = list(map(int, input().split()))
if x > y:
print(n)
elif x <= y:
a = sorted(a)
if a[0] > x:
print(0)
else:
ans, i = 0, 0
while i < n and a[i] <= x:
ans += 1
i += 1
print((ans + 1) // 2)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[10000 + 1][730] = {0};
int main() {
int N, M;
while (cin >> N >> M && N + M) {
for (int i = 0; i < 10001; i++) {
for (int j = 0; j < 730; j++)
a[i][j] = 0;
}
int r, q;
cin >> r;
for (int i = 0; i < r; i++) {
int t, n, m, s;
cin >> t >> n >> m >> s;
a[m][t - 540] += (s == 1) ? 1 : -1;
}
for (int i = 1; i <= M; i++) {
for (int j = 1; j <= 720; j++) {
a[i][j] += a[i][j - 1];
}
}
cin >> q;
for (int i = 0; i < q; i++) {
int ts, te, m;
cin >> ts >> te >> m;
ts -= 540; te -= 540;
int sum = 0;
for (int j = ts; j < te; j++) {
if (a[m][j] > 0) ++sum;
}
cout << sum << endl;
}
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100;
const long long mod = 1e9 + 7;
long long n, C[45][45];
int k;
struct Matrix {
int n, m;
int v[N][N];
Matrix(int n = 0, int m = 0) : n(n), m(m) { memset(v, 0, sizeof v); }
void init() { memset(v, 0, sizeof v); }
void show() {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cout << v[i][j] << " ";
cout << endl;
}
}
Matrix operator*(const Matrix B) const {
Matrix C(n, B.m);
C.init();
for (int i = 0; i < n; i++)
for (int j = 0; j < B.m; j++)
for (int k = 0; k < m; k++)
C.v[i][j] =
((v[i][k] % mod) * (B.v[k][j] % mod) + C.v[i][j] % mod) % mod;
return C;
}
};
void init1() {
for (int i = 0; i <= 40; i++) C[i][0] = C[i][i] = 1;
for (int i = 1; i <= 40; i++) {
for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
}
}
Matrix a, b;
void make_a() {
a.n = 1;
a.m = 2 * k + 3;
a.init();
for (int i = 0; i <= k; i++) a.v[0][i] = 1;
for (int i = k + 1; i <= 2 * k + 1; i++) a.v[0][i] = 2;
a.v[0][2 * k + 2] = 1;
}
void make_b() {
b.n = b.m = 2 * k + 3;
b.init();
for (int j = 0; j <= k; j++) {
int cnt1 = j;
for (int i = k + 1, cnt2 = 0; i <= 2 * k + 1 && cnt2 <= cnt1; i++, cnt2++)
b.v[i][j] = C[cnt1][cnt2];
}
for (int j = k + 1; j <= 2 * k + 1; j++) {
int cnt1 = j - k - 1;
for (int i = 0, cnt2 = 0; i <= k && cnt2 <= cnt1; i++, cnt2++)
b.v[i][j] = C[cnt1][cnt2];
for (int i = k + 1, cnt2 = 0; i <= 2 * k + 1 && cnt2 <= cnt1; i++, cnt2++)
b.v[i][j] = C[cnt1][cnt2];
}
int cnt1 = k;
for (int i = k + 1, cnt2 = 0; i <= 2 * k + 1 && cnt2 <= cnt1; i++, cnt2++)
b.v[i][2 * k + 2] = C[cnt1][cnt2];
b.v[2 * k + 2][2 * k + 2] = 1;
}
Matrix ksm(Matrix unit, long long x, Matrix turn) {
Matrix ret = unit;
while (x) {
if (x & 1) ret = ret * turn;
turn = turn * turn;
x >>= 1;
}
return ret;
}
int main() {
init1();
cin >> n >> k;
make_a();
make_b();
Matrix res = ksm(a, n - 1, b);
cout << res.v[0][2 * k + 2] << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int inf = 1000000007;
void e_gcd(long long a, long long b, long long &x1, long long &y1) {
if (b == 0) {
x1 = 1;
y1 = 0;
} else {
e_gcd(b, a % b, x1, y1);
long long l = x1;
x1 = y1;
y1 = l - (a / b) * y1;
}
}
long long s1[200001], s2[200001];
int n;
int main() {
s1[1] = 1;
s2[1] = 1;
int i, j;
for (i = 2; i <= 200000; ++i) {
s1[i] = s1[i - 1] * i % inf;
long long x1, y1;
e_gcd(i, inf, x1, y1);
s2[i] = s2[i - 1] * ((x1 + inf) % inf) % inf;
}
while (scanf("%d", &n) != EOF) {
cout << (s1[2 * n] * s2[n] % inf * s2[n] % inf - n + inf) % inf << endl;
}
}
| 9 | CPP |
for i in range(int(input())):
n = int(input())
s = input()
l = s[n-1]
print(l*n) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
using namespace std;
const int N = 222;
int a[N][N], ta[N][N], r[N], c[N], n, m;
void print() {
printf("YES\n");
for (int j = 1; j <= n; ++j) printf("%d", r[j]);
printf("\n");
for (int j = 1; j <= m; ++j) printf("%d", c[j]);
printf("\n");
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) scanf("%d", &a[i][j]);
for (int i = 0; i <= m; ++i) {
for (int j = 1; j <= m; ++j) c[j] = 0;
for (int j = 1; j <= n; ++j) r[j] = 0;
for (int j = 1; j <= i; ++j)
if (a[1][j] == 1) c[j] = 1;
for (int j = i + 1; j <= m; ++j)
if (a[1][j] == 0) c[j] = 1;
for (int j = 1; j <= n; ++j)
for (int k = 1; k <= m; ++k)
if (c[k])
ta[j][k] = a[j][k] ^ 1;
else
ta[j][k] = a[j][k];
if (i == m) {
bool f = true;
int tot = 0, id = 2;
for (int j = 2; j <= n; ++j) {
int cc = 0;
for (int k = 2; k <= m; ++k)
if (ta[j][k] != ta[j][k - 1]) cc++;
if (cc > 1)
f = false;
else if (cc == 1)
tot++, id = j;
}
if (tot > 1) f = false;
if (!f) break;
for (int j = 2; j < id; ++j)
if (ta[j][1]) r[j] = 1;
if (ta[id][1]) r[id] = 1;
for (int j = id + 1; j <= n; ++j)
if (!ta[j][1]) r[j] = 1;
print();
return 0;
continue;
}
bool f = true;
for (int j = 2; j <= n; ++j) {
for (int k = 2; k <= m; ++k)
if (ta[j][k] != ta[j][k - 1]) {
f = false;
break;
}
if (ta[j][1] == 0) r[j] = 1;
}
if (f) {
print();
return 0;
}
}
printf("NO\n");
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct SuffixAutomaton {
vector<map<char, int>> edges;
vector<int> link;
vector<int> lenght;
int last, sz;
vector<bool> term;
SuffixAutomaton() {
edges.push_back(map<char, int>());
link.push_back(-1);
lenght.push_back(0);
term.push_back(false);
last = 0;
sz = 0;
}
SuffixAutomaton(string s) : SuffixAutomaton() {
for (const auto &ch : s) {
extend(ch);
}
find_terminals();
}
void extend(char ch) {
edges.push_back(map<char, int>());
sz++;
lenght.push_back(sz);
link.push_back(0);
term.push_back(false);
int r = edges.size() - 1;
int p = last;
while (p >= 0 && edges[p].find(ch) == edges[p].end()) {
edges[p][ch] = r;
p = link[p];
}
if (p != -1) {
int q = edges[p][ch];
if (lenght[p] + 1 == lenght[q]) {
link[r] = q;
} else {
edges.push_back(edges[q]);
lenght.push_back(lenght[p] + 1);
link.push_back(link[q]);
term.push_back(false);
int qq = edges.size() - 1;
link[q] = qq;
link[r] = qq;
while (p >= 0 && edges[p][ch] == q) {
edges[p][ch] = qq;
p = link[p];
}
}
}
last = r;
}
void find_terminals() {
term = vector<bool>(edges.size(), false);
int p = last;
while (p >= 0) {
term[p] = true;
p = link[p];
}
}
};
void dfs(SuffixAutomaton &sa, vector<int64_t> &occur, vector<int64_t> &words,
int st) {
if (occur[st] > 0) return;
int64_t occ = 0, wrd = 0;
if (sa.term[st]) {
occ++;
wrd++;
}
for (const auto &p : sa.edges[st]) {
dfs(sa, occur, words, p.second);
occ += occur[p.second];
wrd += words[p.second] + occur[p.second];
}
occur[st] = occ;
words[st] = wrd;
}
int main() {
string s;
int64_t k, n;
cin >> s >> k;
n = s.size();
if (n * (n - 1) / 2 + n < k) {
cout << "No such line." << endl;
return 0;
}
SuffixAutomaton sa(s);
vector<int64_t> occur(sa.edges.size()), words(sa.edges.size());
dfs(sa, occur, words, 0);
int st = 0;
string t = "";
int64_t prev_k = k;
while (k > 0) {
int64_t acc = 0, tmp;
for (const auto &p : sa.edges[st]) {
tmp = acc;
acc += words[p.second];
if (acc >= k) {
st = p.second;
k -= tmp + occur[p.second];
t += p.first;
break;
}
}
if (k == prev_k) {
t = "No such line.";
break;
}
prev_k = k;
}
cout << t << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int x = n, i = 0;
i = x / k;
x = (i + 1) * k;
cout << x << endl;
}
| 7 | CPP |
n,k=map(int,input().split())
lis=list(map(int,input().split()))
l=[]
for i in range(n):
if(lis[i] not in l):
l.insert(0,lis[i])
if(len(l)>k):
l.remove(l[k])
print(len(l))
for x in l:
print(x,end=" ")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
void _main() {
int N, M, T;
cin >> N >> M >> T;
vector<int> a(N), cum(T + 1, 0);
REP (i, N) {
cin >> a[i];
cum[a[i] - M]++;
cum[min(T, a[i] + M)]--;
}
REP (i, T) cum[i + 1] += cum[i];
int ans = 0;
FOR (i, 1, T + 1) ans += (cum[i] == 0);
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
_main();
return 0;
}
| 0 | CPP |
n = int(input())
s = input()
l = [1]*s.count('n')
l += [0]*s.count('z')
print(*l) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> W[100010];
int deg1[100010], deg2[100010];
int main() {
int n, m, Q, a, b, x;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a, &b);
if (a > b) swap(a, b);
W[a].push_back(b);
deg1[a]++, deg2[b]++;
}
long long ans = 0;
for (int i = 1; i <= n; i++) ans += (long long)deg1[i] * deg2[i];
printf("%lld\n", ans);
scanf("%d", &Q);
while (Q--) {
scanf("%d", &x);
for (int i = 0; i < (int)W[x].size(); i++) {
int to = W[x][i];
ans -= (long long)deg1[x] * deg2[x];
deg1[x]--, deg2[x]++;
ans += (long long)deg1[x] * deg2[x];
ans -= (long long)deg1[to] * deg2[to];
deg1[to]++, deg2[to]--;
ans += (long long)deg1[to] * deg2[to];
W[to].push_back(x);
}
W[x].clear();
printf("%lld\n", ans);
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> randperm(int N) {
vector<int> V, ans;
for (int i = 0; i < N; i++) V.push_back(i);
for (int size = N; size > 0; size--) {
int sample = V[rand() % size];
ans.push_back(sample);
vector<int> U;
for (int v : V)
if (v != sample) U.push_back(v);
V = U;
}
return ans;
}
int indep(vector<vector<int>>& V) {
int N = V.size();
vector<int> U = randperm(N);
set<int> ind;
int ans = 0;
for (int i = 0; i < N; i++) {
bool good = true;
for (int v : V[U[i]]) {
if (ind.count(v) > 0) {
good = false;
break;
}
}
if (good) {
ans++;
ind.insert(U[i]);
}
}
return ans;
}
int main() {
int N, K;
cin >> N >> K;
vector<vector<int>> G(N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
int edge;
cin >> edge;
if (edge == 0) G[i].push_back(j);
}
}
int curmax = 0;
for (int t = 0; t < 50000; t++) {
curmax = max(curmax, indep(G));
}
double ans = K * K * (0.5 - 0.5 / curmax);
printf("%.7f\n", ans);
return 0;
}
| 11 | CPP |
s,n=[int(i)for i in input().split()]
a=[]
for j in range(0,n):
p,q=[int(k)for k in input().split()]
a.append((p,q))
a.sort(key=lambda x:x[0])
for h in range(0,n):
if s>a[h][0]:
s+=a[h][1]
else:
print('NO')
exit()
print('YES') | 7 | PYTHON3 |
#Together
N = int(input())
a = list(map(int, input().split()))
b = []
for ai in a:
b.append(ai-1)
b.append(ai)
b.append(ai+1)
#print(b)
import collections
cnt = collections.Counter(b)
#print(cnt)
print(max(cnt.values())) | 0 | PYTHON3 |
s1=str(input()).lower()
s2=str(input()).lower()
for i in range(0,len(s1)):
if (s1[i]==s2[i] and len(s1)==i+1):
print("0")
exit(0)
if s1[i]==s2[i]:
pass
elif s1[i]<s2[i]:
print("-1")
exit(0)
else:
print("1")
exit(0) | 7 | PYTHON3 |
n,p = map(int, input().split())
s = input()
sep = len(s) - p
s1 = list(s[0:sep])
s2 = list(s[sep: p])
s3 = list(s[p:len(s)])
"""
print(sep)
print(len(s))
print(s1)
print(s2)
print(s3)
"""
if (s1 == s3 and '.' not in s1):
print("No")
exit(0)
for i, ch in enumerate(s1):
if (s1[i] == s3[i]):
if (s1[i] == '.'):
s1[i] = '1'
s3[i] = '0'
elif (s1[i] == '.'):
if (s3[i] == '0'):
s1[i] = '1'
else:
s1[i] = '0'
elif (s3[i] == '.'):
if s1[i] == '0':
s3[i] = '1'
else:
s3[i] = '0'
#print("s3[] = ", s3[len(s1)-p:])
if (s2 == []):
ans = s1 + s3[len(s1) - p:]
else:
ans = s1 + s2 + s3
for i, ch in enumerate(ans):
if (ch == '.'):
ans[i] = '0'
print("".join(ans))
#print(len(ans)) | 8 | PYTHON3 |
n=int(input())
i=0
count=0
for i in range (n):
scores=[]
scores=list(map(int, input().split()))
n=scores.count(1)
if (n>=2):
count=count+1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, v[1002], x, y, ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> v[i];
for (int i = 1; i <= m; ++i) {
cin >> x >> y;
ans += min(v[x], v[y]);
}
cout << ans << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int counter = 1;
int inhand = 1;
while (cin >> str) {
for (int i = 1; i < str.length(); i++) {
if (str[i] != str[i - 1] || inhand == 5) {
counter++;
inhand = 1;
} else {
inhand++;
}
}
cout << counter << endl;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e) {
cout << e << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
<< endl;
}
template <class T>
T Abs(T x) {
return x > 0 ? x : -x;
}
template <class T>
inline T sqr(T x) {
return x * x;
}
long long Pow(long long B, long long P) {
long long R = 1;
while (P > 0) {
if (P % 2 == 1) R = (R * B);
P /= 2;
B = (B * B);
}
return R;
}
int BigMod(long long B, long long P, long long M) {
long long R = 1;
while (P > 0) {
if (P % 2 == 1) {
R = (R * B) % M;
}
P /= 2;
B = (B * B) % M;
}
return (int)R;
}
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int best = 0;
best = max(best, a + b + c);
best = max(best, a + (b * c));
best = max(best, a * (b + c));
best = max(best, (a + b) * c);
best = max(best, (a * b) + c);
best = max(best, (a * b) * c);
deb(best);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
long long int ans = 0;
ans = (long long int)(4 * pow(2, n / 2 - 1) - 2);
cout << ans << endl;
}
return 0;
}
| 7 | CPP |
import random
class maps(object):
def __init__(self):
self.readinputs()
# recieve |V| and |E|
def readinputs(self):
self.V, self.E = map(int, input().split())
self.es = [[] for i in range(self.V)]
self.Mes = [[0]*self.V for i in range(self.V)]
for _ in range(self.E):
# recieve edges
a, b, c = map(int, input().split())
a, b = a-1, b-1
self.es[a].append((b,c))
self.es[b].append((a,c))
self.Mes[a][b] = c
self.Mes[b][a] = c
self.T = int(input())
# recieve info
self.info = [[] for i in range(self.T)]
for t in range(self.T):
Nnew = int(input())
for _ in range(Nnew):
new_id, dst = map(int, input().split())
self.info[t].append((new_id, dst))
def random_walk(self):
where = [('v', 0)] # ('e',from,to,dist)
self.path = [0]*self.T
for t in range(self.T):
now_where = where[-1]
if now_where[0] == 'v':
to, dist = random.choice(self.es[now_where[1]])
# to, dist = self.es[now_where[1]][n]
self.path[t] = to
if dist == 1:
where.append(('v', to))
else:
where.append(('e', now_where[1], to, 1))
elif now_where[0] == 'e':
now_where = where[-1]
# num = random.randint(0,1)
if True :
self.path[t] = now_where[2]
if now_where[3] + 1 < self.Mes[now_where[1]][now_where[2]]:
where.append(('e', now_where[1], now_where[2], now_where[3] + 1))
elif now_where[3] + 1 == self.Mes[now_where[1]][now_where[2]]:
where.append(('v', now_where[2]))
else:
# ココの分岐に来ることはありえない。
pass
else:
self.path[t] = now_where[1]
if now_where[3] - 1 > 0:
where.append(('e', now_where[1], now_where[2], now_where[3] - 1))
elif now_where[3] - 1 == 0:
where.append(('v', now_where[1]))
else:
# ココの分岐に来ることはありえない。
pass
else:
# ココの分岐に来ることはありえない。
pass
def output(self):
for t in range(self.T) :
print(self.path[t] + 1)
if __name__ == "__main__":
M = maps()
M.random_walk()
M.output()
| 0 | PYTHON3 |
coinCount = int(input())
coins = [0] * coinCount
operations = list(map(int, input().split()))[:coinCount]
numberOfReplacedCoins = 0
indexOfLastOldCoin = coinCount - 1
results = [1]
for op in operations:
index = op - 1
if coins[index] == 0:
coins[index] = 1
numberOfReplacedCoins += 1
if numberOfReplacedCoins == coinCount:
indexOfLastOldCoin = -1
while indexOfLastOldCoin >= 0 and coins[indexOfLastOldCoin] == 1:
indexOfLastOldCoin -= 1
coinsAtRightEdge = coinCount - indexOfLastOldCoin - 1
hardness = 1 + numberOfReplacedCoins - coinsAtRightEdge
results.append(hardness)
print(" ".join(map(str, results)))
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int arr[6];
int rev[6];
};
int N, M, Q;
node zero, one;
node emptyNode;
node* st;
bool* lazy;
int stS;
inline void revertNode(node& a) { swap(a.arr, a.rev); }
inline node mergeNodes(node a, node b) {
node sol;
for (int i = 0; i <= M; i++) {
sol.arr[i] = a.arr[b.arr[i]];
sol.rev[i] = a.rev[b.rev[i]];
}
return sol;
}
inline void remLazy(int pos, int rs, int re) {
if (lazy[pos]) {
lazy[pos] = false;
revertNode(st[pos]);
if (rs != re) {
lazy[2 * pos + 1] ^= 1;
lazy[2 * pos + 2] ^= 1;
}
}
}
void update(int pos, int rs, int re, int ns, int ne) {
remLazy(pos, rs, re);
if (ns > re || rs > ne) {
return;
}
if (ns <= rs && re <= ne) {
lazy[pos] = true;
remLazy(pos, rs, re);
} else {
update(2 * pos + 1, rs, (rs + re) / 2, ns, ne);
update(2 * pos + 2, (rs + re) / 2 + 1, re, ns, ne);
st[pos] = mergeNodes(st[2 * pos + 1], st[2 * pos + 2]);
}
}
node query(int pos, int rs, int re, int ns, int ne) {
if (ns > re || rs > ne) {
return emptyNode;
}
remLazy(pos, rs, re);
if (ns <= rs && re <= ne) {
return st[pos];
}
node n1 = query(2 * pos + 1, rs, (rs + re) / 2, ns, ne);
node n2 = query(2 * pos + 2, (rs + re) / 2 + 1, re, ns, ne);
return mergeNodes(n1, n2);
}
int main() {
scanf("%d %d %d", &N, &M, &Q);
for (int i = 0; i < M; i++) {
one.arr[i] = i + 1;
one.rev[i] = i + 1;
emptyNode.arr[i] = i;
emptyNode.rev[i] = i;
}
one.arr[M] = 0;
one.rev[M] = M;
emptyNode.arr[M] = M;
emptyNode.rev[M] = M;
zero = one;
revertNode(zero);
stS = 2 * pow(2, ceil(log2(N))) - 1;
st = new node[stS];
lazy = new bool[stS];
for (int i = 0; i < stS; i++) {
st[i] = emptyNode;
lazy[i] = false;
}
for (int i = stS / 2; i < stS / 2 + N; i++) {
long long num;
scanf("%lld", &num);
if (num % 2ll == 0) {
st[i] = zero;
} else {
st[i] = one;
}
}
for (int i = stS / 2 - 1; i >= 0; i--) {
st[i] = mergeNodes(st[2 * i + 1], st[2 * i + 2]);
}
for (int i = 0; i < Q; i++) {
int type, l, r;
scanf("%d %d %d", &type, &l, &r);
l--;
r--;
if (type == 1) {
long long num;
scanf("%lld", &num);
if (num % 2ll == 1ll) {
update(0, 0, stS / 2, l, r);
}
} else {
node sol = query(0, 0, stS / 2, l, r);
if (sol.arr[M] == 0) {
printf("2\n");
} else {
printf("1\n");
}
}
}
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100010, INF = 10e8, M = 150;
long long MOD = 100 * 100 + 7;
string n, m;
int a, b;
int main() {
cin >> n >> m;
for (int i = 0; i < (int((n).size())); i++)
if (n[i] != m[i])
if (n[i] == '4')
a++;
else
b++;
cout << max(a, b);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000001;
long long highp2(long long n) { return (n & (~(n - 1))); }
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
long long binarysearchlf(long long l, long long h, vector<long long> &a,
long long k) {
while (l < h) {
long long mid = l + ((h - l + 1) / 2);
if (a[mid] < k)
l = mid;
else
h = mid - 1;
}
return l;
}
long long binarysearchft(long long l, long long h, vector<long long> &a,
long long k) {
while (l < h) {
long long mid = l + ((h - l) / 2);
if (a[mid] < k)
l = mid + 1;
else
h = mid;
}
return l;
}
long long gcd(long long a, long long b) {
if (a < b) swap(a, b);
if (b == 0) return a;
return (b, a % b);
}
string getstring(long long k, char x) {
string s(k, x);
return s;
}
bool sort1(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return a.second < b.second;
}
bool sort2(const vector<int> &v1, const vector<int> &v2) {
if (v1[1] > v2[1])
return true;
else if (v1[1] < v2[1])
return false;
else {
return v1[2] > v2[2];
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string s;
cin >> s;
int i1, i2;
int flag1 = 0, flag2 = 0;
int n = s.length();
for (long long i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B') {
i1 = i;
flag1 = 1;
break;
}
}
for (long long i = 0; i < n - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'A') {
i2 = i;
flag2 = 1;
break;
}
}
if (flag1 == 0 || flag2 == 0) {
cout << "NO" << endl;
return 0;
}
if (abs(i1 - i2) > 1)
cout << "YES" << endl;
else {
int flag = 0;
for (int i = i2 + 2; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'B') flag = 1;
}
for (int i = i1 + 2; i < n - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'A') flag = 1;
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
| 7 | CPP |
n=int(input())
for i in range(n):
word=input()
length=len(word)
if length<=10:
print(word)
else:
num=str(length-2)
a=word[0]+num+word[-1]
print(a)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long n, k, a, b, q;
long long orders_on_day[N];
class Segment {
long long size;
vector<long long> t;
public:
Segment(long long n) {
size = 1;
while (size < n) size = size * 2;
t.assign(2 * size, 0);
}
void print() {
for (long long x : t) {
cout << x << " ";
}
cout << endl;
}
void set(long long v, long long l, long long r, long long idx,
long long value) {
if (r - l == 1) {
t[v] = value;
return;
}
long long m = (l + r) / 2;
if (idx < m) {
set(v * 2 + 1, l, m, idx, value);
} else {
set(v * 2 + 2, m, r, idx, value);
}
t[v] = t[2 * v + 1] + t[2 * v + 2];
}
void set(long long idx, long long value) { set(0, 1, size, idx, value); }
long long sum(long long v, long long l, long long r, long long lx,
long long rx) {
if (lx >= r || l >= rx) {
return 0;
}
if (l <= lx && r >= rx) {
return t[v];
}
long long m = (lx + rx) / 2;
long long lsum = sum(v * 2 + 1, l, r, lx, m);
long long rsum = sum(v * 2 + 2, l, r, m, rx);
return lsum + rsum;
}
long long sum(long long l, long long r) { return sum(0, l, r, 1, size); }
};
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> k >> b >> a >> q;
Segment seg1 = Segment(n + 1);
Segment seg2 = Segment(n + 1);
vector<long long> orders_filled_defect(n);
vector<long long> orders_filled_repair(n);
while (q--) {
long long type;
cin >> type;
if (type == 1) {
long long day, orders;
cin >> day >> orders;
orders_on_day[day] += orders;
long long t1 = min(a, orders_on_day[day]);
long long t2 = min(b, orders_on_day[day]);
seg1.set(day, t1);
seg2.set(day, t2);
} else {
long long repair_day;
cin >> repair_day;
cout << seg1.sum(1, repair_day) + seg2.sum(repair_day + k, n + 1) << "\n";
}
}
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
#define maxn 300100
using namespace std;
struct data{
int l,r,len;
data(){}
data(int l,int r):l(l),r(r),len(r-l+1){}
int operator<(const data& d)const{return len<d.len;}
}d[maxn];
int tr[maxn],n,m;
void add(int x,int a){for(;x<=m;x+=x&-x)tr[x]+=a;}
int qry(int x){int ans=0;for(;x;x-=x&-x)ans+=tr[x];return ans;}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)
scanf("%d%d",&d[i].l,&d[i].r),d[i].len=d[i].r-d[i].l+1;
sort(d+1,d+n+1);
for(int i=1,l=1;i<=m;++i){
while(l<=n&&d[l].len<i)
add(d[l].l,1),add(d[l].r+1,-1),l++;
int ans=n-l+1;
for(int j=i;j<=m;j+=i)
ans+=qry(j);//,printf("[%d]",qry(j));
printf("%d\n",ans);
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 105;
int b, d;
bool two, three, eleven, seven;
bool Test3(int d) { return b % d == 1; }
bool Test11(int d) { return b % d == d - 1; }
int Get(int d) {
int res, cur = 1;
for (res = 0; res < Maxn && cur; res++) cur = cur * b % d;
return res;
}
int main() {
scanf("%d %d", &b, &d);
int sav = d;
for (int i = 2; i <= d; i++)
if (d % i == 0) {
int res = 1;
while (d % i == 0) {
res *= i;
d /= i;
}
seven |= Get(res) == Maxn && !Test3(res) && !Test11(res);
}
if (Get(sav) < Maxn)
printf("2-type\n%d\n", Get(sav));
else if (Test3(sav))
printf("3-type\n");
else if (Test11(sav))
printf("11-type\n");
else if (seven)
printf("7-type\n");
else
printf("6-type\n");
return 0;
}
| 8 | CPP |
n = int(input())
ans = []
for i in range(n):
ka = [0]*n
ans.append(ka)
cnt = 0
start = 0
yo = 0
ha = 1
while cnt!=n:
# cnt = start
if start == 0:
for j in range(n):
ans[j][cnt] = ha
# cnt+=k
ha+=1
else:
for j in range(n-1,-1,-1):
ans[j][cnt] = ha
# cnt+=k
ha+=1
yo+=1
if yo%2 == 0:
start = 0
else:
start = n-1
cnt+=1
# ha+=1
for i in ans:
print(*i)
| 9 | PYTHON3 |
def f():
return map(int ,input().split())
def lis():
return list(map(int ,input().split()))
""".........................................."""
n=int(input())
d=[[0,0],[0,1],[1,0],[1,1]]
for i in range(n):
[x,y]=d[-1]
d.append([x,y+1])
d.append([x+1,y])
d.append([x+1,y+1])
print(len(d))
for i in d:
print(*i)
| 9 | PYTHON3 |
n = int(input())
s = input()
g1 = 0
g2 = 0
ans = 0
num2 = s.count("G")
for i in range(n):
if s[i] == "G":
g1 += 1
else:
g2 = g1
g1 = 0
num = g1 + g2
if num2 != num:
num+=1
ans = max(ans,num)
print(min(n,ans)) | 8 | PYTHON3 |
n = int(input())
a = [int(k) for k in input().split()]
c = sorted(a, reverse=True)
b = [0]*2001
m, i = 1, 1
r = c[0]
b[r] = 1
while i < len(c):
if c[i] != r:
r = c[i]
b[c[i]] = m + 1
m += 1
i += 1
for k in range(len(a)):
if k == len(a)-1:
print(b[a[k]], end='\n')
else:
print(b[a[k]], end=' ') | 7 | PYTHON3 |
from sys import stdin,stdout
def main():
n=int(stdin.readline())
a=[(i,u) for i,u in enumerate(list(map(int,stdin.readline().split( ))))]
a.sort(key=lambda x:x[1])
ans=[]
p=[a[0][1]]*n
for i in range(1,n):
p[i]=p[i-1]+a[i][1]
for i in range(n):
if i==n-1:
try:
x=p[n-3]
if x==a[n-2][1]:
ans.append(a[n-1][0])
except:
pass
else:
try:
x=p[n-2]-a[i][1]
if x==a[n-1][1]:
ans.append(a[i][0])
except:
pass
if not ans:
stdout.write("%d\n"%(0))
else:
stdout.write("%d\n"%(len(ans)))
for u in ans:
stdout.write("%d "%(u+1))
stdout.write("\n")
main()
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double PI =
3.14159265358979323846264338327950288419716939937510582097494459230;
bool comp(int a, int b) { return (a < b); }
int main() {
int n;
cin >> n;
vector<long long> v(n), v1(n - 1), v2(n - 2);
for (int i = 0; i < n; i++) cin >> v[i];
for (int i = 0; i < n - 1; i++) cin >> v1[i];
for (int i = 0; i < n - 2; i++) cin >> v2[i];
sort(v.begin(), v.end());
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
int i, c = 0;
for (i = 0; i < n - 1; i++) {
if (v[i] != v1[i]) {
c = 1;
break;
}
}
if (c)
cout << v[i] << "\n";
else
cout << v[n - 1] << "\n";
int cc = 0;
for (i = 0; i < n - 2; i++) {
if (v1[i] != v2[i]) {
cc = 1;
break;
}
}
if (cc)
cout << v1[i];
else
cout << v1[n - 2];
return 0;
}
| 8 | CPP |
import sys
input = sys.stdin.readline
def main():
N = int(input())
A = list(map(int, input().split()))
B = sorted(A[::2])
C = sorted(A[1::2])
Prev = 0
for i in range(N):
if i % 2: Next = C[i // 2]
else: Next = B[i // 2]
if Prev > Next: return print('NO')
Prev = Next
print('YES')
if __name__ == '__main__':
T = int(input())
for _ in range(T):
main() | 9 | PYTHON3 |
from bisect import *
from sys import stdin
input = stdin.readline
for _ in ' '*int(input()):
n, m = map(int, input().split())
a = sorted([(int(x), i) for i, x in enumerate(input().split())])
b = [x for x, y in a]
x = bisect_left(b, m/2)
if x < len(b) and m/2 <= b[x] <= m: print(1, a[x][1]+1); continue
ans, s, n = [], 0, m/2
for i in range(x):
s += a[i][0]
ans.append(a[i][1]+1)
if s >= n: break
else: print(-1); continue
print(len(ans), *ans) | 7 | PYTHON3 |
a,b,c=map(int,input().split())
lis=list(range(1,min(a,b)+1))
lis=[x for x in lis if a%x==0 and b%x==0]
print(lis[-c]) | 0 | PYTHON3 |
n = int(input())
for i in range(n):
a = int(input())
b = input()
cnt = 0
l = []
b += 'C'
for j in range(len(b)):
if b[j] == 'A':
for k in range(j + 1 , len(b)):
if b[k] == 'P':
cnt = cnt + 1
else:
l.append(cnt)
cnt = 0
break
elif b[j] == 'C':
l.append(cnt)
l.sort()
print(l[-1])
| 7 | PYTHON3 |
import sys
read = lambda: sys.stdin.readline().rstrip()
n = int(read())
N = tuple(map(int,read().split()))
ans = 0
for i in range(n):
ans += N[i]
print("HARD" if ans > 0 else "EASY") | 7 | PYTHON3 |
q = int(input())
for i in range(q):
n = int(input())
a = [int(i) for i in input().split()]
ans = [0] * n
for i in range(n):
if ans[i] == 0:
numbers_now = []
now = a[a[i] - 1]
numbers_now.append(i)
numbers_now.append(a[i] - 1)
count = 1
while now != a[i]:
now = a[now - 1]
numbers_now.append(now - 1)
count += 1
for i in numbers_now:
ans[i] = count
else:
continue
print(*ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int ed, next;
int flow;
int cost;
} edge[1000010];
int head[10010], nEdge;
int pre[10010], now[10010];
int his[10010];
int dis[10010];
bool vis[10010];
int que[10010 * 100], front, rear, tot;
inline void init() {
memset(head, -1, sizeof(head));
nEdge = 0;
}
inline void _addEdge(int a, int b, int f, int c) {
edge[nEdge].ed = b;
edge[nEdge].flow = f;
edge[nEdge].cost = c;
edge[nEdge].next = head[a];
head[a] = nEdge++;
}
inline void addEdge(int a, int b, int f, int c) {
_addEdge(a, b, f, c);
_addEdge(b, a, 0, -c);
}
int minCostMaxFlow(int v, int src, int dst, int &netCost) {
int i, x, y;
int totalFlow = 0;
for (netCost = 0;;) {
memset(dis, 0x3F, sizeof(dis));
memset(vis, 0, sizeof(vis));
front = rear = v;
dis[src] = 0;
his[src] = 0x3F3F3F3F;
vis[que[rear++] = src] = true;
while (front < rear) {
vis[x = que[front++]] = false;
for (i = head[x]; ~i; i = edge[i].next) {
if (edge[i].flow && dis[y = edge[i].ed] > dis[x] + edge[i].cost) {
dis[y] = dis[x] + edge[i].cost;
pre[y] = x;
now[y] = i;
his[y] = min(his[x], edge[i].flow);
if (!vis[y]) {
if (front < rear && dis[y] < dis[que[front]])
que[--front] = y;
else
que[rear++] = y;
vis[y] = true;
}
}
}
}
if (dis[dst] == 0x3F3F3F3F) break;
totalFlow += his[dst];
netCost += dis[dst] * his[dst];
for (i = dst; i != src; i = pre[i]) {
edge[now[i]].flow -= his[dst];
edge[now[i] ^ 1].flow += his[dst];
}
}
return totalFlow;
}
int mat[128][128];
int main() {
int n, m, i, j, v, src, dst, ans;
while (~scanf("%d %d", &n, &m)) {
init();
v = n * m + 2;
src = n * m;
dst = n * m + 1;
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) {
scanf("%d", &mat[i][j]);
}
}
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) {
if ((i + j) & 1) {
if (i < n - 1)
addEdge((i + 1) * m + j, i * m + j, 1, mat[i + 1][j] != mat[i][j]);
if (j < m - 1)
addEdge(i * m + j + 1, i * m + j, 1, mat[i][j + 1] != mat[i][j]);
addEdge(i * m + j, dst, 1, 0);
} else {
if (i < n - 1)
addEdge(i * m + j, (i + 1) * m + j, 1, mat[i + 1][j] != mat[i][j]);
if (j < m - 1)
addEdge(i * m + j, i * m + j + 1, 1, mat[i][j + 1] != mat[i][j]);
addEdge(src, i * m + j, 1, 0);
}
}
}
minCostMaxFlow(v, src, dst, ans);
printf("%d\n", ans);
}
return 0;
}
| 9 | CPP |
t=int(input())
for _ in range(t):
n=int(input())
s=list(map(int,input().split()))
e=0
o=0
for i in s:
if(i%2==0):
e+=1
else:
o+=1
if((o==n and n%2==0) or e==n):
print("NO")
else:
print("YES") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
long long a[2][1001][2][1001], v;
inline long long f(int x, int y) {
long long r = 0;
for (int i = y; i >= 1; i ^= i & -i)
for (int j = x; j >= 1; j ^= j & -j) r ^= a[y & 1][i][x & 1][j];
return r;
}
inline void g(int x, int y) {
for (int i = y; i <= n; i += i & -i)
for (int j = x; j <= n; j += j & -j) a[y & 1][i][x & 1][j] ^= v;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m;
while (m--) {
int t, x0, y0, x1, y1;
cin >> t >> x0 >> y0 >> x1 >> y1;
if (t == 1) {
cout << (f(x1, y1) ^ f(x0 - 1, y0 - 1) ^ f(x1, y0 - 1) ^ f(x0 - 1, y1))
<< endl;
} else {
cin >> v;
g(x0, y0), g(x1 + 1, y0), g(x0, y1 + 1), g(x1 + 1, y1 + 1);
}
}
}
| 10 | CPP |
n, t = map(int, input().split())
if n < len(str(t)):
print(-1)
else:
if t != 10:
print(''.join([str(t) for i in range(n)]))
else:
print('1'+''.join(['0' for i in range(n-1)])) | 7 | PYTHON3 |
n = int(input())
g = [input() for i in range(n)]
for i in g:
if len(i) <= 10:
print(i)
else:
x = len(i) - 2
print(f'{i[0]}{x}{i[-1]}')
| 7 | PYTHON3 |
__author__ = 'Bian'
n = int(input())
total = 0
while n>0:
n -= 1
know = [int(i) for i in input().split()]
if sum(know) > 1: total += 1
print(total) | 7 | PYTHON3 |
t = input()
s = input()
if len(t) != len(s):
print('NO')
quit()
for i in range(len(t)):
if t[i] != s[len(t)-1-i]:
print('NO')
quit()
print('YES')
| 7 | PYTHON3 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,x,ans=0;
cin>>a>>b>>c>>x;
for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)for(int k=0;k<=c;k++)ans+=(500*i+100*j+50*k==x);
cout<<ans<<endl;
return 0;
} | 0 | CPP |
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<random>
#include<ctime>
#include<vector>
#include<queue>
#include<cmath>
#include<set>
#include<unordered_map>
#include<map>
#include<bitset>
#include<stack>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=6e5+5,M=1e3+5;
const ll INF=1e18+5;
inline ll read()
{
ll sum=0,fh=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')fh=-1;
c=getchar();
}
while(c>='0'&&c<='9')
{
sum=sum*10+c-'0';
c=getchar();
}
return sum*fh;
}
inline int read2()
{
char c=getchar();
while(c!='a'&&c!='b'&&c!='c'&&c!='?')c=getchar();
return c=='?'?0:c-'a'+1;
}
inline int read3()
{
char c=getchar();
while(c<'a'||c>'z')
{
c=getchar();
}
return c-'a';
}
inline void write(ll x)
{
if(x<0)putchar('-'),x=-x;
if(x>9)write(x/10);
putchar(x%10+'0');
}
/*namespace INPUT_SPACE{
const int BS=(1<<24)+5;char Buffer[BS],*HD,*TL;
char gc() { if(HD==TL) TL=(HD=Buffer)+fread(Buffer,1,BS,stdin);return (HD==TL)?EOF:*HD++; }
inline ull read()
{
ull x,ch;while(((ch=gc())<'0'||ch>'9'));
x=ch^'0';
while((ch=gc())>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^'0');
return x;
}
}using INPUT_SPACE::read;
char sws[30000011],tt[21];int ssl,ttl;
inline int write(int x)
{
if(!x) sws[++ssl]='0';for(ttl=0;x;x/=10) tt[++ttl]=char(x%10+'0');
for(;ttl;ttl--) sws[++ssl]=tt[ttl];return sws[++ssl]='\n';
}*/
inline int gcd(int x,int y)
{
return y==0?x:gcd(y,x%y);
}
inline ll ab(ll x)
{
return x<0?-x:x;
}
inline ll fpow(ll qwe,ll asd,ll zxc)
{
if(asd<0)return 0;
ll a=qwe,b=1,c=asd;
while(c)
{
if(c&1)b=b*a%zxc;
a=a*a%zxc;
c>>=1;
}
return b;
}
int n,m;
struct miaow2
{
int son[2];
int fa,qfa;
int fz;
int sz,sum;
}t[N];
#define ls(x) t[x].son[0]
#define rs(x) t[x].son[1]
#define son(x,k) t[x].son[k]
#define fa(x) t[x].fa
#define qfa(x) t[x].qfa
#define fz(x) t[x].fz
#define sz(x) t[x].sz
#define sum(x) t[x].sum
inline int fx(int x)
{
if(!fa(x))return -1;
return rs(fa(x))==x;
}
inline void upd(int x)
{
sum(x)=sz(x)+(ls(x)?sum(ls(x)):0)+(rs(x)?sum(rs(x)):0);
}
inline void pd(int x)
{
if(!fz(x))return;
swap(ls(x),rs(x));
fz(x)=0;
if(ls(x))fz(ls(x))^=1;
if(rs(x))fz(rs(x))^=1;
}
inline void rot(int x)
{
if(!fa(x))return;
int y=fa(x),k=fx(x);
if(fa(y))
{
fa(x)=fa(y);
son(fa(y),fx(y))=x;
}
else swap(qfa(x),qfa(y)),fa(x)=0;
fa(y)=x;
if(son(x,k^1))fa(son(x,k^1))=y;
son(y,k)=son(x,k^1);
son(x,k^1)=y;
upd(y);
upd(x);
}
inline void pd2(int x)
{
if(fa(x))pd2(fa(x));
pd(x);
}
inline void splay(int x)
{
pd2(x);
if(!fa(x))return;
int y=fa(x);
while(y)
{
if(!fa(y))
{
rot(x);
return;
}
int z=fa(y);
if(fx(x)==fx(y))rot(y);
else rot(x);
rot(x);
y=fa(x);
}
}
inline void access(int x)
{
splay(x);
if(rs(x))
{
qfa(rs(x))=x;
fa(rs(x))=0;
rs(x)=0;
upd(x);
}
int y=qfa(x);
while(y)
{
splay(y);
//cout<<y<<"."<<fz(y)<<endl;
if(rs(y))
{
qfa(rs(y))=y;
fa(rs(y))=0;
rs(y)=0;
}
rs(y)=x;
fa(x)=y;
qfa(x)=0;
x=y;
y=qfa(x);
}
}
inline void sc()
{
for(int i=1;i<=n;++i)
{
cout<<i<<" ls:"<<ls(i)<<" rs:"<<rs(i)<<" fa:"<<fa(i)<<" qfa:"<<qfa(i)<<" sz:"<<sz(i)<<" sum:"<<sum(i)<<" fz:"<<fz(i)<<endl;
}
cout<<endl;
}
inline int hg(int x)
{
access(x);
//sc();
splay(x);
fz(x)=1;
}
inline int lctcx(int l,int r)
{
//cout<<"cx:"<<l<<" "<<r<<endl;
//sc();
hg(l);
//sc();
access(r);
splay(r);
//cout<<"cx:"<<ls(r)<<" "<<rs(r)<<" "<<ls(rs(r))<<" "<<rs(rs(r))<<endl;
//sc();
return sum(r);
}
inline void lctxg(int x,int y)
{
hg(x);
sz(x)+=y;
upd(x);
}
#define pi pair<ll,ll>
struct miaow
{
int f,t,l;
ll c;
miaow(int f=0,int t=0,ll c=0,int l=0):f(f),t(t),c(c),l(l){}
}imap[N*2+5];
int str[N*2+5]={0},cou=2;
inline void jb(int f,int t,ll c=0)
{
//cout<<f<<" "<<t<<" "<<c<<endl;
imap[cou]=miaow(f,t,c,str[f]);str[f]=cou++;
imap[cou]=miaow(t,f,c,str[t]);str[t]=cou++;
}
//ll a[N];
int dfn[N],dfnl[N],dfnr[N],dfncou=0,dep[N];
pi sx[N];
inline void dfs(int o,int fa,int d)
{
sx[o]=pi(-d,o);
dep[o]=d;
dfn[++dfncou]=o;
dfnl[o]=dfncou;
for(int i=str[o];i;i=imap[i].l)
{
int tt=imap[i].t;
if(tt==fa)continue;
qfa(tt)=o;
dfs(tt,o,d+1);
dfn[++dfncou]=o;
}
dfnr[o]=dfncou;
return;
}
struct meow
{
int imi,l,r;
meow(int imii=0,int ll=0,int rr=0)
{
imi=imii,l=ll,r=rr;
}
};
inline meow meg(meow& qwe,meow& asd)
{
if(qwe.imi<asd.imi)return qwe;
if(qwe.imi>asd.imi)return asd;
return meow(qwe.imi,min(qwe.l,asd.l),max(qwe.r,asd.r));
}
struct nya
{
int l,r;
meow imx;
}tt[N*4+5];
#define l(x) tt[x].l
#define r(x) tt[x].r
#define imx(x) tt[x].imx
#define lss(x) (x*2)
#define rss(x) (x*2+1)
inline void tcsh(int l,int r,int o)
{
l(o)=l,r(o)=r;
if(l==r)
{
imx(o)=meow(dep[dfn[l]],l,r);
return;
}
int mid=(l+r)>>1;
tcsh(l,mid,lss(o)),tcsh(mid+1,r,rss(o));
imx(o)=meg(imx(lss(o)),imx(rss(o)));
}
inline meow cx(int l,int r,int o)
{
//cout<<l<<" "<<r<<" "<<o<<endl;
if(l<=l(o)&&r>=r(o))return imx(o);
meow qwe(1e9,0,0),asd(1e9,0,0);
int mid=(l(o)+r(o))>>1;
if(l<=mid)qwe=cx(l,min(mid,r),lss(o));
if(r>mid)asd=cx(max(mid+1,l),r,rss(o));
return meg(qwe,asd);
}
/*inline void xg(int l,int r,int o,int x)
{
if(l>r)return;
if(l<=l(o)&&r>=r(o))
{
bj(o)+=x;
imx(o)+=x;
return;
}
int mid=(l(o)+r(o))>>1;
if(l<=mid)xg(l,min(mid,r),ls(o),x);
if(r>mid)xg(max(l,mid+1),r,rs(o),x);
if(imx(ls(o))>imx(rs(o)))imx(o)=imx(ls(o))+bj(o),sum(o)=sum(ls(o));
else if(imx(ls(o))<imx(rs(o)))imx(o)=imx(rs(o))+bj(o),sum(o)=sum(rs(o));
else imx(o)=imx(ls(o))+bj(o),sum(o)=sum(ls(o))+sum(rs(o));
}*/
/*inline void xg(int k,int o,int x)
{
//if(l>r)return;
if(l(o)==r(o))
{
mat(o,0,0)=0;
mat(o,0,1)=x;
mat(o,1,0)=-x;
mat(o,1,1)=0;
return;
return;
}
int mid=(l(o)+r(o))>>1;
if(k<=mid)xg(k,ls(o),x);
else xg(k,rs(o),x);
upd(o);
}*/
/*inline int cx(int k,int o)
{
if(l(o)==r(o))return imx(o);
int x=imx(o),mid=(l(o)+r(o))>>1;
if(k<=mid)return min(x,cx(k,ls(o)));
else return min(x,cx(k,rs(o)));
}*/
struct meow2
{
int l,r,lca,lcal,lcar;
meow2(int ll=0,int rr=0,int lca=0,int lcal=0,int lcar=0):lca(lca),lcal(lcal),lcar(lcar)
{
l=ll,r=rr;
}
};
vector<meow2> dcz[N];
int djs[N];
map<pi,int> djs2;
ll ans;
inline void csh()
{
n=read();//,m=read();
//cout<<"?"<<endl;
for(int i=1;i<n;++i)
{
int f=read(),t=read();
jb(f,t);
}
//cout<<"?"<<endl;
dfs(1,0,1);
//cout<<"?"<<endl;
sort(sx+1,sx+n+1);
//cout<<"?"<<endl;
tcsh(1,dfncou,1);
//cout<<"?"<<endl;
//for(int i=1;i<=dfncou;++i)cout<<dfn[i]<<" ";cout<<endl;
//for(int i=1;i<=n;++i)cout<<i<<" "<<dfnl[i]<<" "<<dfnr[i]<<endl;
m=read();
for(int i=1;i<=m;++i)
{
//cout<<"?"<<i<<endl;
int l=read(),r=read();
if(l==r)
{
//cout<<"!1"<<endl;
dcz[l].push_back(meow2(l,r,l));
//cout<<l<<" "<<r<<" "<<l<<" "<<"0 0"<<endl;
continue;
}
if(dfnl[l]>dfnl[r])swap(l,r);
if(dfnl[l]<dfnl[r]&&dfnr[l]>dfnr[r])
{
//cout<<"!2"<<endl;
meow qwe=cx(dfnr[r],dfnr[l],1);
dcz[l].push_back(meow2(l,r,l,0,dfn[qwe.l-1]));
//cout<<l<<" "<<r<<" "<<l<<" "<<"0 "<<dfn[qwe.l-1]<<endl;
}
else
{
//cout<<"!3"<<" "<<dfnr[l]<<" "<<dfnl[r]<<endl;
meow qwe=cx(dfnr[l],dfnl[r],1);
//cout<<"!3"<<" "<<dfnr[l]<<" "<<dfnl[r]<<endl;
//cout<<qwe.l<<" "<<qwe.r<<" "<<qwe.imi<<endl;
dcz[dfn[qwe.l]].push_back(meow2(l,r,dfn[qwe.l],dfn[qwe.l-1],dfn[qwe.r+1]));
//cout<<l<<" "<<r<<" "<<dfn[qwe.l]<<" "<<dfn[qwe.l-1]<<" "<<dfn[qwe.r+1]<<endl;
}
}
}
inline void solve()
{
for(int i=1;i<=n;++i)
{
int o=sx[i].second;
//cout<<"!"<<o<<endl;
int js=0;
for(int j=0;j<dcz[o].size();++j)
{
int l=dcz[o][j].l,r=dcz[o][j].r,lcal=dcz[o][j].lcal,lcar=dcz[o][j].lcar;
//cout<<l<<" "<<r<<" "<<lcal<<" "<<lcar<<endl;
if(l==r)
{
ans+=js;
js+=1;
}
else if(l==o)
{
ans+=js-djs[lcar];
ans+=lctcx(l,r);
js+=1;
djs[lcar]+=1;
}
else
{
//cout<<"?1 "<<ans<<endl;
ans+=js-djs[lcal]-djs[lcar]+djs2[pi(lcal,lcar)];
//cout<<"?2 "<<ans<<endl;
ans+=lctcx(l,r);
//cout<<"?3 "<<ans<<endl;
js+=1;
djs[lcal]+=1,djs[lcar]+=1;
djs2[pi(lcal,lcar)]+=1;
}
}
for(int j=0;j<dcz[o].size();++j)
{
int l=dcz[o][j].l,r=dcz[o][j].r,lcal=dcz[o][j].lcal,lcar=dcz[o][j].lcar;
if(l==r)
{
lctxg(l,1);
}
else if(l==o)
{
lctxg(l,1);
lctxg(lcar,-1);
}
else
{
lctxg(o,1);
lctxg(lcal,-1);
lctxg(lcar,-1);
}
}
}
}
int main()
{
//freopen("qwq.txt","r",stdin);
//freopen("qaq.txt","w",stdout);
csh();
solve();
cout<<ans<<endl;
return 0;
}
| 12 | CPP |
for _ in range(int(input())):
x , n , m = map(int , input().split())
while(n > 0 ):
if (x <=20):
break
x = (x//2)+10
n-=1
while(m>0):
x = x-10
m-=1
if (x > 0 ):
print("NO")
else :
print("YES")
| 8 | PYTHON3 |
from math import log,floor
n = int(input())
a = list(map(int,input().split()))
for k in range(1,n):
moves=0
b = a[:]
for i in range(1,k+1):
x = log(n-i,2)
j=floor(x)
while j>=0:
y = i+(2**j)
if y<=n:
moves += b[i-1]
b[y-1] += b[i-1]
b[i-1] = 0
break
else:
j -= 1
print(moves)
| 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int k,n;
int main()
{
scanf("%d",&k);
if(k<=500)
{
printf("%d\n",k);
for(int i=1;i<=k;i++)
{
for(int j=1;j<=k;j++)printf("%d ",i);
puts("");
}
return 0;
}
n=(k+3)/4*2;
cout<<n<<endl;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
int r=(i+j)%n;
if(i%2)r+=n;
if(r>=k)r-=n;
printf("%d ",r+1);
}
puts("");
}
} | 0 | CPP |
c = sum(list(map(int, input().split())))
m = sum(list(map(int, input().split())))
n=int(input())
import math
z=math.ceil(c/5)+math.ceil(m/10)
if z>n:
print('NO')
else:
print('YES')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
int flag = 0;
for (int i = 0; i < n; i++) {
string s;
int a, b;
cin >> s >> a >> b;
if (a >= 2400 && b > a) flag = 1;
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
| 7 | CPP |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
# import time,random,resource
# sys.setrecursionlimit(10**6)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)
def IF(c, t, f): return t if c else f
def YES(c): return IF(c, "YES", "NO")
def Yes(c): return IF(c, "Yes", "No")
class Prime():
def __init__(self, n):
self.M = m = int(math.sqrt(n)) + 10
self.A = a = [True] * m
a[0] = a[1] = False
self.T = t = [2]
for j in range(4, m, 2):
a[j] = False
for i in range(3, m, 2):
if not a[i]:
continue
t.append(i)
for j in range(i*i,m,i):
a[j] = False
self.ds_memo = {}
self.ds_memo[1] = set([1])
def is_prime(self, n):
return self.A[n]
def division(self, n):
d = collections.defaultdict(int)
for c in self.T:
while n % c == 0:
d[c] += 1
n //= c
if n < 2:
break
if n > 1:
d[n] += 1
return d.items()
def main():
t = 1
rr = []
for _ in range(t):
pr = Prime(10**12)
n = I()
d = list(pr.division(n))
if len(d) == 1:
rr.append(d[0][0])
else:
rr.append(1)
return JA(rr, "\n")
print(main())
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, L = 20, MOD = 1e9 + 7, P = 727, SQ = sqrt(N);
const long long inf = 1e18 + 10, M = 4e2 + 10;
vector<int> v[N];
long long bm[N], a[N], ex[N];
int pw(int c, int d) {
if (d == 0) return 1;
int tmp = pw(c, d / 2);
tmp = 1ll * tmp * tmp % MOD;
if (d % 2) tmp = 1ll * tmp * c % MOD;
return tmp;
}
int main() {
long long n, mx = 0, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
ex[a[i]]++, mx = max(mx, a[i]);
}
bm[1] = n;
for (int i = 2; i <= mx; i++) {
bm[i] = bm[i - 1] - ex[i - 1];
}
for (int i = 1; i <= mx; i++)
for (int j = i; j <= mx; j += i) v[j].push_back(i);
for (int i = 1; i <= mx; i++) {
long long ret = 1, cnt = n, res = 0;
for (int j = 0; j < (int)v[i].size(); j++) {
long long dif = cnt - bm[v[i][j]];
if (dif > 0) ret = 1ll * ret * pw(res, dif) % MOD;
cnt = bm[v[i][j]], res++;
}
long long op = 1ll * ret * pw(res, cnt) % MOD;
ret = 1ll * ret * pw(res - 1, cnt) % MOD;
ans = (ans + (op - ret) + MOD) % MOD;
}
return cout << ans, 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 10000;
#define rep(i,n) for(int i = 0;i < n;i++)
#define rrep(i,n) for(int i = 1;i <= n;i++)
string s;
int dp[502][2][3][10][500], m;
//dp[桁][使えるか][上下][前の数字][mod]
int rec(int p, int ok, int pre_up, int pre, int num){
if(p == s.size())return (num == 0);
if(dp[p][ok][pre_up][pre][num] != -1)return dp[p][ok][pre_up][pre][num];
int n = ok ? 9 : s[p]-'0';
int res = 0;
for(int i = 0;i <= n;i++){
if(pre_up == 1 && pre <= i)continue;
if(pre_up == 2 && pre >= i)continue;
if(pre_up == 0){
if(pre == 0)res += rec(p+1, ok|(i < n), 0, i, (num*10+i)%m);
else if(pre < i)res += rec(p+1, ok|(i < n), 1, i, (num*10+i)%m);
else if(pre > i)res += rec(p+1, ok|(i < n), 2, i, (num*10+i)%m);
}else if(pre_up == 1){
res += rec(p+1, ok|(i < n), 2, i, (num*10+i)%m);
}else{
res += rec(p+1, ok|(i < n), 1, i, (num*10+i)%m);
}
}
return dp[p][ok][pre_up][pre][num] = res % mod;
}
int get(string str){
s = str;
fill((int*)dp, (int*)(dp+502), -1);
int ans = rec(0, 0, 0, 0, 0);
return ans;
}
string calc(string str){
for(int i = str.size()-1;i >= 0;i--){
if(str[i] == '0')str[i] = '9';
else {str[i]--;break;}
}
return str;
}
int main(){
string a, b;
cin >> a >> b >> m;
int ans = (get(b)-get(calc(a)) + mod)%mod;
printf("%d\n", ans);
return 0;
}
| 0 | CPP |
from collections import Counter
def solve(k, s):
if Counter(s).most_common(1)[0][1] > k: return "no"
return "yes"
n, k = [int(i) for i in input().split()]
s = input()
print(solve(k, s)) | 7 | PYTHON3 |
import sys
import math
from collections import defaultdict,deque
input = sys.stdin.readline
def inar():
return [int(el) for el in input().split()]
def main():
t=int(input())
rem=t%4
if rem==1:
print(0,"A")
elif rem==2:
print(1,'B')
elif rem==0:
print(1,'A')
else:
print(2,'A')
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
from collections import deque
import sys
def inp():
return sys.stdin.readline().strip()
for _ in range(int(inp())):
x,y,n=map(int,inp().split())
val=n+y-n%x
while val>n:
val-=x
print(val) | 7 | PYTHON3 |
def small(arr):
freq={}
for i in range(len(arr)):
freq[arr[i]]=i
#print(freq)
arr=list(set(arr))
if(len(arr)==1 ):
return (0,1)
#print(arr)
arr.sort()
small=freq[arr[0]]
sec_small=freq[arr[1]]
return (small,sec_small)
def graph(arr,n,m):
empty=[]
a=1
b=a+1
temp=n
s=0
s=sum(arr)*2
while(temp>0):
#print(a,b)
if(a==n):
a=n
b=1
empty.append((a,b))
a=b
b=a+1
temp-=1
print(s)
for i in empty:
print(i[0],i[1])
t=int(input())
for i in range(t):
inp=input().split()
n=int(inp[0])
m=int(inp[1])
arr=list(map(int,input().split()))
if(m<=n-1 or n==2):
print(-1)
else:
graph(arr,n,m) | 8 | PYTHON3 |
_1,_2=map(int,input().split())
name,ip=[],[]
for i in range(_1):
x,y="",""
x,y=map(str,input().split())
name.append(x)
ip.append(y)
names,ips=[],[]
for i in range(_2):
x,y="",""
x,y=map(str,input().split())
names.append(x)
ips.append(y)
for i in range(len(names)):
print(names[i] + " " + ips[i], end=" ")
a=0
while (1):
if (ips[i] == (ip[a]+";")):
print("#"+name[a])
break
else :
a+=1
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
const double eps = 1e-10;
struct Point {
double x, y;
Point(double x = 0.0, double y = 0.0) : x(x), y(y) {}
double norm() {return sqrt(x*x + y*y);}
};
Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}
Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}
double operator * (const Point &p, const Point q) {return p.x * q.x + p.y * q.y;}
bool operator == (const Point &p, const Point &q) {return (abs(p.x - q.x) < eps && abs(p.y - q.y) < eps);}
bool operator != (const Point &p, const Point &q) {return !(p == q);}
double cross(const Point &p, const Point &q) {return p.x*q.y - p.y*q.x;}
double dist(const Point &p, const Point &q) {return (p-q).norm();}
struct Segment {
Point p , q;
Segment(Point p = Point(0.0,0.0), Point q = Point(0.0,0.0)) : p(p), q(q) {}
};
struct Line {
double a, b, c;
Line(double a, double b, double c) : a(a), b(b), c(c) {}
Line(Point p, Point q) {
a = q.y - p.y;
b = p.x - q.x;
c = q.x * p.y - p.x * q.y;
}
};
struct Circle {
double r;
Point p;
Circle(Point p = Point(0.0, 0.0), double r = 0.0) : p(p), r(r) {}
};
// 点の直線への射影
Point projection (Point p, Line l) {
double x = p.x - l.a * (l.a*p.x + l.b*p.y + l.c) / (l.a*l.a + l.b*l.b);
double y = p.y - l.b * (l.a*p.x + l.b*p.y + l.c) / (l.a*l.a + l.b*l.b);
return Point(x,y);
}
// 線対称な点
Point reflection(Point p, Line l) {
double x = p.x - 2.0 * l.a * (l.a*p.x + l.b*p.y + l.c) / (l.a*l.a + l.b*l.b);
double y = p.y - 2.0 * l.b * (l.a*p.x + l.b*p.y + l.c) / (l.a*l.a + l.b*l.b);
return Point(x,y);
}
// 点の線分からの回転方向
int ccw(Point p, Point p1, Point p2) {
p1 = p1 - p; p2 = p2 - p;
if(cross(p1,p2) > eps) return 1;
if(cross(p1,p2) < -eps) return -1;
if(p1 * p2 < 0) return 2;
if(p1.norm() < p2.norm()) return -2;
return 0;
}
// 点が線分上にあるか判定
bool on_segment(Point p, Segment s) {
return (ccw(s.p,s.q,p) == 0 ? true : false);
}
// 線分の交差判定
bool segment_segment_cross(const Segment l, const Segment s) {
return ccw(l.p,l.q,s.p) * ccw(l.p,l.q,s.q) <= 0 && ccw(s.p,s.q,l.p) * ccw(s.p,s.q,l.q) <= 0;
}
// 直線の平行・直交判定 (平行:2 直交:1 その他:0)
int line_parallel_orthogonal(Line l, Line s) {
if(abs(l.a*s.a + l.b*s.b) < eps) return 1;
else if(abs(l.a*s.b - l.b*s.a) < eps) return 2;
else return 0;
}
// 直線と直線の交点
vector<Point> line_line_cross(Line l, Line s) {
vector<Point> vp;
if(line_parallel_orthogonal(l,s) != 2) {
Point p;
p.x = (l.b*s.c - s.b*l.c) / (l.a*s.b - s.a*l.b);
p.y = (-l.a*s.c + s.a*l.c) / (l.a*s.b - s.a*l.b);
vp.push_back(p);
}
return vp;
}
// 点と直線の距離
double point_line_dist(Point p, Line l) {
return abs(l.a*p.x + l.b*p.y + l.c) / sqrt(l.a*l.a + l.b*l.b);
}
// 点と線分の距離
double point_segment_dist(Point p, Segment s) {
Point h = projection(p,Line(s.p,s.q));
if(on_segment(h,s)) return dist(p,h);
else return min(dist(p,s.p),dist(p,s.q));
}
// 線分と線分の距離
double segment_segment_dist(Segment l, Segment s) {
if(segment_segment_cross(l,s)) return 0.0;
else return min({point_segment_dist(l.p,s),point_segment_dist(l.q,s),point_segment_dist(s.p,l),point_segment_dist(s.q,l)});
}
// 直線と直線の距離
double line_line_dist(Line l, Line s) {
if(line_parallel_orthogonal(l,s) != 2) return 0.0;
else if(abs(s.a) < eps) return point_line_dist(Point(0.0,-s.c/s.b),l);
else return point_line_dist(Point(-s.c/s.a,0),l);
}
// 直線と線分の距離
double line_segment_dist(Line l, Segment s) {
Point a, b;
if(abs(l.a) < eps) a = Point(0.0,-l.c/l.b), b = Point(1.0,-l.c/l.b);
else if(abs(l.b) < eps) a = Point(-l.c/l.a,0.0), b = Point(-l.c/l.a,0.0);
else a = Point(0.0,-l.c/l.b), b = Point(-l.c/l.a,0);
if(ccw(a,b,s.p) * ccw(a,b,s.q) <= 0) return 0.0;
else return min(point_line_dist(s.p,l),point_line_dist(s.q,l));
}
// ★円と円の交差判定 (離れる:4 外接:3 交わる:2 内接:1 内包:0)
int circle_circle_pos(Circle c, Circle d) {
if(dist(c.p,d.p) >= c.r + d.r + eps) return 4;
else if(abs(dist(c.p,d.p) - c.r - d.r) < eps) return 3;
else if(dist(c.p,d.p) >= abs(c.r-d.r) + eps) return 2;
else if(abs(dist(c.p,d.p) - abs(c.r-d.r)) < eps) return 1;
else return 0;
}
// ★円と直線の交点
vector<Point> circle_line_cross(Circle c, Line l) {
vector<Point> vp;
Point h = projection(c.p,l);
double d = l.a*c.p.x + l.b*c.p.y + l.c;
double q = c.r*c.r - d*d / (l.a*l.a + l.b*l.b);
if(q >= eps) {
Point p1, p2;
p1.x = h.x + sqrt(q) * l.b / sqrt(l.a*l.a + l.b*l.b);
p1.y = h.y - sqrt(q) * l.a / sqrt(l.a*l.a + l.b*l.b);
p2.x = h.x - sqrt(q) * l.b / sqrt(l.a*l.a + l.b*l.b);
p2.y = h.y + sqrt(q) * l.a / sqrt(l.a*l.a + l.b*l.b);
vp.push_back(p1);
vp.push_back(p2);
} else if(abs(q) < eps) {
vp.push_back(h);
}
return vp;
}
// ★円と円の交点
vector<Point> circle_circle_cross(Circle c, Circle d) {
Line l(2.0*(c.p.x-d.p.x),2.0*(c.p.y-d.p.y),-c.p.x*c.p.x+d.p.x*d.p.x-c.p.y*c.p.y+d.p.y*d.p.y+c.r*c.r-d.r*d.r);
return circle_line_cross(c,l);
}
// ★多角形の面積
double polygon_area(vector<Point>& v) {
int l = v.size();
double s = 0.0;
for(int i = 0; i < l; i++) s += 1/2.0 * cross(v[i],v[(i+1)%l]);
return s;
}
// ★多角形の凸性
bool polygon_convex(vector<Point>& v) {
int l = v.size();
for(int i = 0; i < l; i++) {
if(cross(v[(i+1)%l]-v[i],v[(i+2)%l]-v[i]) < -eps) return false;
}
return true;
}
int main() {
int n;
cin >> n;
vector<Point> v(n);
rep(i,n) cin >> v[i].x >> v[i].y;
cout << (polygon_convex(v)? 1 : 0) << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 103;
map<string, int> mp1[maxn], mp2[maxn];
vector<int> ans;
char getA(string a, string b) {
int c[30];
memset(c, 0, sizeof(c));
for (int i = 0; i < a.size(); i++) c[a[i] - 'a']++;
for (int i = 0; i < b.size(); i++) c[b[i] - 'a']--;
for (int i = 0; i < 26; i++)
if (c[i] > 0) return i + 'a';
}
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "? 1 1" << endl;
string s;
cin >> s;
cout << "! " << s << endl;
} else {
cout << "? 1 " << n << endl;
for (int i = 0; i < n * (n + 1) / 2; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp1[s.size()][s]++;
}
cout << "? 2 " << n << endl;
for (int i = 0; i < n * (n - 1) / 2; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp2[s.size()][s]++;
}
for (int i = 1; i <= n; i++) {
for (auto p : mp2[i]) mp1[i][p.first] -= mp2[i][p.first];
for (auto p : mp1[i]) {
if (p.second > 0) {
string new1 = "";
for (int j = 0; j < ans.size(); j++) new1 += ans[j];
ans.push_back(getA(p.first, new1));
}
}
}
string new1 = "";
for (int j = 0; j < ans.size(); j++) new1 += ans[j];
cout << "! " << new1 << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int getidx(const vector<int>& ar, int x) {
return lower_bound(ar.begin(), ar.end(), x) - ar.begin();
}
inline long long GCD(long long a, long long b) {
long long n;
if (a < b) swap(a, b);
while (b != 0) {
n = a % b;
a = b;
b = n;
}
return a;
}
inline long long LCM(long long a, long long b) {
if (a == 0 || b == 0) return GCD(a, b);
return a / GCD(a, b) * b;
}
inline long long CEIL(long long n, long long d) {
return n / d + (long long)(n % d != 0);
}
inline long long ROUND(long long n, long long d) {
return n / d + (long long)((n % d) * 2 >= d);
}
inline long long POW(long long a, long long n) {
if (n < 0) return 0;
long long ret = 1;
while (n) {
if (n % 2) ret *= a;
a = a * a;
n /= 2;
}
return ret;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
const double EPS = 1e-12;
const int MAXN = 1e3;
int n;
double m, l[MAXN], d[MAXN];
void input() {
cin >> n >> m;
for (int(i) = (0); (i) < (int)(n); ++(i)) cin >> l[i];
for (int(i) = (0); (i) < (int)(n); ++(i)) cin >> d[i];
}
bool chk(double k) {
double cur = k + m;
cur -= cur / l[0];
if (cur + EPS < m) return false;
for (int(i) = (1); (i) < (int)(n); ++(i)) {
cur -= cur / d[i];
cur -= cur / l[i];
if (cur + EPS < m) return false;
}
cur -= cur / d[0];
if (cur + EPS < m) return false;
return true;
}
int solve() {
double lo = 0, hi = 1e9 + 1;
for (int(loop) = (0); (loop) < (int)(1000); ++(loop)) {
double mid = (lo + hi) / 2;
if (chk(mid))
hi = mid;
else
lo = mid;
}
cout.precision(12);
if (hi >= 1e9 + 1)
cout << -1 << '\n';
else
cout << hi << '\n';
return 0;
}
void execute() { input(), solve(); }
int main(void) {
cin.tie(0);
ios_base::sync_with_stdio(false);
execute();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int k, x, n;
char a[1000][1000];
int main() {
scanf("%d%d", &n, &x);
k = n / 2;
for (int i = 1; i <= n; ++i)
if (i & 1) {
for (int j = 1; j <= k; ++j) a[i][j] = '>';
for (int j = k + 1; j <= n; ++j) a[i][j] = (j - k & 1) ? '.' : '>';
a[i][n] = 'v';
} else {
for (int j = 1; j <= k + 1; ++j) a[i][j] = (k - j + 1 & 1) ? '<' : '.';
for (int j = k + 2; j <= n; ++j) a[i][j] = '<';
a[i][1] = '^';
}
for (int i = 1; i <= n; ++i, puts(""))
for (int j = 1; j <= n; ++j) putchar(a[i][j]);
puts("1 1");
}
| 10 | CPP |
for test in range(int(input())):
n,m=map(int,input().split())
t=((n-1)*m)+((m-1)*n)
if t>(n*m):
print('NO')
else:
print('YES')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, Q, A[maxn];
inline int read() {
int ret = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -f;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
ret = ret * 10 + ch - '0';
ch = getchar();
}
return ret * f;
}
struct Range {
int L, R, Sum;
inline bool operator<(const Range& b) const { return Sum < b.Sum; }
inline Range operator+(const Range& b) const {
return (Range){L, b.R, Sum + b.Sum};
}
} Ra[25];
struct SegmentTree {
struct Node {
Range Lmax, Rmax, Max, Lmin, Rmin, Min, All;
bool Tag;
} Tree[maxn * 4];
inline void Merge(Node& a, Node b, Node c) {
a.Lmax = max(b.Lmax, b.All + c.Lmax);
a.Rmax = max(c.Rmax, b.Rmax + c.All);
a.Max = max(max(b.Max, c.Max), b.Rmax + c.Lmax);
a.Lmin = min(b.Lmin, b.All + c.Lmin);
a.Rmin = min(c.Rmin, b.Rmin + c.All);
a.Min = min(min(b.Min, c.Min), b.Rmin + c.Lmin);
a.All = b.All + c.All;
}
inline void PushUp(int rt) {
Merge(Tree[rt], Tree[rt * 2], Tree[rt * 2 + 1]);
}
inline void Reverse(int rt) {
swap(Tree[rt].Min, Tree[rt].Max);
swap(Tree[rt].Lmax, Tree[rt].Lmin);
swap(Tree[rt].Rmax, Tree[rt].Rmin);
Tree[rt].Min.Sum *= -1;
Tree[rt].Max.Sum *= -1;
Tree[rt].All.Sum *= -1;
Tree[rt].Lmin.Sum *= -1;
Tree[rt].Lmax.Sum *= -1;
Tree[rt].Rmin.Sum *= -1;
Tree[rt].Rmax.Sum *= -1;
}
inline void PushDown(int rt) {
if (Tree[rt].Tag) {
Tree[rt * 2].Tag ^= 1;
Tree[rt * 2 + 1].Tag ^= 1;
Reverse(rt * 2);
Reverse(rt * 2 + 1);
Tree[rt].Tag ^= 1;
}
}
inline void Build(int L = 1, int R = n, int rt = 1) {
if (L == R) {
Tree[rt].All = Tree[rt].Lmax = Tree[rt].Lmin = Tree[rt].Max =
Tree[rt].Min = Tree[rt].Rmax = Tree[rt].Rmin = (Range){L, R, A[L]};
return;
}
int M = (L + R) >> 1;
Build(L, M, rt * 2);
Build(M + 1, R, rt * 2 + 1);
PushUp(rt);
}
inline void UpdatePoint(int P, int V, int L = 1, int R = n, int rt = 1) {
if (L == R) {
Tree[rt].All.Sum = Tree[rt].Lmax.Sum = Tree[rt].Lmin.Sum =
Tree[rt].Max.Sum = Tree[rt].Min.Sum = Tree[rt].Rmax.Sum =
Tree[rt].Rmin.Sum = V;
return;
}
int M = (L + R) >> 1;
PushDown(rt);
if (P <= M) UpdatePoint(P, V, L, M, rt * 2);
if (M < P) UpdatePoint(P, V, M + 1, R, rt * 2 + 1);
PushUp(rt);
}
inline Node QueryMax(int LL, int RR, int L = 1, int R = n, int rt = 1) {
if (LL <= L && R <= RR) return Tree[rt];
int M = (L + R) >> 1;
Node ret;
PushDown(rt);
if (LL <= M) ret = QueryMax(LL, RR, L, M, rt * 2);
if (M < RR) {
if (LL > M)
ret = QueryMax(LL, RR, M + 1, R, rt * 2 + 1);
else
Merge(ret, ret, QueryMax(LL, RR, M + 1, R, rt * 2 + 1));
}
return ret;
}
inline void UpdateRange(int LL, int RR, int L = 1, int R = n, int rt = 1) {
if (LL <= L && R <= RR) {
Reverse(rt);
Tree[rt].Tag ^= 1;
return;
}
int M = (L + R) >> 1;
PushDown(rt);
if (LL <= M) UpdateRange(LL, RR, L, M, rt * 2);
if (M < RR) UpdateRange(LL, RR, M + 1, R, rt * 2 + 1);
PushUp(rt);
}
} S;
int main() {
n = read();
for (int i = 1; i <= n; i++) A[i] = read();
Q = read();
S.Build();
while (Q--) {
if (read() == 0) {
int P = read(), V = read();
S.UpdatePoint(P, V);
} else {
int L = read(), R = read(), K = read(), cnt, ans = 0;
for (cnt = 0; cnt < K; cnt++) {
SegmentTree::Node tep = S.QueryMax(L, R);
if (tep.Max.Sum <= 0) break;
ans += tep.Max.Sum;
S.UpdateRange(tep.Max.L, tep.Max.R);
Ra[cnt] = tep.Max;
}
for (int i = 0; i < cnt; i++) S.UpdateRange(Ra[i].L, Ra[i].R);
printf("%d\n", ans);
}
}
return 0;
}
| 10 | CPP |
# Codeforces Submission
# User : sudoSieg
# Time : 15:13:27
# Date : 21/10/2020
def move(x):
a = x.pop()
if a != None:
for i in range(len(x) - 1, -1, -1):
if x[i] == None:
x[i] = a
return x
return x
def gen(n):
x = []
for i in range(1, 2 * n):
if i % 2 == 1:
x.append((i + 1)//2)
else:
x.append(None)
return x
def solve(x, n):
print(*x)
while len(x) != n:
x = move(x)
print(*x)
return x
import io
import os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n, q = map(int, input().split())
for _ in range(q):
x = int(input())
for r in range(100):
num = 2 * n - 2 ** r - x
den = 2 ** (r + 1)
if num % den == 0 and num >= 0 and den > 0 and n - num//den >= 1 and n - num//den <= n:
i = n - num//den
print(i)
break | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, x;
cin >> n >> k;
vector<int> first(n, k + 1), last(n, -1);
for (int i = 0; i < k; ++i) {
int x;
cin >> x;
x -= 1;
first[x] = min(first[x], i);
last[x] = max(last[x], i);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (i > 0 && last[i - 1] <= first[i]) ans += 1;
if (i < n - 1 && last[i + 1] <= first[i]) ans += 1;
if (last[i] == -1) ans += 1;
}
cout << ans;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, c = 0, k;
string a, b;
cin >> a;
cin >> b;
for (i = 0; i < a.size(); i++) {
if (a[i] != b[i]) {
c++;
}
}
if (c % 2 == 1) {
cout << "impossible" << endl;
} else {
c = c / 2;
k = 0;
while (c > 0) {
if (a[k] != b[k]) {
b[k] = a[k];
c--;
}
k++;
}
cout << b << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int, int>
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, a, b) for(int i = (a); i > (b); i--)
#define all(c) c.begin(), c.end()
#define endl '\n'
#define debug(x) cout << __LINE__ << ": " << #x << " " << x << endl;
const int mod = 1e9 + 7;
const int inf = 2e18 + 7;
const int nax = 101010;
class SegmentTreeMin
{
vector<int> tree;
vector<int> high; vector<int> low;
vector<int> delta;
public:
SegmentTreeMin(int n)
{
tree = vector<int>(4 * n + 1);
high = vector<int>(4 * n + 1);
low = vector<int>(4 * n + 1);
delta = vector<int>(4 * n + 1);
init(1, 1, n);
}
void init(int i, int a, int b)
{
low[i] = a;
high[i] = b;
if (a == b)
{
return;
}
int mid = (a + b) / 2;
init(2 * i, a, mid);
init(2 * i + 1, mid + 1, b);
}
void propagate(int i)
{
delta[2 * i] += delta[i];
delta[2 * i + 1] += delta[i];
delta[i] = 0;
}
void update(int i)
{
tree[i] = min(tree[2 * i] + delta[2 * i], tree[2 * i + 1] + delta[2 * i + 1]);
}
void _increment(int i, int a, int b, int x)
{
if (b < low[i] or a > high[i])
{
return;
}
if (a <= low[i] and b >= high[i])
{
delta[i] += x;
return;
}
propagate(i);
_increment(2 * i, a, b, x);
_increment(2 * i + 1, a, b, x);
update(i);
}
int _query(int i, int a, int b)
{
if (b < low[i] or a > high[i])
{
return inf;
}
if (a <= low[i] and b >= high[i])
{
return tree[i] + delta[i];
}
propagate(i);
int res = min(_query(2 * i, a, b), _query(2 * i + 1, a, b));
update(i);
return res;
}
void increment(int a, int b, int x)
{
_increment(1, a, b, x);
}
int query(int a, int b)
{
return _query(1, a, b);
}
};
class SegmentTreeMax
{
vector<int> tree;
vector<int> high; vector<int> low;
vector<int> delta;
public:
SegmentTreeMax(int n)
{
tree = vector<int>(4 * n + 1);
high = vector<int>(4 * n + 1);
low = vector<int>(4 * n + 1);
delta = vector<int>(4 * n + 1);
init(1, 1, n);
}
void init(int i, int a, int b)
{
low[i] = a;
high[i] = b;
if (a == b)
{
return;
}
int mid = (a + b) / 2;
init(2 * i, a, mid);
init(2 * i + 1, mid + 1, b);
}
void propagate(int i)
{
delta[2 * i] += delta[i];
delta[2 * i + 1] += delta[i];
delta[i] = 0;
}
void update(int i)
{
tree[i] = max(tree[2 * i] + delta[2 * i], tree[2 * i + 1] + delta[2 * i + 1]);
}
void _increment(int i, int a, int b, int x)
{
if (b < low[i] or a > high[i])
{
return;
}
if (a <= low[i] and b >= high[i])
{
delta[i] += x;
return;
}
propagate(i);
_increment(2 * i, a, b, x);
_increment(2 * i + 1, a, b, x);
update(i);
}
int _query(int i, int a, int b)
{
if (b < low[i] or a > high[i])
{
return -inf;
}
if (a <= low[i] and b >= high[i])
{
return tree[i] + delta[i];
}
propagate(i);
int res = max(_query(2 * i, a, b), _query(2 * i + 1, a, b));
update(i);
return res;
}
void increment(int a, int b, int x)
{
_increment(1, a, b, x);
}
int query(int a, int b)
{
return _query(1, a, b);
}
};
class SegmentTreeSum
{
vector<int> tree;
vector<int> high; vector<int> low;
vector<int> delta;
public:
SegmentTreeSum(int n)
{
tree = vector<int>(4 * n + 1);
high = vector<int>(4 * n + 1);
low = vector<int>(4 * n + 1);
delta = vector<int>(4 * n + 1);
init(1, 1, n);
}
void init(int i, int a, int b)
{
low[i] = a;
high[i] = b;
if (a == b)
{
return;
}
int mid = (a + b) / 2;
init(2 * i, a, mid);
init(2 * i + 1, mid + 1, b);
}
void propagate(int i)
{
delta[2 * i] += delta[i];
delta[2 * i + 1] += delta[i];
delta[i] = 0;
}
void update(int i)
{
tree[i] = tree[2 * i] + delta[2 * i] + tree[2 * i + 1] + delta[2 * i + 1];
}
void _increment(int i, int a, int b, int x)
{
if (b < low[i] or a > high[i])
{
return;
}
if (a <= low[i] and b >= high[i])
{
delta[i] += x;
return;
}
propagate(i);
_increment(2 * i, a, b, x);
_increment(2 * i + 1, a, b, x);
update(i);
}
int _query(int i, int a, int b)
{
if (b < low[i] or a > high[i])
{
return 0;
}
if (a <= low[i] and b >= high[i])
{
return tree[i] + delta[i];
}
propagate(i);
int res = _query(2 * i, a, b) + _query(2 * i + 1, a, b);
update(i);
return res;
}
void increment(int a, int b, int x)
{
_increment(1, a, b, x);
}
int query(int a, int b)
{
return _query(1, a, b);
}
};
void solve()
{
int n, q; cin >> n >> q;
vector<int> a(n + 1);
loop(i, 1, n + 1)
{
char x; cin >> x;
if (x == '+') a[i] = 1;
else a[i] = -1;
}
vector<int> b = a;
loop(i, 1, n + 1) b[i] += b[i - 1];
SegmentTreeSum SS = SegmentTreeSum(n + 10);
SegmentTreeMax SM = SegmentTreeMax(n + 10);
SegmentTreeMin Sm = SegmentTreeMin(n + 10);
loop(i, 1, n + 1)
{
SS.increment(i + 1, i + 1, a[i]);
SM.increment(i + 1, i + 1, b[i]);
Sm.increment(i + 1, i + 1, b[i]);
}
loop(i, 0, q)
{
int l, r; cin >> l >> r;
l++; r++;
int range_sum = SS.query(l, r);
int lmin = Sm.query(1, l - 1);
int lmax = SM.query(1, l - 1);
int rmin = Sm.query(r + 1, n + 1);
int rmax = SM.query(r + 1, n + 1);
if (r + 1 != n + 2)
{
rmin -= range_sum;
rmax -= range_sum;
}
// debug(l);
// debug(r);
// debug(lmin);
// debug(lmax);
// debug(rmin);
// debug(rmax);
// debug(range_sum);
int mmin = min(lmin, rmin);
int mmax = max(lmax, rmax);
cout << mmax - mmin + 1 << endl;
}
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("fin.txt", "r", stdin);
freopen("fout.txt", "w", stdout);
#endif
int t; cin >> t;
while (t--)
{
solve();
}
return 0;
}
| 10 | CPP |
from itertools import combinations as cb
c = list(map(int,input().split()))
cc = sum(c)
ans = "NO"
for g in cb(c, 2):
if sum(g) == cc//2:
ans = "YES"
for k in c:
if k == cc//2:
ans = "YES"
if cc & 1: ans = "NO"
print(ans) | 7 | PYTHON3 |
x = 0
for i in range(int(input())):
p = input()
if '++' in p:
x+=1
if '--' in p:
x-=1
print(x) | 7 | PYTHON3 |
x, y, z, t1, t2, t3 = map(int, input().split())
if abs(x - y) * t1 >= 3 * t3 + abs(x - y) * t2 + abs(x - z) * t2:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fastio() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
fastio();
string s;
getline(cin, s);
bool ok = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' ||
s[i] == 'u' || s[i] == 'y')
ok = true;
else
ok = false;
} else if (s[i] >= 'A' && s[i] <= 'Z') {
if (s[i] == 'A' || s[i] == 'E' || s[i] == 'I' || s[i] == 'O' ||
s[i] == 'U' || s[i] == 'Y')
ok = true;
else
ok = false;
}
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 7 | CPP |
from sys import stdin,exit
def listinput():
return list(map(int,stdin.readline().rstrip().split()))
n=int(input())
inp=[]
sums=[]
for _ in range(n):
_=int(input())
li=listinput()
sums.append(sum(li))
inp.append(li)
vals = {}
seen = [set() for _ in range(n)]
for i in range(n):
for j in range(len(inp[i])):
v = sums[i]-inp[i][j]
if v not in vals:
vals[v]=[(i+1,j+1)]
seen[i].add(v)
elif v not in seen[i]:
print("YES")
print(vals[v][0][0],vals[v][0][1])
print(i+1,j+1)
exit(0)
print('NO') | 9 | PYTHON3 |
import sys
sys.setrecursionlimit(10**8)
try:
FILE_POINTER = open('input.inpt')
input = FILE_POINTER.readline
except:
FILE_POINTER = None
input = sys.stdin.readline
n, r, av = list(map(int, input().strip().split()))
grades = []
curr = 0
for i in range(n):
grades.append(list(map(int, input().strip().split())))
curr += grades[-1][0]
require = av*n
grades.sort(key = lambda x : x[1])
i = 0
ans = 0
while curr < require:
if grades[i][0] < r:
increment = min(require-curr, r-grades[i][0])
ans += grades[i][1] * increment
curr += increment
i += 1
print(ans)
if FILE_POINTER:
FILE_POINTER.close() | 9 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.