solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
for t in range(int(input())):
n = int(input())
c2 = 0
c3 = 0
while n % 2 == 0:
n /= 2
c2 += 1
while n % 3 == 0:
n /= 3
c3 += 1
if n > 1 or c3 < c2:
print(-1)
else:
print((2*c3)-c2) | 8 | PYTHON3 |
n = int(input())
output = (n // 3) * 2
print(output + 1 if n % 3 > 0 else output) | 7 | PYTHON3 |
n,m=map(int,input().split())
for i in range(1,n+1):
for j in range(0,m):
if(i%2!=0):
print("#",end="")
elif((i//2)%2!=0):
if(j==m-1):
print("#",end="")
else:
print(".",end="")
elif((i//2)%2==0):
if(j==0):
print("#",end="")
else:
print(".",end="")
print(end="\n") | 7 | PYTHON3 |
#include <iostream>
using namespace std;
int main(void)
{
int n;
while (cin >> n){
if(n == EOF) return 0;
cout << ((n * n) + n + 2) / 2 << endl;
}
return 0;
} | 0 | CPP |
# python3
import sys, threading, os.path
import collections, heapq, math,bisect
import string
from platform import python_version
import itertools
sys.setrecursionlimit(10**6)
threading.stack_size(2**27)
def main():
if os.path.exists('input.txt'):
input = open('input.txt', 'r')
else:
input = sys.stdin
#--------------------------------INPUT---------------------------------
n = str(input.readline().rstrip('\n'))
j = 0
sol = "YES"
for i in range(len(n)):
if j >= len(n):
break
if j+2 < len(n) and n[j]+n[j+1]+n[j+2]=='144':
j+=3
elif j+1 < len(n) and n[j]+n[j+1]=='14':
j+=2
elif n[j]=='1':
j+=1
else:
sol = "NO"
break
output = sol
#-------------------------------OUTPUT----------------------------------
if os.path.exists('output.txt'):
open('output.txt', 'w').writelines(str(output))
else:
sys.stdout.write(str(output))
if __name__ == '__main__':
main()
#threading.Thread(target=main).start() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 111111, NN = 15;
int dist[NN][1 << NN], pr[NN][1 << NN];
pair<int, int> op[NN][1 << NN];
int q[N], a[N];
int qs, qe;
int f(int v, int p, int x, int n) {
assert(p + 2 * x <= n);
for (int i = (0); i <= (2); i++) {
int pos = p + i * x;
v ^= 1 << (pos - 1);
}
return v;
}
void bfs(int n) {
if (dist[n][0] == 0) return;
dist[n][0] = 0;
q[qs++] = 0;
while (qs != qe) {
int u = q[qe++];
qe %= N;
for (int p = (1); p <= (n); p++) {
for (int x = (1); x <= (n); x++) {
if (p + 2 * x <= n) {
int v = f(u, p, x, n);
if (dist[n][u] + 1 < dist[n][v]) {
dist[n][v] = dist[n][u] + 1;
pr[n][v] = u;
op[n][v] = make_pair(p, x);
q[qs++] = v;
qs %= N;
}
}
}
}
}
}
vector<pair<int, int> > get(int n, int v) {
vector<pair<int, int> > ans;
if (dist[n][v] > 1e6) {
return ans;
}
while (v) {
ans.push_back(op[n][v]);
v = pr[n][v];
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i = (3); i <= (NN - 1); i++) {
fill(dist[i], dist[i] + (1 << i), 1e7);
bfs(i);
}
int n;
cin >> n;
for (int i = (1); i <= (n); i++) {
cin >> a[i];
}
vector<int> di;
vector<pair<int, int> > ans;
int pos = 1;
while (pos <= n) {
int rem = n - pos + 1;
int cur = NN - 1, add = 0;
if (cur >= rem) {
cur = rem;
} else {
cur = 6;
add = 6;
}
int v = 0;
for (int i = (1); i <= (cur); i++) {
v = v * 2 + a[pos + cur - i];
}
vector<pair<int, int> > ops;
if (add) {
int mini = 10, bv, bm;
for (int mask = (0); mask <= ((1 << add) - 1); mask++) {
int vv = v + mask * (1 << cur);
int di = dist[cur + add][vv];
if (di < mini) {
mini = di;
bv = vv;
bm = mask;
}
}
ops = get(cur + add, bv);
for (int i = (0); i <= (add - 1); i++) {
a[pos + cur + i] ^= (bm & (1 << i)) > 0;
}
} else {
if (dist[cur][v] > 1e6) {
cout << "NO" << endl;
return 0;
}
ops = get(cur, v);
}
for (auto p : ops) {
ans.push_back(make_pair(p.first + pos - 1, p.second));
}
pos += cur;
}
cout << "YES" << endl;
cout << (int)(ans).size() << endl;
for (auto p : ans) {
for (int i = (0); i <= (2); i++) {
cout << p.first + i * p.second << " ";
}
cout << endl;
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long array[n];
for (int i = 0; i < n; i++) cin >> array[i];
if (n <= 2) {
cout << n << endl;
return 0;
}
int best = 0, left = 0, pre = 0, sec = 1;
while (sec + 1 < n) {
if (array[sec + 1] == array[sec] + array[pre]) {
sec++, pre++;
} else {
best = max(best, sec - left + 1);
left = sec, pre = sec;
sec++;
}
}
best = max(best, sec - left + 1);
cout << best << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int A, B, n;
int main() {
cin >> A >> B >> n;
if (B == 0) {
cout << 0;
return 0;
} else {
if (A == 0) {
cout << "No solution";
return 0;
} else {
if (B % A != 0) {
cout << "No solution";
return 0;
} else {
if (B / A < 0 && n % 2 == 0) {
cout << "No solution";
return 0;
}
int k = abs(B / A);
int d = 0;
int p = 0;
while (p < k) {
d++;
p = pow((double)d, (double)n);
if (p == k) {
if (B / A > 0) {
cout << d;
return 0;
} else {
cout << -d;
return 0;
}
}
}
cout << "No solution";
return 0;
}
}
}
}
| 7 | CPP |
import sys
from collections import OrderedDict
#my_file = sys.stdin
#my_file = open("input.txt", "r")
k = int(input())
string = input()
sorted = "".join(sorted(set(string)))
for char in sorted:
if string.count(char)%k != 0:
print(-1)
break
else:
for i in range(k):
for char in sorted:
for rep in range(int(string.count(char)/k)):
print(char, end="") | 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().split()))
lstsum = [0] * (n + 1)
isum = 0
for i in range(1, n + 1):
isum += lst[i - 1]
lstsum[i] = isum
for i in range(int(input())):
l, r = map(int, input().split())
print((lstsum[r] - lstsum[l - 1]) // 10)
| 9 | PYTHON3 |
x = int(input())
h,m = map(int,input().split())
n = 0
f = 0
while True:
while m >= 0 and f!= 1:
if "7" in str(m) or "7" in str(h):
print(n)
f = 1
break
if m-x < 0:
m = 60 + m - x
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
n += 1
if f == 1:
break | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int u[200010], v[200010];
int deg[200010];
unsigned long long A, B, C;
unsigned long long calc(int i, int j, int k) {
if (i > j) swap(i, j);
if (j > k) swap(j, k);
if (i > j) swap(i, j);
return A * i + B * j + C * k;
}
vector<int> e[200010];
vector<int> to[200010];
vector<unsigned long long> f[200010];
int cnt(int u, int l, int r) {
return upper_bound(to[u].begin(), to[u].end(), r) -
lower_bound(to[u].begin(), to[u].end(), l);
}
unsigned long long usum(int u, int l, int r) {
int L = lower_bound(to[u].begin(), to[u].end(), l) - to[u].begin();
int R = upper_bound(to[u].begin(), to[u].end(), r) - to[u].begin();
return f[u][R] - f[u][L];
}
unsigned long long C2(int x) { return (unsigned long long)x * (x - 1) / 2; }
unsigned long long sum(int l, int r) { return C2(r + 1) - C2(l); }
bool vis[200010];
int main() {
cin >> n >> m;
cin >> A >> B >> C;
for (int i = 0; i < m; i++) {
cin >> u[i] >> v[i];
if (u[i] > v[i]) swap(u[i], v[i]);
deg[u[i]]++;
deg[v[i]]++;
to[u[i]].push_back(v[i]);
to[v[i]].push_back(u[i]);
}
for (int i = 0; i < n; i++) {
sort(to[i].begin(), to[i].end());
f[i].push_back(0);
for (int j = 0; j < to[i].size(); j++)
f[i].push_back(f[i].back() + to[i][j]);
}
unsigned long long ans = 0;
for (int i = 0; i < n; i++) {
ans += A * C2(n - i - 1) * i;
ans += B * i * (n - i - 1) * i;
ans += C * C2(i) * i;
}
for (int i = 0; i < m; i++) {
int x = u[i];
int y = v[i];
ans -= (n - y - 1) * (A * x + B * y) + C * sum(y + 1, n - 1);
ans -= (y - x - 1) * (A * x + C * y) + B * sum(x + 1, y - 1);
ans -= x * (B * x + C * y) + A * sum(0, x - 1);
}
for (int i = 0; i < m; i++) {
int x = u[i];
int y = v[i];
ans += cnt(y, y + 1, n - 1) * (A * x + B * y) + C * usum(y, y + 1, n - 1);
ans += cnt(x, y + 1, n - 1) * (A * x + B * y) + C * usum(x, y + 1, n - 1);
ans += cnt(y, 0, x - 1) * (B * x + C * y) + A * usum(y, 0, x - 1);
}
for (int i = 0; i < m; i++)
if (deg[u[i]] <= deg[v[i]])
e[u[i]].push_back(v[i]);
else
e[v[i]].push_back(u[i]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < e[i].size(); j++) {
int x = e[i][j];
vis[x] = true;
}
for (int j = 0; j < e[i].size(); j++) {
int x = e[i][j];
for (int k = 0; k < e[x].size(); k++) {
int y = e[x][k];
if (vis[y]) ans -= calc(i, x, y);
}
}
for (int j = 0; j < e[i].size(); j++) {
int x = e[i][j];
vis[x] = false;
}
}
cout << ans << "\n";
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
string str;
int main() {
long long int len, q, i, start, end, idx, ans = 0;
map<pair<long long int, long long int>, long long int> m;
char ch;
cin >> len >> q;
cin >> str;
i = 0;
while (i < len && str[i] != '.') i++;
start = i;
end = i + 1;
while (end < len) {
while (end < len && str[end] == '.') end++;
if (end - start >= 2) {
m[{start, end}] = end - start;
}
if (end == len) break;
start = end;
while (start < len && str[start] != '.') start++;
end = start + 1;
}
for (auto it = m.begin(); it != m.end(); it++) {
ans = ans + (it->second - 1);
}
while (q--) {
cin >> idx >> ch;
idx--;
if (idx == 0) {
if (str[idx] == '.' && ch != '.') {
if (str[idx + 1] == '.') ans--;
} else if (str[idx] == '.' && ch == '.') {
} else if (str[idx] != '.' && ch != '.') {
} else if (str[idx] != '.' && ch == '.') {
if (idx + 1 < len && str[idx + 1] == '.') ans++;
}
} else if (idx == len - 1) {
if (str[idx] == '.' && ch != '.') {
if (str[idx - 1] == '.') ans--;
} else if (str[idx] == '.' && ch == '.') {
} else if (str[idx] != '.' && ch != '.') {
} else if (str[idx] != '.' && ch == '.') {
if (idx - 1 >= 0 && str[idx - 1] == '.') ans++;
}
} else {
if (str[idx] == '.' && ch != '.') {
if (str[idx - 1] == '.' && str[idx + 1] == '.')
ans -= 2;
else if (str[idx - 1] == '.' || str[idx + 1] == '.')
ans--;
} else if (str[idx] == '.' && ch == '.') {
} else if (str[idx] != '.' && ch != '.') {
} else if (str[idx] != '.' && ch == '.') {
if (str[idx - 1] == '.' && str[idx + 1] == '.')
ans += 2;
else if (str[idx - 1] == '.' || str[idx + 1] == '.')
ans++;
}
}
str[idx] = ch;
cout << ans << endl;
}
}
| 9 | CPP |
n = int(input())
sn = list(map(int, input().split()))
ans = 0
stack = []
for i in range(n):
while len(stack) and sn[i] > sn[stack[-1]]:
l = stack.pop()
#print(l)
ans = max(ans, sn[l]^sn[i])
if len(stack):
ans = max(ans, sn[i]^sn[stack[-1]])
stack.append(i)
print(ans)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long double eps = 1e-7;
const int inf = 1000000010;
const long long INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 110, LOG = 20;
int n, m, k, u, v, x, y, t, a, b, ans, root;
int deg[7];
vector<pair<int, int> > G[7];
bitset<MAXN> mark;
int A[MAXN][2];
vector<pair<int, int> > out;
void tour(int node) {
while (!G[node].empty()) {
pair<int, int> p = G[node].back();
G[node].pop_back();
int v = p.first, i = p.second;
if (mark[i]) continue;
mark[i] = 1;
tour(v);
out.push_back({i, A[i][0] == node});
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A[i][0] >> A[i][1];
G[A[i][0]].push_back({A[i][1], i});
G[A[i][1]].push_back({A[i][0], i});
root = A[i][0];
}
for (int i = 0; i < 7; i++)
if (G[i].size() & 1) {
if (t++ == 2) return cout << "No solution" << '\n', 0;
root = i;
}
tour(root);
if (out.size() < n) return cout << "No solution" << '\n', 0;
for (pair<int, int> p : out) {
cout << p.first << ' ';
if (p.second)
cout << "-\n";
else
cout << "+\n";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s, p = "hard";
cin >> n >> s;
vector<long long> c(n);
for (int i = 0; i < n; i++) cin >> c[i];
vector<vector<long long> > dp(n + 1, vector<long long>(5, 1e18));
for (int j = 0; j < 4; j++) dp[0][j] = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < 4; j++) {
if (s[i] != p[j])
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
else {
dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j]);
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + c[i]);
}
}
long long ans = LLONG_MAX;
for (int j = 0; j < 4; j++) ans = min(ans, dp[n][j]);
cout << ans << endl;
return 0;
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a[100]={2,1};
cin>>n;
for(int i=2;i<=n;i++)
a[i]=a[i-1]+a[i-2];
cout<<a[n];
return 0;
} | 0 | CPP |
n,m = map(int,input().split())
l = list(map(int,input().split()))
cur = 1
time = 0
for i in l:
if i >= cur:
time += i - cur
else:
time += n - cur + i
cur = i
print(time)
| 8 | PYTHON3 |
# cook your dish here
def solve(a, b, c):
for i in range(len(a)):
if (a[i] == b[i] and a[i] == c[i]):
continue
elif (a[i] == c[i]):
b[i] = c[i]
elif (b[i] == c[i]):
a[i] = c[i]
else:
return 0
return a == b
for i in range(int(input())):
a = list(input())
b = list(input())
c = list(input())
if (solve(a, b, c)):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
t = int(input())
for i in range(1, t + 1):
counts = dict()
n = int(input())
line = input()
numbers = line.split(' ')
for num in numbers:
if counts.get(int(num)):
counts[int(num)] += 1
else:
counts[int(num)] = 1
k = 1
while k <= 2048:
if counts.get(2048) is not None and counts.get(2048) > 0:
print('YES')
break
if counts.get(k) is None:
k = k * 2
continue
if counts.get(k * 2) is not None:
counts[k * 2] += counts.get(k) // 2
else:
counts[k * 2] = counts.get(k) // 2
k = k * 2
if k > 2048:
print('NO')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 1e6 + 5;
const ll LINF = 1e18 + 5;
int n, t[N], rt;
vector<pii> seq;
vector<int> G[N];
pii ans;
int in[N], out[N], id, sum[N], num[N], all, dp[N];
void dfs(int u) {
sum[u] = t[u];
in[u] = ++id;
num[id] = u;
for (auto v : G[u]) {
dfs(v);
sum[u] += sum[v];
if (dp[v]) dp[u] = dp[v];
}
out[u] = id;
if (u != rt && sum[u] == all / 3 * 2)
if (dp[u]) ans = make_pair(u, dp[u]);
if (u != rt && sum[u] == all / 3) {
dp[u] = u;
seq.push_back(make_pair(in[u], out[u]));
}
}
set<pii> st;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
int f;
cin >> f >> t[i];
if (f)
G[f].push_back(i);
else
rt = i;
all += t[i];
}
if (all % 3) return cout << -1, 0;
dfs(rt);
if (ans.first) return cout << ans.first << ' ' << ans.second, 0;
sort(begin(seq), end(seq));
for (int i = 0; i < (int)seq.size(); i++) {
auto it = st.lower_bound({seq[i].first, 0});
if (it != st.begin()) {
--it;
ans = make_pair(num[seq[i].first], (*it).second);
break;
}
st.insert({seq[i].second, num[seq[i].first]});
}
if (ans.first)
cout << ans.first << ' ' << ans.second;
else
cout << -1;
return 0;
}
| 9 | CPP |
#include <iostream>
#define N 1001
using namespace std;
void func(int,int,int);
int n,k[N];
string str[N];
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>k[i]>>str[i];
cout<<str[1]<<endl;
func(2,1,1);
return 0;
}
void func(int d,int q,int p){
if(d==n+1) return ;
if(q==k[d]){
for(int i=0;i<p;i++) cout<<'.';
cout<<str[d]<<endl;
func(d+1,d,p+1);
}
func(d+1,q,p);
} | 0 | CPP |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n;
scanf("%d",&n);
long long t = 1, a = 1;
int T, A;
for(int i=0;i<n;i++){
scanf("%d%d",&T,&A);
long long tmp = max(max(t%T?t/T+1:t/T,a%A?a/A+1:a/A),1ll);
t = tmp*T;
a = tmp*A;
}
printf("%lld\n",t+a);
return 0;
}
| 0 | CPP |
for num in range(int(input())):
x,y,a,b=map(int,input().split())
if ((y-x)//(a+b))==((y-x)/(a+b)):
print((y-x)//(a+b))
else:
print(-1)
| 7 | PYTHON3 |
from itertools import permutations
a = permutations("12345")
b = []
c = []
for i in range(5):
b.append(list(map(int, input().split())))
for i in a:
c.append(
(b[int(i[0])-1][int(i[1])-1]+b[int(i[1])-1][int(i[0])-1]+b[int(i[2])-1][int(i[3])-1]+b[int(i[3])-1][int(i[2])-1])+
(b[int(i[1])-1][int(i[2])-1]+b[int(i[2])-1][int(i[1])-1]+b[int(i[3])-1][int(i[4])-1]+b[int(i[4])-1][int(i[3])-1])+
(b[int(i[2])-1][int(i[3])-1]+b[int(i[3])-1][int(i[2])-1])+
(b[int(i[3])-1][int(i[4])-1]+b[int(i[4])-1][int(i[3])-1])
)
print(max(c))
| 8 | PYTHON3 |
def f():
n, m = [int(s) for s in input().split()]
if n%m:
print('NO')
else:
print('YES')
t = int(input())
for i in range(t):
f() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
long long n, m;
cin >> n >> m;
long long a[m];
a[0] = 1;
for (long long i = 1; i <= m; i++) {
cin >> a[i];
}
long long y = 0;
for (long long i = 1; i <= m; i++) {
if (a[i] > a[i - 1]) {
y = y + (a[i] - a[i - 1]);
} else if (a[i] < a[i - 1]) {
y = y + (n - a[i - 1]) + (a[i]);
} else if (a[i] == a[i - 1]) {
y = y + 0;
}
}
cout << y << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
int cnt1 = 0;
int cnt2 = 0;
int sum1 = 0;
int sum2 = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == 1) {
cnt1++;
sum1 += 1;
} else {
cnt2++;
sum2 += 2;
}
}
if (cnt1 == 0) {
cout << 0 << '\n';
return 0;
}
if (cnt1 > cnt2) {
while (cnt1--) {
sum2 += 1;
sum1--;
}
while (sum1 % 3 != 0 && sum1 > 0) {
sum1--;
}
cout << sum1 / 3 + sum2 / 3 << '\n';
} else {
cout << cnt1 << '\n';
}
return 0;
}
| 7 | CPP |
k, n, w = [int(x) for x in input().split(" ")]
ans = sum([k * x for x in range(1, w + 1)])
print(0 if (n > ans) else ans - n)
| 7 | PYTHON3 |
num = int(input())
case = []
minutes_1 = []
minutes_2 = []
for i in range(num):
hh,mm = input().split()
case.append((int(hh),int(mm)))
minutes_1.append(((24 - case[i][0]),(60 - case[i][1])))
minutes_2.append(60*minutes_1[i][0] + minutes_1[i][1] - 60)
for i in range(num):
print(minutes_2[i]) | 7 | PYTHON3 |
n = int(input())
dict = {'Tetrahedron' : 4, 'Cube' : 6, 'Octahedron' : 8, 'Dodecahedron' : 12, 'Icosahedron' : 20}
sumVal = 0
for i in range(n):
s = input()
sumVal += dict[s]
print("{}\n".format(sumVal))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int P = 998244353, g = 3;
int power(int a, int b) {
int ans = 1;
int t;
for (t = a; b; b >>= 1) {
if (b & 1) ans = 1ll * ans * t % P;
t = 1ll * t * t % P;
}
return ans;
}
int wn[30];
void get_wn() {
for (int i = 0; i < 23; i++) {
int t = 1 << i;
wn[i] = power(g, (P - 1) / t);
}
}
void change(vector<int>& y) {
int n = y.size();
for (int i = 1, j = n >> 1; i < n - 1; i++) {
if (i < j) swap(y[i], y[j]);
int k = n / 2;
while (j >= k) {
j -= k;
k >>= 1;
}
if (j < k) j += k;
}
}
void ntt(vector<int>& y, int sgn = 1) {
int n = y.size();
change(y);
int id = 0;
for (int h = 2; h <= n; h <<= 1) {
id++;
for (int j = 0; j < n; j += h) {
int w = 1;
for (int k = j; k < j + h / 2; k++) {
int u = y[k];
int t = 1ll * w * y[k + h / 2] % P;
y[k] = (u + t) % P;
y[k + h / 2] = ((u - t) % P + P) % P;
w = (1ll * w * wn[id]) % P;
}
}
}
if (sgn == -1) {
for (int i = 1; i < n / 2; i++) swap(y[i], y[n - i]);
int inv = power(n, P - 2);
for (int i = 0; i < n; i++) y[i] = 1ll * y[i] * inv % P;
}
}
void mul(vector<int>& a, vector<int>& b, vector<int>& res) {
if (a.size() <= 10 && b.size() <= 10) {
vector<int> tmp;
tmp.resize(a.size() + b.size());
for (int i = 0; i < a.size(); i++)
for (int j = 0; j < b.size(); j++)
tmp[i + j] += 1ll * a[i] * b[j] % P, tmp[i + j] %= P;
res = tmp;
return;
}
vector<int> fa(a.begin(), a.end()), fb(b.begin(), b.end());
int n = 1;
while (n < (int)max(a.size(), b.size())) n <<= 1;
n <<= 1;
fa.resize(n);
fb.resize(n);
ntt(fa);
ntt(fb);
for (int i = 0; i < n; ++i) fa[i] = 1ll * fa[i] * fb[i] % P;
ntt(fa, -1);
res = fa;
}
vector<int> v[400000 + 10];
int Stirling(int n, int r) {
int nn = 1;
while (nn < n) nn <<= 1;
for (int i = 0; i < n; i++) v[i].push_back(i), v[i].push_back(1);
for (int i = n; i < nn; i++) v[i].push_back(1);
for (int w = nn; w > 1; w >>= 1) {
int hw = w >> 1;
for (int i = 0; i < hw; i++) mul(v[i], v[i + hw], v[i]);
}
return v[0][r];
}
int C(int n, int m) {
if (m < 0 || n < m) return 0;
int res = 1;
for (int i = n; i > n - m; i--) res = 1ll * res * i % P;
for (int i = 2; i <= m; i++) res = 1ll * res * power(i, P - 2) % P;
return res;
}
int main() {
get_wn();
int n, a, b;
cin >> n >> a >> b;
int ans = C(a + b - 2, a - 1);
ans = 1ll * ans * Stirling(n - 1, a + b - 2) % P;
printf("%d\n", ans);
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
void count_sort(vector<long long>& p, vector<long long>& c) {
long long n = p.size();
vector<long long> cnt(n);
for (auto x : c) cnt[x]++;
vector<long long> pos(n), p_new(n);
pos[0] = 0;
for (long long i = 1; i < n; i++) pos[i] = pos[i - 1] + cnt[i - 1];
for (auto x : p) {
long long i = c[x];
p_new[pos[i]] = x;
pos[i]++;
}
p = p_new;
}
int main() {
string s, t, str;
cin >> s >> t;
str = s;
long long sz = s.size();
s = s + '#';
s = s + t;
s = s + '$';
long long n = s.size();
vector<long long> p(n), c(n);
{
std::vector<pair<char, long long>> a(n);
for (long long i = 0; i < n; i++) a[i] = {s[i], i};
sort(a.begin(), a.end());
for (long long i = 0; i < n; i++) p[i] = a[i].second;
c[p[0]] = 0;
for (long long i = 1; i < n; i++) {
if (a[i].first == a[i - 1].first)
c[p[i]] = c[p[i - 1]];
else
c[p[i]] = c[p[i - 1]] + 1;
}
}
long long k = 0;
while ((1 << k) < n) {
for (long long i = 0; i < n; i++) {
p[i] = (p[i] - (1 << k) + n) % n;
}
count_sort(p, c);
vector<long long> c_new(n);
c_new[p[0]] = 0;
for (long long i = 1; i < n; i++) {
pair<long long, long long> prev = {c[p[i - 1]],
c[(p[i - 1] + (1 << k)) % n]};
pair<long long, long long> now = {c[p[i]], c[(p[i] + (1 << k)) % n]};
if (now == prev)
c_new[p[i]] = c_new[p[i - 1]];
else
c_new[p[i]] = c_new[p[i - 1]] + 1;
}
c = c_new;
k++;
}
k = 0;
vector<long long> lcp(n);
for (long long i = 0; i < n - 1; i++) {
long long pi = c[i];
long long j = p[pi - 1];
while (i + k < n && j + k < n && s[i + k] == s[j + k]) k++;
lcp[pi] = k;
k = max(k - 1, 0ll);
}
long long ans = LLONG_MAX;
for (long long i = 2; i < n; i++) {
if ((p[i] > sz && p[i - 1] < sz) || (p[i] < sz && p[i - 1] > sz)) {
long long val;
if (i + 1 >= n)
val = lcp[i - 1];
else
val = max(lcp[i - 1], lcp[i + 1]);
long long temp = lcp[i] - val;
if (temp > 0) {
ans = min(val + 1, ans);
}
}
}
if (ans == LLONG_MAX) {
if (str == t)
cout << str.size();
else
cout << -1;
return 0;
}
cout << ans;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr int N = 62;
LL C[N][N][N];
LL ans[N][N][N];
int n, m, q;
void load() {
cin >> n >> m >> q;
for (int c = 0; c < m; c++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> C[c][i][j];
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
C[c][i][j] = min(C[c][i][j], C[c][i][k] + C[c][k][j]);
}
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
load();
memset(ans, 0x3f3f3f3f, sizeof ans);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int c = 0; c < m; c++) {
ans[0][i][j] = min(ans[0][i][j], C[c][i][j]);
}
}
}
for (int x = 1; x <= n; x++) {
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
ans[x][i][j] = min(ans[x][i][j], ans[x - 1][i][k] + ans[0][k][j]);
}
}
}
}
while (q--) {
int s, f, x;
cin >> s >> f >> x;
s--;
f--;
x = min(n, x);
cout << ans[x][s][f] << "\n";
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, ans, res[N];
char s[N];
vector<int> p, cnt[N];
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i <= n; i++)
if (n % i == 0) {
cnt[i].resize(i);
p.push_back(i);
}
for (int i = 1; i <= n; i++)
for (int j = 0; j < p.size(); j++) {
int x = p[j];
if (s[i] == '1') cnt[x][i % x] ^= 1;
}
for (int i = 0; i < p.size(); i++) {
int x = p[i];
for (int j = 0; j < x; j++) res[x] |= cnt[x][j];
}
for (int i = 1; i <= n; i++) ans += !res[gcd(i, n)];
printf("%d", ans);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, K, C[65][65], f[65][65][2];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
inline int add(int a, int b) { return (a += b) >= mod ? a - mod : a; }
inline int sub(int a, int b) { return (a -= b) < 0 ? a + mod : a; }
inline int mul(int a, int b) { return 1LL * a * b % mod; }
inline int fast(int a, int b) {
int ret(1);
for (; b; b >>= 1, a = mul(a, a))
if (b & 1) ret = mul(ret, a);
return ret;
}
void pre() {
for (int i = 0; i <= 60; ++i) {
C[i][0] = C[i][i] = 1;
for (int j = 1; j < i; ++j) C[i][j] = add(C[i - 1][j], C[i - 1][j - 1]);
}
}
int main() {
n = read();
K = read();
pre();
f[0][0][1] = f[1][0][0] = 1;
for (int i = 2; i <= n; ++i)
for (int j = 1; j < i; ++j)
for (int k = 0; k <= (j >> 1); ++k)
for (int l = 0; l <= ((i - j - 1) >> 1); ++l)
for (int x = 0; x <= 1; ++x)
for (int y = 0; y <= 1; ++y) {
int z = (!(x & y));
if (k + l + z > K) continue;
int temp = mul(C[i - 2][j - 1], i);
f[i][k + l + z][z] =
add(f[i][k + l + z][z],
mul(mul(f[j][k][x], f[i - j - 1][l][y]), temp));
}
printf("%d\n", mul(add(f[n][K][0], f[n][K][1]), fast(n, mod - 2)));
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m;
cin >> n >> m;
string s[n];
for (long long i = 0; i < n; ++i) {
cin >> s[i];
}
vector<pair<pair<long long, long long>, long long>> v;
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
if (s[i][j] == '*') {
long long x = i, y = j, ss = 0;
long long x1 = i, x2 = i, y1 = j, y2 = j;
while (x1 >= 0 && x2 < n && y1 >= 0 && y2 < m && s[x1][y] == '*' &&
s[x2][y] == '*' && s[x][y1] == '*' && s[x][y2] == '*') {
x1--;
x2++;
y1--;
y2++;
ss++;
}
if (ss > 1) v.push_back({{x, y}, ss});
}
}
}
for (auto i : v) {
long long x = i.first.first;
long long y = i.first.second;
long long ss = i.second;
long long x1 = x, x2 = x, y1 = y, y2 = y;
while (ss--) {
s[x1][y] = s[x2][y] = s[x][y1] = s[x][y2] = '.';
x1--;
x2++;
y1--;
y2++;
}
}
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
if (s[i][j] == '*') {
cout << -1;
return 0;
}
}
}
cout << v.size() << "\n";
for (auto i : v) {
long long x = i.first.first;
long long y = i.first.second;
long long ss = i.second;
cout << x + 1 << " " << y + 1 << " " << ss - 1 << "\n";
}
return 0;
}
| 11 | CPP |
def main():
q = int(input())
for _ in range(q):
s = input()
m = int(input())
t = ["0" for __ in range(m)]
b = list(map(int, input().split()))
l = sorted(s)
d = {}
for x in s:
if x in d:
d[x] += 1
else:
d[x] = 1
while True:
idxs = []; num0s = 0
for c, el in enumerate(b):
if el == 0:
num0s += 1
#t[c] = l.pop()
idxs.append(c)
b[c] = -1
if not num0s:
break
while True:
chosen = l[-1]
freq = d[chosen]
if freq < num0s:
l = l[:-freq]
else:
for ix in idxs:
t[ix] = chosen
l = l[:-freq]
break
for i in range(len(b)):
for idx in idxs:
b[i] -= abs(i - idx)
#print(b)
print("".join(t))
main() | 10 | PYTHON3 |
n=int(input())
x,y,z=0,0,0
for i in range(n):
a,b,c=map(int,input().split())
x+=a
y+=b
z+=c
if [x,y,z]==[0,0,0]:print('YES')
else:print('NO')
| 7 | PYTHON3 |
s1 = input()
s2 = input()
s1U = s1.upper()
s2U = s2.upper()
t = input()
res = []
dL = {}
dU = {}
nums = [str(i) for i in range(10)]
for i in range(26):
dL[s1[i]] = s2[i]
dU[s1U[i]] = s2U[i]
for ch in t:
if ch in nums:
res.append(ch)
continue
if ch.islower():
res.append(dL[ch])
else:
res.append(dU[ch])
print(''.join(res)) | 8 | PYTHON3 |
N = int(input())
for _ in range(N):
input()
d = [int(x) for x in input().split()]
input()
j = [int(x) for x in input().split()]
print(
len([i for i in d if i % 2 == 0]) *
len([i for i in j if i % 2 == 0]) +
len([i for i in d if abs(i) % 2 == 1]) *
len([i for i in j if abs(i) % 2 == 1]))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
const int inf = 1034567891;
const long long LL_INF = 1234567890123456789ll;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T>
T GCD(T a, T b) {
long long t;
while (a) {
t = a;
a = b % a;
b = t;
}
return b;
}
template <typename T>
string toString(T a) {
return to_string(a);
}
template <typename T>
void toInt(string s, T& x) {
stringstream str(s);
str >> x;
}
inline int add(int x, int y) {
x += y;
if (x >= mod) x -= mod;
return x;
}
inline int sub(int x, int y) {
x -= y;
if (x < 0) x += mod;
return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % mod; }
inline int powr(int a, long long b) {
int x = 1 % mod;
while (b) {
if (b & 1) x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline int inv(int a) { return powr(a, mod - 2); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int test;
cin >> test;
while (test--) {
int n;
cin >> n;
vector<int> vec;
int v;
for (int i = 0; i < n; i++) {
cin >> v;
vec.push_back(v);
}
vector<vector<int>> cnt(n + 1, vector<int>(n + 1, 0));
long long ans = 0;
for (int j = n - 2; j >= 0; j--) {
for (int k = j + 2; k < n; k++) {
cnt[vec[j + 1]][vec[k]]++;
}
for (int i = 0; i < j; i++) {
ans += cnt[vec[i]][vec[j]];
}
}
cout << ans << '\n';
}
return 0;
}
| 10 | CPP |
#include<bits/stdc++.h>
#define ll long long
#define N 200010
#define mo 1000000007
using namespace std;
template <typename T> void read(T &x){
x=0;char c=getchar();int fh=1;
while (!isdigit(c)){if (c=='-')fh=-1;c=getchar();}
while (isdigit(c))x=x*10+c-'0',c=getchar();
x*=fh;
}
ll b,w,gb,gw,jie[N],nj[N];
ll c(ll x,ll y){if (x<y) return 0;return (jie[x]*nj[y]%mo)*nj[x-y]%mo;}
ll po(ll x,ll y){ll z=1;while (y){if (y%2)z=x*z%mo;x=x*x%mo;y/=2;}return z;}
int main(){
read(b);read(w);
gb=0;gw=0;jie[0]=1;
for (int i=1;i<=b+w;i++)jie[i]=jie[i-1]*i%mo;
nj[b+w]=po(jie[b+w],mo-2);for(int i=b+w-1;i>=0;i--) nj[i]=nj[i+1]*(i+1)%mo;
for (int i=1;i<=b+w;i++){
printf("%d\n",(1-gb+gw+mo)*po(2,mo-2)%mo);
gb=(gb+c(i-1,b-1)*po(po(2,i),mo-2))%mo;
gw=(gw+c(i-1,w-1)*po(po(2,i),mo-2))%mo;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, x;
scanf("%lld%lld", &a, &b);
long long cx = abs(a - b), cnt = 0;
if (!cx) {
cout << "infinity\n";
return 0;
}
for (int i = 1; i * i <= cx; i++) {
if (!(cx % i)) {
if ((i * i == cx) && cx % i == 0 && (i > b)) {
;
cnt++;
continue;
}
if (i > b) {
;
cnt++;
}
if ((cx / i) > b) {
;
cnt++;
}
}
}
cout << cnt << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b, c;
char s[105][105];
set<char> myset;
bool inmap(int x, int y) { return 0 <= x && x < n && 0 <= y && y < m; }
int step[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};
void hehe(int x, int y) {
for (int i = 0; i < 4; i++) {
int nowx = step[i][0] + x, nowy = step[i][1] + y;
if (!inmap(nowx, nowy) || !s[nowx][nowy]) continue;
myset.insert(s[nowx][nowy]);
}
}
char find(int x1, int y1, int x2, int y2) {
myset.clear();
for (int i = x1; i <= x2; i++)
for (int j = y1; j <= y2; j++) hehe(i, j);
for (int i = 0; i < 26; i++)
if (myset.find(i + 'a') == myset.end()) return i + 'a';
}
bool work() {
if ((n & 1) && (m & 1)) return false;
if (n * m > (2 * a + 2 * b + 4 * c)) return false;
memset(s, 0, sizeof s);
int h = 0, l = 0;
if (n & 1) {
for (int i = 0; i < m; i += 2)
s[0][i] = s[0][i + 1] = find(0, i, 0, i + 1), a--;
if (a < 0) return false;
h = 1;
}
if (m & 1) {
for (int i = 0; i < n; i += 2)
s[i][0] = s[i + 1][0] = find(i, 0, i + 1, 0), b--;
if (b < 0) return false;
l = 1;
}
a -= (a & 1);
b -= (b & 1);
if ((n - h) * (m - l) > (2 * a + 2 * b + 4 * c)) return false;
int i;
for (i = h; i < n; i += 2) {
int j = l;
while (a >= 2 && j < m) {
s[i][j] = s[i][j + 1] = find(i, j, i, j + 1);
s[i + 1][j] = s[i + 1][j + 1] = find(i + 1, j, i + 1, j + 1);
j += 2;
a -= 2;
}
while (b >= 2 && j < m) {
s[i][j] = s[i + 1][j] = find(i, j, i + 1, j);
s[i][j + 1] = s[i + 1][j + 1] = find(i, j + 1, i + 1, j + 1);
j += 2;
b -= 2;
}
while (c && j < m) {
s[i][j] = s[i][j + 1] = s[i + 1][j] = s[i + 1][j + 1] =
find(i, j, i + 1, j + 1);
j += 2;
c--;
}
if (j < m) return false;
}
if (i < n) return false;
return true;
}
int main() {
while (~scanf("%d %d %d %d %d", &n, &m, &a, &b, &c)) {
bool ans = work();
if (ans) {
for (int i = 0; i < n; i++) puts(s[i]);
} else
puts("IMPOSSIBLE");
}
return 0;
}
| 9 | CPP |
t=int(input())
for hh in range(0,t):
n=int(input())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[int(x) for x in input().split()]
p=[-1]*n
for i in range(0,n):
if(a[i]==b[i] and b[i]==c[i]):
p[i]=a[i]
prev=-2
for i in range(0,n):
if(p[i]==-1):
li=[]
li.append(a[i])
li.append(b[i])
li.append(c[i])
li.sort()
for j in range(0,3):
if li[j]!=prev:
p[i]=li[j]
break
prev=p[i]
prev=p[n-2]
prev2=p[0]
if p[n-1]==p[0]:
li=[]
li.append(a[i])
li.append(b[i])
li.append(c[i])
li.sort()
for j in range(0,3):
if li[j]!=prev and li[j]!=prev2:
p[i]=li[j]
break
print(*p)
| 7 | PYTHON3 |
import collections
n = int(input())
x = []
y = []
for i in range(n):
newx, newy, = map(int, input().strip().split())
x.append(newx)
y.append(newy)
print(min(len(set(x)), len(set(y))))
| 7 | PYTHON3 |
from sys import stdin
x = 0
n = int(stdin.readline())
for i in range(n):
a = stdin.readline().rstrip()
if a[1]=="+":
x += 1
else:
x -= 1
print(x)
| 7 | PYTHON3 |
from math import ceil
a, b, c = [int(x) for x in input().strip().split()]
x = ceil(a/c)
y = ceil(b/c)
print(x * y)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int b1(0), b2(0);
string s;
for (int i = 1; i <= 8; i++) {
cin >> s;
for (int j = 0; j < s.length(); j++) {
if (s[j] == 'Q') b1 += 9;
if (s[j] == 'R') b1 += 5;
if (s[j] == 'B') b1 += 3;
if (s[j] == 'N') b1 += 3;
if (s[j] == 'P') b1 += 1;
if (s[j] == 'K') b1 += 0;
if (s[j] == 'q') b2 += 9;
if (s[j] == 'r') b2 += 5;
if (s[j] == 'b') b2 += 3;
if (s[j] == 'n') b2 += 3;
if (s[j] == 'p') b2 += 1;
if (s[j] == 'k') b2 += 0;
}
}
if (b1 > b2)
cout << "White" << endl;
else if (b1 < b2)
cout << "Black" << endl;
else
cout << "Draw" << endl;
return 0;
}
| 7 | CPP |
n, m = int(input()), list(map(int, input().split()))
print(sum(m) / n)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
string tostring(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T>
int toint(T s) {
int v;
istringstream sin(tostring(s));
sin >> v;
return v;
}
vector<string> split(string sentence) {
istringstream iss(sentence);
vector<string> tokens;
copy(istream_iterator<string>(iss), istream_iterator<string>(),
back_inserter<vector<string> >(tokens));
return tokens;
}
string conversion(int a, int b) {
string cambio;
int suma = 0;
int coci = a;
while (coci > 0) {
cambio += tostring(coci % b);
coci = coci / b;
}
return string(cambio.rbegin(), cambio.rend());
}
int GCD(int a, int b) {
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int main() {
int n, k;
int i;
int a[1000000];
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
bool flag = true;
for (i = k; i <= n; i++) {
if (a[i] != a[k]) {
flag = false;
break;
}
}
if (!flag) {
cout << "-1" << endl;
return 0;
} else {
for (i = k; i >= 1; i--) {
if (a[i] != a[k]) {
cout << i << endl;
return 0;
}
}
cout << "0" << endl;
return 0;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
int n;
while (~scanf("%d", &n)) {
int a, b;
char log[50];
int x[105] = {0x3f3f3f3f}, time[105] = {0};
getchar();
for (int i = 1; i <= n; ++i) {
gets(log);
a = (log[1] - '0') * 10 + (log[2] - '0');
b = (log[4] - '0') * 10 + (log[5] - '0');
if (log[7] == 'a' && a == 12) {
a = 0;
}
if (log[7] == 'p' && a != 12) {
a += 12;
}
x[i] = a * 60 + b;
if (x[i] == x[i - 1]) {
time[i] = time[i - 1] + 1;
time[i] %= 10;
}
}
int answer = 0;
for (int i = 1; i <= n; ++i) {
if (x[i - 1] > x[i]) {
answer += 1;
} else if (x[i] == x[i - 1]) {
if (time[i] == 0) {
answer += 1;
}
}
}
printf("%d\n", answer);
}
return 0;
}
| 10 | CPP |
t=int(input())
for i in range(t):
s,a,b,co=[int(i) for i in input().split()]
t=s%(a*co)
c=s//(a*co)
c=c*a+(c*b)
c=c+(t//co)
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100100, P = 1000000007;
int i, j, k, n, m, ch, o, x, nls, ans;
int a[N], Ls[N], cnt[N], st[N], vl[N], vr[N], rk[N], p[N], z[N], Tr[N];
struct tree {
tree *l, *r;
int sum, num, sm2, ad;
} T[N << 3], *cur, *rta[N], *rtb[N];
void R(int &x) {
x = 0;
ch = getchar();
while (ch < '0' || '9' < ch) ch = getchar();
while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
}
void W(int x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) W(x / 10);
putchar(x % 10 + '0');
}
int find(int x) {
int l = 1, r = nls, mid;
while (l < r) {
mid = (l + r) >> 1;
if (Ls[mid] == x) return mid;
if (Ls[mid] < x)
l = mid + 1;
else
r = mid - 1;
}
return l;
}
void T_add(int x, int y) {
for (; x <= n; x += x & -x) Tr[x] = (Tr[x] + y) % P;
}
int T_query(int x) {
int y = 0;
for (; x; x -= x & -x) y = (y + Tr[x]) % P;
return y;
}
void up(tree *k) {
k->sum = (k->l->sum + k->r->sum) % P;
k->num = (k->l->num + k->r->num) % P;
k->sm2 = (k->l->sm2 + k->r->sm2) % P;
}
void down(tree *k) {
if (k->ad) {
k->l->ad = (k->l->ad + k->ad) % P;
k->l->sm2 = ((long long)k->l->sum * k->ad + k->l->sm2) % P;
k->r->ad = (k->r->ad + k->ad) % P;
k->r->sm2 = ((long long)k->r->sum * k->ad + k->r->sm2) % P;
k->ad = 0;
}
}
void Ta_build(int L, int R, tree *&k) {
k = ++cur;
k->l = k->r = T;
k->sum = k->num = k->sm2 = k->ad = 0;
if (L == R) {
k->sum = vl[p[st[i] + L]];
k->num = 1;
k->sm2 = (long long)vl[p[st[i] + L]] * (cnt[i] - L) % P;
return;
}
int mid = (L + R) >> 1;
Ta_build(L, mid, k->l);
Ta_build(mid + 1, R, k->r);
up(k);
}
void Tb_build(int L, int R, tree *&k) {
k = ++cur;
k->l = k->r = T;
k->sum = k->num = k->sm2 = k->ad = 0;
if (L == R) {
k->sum = vr[p[st[i] + L]];
k->num = 1;
k->sm2 = (long long)vr[p[st[i] + L]] * (L - 1) % P;
return;
}
int mid = (L + R) >> 1;
Tb_build(L, mid, k->l);
Tb_build(mid + 1, R, k->r);
up(k);
}
int T_sum(int L, int R, int l, int r, tree *k) {
if (l > r) return 0;
if (L == l && R == r) return k->sum;
down(k);
int mid = (L + R) >> 1;
if (r <= mid) return T_sum(L, mid, l, r, k->l);
if (l > mid) return T_sum(mid + 1, R, l, r, k->r);
return (T_sum(L, mid, l, mid, k->l) + T_sum(mid + 1, R, mid + 1, r, k->r)) %
P;
}
int T_num(int L, int R, int l, int r, tree *k) {
if (l > r) return 0;
if (L == l && R == r) return k->num;
down(k);
int mid = (L + R) >> 1;
if (r <= mid) return T_num(L, mid, l, r, k->l);
if (l > mid) return T_num(mid + 1, R, l, r, k->r);
return (T_num(L, mid, l, mid, k->l) + T_num(mid + 1, R, mid + 1, r, k->r)) %
P;
}
int T_sm2(int L, int R, int l, int r, tree *k) {
if (l > r) return 0;
if (L == l && R == r) return k->sm2;
down(k);
int mid = (L + R) >> 1;
if (r <= mid) return T_sm2(L, mid, l, r, k->l);
if (l > mid) return T_sm2(mid + 1, R, l, r, k->r);
return (T_sm2(L, mid, l, mid, k->l) + T_sm2(mid + 1, R, mid + 1, r, k->r)) %
P;
}
void T_change0(int L, int R, int x, tree *k) {
if (L == R) {
k->num = 0;
k->sum = 0;
k->sm2 = 0;
return;
}
down(k);
int mid = (L + R) >> 1;
if (x <= mid)
T_change0(L, mid, x, k->l);
else
T_change0(mid + 1, R, x, k->r);
up(k);
}
void T_change1(int L, int R, int x, int t1, int t2, tree *k) {
if (L == R) {
k->num = 1;
k->sum = t1;
k->sm2 = t2;
return;
}
down(k);
int mid = (L + R) >> 1;
if (x <= mid)
T_change1(L, mid, x, t1, t2, k->l);
else
T_change1(mid + 1, R, x, t1, t2, k->r);
up(k);
}
void T_add(int L, int R, int l, int r, int ad, tree *k) {
if (l > r) return;
if (L == l && R == r) {
k->ad = (k->ad + ad) % P;
k->sm2 = ((long long)k->sum * ad + k->sm2) % P;
return;
}
down(k);
int mid = (L + R) >> 1;
if (r <= mid)
T_add(L, mid, l, r, ad, k->l);
else {
if (l > mid)
T_add(mid + 1, R, l, r, ad, k->r);
else
T_add(L, mid, l, mid, ad, k->l), T_add(mid + 1, R, mid + 1, r, ad, k->r);
}
up(k);
}
int main() {
cur = T;
R(n);
for (i = 1; i <= n; i++) R(a[i]), Ls[i] = a[i];
sort(Ls + 1, Ls + n + 1);
Ls[n + 1] = -1;
for (i = 1; i <= n; i++)
if (Ls[i] != Ls[i + 1]) Ls[++nls] = Ls[i];
for (i = 1; i <= n; i++) {
a[i] = find(a[i]);
cnt[a[i]]++;
rk[i] = cnt[a[i]];
}
for (i = 1; i <= nls; i++) st[i] = st[i - 1] + cnt[i - 1];
for (i = 1; i <= n; i++) {
vl[i] = T_query(a[i]);
T_add(a[i], 1);
}
for (i = 1; i <= nls; i++) Tr[i] = 0;
for (i = n; i; i--) {
vr[i] = T_query(a[i]);
T_add(a[i], 1);
}
for (i = 1; i <= n; i++) p[st[a[i]] + rk[i]] = i;
for (i = 1; i <= nls; i++)
Ta_build(1, cnt[i], rta[i]), Tb_build(1, cnt[i], rtb[i]);
for (i = 1; i <= n; i++) {
int suma = T_sum(1, cnt[a[i]], 1, rk[i] - 1, rta[a[i]]),
sumb = T_sum(1, cnt[a[i]], rk[i] + 1, cnt[a[i]], rtb[a[i]]);
ans = ((long long)suma * sumb + ans) % P;
}
R(m);
for (i = 1; i <= m; i++) {
R(o);
R(x);
if (o == 1) {
if (!z[x]) {
z[x] = 1;
int numa = T_num(1, cnt[a[x]], rk[x], cnt[a[x]], rta[a[x]]),
numb = T_num(1, cnt[a[x]], 1, rk[x], rtb[a[x]]);
int suma = T_sum(1, cnt[a[x]], 1, rk[x] - 1, rta[a[x]]),
sumb = T_sum(1, cnt[a[x]], rk[x] + 1, cnt[a[x]], rtb[a[x]]);
int sm2a = T_sm2(1, cnt[a[x]], 1, rk[x] - 1, rta[a[x]]),
sm2b = T_sm2(1, cnt[a[x]], rk[x] + 1, cnt[a[x]], rtb[a[x]]);
int ta = (sm2a + P - (long long)numa * suma % P) % P,
tb = (sm2b + P - (long long)numb * sumb % P) % P;
ans = (ans + P - (long long)suma * sumb % P) % P;
ans =
(ans + P - ((long long)ta * vr[x] + (long long)tb * vl[x]) % P) % P;
T_change0(1, cnt[a[x]], rk[x], rta[a[x]]);
T_change0(1, cnt[a[x]], rk[x], rtb[a[x]]);
T_add(1, cnt[a[x]], 1, rk[x] - 1, P - 1, rta[a[x]]);
T_add(1, cnt[a[x]], rk[x] + 1, cnt[a[x]], P - 1, rtb[a[x]]);
}
} else {
if (z[x]) {
z[x] = 0;
int numa = T_num(1, cnt[a[x]], rk[x], cnt[a[x]], rta[a[x]]),
numb = T_num(1, cnt[a[x]], 1, rk[x], rtb[a[x]]);
int suma = T_sum(1, cnt[a[x]], 1, rk[x] - 1, rta[a[x]]),
sumb = T_sum(1, cnt[a[x]], rk[x] + 1, cnt[a[x]], rtb[a[x]]);
int sm2a = T_sm2(1, cnt[a[x]], 1, rk[x] - 1, rta[a[x]]),
sm2b = T_sm2(1, cnt[a[x]], rk[x] + 1, cnt[a[x]], rtb[a[x]]);
int ta = (sm2a + P - (long long)numa * suma % P) % P,
tb = (sm2b + P - (long long)numb * sumb % P) % P;
ans = (ans + (long long)suma * sumb) % P;
ans = (ans + (long long)ta * vr[x] + (long long)tb * vl[x]) % P;
T_change1(1, cnt[a[x]], rk[x], vl[x], (long long)vl[x] * numa % P,
rta[a[x]]);
T_change1(1, cnt[a[x]], rk[x], vr[x], (long long)vr[x] * numb % P,
rtb[a[x]]);
T_add(1, cnt[a[x]], 1, rk[x] - 1, 1, rta[a[x]]);
T_add(1, cnt[a[x]], rk[x] + 1, cnt[a[x]], 1, rtb[a[x]]);
}
}
W(ans);
puts("");
}
}
| 11 | CPP |
n, a = int(input()), list(map(int, input().split()))
*b, = reversed(a)
print(max(len(a) - min(a.index(n), a.index(1)) - 1, len(b) - min(b.index(n), b.index(1)) - 1)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
string ans="No";
if(N%10==9|N>=90)ans="Yes";
cout<<ans<<endl;
} | 0 | CPP |
#include <cstdio>
#include <cstring>
const int N = 2e5 + 5;
char s[N];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1), cnt = 0;
long long ans = 0;
for (int i = 1; i <= n - 2; i++) {
if (s[i] == 'A') {
if (s[i + 1] == 'B' && s[i + 2] == 'C') {
ans += cnt + 1, s[i + 2] = 'A', i++;
} else {
cnt++;
}
} else {
cnt = 0;
}
}
printf("%lld\n", ans);
return 0;
} | 0 | CPP |
# Legends Always Come Up with Solution
import os
import sys
from io import BytesIO, IOBase
import bisect
import math
def getprimes(x):
a=0
while x % 2 == 0:
x //= 2
a+=1
for i in range(3,math.floor(math.sqrt(x)) + 1, 2):
while x % i == 0:
x//=i
a+=1
if x>1:
a+=1
return a
def main():
t = int(input())
while t:
a,b,k = [int(i) for i in input().split()]
if(k==1):
if(a==b):
print("NO")
elif(math.gcd(a,b)==min(a,b)):
print("YES")
else:
print("NO")
elif(k>getprimes(a)+getprimes(b)):
print("NO")
else:
print("YES")
t-=1
# 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")
if __name__ == "__main__":
main()
| 10 | PYTHON3 |
n = int(input())
stones = {"purple":"Power","green":"Time","blue":"Space","orange":"Soul","red":"Reality","yellow":"Mind"}
for i in range(0,n):
a = input()
del stones[a]
print(len(stones))
print("\n")
for i in stones:
print(stones[i]) | 7 | PYTHON3 |
def check(arr,n):
f = arr[0:n]
l = arr[n:]
freqf = [False]*n
freql = [False]*(len(arr)-n)
for i in f:
try:
freqf[i-1] = True
except:
pass
for i in l:
try:
freql[i-1] = True
except:
pass
for i in freqf:
if not i:
return False
for i in freql:
if not i:
return False
return True
for _ in range(int(input())):
n = int(input())
arr = [int(s) for s in input().split()]
max=0
for i in arr:
if i>max:
max=i
count=0
ans=""
if check(arr,max):
count+=1
ans+=(str(max)+" "+str(n-max)+"\n")
if max!=n-max and check(arr,n-max):
count+=1
ans+=(str(n-max)+" "+str(max)+"\n")
print(count)
print(ans,end="") | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N = 1000;
vector<vector<int> > a(2 * N);
vector<int> ans(2 * N, 0);
void BFS() {
queue<int> Q;
Q.push(0);
ans[0] = 0;
bool was[2 * N];
was[0] = 1;
for (int i = 0; i < 2 * N; i++) {
was[i] = false;
}
while (!Q.empty()) {
int y = Q.front();
Q.pop();
for (int i = 0; i < a[y].size(); i++) {
int k = a[y][i];
if (was[k]) continue;
was[k] = true;
ans[k] = 1 + ans[y];
Q.push(k);
}
}
}
char buffer[1001];
int main() {
int c, d;
cin >> c >> d;
for (int i = 0; i < c; ++i) {
for (int j = 0; j < d; ++j) {
char k;
cin >> k;
if (k == '#') {
a[i].push_back(j + c);
a[c + j].push_back(i);
}
}
}
BFS();
if (ans[c - 1] == 0)
puts("-1");
else {
cout << ans[c - 1];
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using matr = vector<vector<ll>>;
using dbl = long double;
using ui = unsigned int;
mt19937 rnd;
ll random(ll limit) {
uniform_int_distribution<ll> uniform_dist(0, limit);
return uniform_dist(rnd);
}
int max_p(int a, vector<int>& p) {
int ans = 1;
for (auto q : p) {
if (a % q == 0) return a / q;
}
}
int main() {
rnd = mt19937(956231);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<bool> x(n + 1, true);
vector<int> p;
for (int i = 2; i <= n; i++) {
if (x[i]) {
p.push_back(i);
for (int j = i * 2; j <= n; j += i) {
x[j] = false;
}
}
}
vector<int> num(n + 1);
num[1] = 1;
for (int i = 2; i <= n; i++) {
if (x[i])
num[1]++;
else {
int a = max_p(i, p);
num[a]++;
}
}
int s = 0;
int i = 1;
for (int t = 2; t <= n; t++) {
while (i <= n && s < t) {
s += num[i];
i++;
}
cout << i - 1 << ' ';
}
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define TemplateVersion "3.4.1"
// Useful Marcos
//====================START=====================
// Compile use C++11 and above
#ifdef LOCAL
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it)
{
}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
cerr << *it << " = " << a << endl;
err(++it, args...);
}
#define MSG cout << "Finished" << endl
#else
#define debug(args...)
#define MSG
#endif
#if __cplusplus >= 201703L
template <typename... Args>
void readln(Args &... args)
{
((cin >> args), ...);
}
template <typename... Args>
void writeln(Args... args)
{
((cout << args << " "), ...);
cout << endl;
}
#elif __cplusplus >= 201103L
void readln()
{
}
template <typename T, typename... Args>
void readln(T &a, Args &... args)
{
cin >> a;
readln(args...);
}
void writeln()
{
cout << endl;
}
template <typename T, typename... Args>
void writeln(T a, Args... args)
{
cout << a << " ";
writeln(args...);
}
#endif
#if __cplusplus >= 201103L
#define FOR(_i, _begin, _end) for (auto _i = _begin; _i < _end; _i++)
#define FORR(_i, _begin, _end) for (auto _i = _begin; _i > _end; _i--)
#else
#define FOR(_i, _begin, _end) for (int _i = (int)_begin; _i < (int)_end; _i++)
#define FORR(_i, _begin, _end) for (int _i = (int)_begin; _i > (int)_end; _i--)
#define nullptr NULL
#endif
#if __cplusplus >= 201103L
#define VIS(_kind, _name, _size) \
vector<_kind> _name(_size); \
for (auto &i : _name) \
cin >> i;
#else
#define VIS(_kind, _name, _size) \
vector<_kind> _name; \
_name.resize(_size); \
for (int i = 0; i < _size; i++) \
cin >> _name[i];
#endif
// alias
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define tcase() \
int T; \
cin >> T; \
FOR(kase, 1, T + 1)
// Swap max/min
template <typename T>
bool smax(T &a, const T &b)
{
if (a > b)
return false;
a = b;
return true;
}
template <typename T>
bool smin(T &a, const T &b)
{
if (a < b)
return false;
a = b;
return true;
}
// ceil divide
template <typename T>
T cd(T a, T b)
{
return (a + b - 1) / b;
}
// min exchange
template <typename T>
bool se(T &a, T &b)
{
if (a < b)
return false;
swap(a, b);
return true;
}
// A better MAX choice
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fLL;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef set<int> si;
typedef vector<string> cb;
//====================END=====================
// Constants here
// Pre-Build Function
inline void build()
{
}
// Actual Solver
inline void solve()
{
int r, s, p, x, y;
readln(r, s, p);
vector<int> v(p);
for (auto &i : v)
{
readln(x, y);
if (y > s)
y -= s;
else
y = s - y + 1;
i = y + r - x;
}
sort(all(v), [](const int &a, const int &b) { return a > b; });
int ans = 0;
for (int i = 0; i < p; i++)
smax(ans, i + 1 + v[i]);
cout << ans << '\n';
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#ifdef LOCAL
clock_t _begin = clock();
#endif
build();
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << (double)(clock() - _begin) * 1000 / CLOCKS_PER_SEC << "ms." << endl;
#endif
return 0;
}
| 0 | CPP |
n=int(input())
a=list(map(int,input().split()))
s=set()
non=0
for x in a:
tmp=x//400
if tmp<8:
s.add(tmp)
else:
non+=1
print(max(1,len(s)),len(s)+non)
| 0 | PYTHON3 |
import math
a= int(input())
result = math.ceil(a/5)
print(result) | 7 | PYTHON3 |
year=int(input())
while True:
year=str(int(year)+1)
if(len(set(year))==4):
break
print(year)
| 7 | PYTHON3 |
/*
* 0158.cpp
*
* Created on: 2011/07/27
* Author: isa
*/
#include <iostream>
#include <cstring>
using namespace std;
int m[1000001];
void func(long long num, int times){
if(num > 1000000 || m[num] != -1) return;
m[num] = times;
func(num*2,times+1);
if((num-1)%3 == 0 && ((num-1)/3)%2 == 1){
func((num-1)/3, times+1);
}
}
int main(void){
int n;
memset(m,-1,sizeof(m));
m[1] = 0;
func(2,1);
while(cin >> n && n) cout << m[n] << endl;
} | 0 | CPP |
#include <iostream>
#include <vector>
using lint = long long;
constexpr lint INF = 1LL << 62;
void solve() {
int n, q;
lint t;
std::cin >> n >> t >> q;
std::vector<lint> xs(n);
std::vector<int> ds(n);
for (int i = 0; i < n; ++i) {
std::cin >> xs[i] >> ds[i];
}
xs.insert(xs.begin(), -INF);
xs.push_back(INF);
ds.insert(ds.begin(), 1);
ds.push_back(2);
while (q--) {
int i;
std::cin >> i;
if (ds[i] == 1) {
int j = i;
while (ds[j + 1] == 1) ++j;
lint dst = (xs[j] + xs[j + 1]) / 2;
std::cout << std::min(dst, xs[i] + t) << std::endl;
} else {
int j = i;
while (ds[j - 1] == 2) --j;
lint dst = (xs[j] + xs[j - 1]) / 2;
std::cout << std::max(dst, xs[i] - t) << std::endl;
}
}
}
int main() {
std::cin.tie(nullptr);
std::cout.tie(nullptr);
std::ios::sync_with_stdio(false);
solve();
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T abs(T a) {
return a > 0 ? a : -a;
}
int n;
int m;
vector<pair<int, int> > g[100000];
bool w[100000];
int col[100000];
int ans = 0;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void dfs(int u, int c) {
w[u] = false;
col[u] = c;
for (int i = 0; i < (((int)(g[u]).size())); i++) {
int v = g[u][i].first;
int cc = c + g[u][i].second;
if (w[v]) {
dfs(v, cc);
} else {
ans = gcd(ans, abs(cc - col[v]));
}
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < (m); i++) {
int u, v;
scanf("%d%d", &u, &v);
u--;
v--;
g[u].push_back(make_pair(v, 1));
g[v].push_back(make_pair(u, -1));
}
memset(w, true, sizeof(w));
for (int i = 0; i < (n); i++) {
if (w[i]) {
dfs(i, 0);
}
}
cout << (ans ? ans : n) << endl;
return 0;
}
| 9 | CPP |
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
A = set(map(int, input().split()))
B = set(map(int, input().split()))
mod = 10**9 + 7
row = col = 0
cnt = 0
ans = 1
for x in range(1, N*M+1)[::-1]:
if x in A and x in B:
row += 1
col += 1
elif x in A:
row += 1
ans = ans * col % mod
elif x in B:
col += 1
ans = ans * row % mod
else:
if col * row - cnt > 0:
ans = ans * (col * row - cnt) % mod
else:
ans = 0
break
cnt += 1
for i in range(1, N * M - cnt + 1):
ans = ans * i % mod
print(ans)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
if (n % 2 == 1 && m % 2 == 1 || n == 1 && m > 2 || m == 1 && n > 2) {
puts("1");
printf("%d %d 1 1\n", n, m);
for (int i = (1); i < (n + 1); ++i) {
if (i % 2 == 1)
for (int j = 1; j <= m; ++j) printf("%d %d\n", i, j);
else
for (int j = m; j >= 1; --j) printf("%d %d\n", i, j);
}
puts("1 1");
} else if (m % 2 == 1) {
puts("0");
for (int i = (1); i < (n + 1); ++i) printf("%d 1\n", i);
for (int i = (1); i < (n + 1); ++i) {
if (i % 2 == 1) {
for (int j = 2; j <= m; ++j) printf("%d %d\n", n - i + 1, j);
} else {
for (int j = m; j >= 2; --j) printf("%d %d\n", n - i + 1, j);
}
}
puts("1 1");
} else {
cout << 0 << endl;
for (int j = (1); j < (m + 1); ++j) printf("1 %d\n", j);
for (int j = (1); j < (m + 1); ++j) {
if (j % 2 == 1) {
for (int i = 2; i <= n; ++i) printf("%d %d\n", i, m - j + 1);
} else {
for (int i = n; i >= 2; --i) printf("%d %d\n", i, m - j + 1);
}
}
puts("1 1");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int grundy(int x) {
if (x < 2)
return x;
else if (x == 3)
return (k % 2);
else if (x % 2)
return 0;
else {
int res = 0;
set<int> st;
st.insert(grundy(x - 1));
st.insert((k % 2) * grundy(x / 2));
while (st.count(res)) res++;
return res;
}
}
int main() {
int i, a, x = 0;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &a);
x ^= grundy(a);
}
if (x)
puts("Kevin");
else
puts("Nicky");
return 0;
}
| 9 | CPP |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
string s1, s2;
int main() {
while (1) {
cin >> s1;
if (s1[0] == '.') break;
cin >> s2;
vector<string> d1, d2;
if (s1 == s2) {
cout << "IDENTICAL" << endl;
continue;
}
string temp = "";
for (ll i = 0; i < s1.size(); i++) {
if (s1[i] == '"') d1.push_back(temp), temp = "";
else temp += s1[i];
}
d1.push_back(temp);
temp = "";
for (ll i = 0; i < s2.size(); i++) {
if (s2[i] == '"') d2.push_back(temp), temp = "";
else temp += s2[i];
}
d2.push_back(temp);
if (d1.size() != d2.size()) {
cout << "DIFFERENT" << endl;
continue;
}
ll counter = 0;
for (ll i = 0; i < d1.size(); i++) if (d1[i] != d2[i]) {
if (i % 2 == 0) counter += 2;
else counter++;
}
if (counter == 1) cout << "CLOSE" << endl;
else cout << "DIFFERENT" << endl;
}
}
| 0 | CPP |
for e in list(open(0))[:-1]:h,w=map(int,e.split());print(('#'*w+'\n')*h)
| 0 | PYTHON3 |
n=int(input())
for _ in range(n):
s=input()
l=[]
a=b=0
for c in s:
if c==a:
b+=1
else:
if b%2>0 and not a in l:
l+=[a]
a=c
b=1
if b%2>0 and not a in l:
l+=[a]
print(*sorted(l),sep='') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
x = 0;
char c = getchar();
int f = 1;
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = 10 * x + c - '0';
c = getchar();
}
x *= f;
}
int main() {
int n;
read(n);
if (n == 1) {
printf("1");
return 0;
}
if (n == 2 || n == 4 || n == 5) {
printf("3");
return 0;
}
for (int i = 5; i <= 10000; i++) {
if (i & 1) {
int l = 3, r = (i * i + 1) / 2;
if (n >= l && n <= r) {
printf("%d", i);
return 0;
}
} else if (n % 4 == 0) {
int x = n, mx = (i - 2) / 2;
mx = (mx * mx + 1) / 2;
if (mx * 4 >= x) {
printf("%d", i);
return 0;
}
}
}
return 0;
}
| 7 | CPP |
from math import ceil
def solve(n, k):
if k == 1:
return n - 1
if k == 2:
if n > 1:
return n - 1
else:
return -1
if k == 3:
if n > 2:
return n - 1
else:
return -1
if k in {4, 5}:
if n > 1:
return n - 2
else:
return -1
if 2 * n + 1 <= len(bin(3 * k)[2:]):
return -1
else:
return n - ceil((len(bin(3 * k)[2:]) - 1) / 2)
for i in range(int(input())):
n, k = map(int, input().split())
a = solve(n, k)
if a == -1:
print('NO')
else:
print('YES', a)
| 10 | PYTHON3 |
kg = int(input())
print("YES" if kg % 2 == 0 and kg != 2 else "NO") | 7 | PYTHON3 |
def main():
n, m = list(map(int, input().split()))
if m> n:
n,m = m,n
if n%2 ==0 and m%2==0:
print('Malvika')
elif n%2==1 and m%2==0:
print('Malvika')
else:
print('Akshat')
if __name__ == "__main__":
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int nax = 1e3 + 5;
int n, m, K;
string s, t;
int dp[nax][nax][11][3];
int go(int i, int j, int k, int flag) {
if (i == n || j == m) return 0;
int& ans = dp[i][j][k][flag];
if (ans != -1) return ans;
ans = -1e9;
if (s[i] == t[j]) {
if (flag) {
ans = max(ans, go(i + 1, j + 1, k, flag) + 1);
ans = max(ans, go(i + 1, j + 1, k, 0) + 1);
} else {
if (k - 1 >= 0) ans = max(ans, go(i + 1, j + 1, k - 1, 1) + 1);
}
}
if (i + 1 <= n) ans = max(ans, go(i + 1, j, k, 0));
if (j + 1 <= m) ans = max(ans, go(i, j + 1, k, 0));
return ans;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
memset(dp, -1, sizeof dp);
cin >> n >> m >> K;
cin >> s >> t;
cout << go(0, 0, K, 0) << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long inf = 1e18, mod = 1e9 + 7;
double pi = 3.14;
long long gcd(long long a, long long b) {
while (a > 0) {
if (a > b) {
swap(a, b);
}
b %= a;
}
return b;
}
long long nok(long long a, long long b) { return b; }
long long min3(long long a, long long b, long long c) {
a = min(a, b);
a = min(a, c);
return a;
}
int main() {
long long n, m, maxans = 0, max1 = 0, uk = 0, uk1 = 0;
cin >> n >> m;
long long ar[n][m];
for (int i = 0; i < n; i++) {
long long nowans = 0;
for (int j = 0; j < m; j++) {
cin >> ar[i][j];
if (ar[i][j] != j + 1) {
nowans++;
}
}
if (maxans < nowans) {
uk = i;
maxans = nowans;
}
}
if (maxans > 4) {
cout << "NO";
} else if (maxans <= 2) {
cout << "YES";
} else {
bool can = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
long long maxan = 0;
for (int q = 0; q < n; q++) {
long long nowan = 0;
for (int x = 0; x < m; x++) {
if (x == i) {
if (ar[q][j] != x + 1) {
nowan++;
}
} else if (x == j) {
if (ar[q][i] != x + 1) {
nowan++;
}
} else {
if (ar[q][x] != x + 1) {
nowan++;
}
}
}
maxan = max(maxan, nowan);
}
if (maxan <= 2) {
can = 1;
}
}
}
if (can) {
cout << "YES";
} else {
cout << "NO";
}
}
return 0;
}
| 8 | CPP |
n=int(input())
p1=0
s1=0
p2=0
s2=0
for i in range(0,n):
txy=input().split()
t=int(txy[0])
x=int(txy[1])
y=int(txy[2])
if(t==1):
p1+=10
s1+=x
else:
p2+=10
s2+=x
if(s1>=p1/2):
print("LIVE")
else:
print("DEAD")
if(s2>=p2/2):
print("LIVE")
else:
print("DEAD")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int const N = 2 * 1e5 + 9;
int arr[N];
long long seg[N * 4];
void build(int node, int l, int r) {
if (l == r) {
seg[node] = arr[l];
return;
}
int mid = (l + r) / 2;
build(node * 2, l, mid), build(node * 2 + 1, mid + 1, r);
seg[node] = min(seg[node * 2], seg[node * 2 + 1]);
}
long long query(int node, int l, int r, int s, int e) {
if (r < s || l > e) return 1e15;
if (l >= s && r <= e) return seg[node];
int mid = (l + r) / 2;
return min(query(node * 2, l, mid, s, e),
query(node * 2 + 1, mid + 1, r, s, e));
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < int(n); ++i) {
cin >> arr[i];
}
build(1, 0, n - 1);
int p1 = 0, p2 = n - 1, ans = 0, final = -1, last_index = 0;
while (p1 <= p2) {
int smallest = (arr[p1] < arr[p2]) ? arr[p1] : arr[p2];
bool flag = false;
if (query(1, 0, n - 1, p1, p2) < smallest) {
final = query(1, 0, n - 1, p1, p2);
p1++;
flag = true;
last_index = p1 - 1;
}
if (!flag) {
if (arr[p1] < arr[p2])
p1++;
else
p2--;
}
}
int as = 0;
if (final != -1) {
for (int i = last_index; i < n; i++) {
if (arr[i] == final) {
as = i;
break;
}
}
}
cout << as << '\n';
}
}
| 9 | CPP |
n = input()
s = input().strip()
a, d = 0, 0
for i in s:
if i == 'A':
a += 1
else:
d += 1
if a > d:
print('Anton')
elif d > a:
print('Danik')
else:
print('Friendship')
| 7 | PYTHON3 |
a = input()
b, c = a.split()
b=int(b)
c=int(c)
for i in range(c):
if b %10 !=0:
b-=1
else:
b//=10
print(b) | 7 | PYTHON3 |
test_cases = int(input())
for i in range(0, test_cases):
l = int(input())
tel = list(map(str, input()))
if "8" not in tel:
print("NO")
continue
tel = tel[tel.index("8"):]
if len(tel) < 11:
print("NO")
continue
print("YES") | 7 | PYTHON3 |
import math
t = int(input())
for _ in range(t):
a, b = list(map(int,input().rstrip().split()))
b = str(b)
tmp = len(b) - 1
if(b.count('9')==len(b)):
tmp += 1
print(int(a*tmp)) | 8 | PYTHON3 |
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline()
# ------------------------------
def RL(): return map(int, sys.stdin.readline().split())
def RLL(): return list(map(int, sys.stdin.readline().split()))
def N(): return int(input())
def print_list(l):
print(' '.join(map(str,l)))
# sys.setrecursionlimit(300000)
from heapq import *
# from collections import deque as dq
# from math import ceil,floor,sqrt,pow
# import bisect as bs
# from collections import Counter
# from collections import defaultdict as dc
# from functools import lru_cache
a = RLL()
a.sort(reverse=True)
n = N()
b = RLL()
res = float('inf')
heap = [(b[i]-a[0],i) for i in range(n)]
heapify(heap)
m = max(b)-a[0]
count = [0]*n
while 1:
v,i = heap[0]
res = min(res,m-v)
count[i]+=1
if count[i]==6:
break
t = b[i]-a[count[i]]
m = max(m,t)
heapreplace(heap,(t,i))
print(res)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = (int)1e5 + 1;
int n, m;
int a, b, c;
vector < int > g[maxn];
int u[maxn], ans;
void dfs(int v){
u[v] = 1;
for(int i : g[v]){
if(!u[i]){
dfs(i);
}
}
}
int main(){
cin >> n >> m;
for(int i = 1; i <= m; i++){
cin >> a >> b >> c;
g[a].push_back(b);
g[b].push_back(a);
}
for(int i = 1; i <= n; i++){
if(!u[i]){
ans++;
dfs(i);
}
}
cout << ans;
}
| 0 | CPP |
n,*a=map(int,open(0))
b=sorted(a)
for i in range(n):
print([b[-2],b[-1]][a[i]<b[-1]]) | 0 | PYTHON3 |
from math import ceil
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
a[i]=ceil((a[i]-i)/n)
mini=min(a)
print(a.index(mini)+1) | 8 | PYTHON3 |
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=set(map(int,input().split()))
t=0
p=0
q=0
s=0
for i, x in enumerate(a):
if i+1 in b:
t += x*s
p += x - q
q = 0
else:
t += x*p
p += x - q
q = x
s += x
if n not in b and 1 not in b:
t += a[-1]*a[0]
print(t)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool a(long long int n) {
if (n == 0) return false;
return (ceil(log2(n)) == floor(log2(n)));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int a, b, c, d;
cin >> a >> b >> c >> d;
long long int e = max((3 * a) / 10, (a - (a / 250) * c));
long long int f = max((3 * b) / 10, (b - (b / 250) * d));
if (e > f)
cout << "Misha" << endl;
else if (f > e)
cout << "Vasya" << endl;
else
cout << "Tie" << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct bian {
int nxt, to;
} bi[400040];
int n, m, k, qnum, head[200020], num;
inline void add(int from, int to) {
bi[++num] = bian{head[from], to};
head[from] = num;
}
int id[200020], idnum, up[200020][18], dep[200020];
void dfs(int v, int fa) {
id[v] = ++idnum;
dep[v] = dep[fa] + 1;
up[v][0] = fa;
for (int i = 1; i <= 17; ++i) up[v][i] = up[up[v][i - 1]][i - 1];
for (int i = head[v], u; i; i = bi[i].nxt) {
u = bi[i].to;
if (u == fa) continue;
dfs(u, v);
}
}
int lca(int x, int y) {
if (dep[x] < dep[y]) swap(x, y);
int d = dep[x] - dep[y];
for (int i = 0; i <= 17; ++i)
if (d >> i & 1) x = up[x][i];
if (x == y) return x;
for (int i = 17; ~i; --i)
if (up[x][i] != up[y][i]) x = up[x][i], y = up[y][i];
return up[x][0];
}
int qdis(int x, int y) { return dep[x] + dep[y] - 2 * dep[lca(x, y)]; }
int s[200020], st[200020], tp, p[200020], cnt, a[200020];
bool vis[200020];
queue<int> q;
vector<int> E[200020];
int fr[200020], kd[200020], ans[200020];
int calc(int x, int y, int p) {
if (!x || !y) return x + y;
int d1 = qdis(x, p), d2 = qdis(y, p);
if ((d1 + s[x] - 1) / s[x] < (d2 + s[y] - 1) / s[y] ||
((d1 + s[x] - 1) / s[x] == (d2 + s[y] - 1) / s[y] && kd[x] < kd[y]))
return x;
else
return y;
}
void dfs1(int v) {
fr[v] = 0;
if (s[v]) fr[v] = v;
for (auto u : E[v]) {
dfs1(u);
fr[v] = calc(fr[v], fr[u], v);
}
}
void dfs2(int v, int f) {
fr[v] = calc(fr[v], f, v);
ans[v] = kd[fr[v]];
for (auto u : E[v]) dfs2(u, fr[v]);
}
int main() {
scanf("%d", &n);
for (int i = 1, x, y; i < n; ++i) {
scanf("%d %d", &x, &y);
add(x, y), add(y, x);
}
dfs(1, 0);
scanf("%d", &qnum);
while (qnum--) {
scanf("%d %d", &k, &m);
for (int i = 1, x; i <= k; ++i) {
scanf("%d", &x);
scanf("%d", &s[x]);
kd[x] = i;
if (!vis[x]) vis[x] = 1, q.push(x), p[++cnt] = x;
}
for (int i = 1, x; i <= m; ++i) {
scanf("%d", &x);
a[i] = x;
if (!vis[x]) vis[x] = 1, q.push(x), p[++cnt] = x;
}
if (!vis[1]) vis[1] = 1, q.push(1), p[++cnt] = 1;
sort(p + 1, p + 1 + cnt, [&](int x, int y) { return id[x] < id[y]; });
st[tp = 1] = 1;
for (int i = 2; i <= cnt; ++i) {
int l = lca(st[tp], p[i]);
while (dep[l] < dep[st[tp]]) {
if (dep[l] <= dep[st[tp - 1]]) {
E[st[tp - 1]].emplace_back(st[tp]);
--tp;
} else {
E[l].emplace_back(st[tp]);
st[tp] = l;
q.push(l);
}
}
st[++tp] = p[i];
}
while (tp > 1) E[st[tp - 1]].emplace_back(st[tp]), --tp;
dfs1(1);
dfs2(1, 0);
for (int i = 1; i <= m; ++i) printf("%d ", ans[a[i]]);
printf("\n");
while (!q.empty()) {
int x = q.front();
q.pop();
E[x].clear();
vis[x] = 0, s[x] = 0;
}
cnt = 0;
}
return 0;
}
| 11 | CPP |
import sys
t=int(input().strip())
for a0 in range(t):
l=[int (i) for i in input().split()]
n=l[0]
m=l[1]
odd=0
if(m%2!=0):
odd=1
symm=0
for i in range(n):
l1=[int (i) for i in input().split()]
l2=[int (i) for i in input().split()]
if(l1[1]==l2[0]):
symm=1
if(odd==1 or symm==0):
print("NO")
else:
print("YES")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
void PRT(const long long a) {
if (a < 0) {
putchar(45), PRT(-a);
return;
}
if (a >= 10) PRT(a / 10);
putchar(a % 10 + 48);
}
constexpr int MN(200007);
enum RS_DIR { R, S, RS_CNT };
struct Point {
int x, y;
int level;
inline bool operator<(const Point &o) const {
return level < o.level ||
level == o.level && (y > o.y || y == o.y && x < o.x);
}
} points[MN];
long long dist_sum[MN];
long long dp[MN][RS_CNT];
std::vector<Point> level[MN];
int main() {
int n;
{
register char _c = getchar(), _v = 1;
for (n = 0; _c < 48 || _c > 57; _c = getchar())
if (_c == 45) _v = -1;
for (; _c >= 48 && _c <= 57;
n = (n << 1) + (n << 3) + _c - 48, _c = getchar())
;
n *= _v;
}
++n;
points[0].x = points[0].y = points[0].level = 0;
for (auto it = points + 1, E = points + n; it != E; ++it) {
{
register char _c = getchar(), _v = 1;
for ((it->x) = 0; _c < 48 || _c > 57; _c = getchar())
if (_c == 45) _v = -1;
for (; _c >= 48 && _c <= 57;
(it->x) = ((it->x) << 1) + ((it->x) << 3) + _c - 48, _c = getchar())
;
(it->x) *= _v;
}
{
register char _c = getchar(), _v = 1;
for ((it->y) = 0; _c < 48 || _c > 57; _c = getchar())
if (_c == 45) _v = -1;
for (; _c >= 48 && _c <= 57;
(it->y) = ((it->y) << 1) + ((it->y) << 3) + _c - 48, _c = getchar())
;
(it->y) *= _v;
}
it->level = (it->x > it->y ? it->x : it->y);
}
std::sort(points, points + n);
int level_index = 0;
for (int i = 0; i < n - 1; ++i) {
level[level_index].push_back(points[i]);
if (points[i].level == points[i + 1].level)
dist_sum[level_index] +=
((points[i].x > points[i + 1].x ? points[i].x - points[i + 1].x
: points[i + 1].x - points[i].x) +
(points[i].y > points[i + 1].y ? points[i].y - points[i + 1].y
: points[i + 1].y - points[i].y));
else
++level_index;
}
level[level_index].push_back(points[n - 1]);
int level_cnt = level_index + 1;
dp[0][R] = dp[0][S] = 0;
for (int i = 1; i < level_cnt; ++i) {
long long R_R = dp[i - 1][R] +
((level[i - 1].back().x > level[i].front().x
? level[i - 1].back().x - level[i].front().x
: level[i].front().x - level[i - 1].back().x) +
(level[i - 1].back().y > level[i].front().y
? level[i - 1].back().y - level[i].front().y
: level[i].front().y - level[i - 1].back().y)) +
dist_sum[i];
long long S_R = dp[i - 1][S] +
((level[i - 1].front().x > level[i].front().x
? level[i - 1].front().x - level[i].front().x
: level[i].front().x - level[i - 1].front().x) +
(level[i - 1].front().y > level[i].front().y
? level[i - 1].front().y - level[i].front().y
: level[i].front().y - level[i - 1].front().y)) +
dist_sum[i];
if (R_R < S_R)
dp[i][R] = R_R;
else
dp[i][R] = S_R;
long long R_S = dp[i - 1][R] +
((level[i - 1].back().x > level[i].back().x
? level[i - 1].back().x - level[i].back().x
: level[i].back().x - level[i - 1].back().x) +
(level[i - 1].back().y > level[i].back().y
? level[i - 1].back().y - level[i].back().y
: level[i].back().y - level[i - 1].back().y)) +
dist_sum[i];
long long S_S = dp[i - 1][S] +
((level[i - 1].front().x > level[i].back().x
? level[i - 1].front().x - level[i].back().x
: level[i].back().x - level[i - 1].front().x) +
(level[i - 1].front().y > level[i].back().y
? level[i - 1].front().y - level[i].back().y
: level[i].back().y - level[i - 1].front().y)) +
dist_sum[i];
if (R_S < S_S)
dp[i][S] = R_S;
else
dp[i][S] = S_S;
}
PRT((dp[level_cnt - 1][R] < dp[level_cnt - 1][S] ? dp[level_cnt - 1][R]
: dp[level_cnt - 1][S]));
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, k;
int a[200007];
long long fac[200007];
long long inv[200007];
long long pw2[200007];
long long free_pw[200007];
long long fastpow(long long x, long long st) {
long long ret = 1;
while (st > 0) {
if ((st & 1) != 0) {
ret = (ret * x) % 998244353;
--st;
} else {
x = (x * x) % 998244353;
st >>= 1;
}
}
return ret;
}
long long get_comb(long long x, long long y) {
if (x < y) {
return 0;
}
long long ret = fac[x];
ret = (ret * inv[y]) % 998244353;
ret = (ret * inv[x - y]) % 998244353;
return ret;
}
void input() {
scanf("%I64d%I64d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
}
a[n + 1] = a[1];
fac[0] = pw2[0] = free_pw[0] = 1;
for (int i = 1; i <= n; ++i) {
fac[i] = (fac[i - 1] * i) % 998244353;
pw2[i] = (pw2[i - 1] * 2) % 998244353;
free_pw[i] = (free_pw[i - 1] * (k - 2)) % 998244353;
}
inv[n] = fastpow(fac[n], 998244353 - 2);
for (int i = n - 1; i >= 0; --i) {
inv[i] = (inv[i + 1] * (i + 1)) % 998244353;
}
}
void solve() {
int free = 0;
long long aux = 1;
for (int i = 1; i <= n; ++i) {
if (a[i] == a[i + 1]) {
++free, aux = (aux * k) % 998244353;
}
}
long long ans = 0;
for (int i = 0; i < n - free; ++i) {
long long w = (get_comb(n - free, i) * free_pw[i]) % 998244353;
int lft = n - free - i;
long long coef = pw2[lft];
if ((lft & 1) == 0) {
coef = (coef - get_comb(lft, lft / 2) + 998244353) % 998244353;
}
coef = (coef * inv[2]) % 998244353;
ans = (ans + (w * coef) % 998244353) % 998244353;
}
printf("%I64d\n", (aux * ans) % 998244353);
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
input();
solve();
return 0;
}
| 10 | CPP |
leng=int(input())
x=input().split()
sum=0
A=[]
for i in range(leng):
x[i]=int(x[i])
sum+=x[i]
if x[i]%2!=0:
A.append(x[i])
if len(A)!=0:
mini=min(A)
if sum%2==0:
print(sum)
else:
print(sum-mini) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N, b[309], bst[1009], sol[309][2009];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) scanf("%d", &b[i]);
sol[0][0] = 1;
for (int i = 1; i <= N; i++) {
bool ok = 1;
for (int j = 0; j <= sol[i - 1][0]; j++) {
sol[i][j] = sol[i - 1][j];
if (sol[i][j] != 9 && j != 0) ok = 0;
}
if (ok) {
sol[i][0]++;
for (int j = 1; j <= sol[i][0]; j++) sol[i][j] = (j == 1);
} else {
sol[i][sol[i][0]]++;
int j = sol[i][0];
while (sol[i][j] == 10) sol[i][j--] = 0, sol[i][j]++;
}
int L = b[i] / 9;
if (b[i] % 9 != 0) L++;
if (L > sol[i][0]) {
sol[i][0] = L;
for (int j = 2; j <= L; j++) sol[i][j] = 9;
if (b[i] % 9)
sol[i][1] = b[i] % 9;
else
sol[i][1] = 9;
continue;
}
int sum = b[i];
for (int j = 1; j <= sol[i][0]; j++) {
if (sum <= 9)
bst[j] = sum, sum = 0;
else
bst[j] = 9, sum -= 9;
}
ok = 1;
for (int j = 1; j <= sol[i][0]; j++)
if (bst[j] != sol[i][j]) {
if (bst[j] < sol[i][j]) ok = 0;
break;
}
if (ok) {
int S = 0;
for (int j = 1; j <= sol[i][0]; j++) S += sol[i][j];
if (S == b[i]) continue;
S = 0;
int last_cor_pref = 0;
for (int j = 1; j <= sol[i][0]; j++) {
if (S + sol[i][j] + 1 <= b[i] && S + 9 * (sol[i][0] - j + 1) >= b[i] &&
sol[i][j] < 9)
last_cor_pref = j - 1;
S += sol[i][j];
}
int sum = b[i];
for (int j = 1; j <= last_cor_pref; j++) sum -= sol[i][j];
for (int v = sol[i][last_cor_pref + 1] + 1; v < 10; v++)
if (v + 9 * (sol[i][0] - last_cor_pref - 1) >= sum) {
sum -= v;
sol[i][last_cor_pref + 1] = v;
break;
}
for (int j = sol[i][0]; j > last_cor_pref + 1; j--) {
if (sum <= 9)
sol[i][j] = sum, sum = 0;
else
sol[i][j] = 9, sum -= 9;
}
continue;
}
sol[i][0]++;
sol[i][1] = 1;
sum = b[i] - 1;
for (int j = sol[i][0]; j >= 2; j--) {
if (sum <= 9)
sol[i][j] = sum, sum = 0;
else
sol[i][j] = 9, sum -= 9;
}
}
for (int i = 1; i <= N; i++, printf("\n"))
for (int j = 1; j <= sol[i][0]; j++) printf("%d", sol[i][j]);
return 0;
}
| 9 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.