solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
cnt = 0
for i in range(1, e+1):
if i%a==0 or i%b==0 or i%c==0 or i%d==0:
cnt += 1
print(cnt)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
long long l[maxn], r[maxn], dis[maxn];
int n;
long long a[maxn];
int cal(int x) {
if (x % 2) return x - 1;
return x;
}
set<long long> s;
int main() {
std::ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i < n - 1; i++) {
if (a[i] > 1) {
l[i] = l[i - 1] + cal(a[i]);
}
}
for (int i = n - 2; i >= 0; i--) {
if (a[i + 1] > 1) {
r[i] = r[i + 1] + cal(a[i + 1]);
}
}
dis[1] = cal(a[1] - 1) + 1;
for (int i = 2; i < n; i++) {
dis[i] += (dis[i - 1] + cal(a[i] - 1) + 1);
}
long long ans = l[0] + r[0];
s.insert(l[0]);
for (int i = 1; i < n; i++) {
s.insert(l[i] - dis[i]);
long long x = *--s.lower_bound(1LL * 1e16);
ans = max(ans, r[i] + dis[i] + x);
}
cout << ans;
return 0;
}
| 9 | CPP |
mat = [[int(x) for x in input().split()] for i in range(5)]
m = 0
n = 0
for i in range(5):
for j in range(5):
if mat[i][j] == 1:
m = i
n = j
print(abs(m-2)+abs(n-2)) | 7 | PYTHON3 |
n,k=input().split()
n=int(n)
k=int(k)
if k<=(n+1)//2:
print(2*k-1)
else:
p=k-(n+1)//2
print(2*p)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int power(long long int b, long long int p) {
if (p == 0) return 1;
if (p % 2) return (power(b, p - 1) * b) % mod;
long long int r = power(b, p / 2);
return (r * r) % mod;
}
long long int inverse(long long int x) { return power(x, mod - 2); }
long long int dof(long long int x) {
x %= mod;
if (x < 0) x += mod;
return x;
}
int main() {
long long int a, b, n, x;
scanf("%lld%lld%lld%lld", &a, &b, &n, &x);
long long int baki = (power(a, n) * x) % mod, ans;
if (a == 1) {
n %= mod, b %= mod;
ans = (n * b) % mod;
} else {
a %= mod, b %= mod;
ans = (b * dof(power(a, n) - 1)) % mod;
ans *= inverse(a - 1);
ans %= mod;
}
printf("%lld\n", (ans + baki) % mod);
return 0;
}
| 10 | CPP |
year = int(input().strip())
year += 1
while 1:
if len(set(str(year))) == 4:
print(year)
break
year += 1
| 7 | PYTHON3 |
import bisect
ans = "IMPOSSIBLE"
n, m = map(int, input().split())
ac = []
bc = []
for _ in range(m):
a, b = map(int, input().split())
if min(a, b) == 1:
ac.append(max(a, b))
elif max(a, b) == n:
bc.append(min(a, b))
ac = list(sorted(ac))
bc = list(sorted(bc))
for c in ac:
i = bisect.bisect_left(bc, c)
if i < len(bc) and bc[i] == c:
ans = ans[2:]
break
print(ans) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, t0 = 0, t1 = 0;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
(a % 2 == 0 ? t0 : t1)++;
}
int rounds = n - k;
if (rounds == 0)
puts(t1 % 2 == 0 ? "Daenerys" : "Stannis");
else if (rounds % 2 == 1) {
if (t1 <= rounds / 2)
puts("Daenerys");
else if (t0 <= rounds / 2 && k % 2 == 0)
puts("Daenerys");
else
puts("Stannis");
} else {
if (t0 <= rounds / 2 && k % 2 == 1)
puts("Stannis");
else
puts("Daenerys");
}
}
| 9 | CPP |
from heapq import heappush, heappop
from enum import Enum, auto
INFTY = float('inf')
class Color(Enum):
WHITE = auto()
GRAY = auto()
BLACK = auto()
n = int(input())
adj_list = []
for i in range(n):
u, k, *kv = list(map(int, input().split(' ')))
adj_list.append(kv)
colors = []
d = []
def dijkstra(s):
global d
colors = [Color.WHITE for i in range(n)]
d = [INFTY for i in range(n)]
pque = []
d[s] = 0
heappush(pque, (0, s))
while len(pque) >= 1:
vert_u = heappop(pque)
u = vert_u[1]
colors[u] = Color.BLACK
if d[u] < vert_u[0]: continue
i = 0
while i <= len(adj_list[u])-2:
v = adj_list[u][i]
if colors[v] != Color.BLACK:
if d[u] + adj_list[u][i+1] < d[v]:
d[v] = d[u] + adj_list[u][i+1]
colors[v] = Color.GRAY
heappush(pque, (d[v], v))
i += 2
dijkstra(0)
for i in range(n):
print(i, d[i])
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a*b % MOD; }
ll p,q;
vector<string> PP,Q;
vector<ll> ans;
char ot[] = {'(','{','['};
char ct[] = {')','}',']'};
bool check(ll r,ll c,ll s){
ll cost[] = {r,c,s};
ll sum = 0;
rep(i,PP.size() - 1){
ll cnt = 0;
rep(j,PP[i].size()){
rep(k,3){
if(ot[k] == PP[i][j])sum += cost[k];
if(ct[k] == PP[i][j])sum -= cost[k];
}
}
rep(j,PP[i+1].size()){
if(PP[i+1][j] != '.')break;
cnt++;
}
if(cnt != sum)return false;
}
return true;
}
void solve(ll r,ll c,ll s){
ll cnt[3] = {};
rep(i,Q.size() - 1){
rep(j,Q[i].size()){
rep(k,3){
if(ot[k] == Q[i][j])cnt[k]++;
if(ct[k] == Q[i][j])cnt[k]--;
}
}
ll nn = cnt[0]*r + cnt[1]*c + cnt[2]*s;
if(ans[i] == 0)ans[i] = nn;
else if(ans[i] != nn)ans[i] = -1;
}
}
int main(){
while(cin >> p >> q && p){
PP.clear();
Q.clear();
ans.clear();
ans.resize(q-1,0);
rep(i,p){
string s;
cin >> s;
PP.push_back(s);
}
rep(i,q){
string s;
cin >> s;
Q.push_back(s);
}
FOR(r,1,21){
FOR(c,1,21){
FOR(s,1,21){
if(check(r,c,s)){
// cout << r << " " << c << " " << s << endl;
solve(r,c,s);
}
}
}
}
cout << 0 << " ";
rep(i,ans.size()){
if(i != ans.size() - 1)cout << ans[i] << " ";
else cout << ans[i] << endl;
}
}
}
| 0 | CPP |
for i in range(int(input())):
n=int(input())
if n<=30:
print("NO")
else:
print("YES")
if n==36:
print(6,15,10,5)
elif n==40:
print(6,14,15,5)
elif n==44:
print(6,10,15,13)
else:
print(6,10,14,n-30) | 7 | PYTHON3 |
t=int(input())
for i in range(t):
x,y,n=map(int,input().split(" "))
p=n%x
if(p<y):
g=(((n//x)-1)*x)+y
else:
g=((n//x)*x)+y
print(g) | 7 | PYTHON3 |
for _ in range(int(input())):
a, b, c = [int(q) for q in input().split()]
l = []
for i in range(a - 1, a + 2):
for j in range(b - 1, b + 2):
for k in range(c - 1, c + 2):
l.append(abs(i - j) + abs(i - k) + abs(j - k))
print(min(l)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000000;
int a[N + 1];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a[x]++;
}
for (int i = 1; i <= N; i++) {
a[i] += a[i - 1];
}
for (int ans = N; ans >= 1; ans--) {
int sum = 0;
for (int i = ans; i <= N; i += ans) {
sum += a[min(i + min(ans - 1, k), N)] - a[i - 1];
}
if (sum == n) {
cout << ans << endl;
break;
}
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int lim = 200005;
long long int fact[lim], mmi[lim];
long long int expo(long long int a, long long int b) {
if (b == 0) return 1;
long long int c = expo(a, b / 2);
if (b & 1) {
return (((c * c) % 1000000007) * a) % 1000000007;
}
return (c * c) % 1000000007;
}
void pre() {
fact[0] = 1;
mmi[0] = 1;
for (int i = 1; i < lim; i++) {
fact[i] = (fact[i - 1] * i) % 1000000007;
mmi[i] = (mmi[i - 1] * expo(i, 1000000007 - 2)) % 1000000007;
}
}
long long int f(long long int n, long long int m) {
if (n + m == 1) {
if (n == 1 && m == 0) return 1;
return 0;
}
long long int ans = 0;
if (m > 0) {
ans = (ans +
(fact[n + m - 1] * mmi[n] % 1000000007) * mmi[m - 1] % 1000000007) %
1000000007;
}
if (n > 0) {
n--;
if (n + m == 1) {
if (n == 0 && m == 1) ans += 1;
} else {
if (n > 0) {
ans = (ans + f(n - 1, m)) % 1000000007;
}
}
}
return ans % 1000000007;
}
void solve() {
pre();
long long int n, m, g;
cin >> n >> m >> g;
if (g == 1) {
if (n + m == 1) {
if (n == 0 && m == 1)
cout << 1;
else
cout << 0;
return;
} else {
n--;
}
}
cout << f(n, m);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int kickstart = 0;
int test = 1;
for (int i = 0; i < test; i++) {
if (kickstart)
cout << "Case #" << i + 1 << ": ", solve(), cout << endl;
else
solve();
}
return 0;
}
| 10 | CPP |
#include <iostream>
#include <vector>
#define INF 2147483647
using namespace std;
struct Edge {
int to, cost;
Edge(int to, int cost = -1) : to(to), cost(cost) {}
};
typedef vector<vector<Edge> > P;
P graph;
vector<int> dist;
bool bellman_ford(int n, int s) {
dist = vector<int>(n, 0);
for (int i = 0; i < n; i++) {
for (int v = 0; v < n; v++) {
for (int k = 0; k < graph[v].size(); k++) {
Edge e = graph[v][k];
if (dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
if (i == n - 1) return true;
}
}
}
}
return false;
}
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int V, E;cin >> V >> E;
graph = P(V);
for (int i = 0; i < E; i++) {
int from, to;cin >> from >> to;
graph[from].push_back(Edge(to));
}
if (bellman_ford(V, 0)) { cout << 1 << endl; }
else { cout << 0 << endl; }
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<long long, long long>;
const long long MOD = 998244353;
const long long INF = 2000000000;
const long long DESPACITO = 1000000000000000000;
namespace minmax {
template <class T>
T max(T&& A) {
return A;
}
template <class T>
T min(T&& A) {
return A;
}
template <class T>
T max(T&& A, T&& B) {
return A > B ? A : B;
}
template <class T>
T chmin2(T&& A, T&& B) {
return A < B ? A : B;
}
template <class T, class... Ts>
T max(T&& A, Ts&&... ts) {
T B = max(ts...);
return A > B ? A : B;
}
template <class T, class... Ts>
T min(T&& A, Ts&&... ts) {
T B = min(ts...);
return A < B ? A : B;
}
template <class T, class... Ts>
T chmax(T&& A, Ts&&... ts) {
A = max(A, ts...);
return A;
}
template <class T, class... Ts>
T chmin(T&& A, Ts&&... ts) {
A = min(A, ts...);
return A;
}
template <class T1, class T2>
void chmin2(T1&& A, T2&& Aa, T1&& B, T2&& Bb) {
if (B < A) A = B, Aa = Bb;
}
template <class T1, class T2>
void chmax2(T1&& A, T2&& Aa, T1&& B, T2&& Bb) {
if (B > A) A = B, Aa = Bb;
}
} // namespace minmax
namespace input {
template <class T>
void re(T&& Xx) {
cin >> Xx;
}
template <class T1, class T2>
void re(pair<T1, T2>& Pp) {
re(Pp.first);
re(Pp.second);
}
template <class T>
void re(vector<T>& Aa) {
for (long long i = 0; i < (long long)(Aa).size(); i++) re(Aa[i]);
}
template <class T1, class T2>
void rea(T1&& Aa, T2 t) {
for (long long i = 0; i < t; i++) re(Aa[i]);
}
template <class T1, class T2, class... Ts>
void rea(T1&& Aa, T2 t, Ts&&... ts) {
rea(Aa, t);
rea(ts...);
}
template <class T1, class T2>
void rea1(T1&& Aa, T2 t) {
for (long long i = 1; i <= t; i++) re(Aa[i]);
}
template <class T1, class T2, class... Ts>
void rea1(T1&& Aa, T2 t, Ts&... ts) {
rea1(Aa, t);
rea1(ts...);
}
template <class T, class... Ts>
void re(T&& t, Ts&... ts) {
re(t);
re(ts...);
}
} // namespace input
namespace output {
void pr(int32_t Xx) { cout << Xx; }
void pr(bool Xx) { cout << Xx; }
void pr(long long Xx) { cout << Xx; }
void pr(long long unsigned Xx) { cout << Xx; }
void pr(double Xx) { cout << Xx; }
void pr(char Xx) { cout << Xx; }
void pr(const string& Xx) { cout << Xx; }
void pr(const char* Xx) { cout << Xx; }
void pr(const char* Xx, size_t len) { cout << string(Xx, len); }
void ps() { cout << "\n"; }
void pn() {}
void pw() { pr(" "); }
void pc() {
pr("]");
ps();
}
template <class T1, class T2>
void pr(const pair<T1, T2>& Xx) {
pr(Xx.first);
pw();
pr(Xx.second);
}
template <class T>
void pr(const T&);
bool parse(const char* t) {
if (t == "\n") return true;
return false;
}
template <class T>
bool parse(T&& t) {
return false;
}
template <class T1, class T2>
bool parsepair(const pair<T1, T2>& Xx) {
return true;
}
template <class T>
bool parsepair(T&& t) {
return false;
}
template <class T1, class T2>
void psa(T1&& Aa, T2 t) {
for (long long i = 0; i < t; i++) pr(Aa[i]), pw();
ps();
}
template <class T1, class T2>
void pna(T1&& Aa, T2 t) {
for (long long i = 0; i < t; i++) pr(Aa[i]), ps();
}
template <class T1, class T2>
void psa2(T1&& Aa, T2 t1, T2 t2) {
for (long long i = 0; i < t1; i++) {
for (long long j = 0; j < t2; j++) pr(Aa[i][j]), pw();
ps();
}
}
template <class T>
void pr(const T& Xx) {
if (!(long long)(Xx).size()) return;
bool fst = 1;
bool op = 0;
if (parsepair(*Xx.begin())) op = 1;
for (const auto& Aa : Xx) {
if (!fst) pw();
if (op) pr("{");
pr(Aa), fst = 0;
if (op) pr("}");
}
}
template <class T, class... Ts>
void pr(const T& t, const Ts&... ts) {
pr(t);
pr(ts...);
}
template <class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
pr(t);
if (sizeof...(ts)) {
if (!parse(t)) pw();
}
ps(ts...);
}
template <class T>
void pn(const T& t) {
for (const auto& Aa : t) ps(Aa);
}
template <class T, class... Ts>
void pw(const T& t, const Ts&... ts) {
pr(t);
if (sizeof...(ts)) pw();
pw(ts...);
}
template <class T, class... Ts>
void pc(const T& t, const Ts&... ts) {
bool op = 0;
if (parsepair(t)) op = 1;
if (op) pr("{");
pr(t);
if (op) pr("}");
if (sizeof...(ts)) pr(", ");
pc(ts...);
}
namespace trace {
template <class T1, class T2>
void __f(const char* name, const T1& Xx, const T2& y) {
pr("[", y, "] = ");
ps(Xx);
}
template <class T1, class T2, class... Ts>
void __f(const char* name, const T1& Xx, const T2& y, const Ts&... rest) {
const char* open = strchr(name, '[');
pr("[", y, "]");
__f(open + 1, Xx, rest...);
}
template <class T1, class T2, class... Ts>
void __f0(const char* name, const T1& Xx, const T2& y, const Ts&... rest) {
const char* open = strchr(name, '[');
pr(name, size_t(open - name));
__f(name, Xx, y, rest...);
}
template <class T>
void __fn(long long n, const char* name, const T& Xx) {
for (long long i = 0; i < n; i++) pr(name), __f(name, Xx[i], i);
}
} // namespace trace
} // namespace output
using namespace minmax;
using namespace input;
using namespace output;
using namespace output::trace;
const long long N = 2e5 + 5;
template <class T1, class T2>
long long expo(T1 A, T2 B) {
if (B == 0) return 1;
if (B & 1) return (long long)(1ll * A * expo(A, B - 1) % MOD);
A = expo(A, B / 2);
return (long long)(1ll * A * A % MOD);
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i, n, m, l, r;
re(n, m, l, r);
n *= m;
if (n & 1) return ps(expo(r - l + 1, n)), 0;
long long x = l + (l & 1);
long long y = r - (r & 1);
long long even = (r - l) / 2 + 1;
long long odd = (r - l + 1) - even;
long long ans = expo(odd + even, n) + expo(abs(odd - even), n);
ans %= MOD;
ans *= expo(2ll, MOD - 2);
ans %= MOD;
ps(ans);
return 0;
}
| 11 | CPP |
# Author: Uday Gupta
import sys
input = sys.stdin.readline
t = int(input())
for test in range(t):
#a = list(map(int, input().split()))
s = input()
s = s[0:-1]
zeros = 0
ones = 0
for i in range(len(s)):
if s[i] == '0':
zeros += 1
else:
ones += 1
pairs = min(zeros,ones)
if pairs % 2 != 0:
print("DA")
else:
print("NET")
| 8 | PYTHON3 |
t=int(input())
while(t>0):
t=t-1
s=input()
l=len(s)
g=s[l-2:l]
if g=='po':
print("FILIPINO")
continue
n=s[l-4:l]
if n=='masu':
print("JAPANESE")
continue
if n=='desu':
print("JAPANESE")
continue
m=s[l-5:l]
if m=='mnida':
print("KOREAN")
continue
| 7 | PYTHON3 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,S;
while(cin >> n >> S){
if(n+S == 0) break;
vector<int> r(n);
int ret=0;
for(int i=0;i<n;i++){
cin >> r[i];
}
if(n == 1){
cout << 0 << endl;
continue;
}
sort(r.begin(), r.end());
for(int i=0;i<n;i++){
if(r[i] > (double)S/2){
ret += n-i-1;
}else{
ret += r.end() - upper_bound(r.begin(), r.end(), S-r[i]);
}
}
cout << ret << endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
long long p = 1000000007, l, r;
long long pw(long long x, long long y) {
long long _ = 1;
for (; y; y >>= 1, x = x * x % p) y& 1 ? _ = _ * x % p : 0;
return _;
}
long long S(long long x) {
if (!x)
return 0;
else if (x == 1)
return 4;
else if (x & 1)
return (11 * pw(3, x / 2) - 7) % p;
else
return (19 * pw(3, x / 2 - 1) - 7) % p;
}
long long G(long long x) { return (S(x) + S(x + 1 >> 1)) * pw(2, p - 2) % p; }
int main() {
scanf("%I64d %I64d", &l, &r);
printf("%I64d\n", (G(r) - G(l - 1) + p) % p);
return 0;
}
| 10 | CPP |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
cout<<(15-s.size()+count(s.begin(),s.end(),'o')>=8?"YES":"NO")<<endl;
return 0;
} | 0 | CPP |
def main():
n = int(input())
a = []
b = []
for i in range(n):
a.append(input())
a.sort()
ans = 0
for i in range(n):
t = input()
if t in a:
a[a.index(t)] = ''
print(sum([1 for i in a if i != '']))
if __name__ == '__main__':
main() | 7 | PYTHON3 |
#include<stdio.h>
int a[1005][1005],ans[1005][1005];
char s[131072];
int wz[4],inc[4];
int tmp[4],tmp2[4];
int main()
{
int __;
scanf("%d",&__);
while(__--)
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
scanf("%s",s);
for(int i=0;i<3;i++)
{
wz[i]=i;
inc[i]=0;
}
for(int i=0;i<m;i++)
{
if(s[i]=='R')
{
inc[1]++;
if(inc[1]>=n)
{
inc[1]-=n;
}
}
if(s[i]=='L')
{
inc[1]--;
if(inc[1]<0)
{
inc[1]+=n;
}
}
if(s[i]=='D')
{
inc[0]++;
if(inc[0]>=n)
{
inc[0]-=n;
}
}
if(s[i]=='U')
{
inc[0]--;
if(inc[0]<0)
{
inc[0]+=n;
}
}
if(s[i]=='I')
{
int t=wz[1];
wz[1]=wz[2];
wz[2]=t;
t=inc[1];
inc[1]=inc[2];
inc[2]=t;
}
if(s[i]=='C')
{
int t=wz[0];
wz[0]=wz[2];
wz[2]=t;
t=inc[0];
inc[0]=inc[2];
inc[2]=t;
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
tmp[0]=i;
tmp[1]=j;
tmp[2]=a[i][j];
for(int k=0;k<3;k++)
{
tmp2[k]=tmp[wz[k]]+inc[k];
if(tmp2[k]>n)
{
tmp2[k]-=n;
}
}
ans[tmp2[0]][tmp2[1]]=tmp2[2];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
printf("%d",ans[i][j]);
if(j==n)
{
putchar('\n');
}
else
{
putchar(' ');
}
}
}
}
return 0;
}
| 9 | CPP |
from sys import stdin
import math
n = int(stdin.readline())
nums = list(map(int, stdin.readline().rstrip().split(' ')))
evens = sum(1 for num in nums if num % 2 == 0)
odds = len(nums) - evens
if evens == 0 or odds == 0:
print(0)
else:
print(min(evens, odds)) | 7 | PYTHON3 |
x = int(input())
tot = 0
for i in range(x):
comm = input()
if comm[:2] == '++' or comm[1:] == '++':
tot += 1
else:
tot -= 1
print(tot) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, x1, y1, x2, y2;
cin >> t >> x1 >> y1 >> x2 >> y2;
char a, b;
int x = 0, y = 0;
if (x1 - x2 <= 0)
a = 'E';
else
a = 'W';
if (y1 - y2 <= 0)
b = 'N';
else
b = 'S';
string s;
cin >> s;
x = abs(x1 - x2);
y = abs(y1 - y2);
if (x == 0 && y == 0) {
cout << 0;
return 0;
}
for (int i = 1; i <= t; i++) {
if (s[i - 1] == a && x != 0) {
x--;
} else if (s[i - 1] == b && y != 0)
y--;
if (x == 0 && y == 0) {
cout << i;
return 0;
}
}
cout << -1;
}
| 8 | CPP |
# Input
# The first input line contains a single
# integer n (1 ≤ n ≤ 100) — the number of
# orange-containing drinks in Vasya's fridge.
# The second line contains n integers
# p i (0 ≤ p i ≤ 100) — the volume fraction of
# orange juice in the i-th drink, in percent.
# The numbers are separated by a space.
# Output
# Print the volume fraction in percent of orange
# juice in Vasya's cocktail. The answer will be
# considered correct if the absolute or relative
# error does not exceed 10 - 4.
n = int(input())
drinks = list(map(int,input().split()))
def volumefraction(n, drinks):
sum = 0
for i in drinks:
sum += i
print(sum / n)
volumefraction(n, drinks) | 8 | PYTHON3 |
#include <bits/stdc++.h>
const double inf = 1e20;
using namespace std;
const int md = 1000000007;
int n, C[4010][4010], B[4010];
void pre() {
for (int i = 0; i <= 4000; i++) C[i][0] = 1;
for (int i = 1; i <= 4000; i++)
for (int j = 1; j <= 4000; j++)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % md;
}
int main() {
pre();
cin >> n;
B[0] = 1;
for (int i = 0; i <= n; i++) {
for (int j = i + 1; j <= n + 1; j++)
B[j] = (B[j] + (long long)B[i] * C[j - 1][i]) % md;
}
cout << (B[n + 1] - B[n] + md) % md;
return 0;
}
| 10 | CPP |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
ans = n * ((k - 1) // (n - 1)) + ((k - 1) % (n - 1)) + 1
print(ans) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 500000, INF = 0x3f3f3f3f;
int *aa[N], *aa_[N], *bb[N], *cc[N], *dd[N], ii[N];
char ans[N];
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
aa[i] = (int *)malloc(m * sizeof *aa[i]);
aa_[i] = (int *)malloc(m * sizeof *aa_[i]);
bb[i] = (int *)malloc(m * sizeof *bb[i]);
cc[i] = (int *)malloc(m * sizeof *cc[i]);
dd[i] = (int *)malloc(m * sizeof *dd[i]);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> aa[i][j];
for (int h = 0; h < n; h++) ii[h] = h;
sort(ii, ii + n, [](int i, int j) { return aa[i][0] < aa[j][0]; });
for (int h = 0; h < n; h++)
for (int j = 0; j < m; j++) aa_[h][j] = aa[ii[h]][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
aa[i][j] = bb[i][j] = cc[i][j] = dd[i][j] = aa_[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
aa[i][j] =
max(aa[i][j], max(i ? aa[i - 1][j] : 0, j ? aa[i][j - 1] : 0));
for (int i = n - 1; i >= 0; i--)
for (int j = 0; j < m; j++)
bb[i][j] = min(bb[i][j], min(i + 1 < n ? bb[i + 1][j] : INF,
j ? bb[i][j - 1] : INF));
for (int i = n - 1; i >= 0; i--)
for (int j = m - 1; j >= 0; j--)
cc[i][j] = max(cc[i][j], max(i + 1 < n ? cc[i + 1][j] : 0,
j + 1 < m ? cc[i][j + 1] : 0));
for (int i = 0; i < n; i++)
for (int j = m - 1; j >= 0; j--)
dd[i][j] = min(dd[i][j], min(i ? dd[i - 1][j] : INF,
j + 1 < m ? dd[i][j + 1] : INF));
for (int i = 0; i + 1 < n; i++)
for (int j = 0; j + 1 < m; j++)
if (aa[i][j] < bb[i + 1][j] && cc[i + 1][j + 1] < dd[i][j + 1]) {
cout << "YES\n";
fill(ans, ans + n, 'R');
for (int h = 0; h <= i; h++) ans[ii[h]] = 'B';
ans[n] = '\0';
cout << ans << ' ' << j + 1 << '\n';
goto out;
}
cout << "NO\n";
out:;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int RAND(int lo, int hi) {
return uniform_int_distribution<int>(lo, hi)(rng);
}
string tryit(int n, int m, int p, vector<string> &f, int id) {
vector<int> ids;
for (int i = 0; i < m; i++) {
if (f[id][i] == '1') {
ids.push_back(i);
}
}
int b = ids.size();
vector<int> dp(1 << b);
for (int i = 0; i < n; i++) {
int msk = 0;
for (int j = 0; j < b; j++) {
if (f[i][ids[j]] == '1') {
msk |= (1 << j);
}
}
dp[msk]++;
}
for (int j = 0; j < b; j++) {
for (int i = 0; i < (1 << b); i++) {
if ((i & (1 << j)) == 0) dp[i] += dp[i ^ (1 << j)];
}
}
int ans = 0;
for (int i = 0; i < (1 << b); i++) {
if (dp[i] >= (n+1)/2) {
if (__builtin_popcount(i) > __builtin_popcount(ans)) ans = i;
}
}
string s(m, '0');
for (int i = 0; i < b; i++) {
if (ans & (1 << i)) s[ids[i]] = '1';
}
return s;
}
int cck(string &s) {
int cnt = 0;
for (char c: s) cnt += (c == '1');
return cnt;
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, m, p; cin >> n >> m >> p;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
// pick a random friend
// go through all their subsets
// see how many likes it
// do sos dp
// O(N) + O(2^15)
string ans(m, '0');
int ik = -1;
for (int ite = 0; ite <= 40; ite++) {
int gf = RAND(0, n-1);
string cl = tryit(n, m, p, s, gf);
if (cck(cl) > cck(ans)) {
ans = cl; ik = gf;
}
}
cout << ans << '\n';
return 0;
} | 10 | CPP |
A,B,C=map(int,input().split(' '))
print(min(int(B//A),C)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n, ans = 1, x;
cin >> n;
string s;
long long int col[n];
cin >> s;
col[0] = 1;
map<char, long long int> mp;
mp[s[0]] = 1;
for (long long int i = 1; i < s.size(); i++) {
x = -1;
for (char ch = s[i] + 1; ch <= 'z'; ch++) {
x = max(x, mp[ch]);
}
if (x == -1) {
x = 0;
}
col[i] = x + 1;
mp[s[i]] = x + 1;
ans = max(x + 1, ans);
}
cout << ans << "\n";
for (long long int i = 0; i < n; i++) {
cout << col[i] << " ";
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
long long x, y;
cin >> x >> y;
for (auto i : a) ans += ((i + y - 1) / (x + y)) * y;
cout << ans;
return 0;
}
| 12 | CPP |
n = int(input())
l = []
def count(l, s):
c = 0
for i in range(len(l)):
if (l[i] == s) : c += 1
return c
for i in range(n) :
l.append(input())
c = []
for i in l:
c.append(count(l, i))
print(l[c.index(max(c))])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long maxi = 1000000007;
long long mini = LLONG_MIN;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
fast();
int t;
cin >> t;
while (t--) {
long long x, y, k;
cin >> x >> y >> k;
long long ans = max(x, y);
if (ans > k) {
cout << -1 << "\n";
} else {
ans = max(x, y);
long long mx = max(x, y);
long long mn = min(x, y);
if (ans <= k) {
if (x == y) {
if (x % 2 == k % 2)
cout << k << "\n";
else {
cout << k - 2 << "\n";
}
} else {
if (mn % 2 == 0 && mx % 2 == 0) {
if (k % 2 == 0) {
cout << k << "\n";
} else
cout << k - 2 << "\n";
} else if (mn % 2 == 1 && mx % 2 == 1) {
if (k % 2 == 1) {
cout << k << "\n";
} else
cout << k - 2 << "\n";
} else {
cout << k - 1 << "\n";
}
}
}
}
}
return 0;
}
| 8 | CPP |
n = int(input())
ans = 0
for i in range(n):
s = list(map(int, input().split(' ')))
if s[1] + s[0] > ans:
ans = s[1] + s[0]
print(ans)
| 8 | PYTHON3 |
t=int(input())
while(t):
n=int(input())
l=[(1,1),(11,2),(111,3),(1111,4),(2,1),(22,2),(222,3),(2222,4),(3,1),(33,2),(333,3),(3333,4),(4,1),(44,2),(444,3),(4444,4),(5,1),(55,2),(555,3),(5555,4),(6,1),(66,2),(666,3),(6666,4),(7,1),(77,2),(777,3),(7777,4),(8,1),(88,2),(888,3),(8888,4),(9,1),(99,2),(999,3),(9999,4)]
l1=[]
for i in range(len(l)):
l1.append(l[i][1])
if(l[i][0]==n):
break
print(sum(l1))
t=t-1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > Gr;
vector<bool> used;
vector<int> dfrom1;
vector<int> number;
vector<vector<int> > Trees;
vector<vector<int> > Paths;
int maxdepth = 0;
void dfs(int s, int depth, int path) {
used[s] = true;
dfrom1[s] = depth;
int cnt = 0;
for (int i = 0; i < Gr[s].size(); ++i) {
if (!used[Gr[s][i]]) {
Paths[cnt + path].push_back(Gr[s][i]);
number[Gr[s][i]] = cnt + path;
dfs(Gr[s][i], depth + 1, path + cnt);
++cnt;
}
}
maxdepth = max(depth, maxdepth);
}
void initnewtree(int number, int size) { Trees[number].resize(4 * size + 1); }
void increasetree(int number, int ver, int l, int r, int L, int R, int value) {
if (l > r) return;
if (L == l && R == r) {
Trees[number][ver] += value;
} else {
int M = (L + R) >> 1;
increasetree(number, ver * 2, l, min(r, M), L, M, value);
increasetree(number, ver * 2 + 1, max(M + 1, l), r, M + 1, R, value);
}
}
int getit(int number, int ver, int l, int L, int R) {
int res = 0;
while (L != R) {
res += Trees[number][ver];
int m = (L + R) >> 1;
if (l <= m) {
ver <<= 1;
R = m;
} else {
ver <<= 1;
++ver;
L = m + 1;
}
}
return res + Trees[number][ver];
}
int main() {
int n, q;
cin >> n >> q;
Gr.resize(n + 1);
Paths.resize(n + 1);
number.resize(n + 1);
used.resize(n + 1, false);
dfrom1.resize(n + 1);
Trees.resize(n + 1);
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
Gr[a].push_back(b);
Gr[b].push_back(a);
}
dfs(1, 0, 1);
Trees[0].resize(4 * (maxdepth + 1) + 1);
for (int i = 1; i <= n; ++i) initnewtree(i, Paths[i].size());
for (int i = 0; i < q; ++i) {
int t, v;
cin >> t >> v;
if (t == 0) {
int x, d;
cin >> x >> d;
int Depth = dfrom1[v];
if (v == 1)
increasetree(0, 1, 0, min(maxdepth, d), 0, maxdepth, x);
else {
if (Depth <= d) {
increasetree(0, 1, 0, min(maxdepth, d - Depth), 0, maxdepth, x);
int l = d - Depth + 1;
int r = min((int)Paths[number[v]].size(), Depth + d);
if (l <= r) {
increasetree(number[v], 1, l, r, 1, Paths[number[v]].size(), x);
}
} else {
int l = max(1, Depth - d);
int r = min((int)Paths[number[v]].size(), Depth + d);
increasetree(number[v], 1, l, r, 1, Paths[number[v]].size(), x);
}
}
} else {
if (v == 1)
cout << getit(0, 1, 0, 0, maxdepth) << endl;
else
cout << getit(0, 1, dfrom1[v], 0, maxdepth) +
getit(number[v], 1, dfrom1[v], 1, Paths[number[v]].size())
<< endl;
}
}
return 0;
}
| 11 | CPP |
from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop,heapify
import math
from collections import *
from functools import reduce, cmp_to_key
import sys
input = sys.stdin.readline
from itertools import accumulate
from functools import lru_cache
M = mod = 10000
def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))
def inv_mod(n):return pow(n, mod - 2, mod)
def li():return [int(i) for i in input().rstrip('\n').split()]
def st():return input().rstrip('\n')
def val():return int(input().rstrip('\n'))
def li2():return [i for i in input().rstrip('\n')]
def li3():return [int(i) for i in input().rstrip('\n')]
g = 0
def dfs(node):
global g
d = deque()
d.append([node, 0])
maxdist = 0
farnode = node
visited = {}
while d:
node, dist = d.popleft()
visited[node] = 1
if dist > maxdist:
maxdist, farnode = dist, node
for j in g[node]:
if j not in visited:
visited[j] = 1
d.append([j, dist + 1])
return [farnode, maxdist]
def findistance(u, v):
global g
d = deque()
d.append([u, 0])
visited = {}
while d:
node, dist = d.popleft()
if node == v:return dist
visited[node] = 1
for j in g[node]:
if j not in visited:
visited[j] = 1
d.append([j, dist + 1])
for _ in range(val()):
n, a, b, da, db = li()
g = defaultdict(set)
for i in range(n - 1):
u, v = li()
g[u].add(v)
g[v].add(u)
farnode1 = dfs(1)[0]
diameter = dfs(farnode1)[1]
# print('Diameter', diameter, 'Speeds : ', da, db, a, b)
# print('Distance', findistance(a, b))
print('Bob' if findistance(a, b) > da and diameter > 2 * da and 2 * da < db else 'Alice')
| 10 | PYTHON3 |
def gcd(a, b):
if a > b:
a, b = b, a
if a == 0 or a == b:
return b
return gcd(b%a, a)
n, m = (int(x) for x in input().split())
x = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
diff = x[1]-x[0]
solparz = 'YES\n'+str(x[0])+' '
for i in range(1, n-1):
diff = gcd(diff, x[i+1]-x[i])
for j in range(m):
if diff % p[j] == 0:
solparz += str(j+1)
break
if solparz[-1]==' ':
print('NO')
else:
print(solparz) | 9 | PYTHON3 |
t = int(input())
for _ in range(t):
n = int(input())
if n % 4 == 0:
output = []
for i in range(n//2):
output.append(2*i + 2)
total = sum(output)
for i in range(n//2):
if i == n//2 - 1:
output.append(total)
else:
output.append(2*i + 1)
total -= 2*i + 1
print("YES")
print(*output)
else:
print("NO") | 8 | PYTHON3 |
def drazil(a):
sum=abs(a[0])+abs(a[1])
if a[2]==sum:
print('Yes')
elif a[2]>sum and (a[2]-sum)%2==0:
print('Yes')
else:
print('No')
a=list(map(int,input('').split()))
drazil(a) | 7 | PYTHON3 |
for _ in range (int(input())):
n, x, a, b = map(int, input().split())
if abs(b - a) + x >= n:
print(n - 1)
else:
print(abs(b - a) + x) | 7 | PYTHON3 |
s1 = input()
s2 = input()
s1=s1[::-1]
s2 = s2[::-1]
count=0
for i in range(min(len(s1),len(s2))):
if(s1[i]==s2[i]):
count+=1
else:
break
ans = (len(s1)-count) + (len(s2)-count)
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
int main()
{
int N;
scanf("%d", &N);
using vi = std::vector<int64_t>;
using vvi = std::vector<vi>;
vvi table(10, vi(10));
for (int i{1}; i <= N; i++)
{
int top{i};
while (top >= 10) top /= 10;
table[i % 10][top]++;
}
int64_t ans{};
for (int i{}; i < 10; i++)
for (int j{}; j < 10; j++)
ans += table[i][j] * table[j][i];
printf("%lld\n", ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
int x = 0, y = 0;
for (int i = 0; i < s.size(); i++) s[i] == 'x' ? x++ : y++;
if (x > y)
for (int i = 0; i < x - y; i++) cout << "x";
else
for (int i = 0; i < y - x; i++) cout << "y";
return 0;
}
| 8 | CPP |
for _ in range(int(input())):
n = int(input())
print(n)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[100000];
int main() {
int x, y, n;
cin >> x >> y;
cin >> n;
a[1] = x;
a[2] = y;
for (int i = 3; i <= 6; i++) {
a[i] = (a[i - 1] - a[i - 2]);
}
int t = n % 6;
if (t == 0) t = 6;
a[t] %= 1000000007;
while (a[t] < 0) a[t] += 1000000007;
cout << a[t] << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
class Trie {
public:
bool existed;
int next[26];
};
void insert(char *s);
multiset<int> dfs(int u, int depth);
void merge(multiset<int> &a, multiset<int> &b);
const int MAX = 1e5 + 5;
Trie *const trie = new Trie[MAX];
int trcnt;
char mode[MAX];
int main() {
int n;
while (scanf("%d", &n) != EOF) {
memset(trie, 0, 2 * sizeof(Trie));
trcnt = 0;
for (int i = 1; i <= n; i++) {
scanf("%s", mode);
insert(mode);
}
multiset<int> s = dfs(0, 0);
int res = 0;
for (auto x : s) {
res += x;
}
printf("%d\n", res);
}
return 0;
}
void insert(char *s) {
int index = 0;
for (int i = 0; s[i] != '\0'; i++) {
int &pos = trie[index].next[s[i] - 'a'];
if (!pos) {
pos = ++trcnt;
memset(&trie[pos], 0, sizeof(Trie));
}
index = pos;
}
trie[index].existed = true;
}
multiset<int> dfs(int u, int depth) {
multiset<int> s, ns;
for (int i = 0; i < 26; i++) {
int v = trie[u].next[i];
if (v != 0) {
ns = dfs(v, depth + 1);
merge(s, ns);
}
}
if (trie[u].existed) {
s.insert(depth);
} else if (depth > 0) {
s.erase(prev(s.end()));
s.insert(depth);
}
return s;
}
void merge(multiset<int> &a, multiset<int> &b) {
if (a.size() < b.size()) {
swap(a, b);
}
for (auto x : b) {
a.insert(x);
}
b.clear();
}
| 11 | CPP |
test = int(input());
while(test):
test-=1;
n,k = map(int,input().split());
ls=list(map(int,input().split()));
ss=set(ls)
if(n==k):
print(n);
print(*ls);
elif(len(ss)>k):
print(-1)
else:
ans=list(set(ls));
x=k-len(ans)
for i in range(x):
ans.append(1);
kk='';
for i in ans:
kk+=str(i)+" ";
print(k*n);
print(kk*n) | 8 | PYTHON3 |
#include <bits/stdc++.h>
struct zxf {
long x, y;
} ans[1000005] = {0, 0};
long hash[1000005] = {0}, a[1000005] = {0}, last[1000005] = {0},
count[1000005] = {0}, now[1000005] = {0}, tot[1000005] = {0},
pr[1000005] = {0}, yy[5][1000005] = {0};
int main() {
long i, j, tota = 0, n, k, sumans, len, sum, o, l;
scanf("%ld\n", &n);
for (i = 1; i <= n; i++) scanf("%ld ", &a[i]);
for (i = 1; i <= n; i++)
if (!hash[i] && a[i] != i) {
++tota;
now[tota] = i;
for (j = i;; j = a[j])
if (!hash[j]) {
hash[j] = 1;
count[tota]++;
last[tota] = j;
} else
break;
}
sumans = 0;
len = 0;
for (i = 1; i <= tota;) {
sum = 0;
if (count[i] < 5) {
yy[count[i]][++yy[count[i]][0]] = i;
i++;
continue;
}
sumans++;
pr[sumans] = len;
while (1) {
if (i == tota + 1) goto de;
if (count[i] < 5) {
yy[count[i]][++yy[count[i]][0]] = i;
i++;
break;
}
if (sum == 4 || sum == 5) break;
o = ((5 - sum) < (count[i]) ? (5 - sum) : (count[i]));
tot[sumans] += o;
for (k = last[i], j = 1; j < o; j++) {
++len;
ans[len].x = k;
ans[len].y = a[k];
k = a[k];
}
++len;
ans[len].x = k;
ans[len].y = last[i];
a[last[i]] = a[k];
count[i] -= o;
sum += o;
if (count[i] == 0)
i++;
else
count[i]++;
}
}
de:;
for (i = 1; i <= yy[4][0]; i++) {
sumans++;
pr[sumans] = len;
l = yy[4][i];
tot[sumans] = 4;
for (k = last[l], j = 1; j < 4; j++) {
++len;
ans[len].x = k;
ans[len].y = a[k];
k = a[k];
}
++len;
ans[len].x = k;
ans[len].y = last[l];
}
for (i = 1; i <= ((yy[3][0]) < (yy[2][0]) ? (yy[3][0]) : (yy[2][0])); i++) {
sumans++;
pr[sumans] = len;
l = yy[3][i];
tot[sumans] = 5;
for (k = last[l], j = 1; j < 3; j++) {
++len;
ans[len].x = k;
ans[len].y = a[k];
k = a[k];
}
++len;
ans[len].x = k;
ans[len].y = last[l];
++len;
ans[len].x = last[yy[2][i]];
ans[len].y = a[last[yy[2][i]]];
++len;
ans[len].x = ans[len - 1].y;
ans[len].y = ans[len - 1].x;
}
long i1 = i;
for (j = i1; j <= yy[3][0];) {
sumans++;
pr[sumans] = len;
sum = 5;
while (1) {
if (j == yy[3][0] + 1) goto de1;
if (sum == 0) break;
l = yy[3][j];
o = ((count[l]) < (sum) ? (count[l]) : (sum));
tot[sumans] += o;
for (k = last[l], i = 1; i < o; i++) {
++len;
ans[len].x = k;
ans[len].y = a[k];
k = a[k];
}
++len;
ans[len].x = k;
ans[len].y = last[l];
a[last[l]] = a[k];
count[l] -= o;
sum -= o;
if (count[l] == 0)
j++;
else
count[l]++;
}
}
for (j = i1; j <= yy[2][0]; j++) {
sumans++;
pr[sumans] = len;
tot[sumans] = 2;
++len;
ans[len].x = last[yy[2][j]];
ans[len].y = a[last[yy[2][j]]];
++len;
ans[len].x = ans[len - 1].y;
ans[len].y = ans[len - 1].x;
if (j < yy[2][0]) {
j++;
tot[sumans] += 2;
++len;
ans[len].x = last[yy[2][j]];
ans[len].y = a[last[yy[2][j]]];
++len;
ans[len].x = ans[len - 1].y;
ans[len].y = ans[len - 1].x;
}
}
de1:;
printf("%ld\n", sumans);
for (i = 1; i <= sumans; i++) {
printf("%ld\n", tot[i]);
for (j = 1; j <= tot[i]; j++) printf("%ld ", ans[pr[i] + j].x);
printf("\n");
for (j = 1; j <= tot[i]; j++) printf("%ld ", ans[pr[i] + j].y);
printf("\n");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int *mem, *rl, n, m;
char mp[41][41];
int right_left(int r, int c, int rmin, int cmin) {
int index = (rmin - 1) * m * n * m + (cmin - 1) * n * m + (r - 1) * m + c - 1;
if (rl[index] != -1)
return rl[index];
else {
int len = r - rmin + 1, *tw = new int[len], ans = 0, mini;
memset(tw, 0, len * 4);
for (int i = 0; i < len; i++) {
int j = 0;
while (mp[r - i][c - j] == '0' && j <= c - cmin) {
tw[i]++;
j++;
}
}
mini = tw[0];
for (int i = 0; i < len; i++) {
if (mini > tw[i]) mini = tw[i];
ans += mini;
}
delete[] tw;
return rl[index] = ans;
}
}
int f(int a, int b, int c, int d) {
int index = (a - 1) * m * n * m + (b - 1) * n * m + (c - 1) * m + d - 1;
if (mem[index] != -1)
return mem[index];
else {
int ans = 0;
for (int row = a; row <= c; row++)
for (int col = b; col <= d; col++) ans += right_left(row, col, a, b);
return mem[index] = ans;
}
}
int main() {
int cas, a, b, c, d;
for (int i = 0; i < 41; i++) mp[i][0] = mp[0][i] = '1';
while (cin >> n >> m >> cas) {
mem = new int[n * m * n * m];
rl = new int[n * m * n * m];
memset(mem, -1, n * m * n * m * 4);
memset(rl, -1, n * m * n * m * 4);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> mp[i][j];
while (cas--) {
cin >> a >> b >> c >> d;
(cout << f(a, b, c, d) << endl);
}
}
return 0;
}
| 8 | CPP |
t = int(input());
for t1 in range(t):
n = int(input());
a = list(map(int,input().split()));
m0 = 0; m1 = 0; m2 = 0;
for k in a:
if k%3==0: m0+=1;
elif k%3==1: m1+=1;
else: m2+=1;
if m1>=m2: print(m0 + m2 + (m1-m2)//3);
else: print(m0 + m1 + (m2-m1)//3);
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool pd[1000500 * 2 + 1];
int p[1000500 * 2], p_num[1000500 * 2], p_fa[1000500 * 2], acc = 0,
fa[1000500 * 2];
int n, q, a[1000500 * 2], b[1000500 * 2];
int get(int x) {
if (x == fa[x])
return x;
else
return fa[x] = get(fa[x]);
}
int merge(int x, int y) {
x = get(x);
y = get(y);
fa[x] = y;
}
vector<int> zy[1000500 * 2];
map<int, int> MAP[1000500 * 2];
int main() {
int k;
memset(pd, false, sizeof(pd));
for (int i = 2; i <= 1000500; i++) {
if (pd[i]) continue;
for (int j = i; j <= 1000500; j += i) {
pd[j] = true;
k++;
zy[j].push_back(i);
}
p[++acc] = i;
}
for (int i = 1; i < 1000500; i++) fa[i] = i;
cin >> n >> q;
for (int i = 1; i <= n; i++) cin >> a[i], b[a[i]] = i;
for (int i = 1; i <= acc; i++) {
int bc = 0;
for (int j = 1; j <= 1000500; j++) {
if (p[i] * j > 1010000) break;
if (b[p[i] * j]) {
p_num[p[i]] = b[p[i] * j];
if (bc != 0) merge(bc, b[p[i] * j]);
bc = b[p[i] * j];
}
}
}
for (int i = 1; i <= acc; i++) {
p_fa[p[i]] = get(p_num[p[i]]);
}
int s, t;
for (int i = 1; i <= n; i++) {
int A = i, B = a[i] + 1;
A = get(A);
for (int j = 0; j <= zy[B].size() - 1; j++) {
int ys = zy[B][j];
if (MAP[A].find(p_fa[ys]) == MAP[A].end()) MAP[A][p_fa[ys]] = 1;
for (int k = 0; k < j; k++) {
int ys2 = zy[B][k];
if (MAP[p_fa[ys]].find(p_fa[ys2]) == MAP[p_fa[ys]].end())
MAP[p_fa[ys]][p_fa[ys2]] = 1;
}
}
}
for (int i = 1; i <= q; i++) {
cin >> s >> t;
if (get(s) == get(t)) {
cout << 0 << endl;
continue;
}
s = get(s), t = get(t);
if (MAP[s].find(t) != MAP[s].end() || MAP[t].find(s) != MAP[t].end()) {
cout << 1 << endl;
continue;
}
cout << 2 << endl;
}
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, m;
scanf("%d", &t);
while (t--) {
scanf("%d%d", &n, &m);
char ch[n + 2][m + 2];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (i % 2 == 0) {
if (j % 2 == 0)
ch[i][j] = 'B';
else
ch[i][j] = 'W';
} else {
if (j % 2 == 0)
ch[i][j] = 'W';
else
ch[i][j] = 'B';
}
}
}
ch[n - 1][m - 1] = 'B';
if (n % 2 == 0 && m % 2 == 0) ch[n - 1][0] = 'B';
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) printf("%c", ch[i][j]);
printf("\n");
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5L + 11;
int c[N], d[N];
int main() {
ios ::sync_with_stdio(false);
int n;
cin >> n;
int x = 1e9L, sum = 0;
for (int i = 1; i <= n; i++) {
cin >> c[i] >> d[i];
if (d[i] == 2) x = min(x, 1899 - sum);
sum += c[i];
}
bool f = 1;
for (int i = 1; i <= n; i++) {
if (x >= 1900 && d[i] == 2) f = 0;
if (x <= 1899 && d[i] == 1) f = 0;
x += c[i];
}
if (f) {
if (x > 1e8L)
cout << "Infinity\n";
else
cout << x << '\n';
} else
cout << "Impossible\n";
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, cnt = 0;
string s1, s2;
cin >> n >> t;
int H = t;
cin >> s1 >> s2;
for (int i = 0; i < n; ++i)
if (s1[i] != s2[i]) cnt++;
int T = t;
string ans = s1;
int k = 0;
for (int i = 0; i < n; ++i) {
if (s1[i] != s2[i]) {
if (cnt <= T) {
if (s1[i] != 'a' && s2[i] != 'a')
ans[i] = 'a';
else if (s1[i] != 'b' && s2[i] != 'b')
ans[i] = 'b';
else
ans[i] = 'c';
T--;
cnt--;
} else {
if (k % 2 == 0)
ans[i] = s1[i];
else
ans[i] = s2[i];
k++;
if (k == 2) {
k = 0;
T--;
cnt -= 2;
}
}
}
}
for (int i = 0; i < n && T > 0; ++i)
if (s1[i] == s2[i] && ans[i] == s1[i]) {
if (s1[i] == 'a')
ans[i] = 'b';
else
ans[i] = 'a';
T--;
}
int k1 = 0, k2 = 0;
for (int i = 0; i < n; ++i)
if (s1[i] != ans[i]) k1++;
for (int i = 0; i < n; ++i)
if (s2[i] != ans[i]) k2++;
if (k1 != H || k2 != H) {
cout << -1 << endl;
return 0;
}
cout << ans << endl;
}
| 9 | CPP |
for _ in range(int(input())):
n = int(input())
num = int(input())
dig_sum = sum([int(i) for i in list(str(num)) ])
while num>0:
if num%2!=0 and dig_sum%2==0:
break
else:
dig_sum -= num%10
num//=10
print(num if num else -1)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const double PI = 3.1415926536;
int main() {
int n;
cin >> n;
int arr[205];
int neg = 0;
for (int i = 0; i < 2 * n - 1; i++) {
cin >> arr[i];
if (arr[i] < 0) neg++;
}
int res = 0;
for (int i = 0; i < 2 * n - 1; i++) res += abs(arr[i]);
if (neg % 2 == 0 || n % 2) {
cout << res << endl;
return 0;
}
int m = 99999999;
for (int i = 0; i < 2 * n - 1; i++) {
m = min(abs(arr[i]), m);
}
cout << res - 2 * m << endl;
return 0;
}
| 9 | CPP |
a,b=input().split()
if a in b:
print('H')
else:
print('D') | 0 | PYTHON3 |
#include<cstdio>
#include<set>
#include<cstring>
using namespace std;
set<int> se;
int N,K;
int card[10];
bool used[10];
void rec(int num,int k)
{
if(k==K)
{
se.insert(num);
return;
}
for(int i=0;i<N;i++)
{
if(used[i]==true) continue;
used[i]=true;
int nnum;
if(card[i]<10) nnum=num*10+card[i];
else nnum=num*100+card[i];
rec(nnum,k+1);
used[i]=false;
}
}
int main()
{
while(true)
{
scanf("%d%d",&N,&K);
if(N==0&&K==0) break;
se.clear();
for(int i=0;i<N;i++)
{
scanf("%d",card+i);
}
memset(used,false,sizeof(used));
rec(0,0);
printf("%d\n",se.size());
}
return 0;
} | 0 | CPP |
def check():
n, m = [int(item) for item in input().split()]
n_need = [int(item) for item in input().split()]
m_have = [int(item) for item in input().split()]
i,j = 0, 0
while i<n and j <m:
if n_need[i]<= m_have[j]:
i += 1
j += 1
print(n - i)
check()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
bool help(const pair<long long int, long long int> a,
const pair<long long int, long long int> b) {
if (a.first == b.first)
return a.second < b.second;
else
return a.first > b.first;
}
void solve() {
long long int n, k;
cin >> n >> k;
map<pair<long long int, long long int>, long long int> mp, ans;
vector<pair<long long int, long long int>> v;
for (long long int i = 0; i < n; i++) {
long long int a, b;
cin >> a >> b;
v.push_back({a, b});
if (mp[{a, b}] == 0)
mp[{a, b}] = i + 1;
else {
ans[{a, b}]++;
}
}
sort(v.begin(), v.end(), help);
cout << ans[{v[k - 1].first, v[k - 1].second}] + 1;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t = 1;
while (t--) {
solve();
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1002;
int f[maxn][(1 << 16)];
char s[5][maxn];
int a[5];
int M[5][5];
int cal(int i, int j) {
int ans = 0;
int k = j;
while (k--) {
for (int jj = 0; jj < j; jj++) ans |= (1 << i + jj);
i += 4;
}
return ans;
}
void init() {
for (int i = 0; i < 4; i++) {
for (int j = 1; j <= 4; j++) {
M[i][j] = cal(i, j);
}
}
}
int main() {
init();
int n;
cin >> n;
for (int i = 1; i <= 4; i++) scanf("%d", a + i);
for (int i = 1; i <= 4; i++) scanf("%s", s[i]);
memset(f, 0x3f, sizeof(f));
int mask = 0;
for (int i = 0; i < 4; i++) {
for (int j = 1; j <= 4; j++)
if (s[j][i] == '.') mask |= (1 << (j - 1 + 4 * i));
}
f[1][mask] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 4 - j; k > 0; k--) {
for (int m = (1 << 16) - 1; m >= 0; m--) {
f[i][m | M[j][k]] = min(f[i][m | M[j][k]], f[i][m] + a[k]);
}
}
}
mask = 0;
if (i + 3 < n)
for (int j = 1; j <= 4; j++)
if (s[j][i + 3] == '.') mask += (1 << j - 1);
mask <<= 12;
for (int t = (1 << 12) - 1; t >= 0; t--) {
int m = (t << 4) + 15;
f[i + 1][(m >> 4) + mask] = min(f[i + 1][(m >> 4) + mask], f[i][m]);
assert((m >> 4) + mask < (1 << 16));
}
}
printf("%d\n", f[n][15]);
}
| 12 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
const long long MOD = 1e9 + 7;
using namespace std;
long long n_bits(long long n) {
long long x = __builtin_popcount(n);
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) {
long long n, x;
cin >> n >> x;
long long a[n], c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 != 0) c++;
}
long long e = n - c;
if (c == 0)
cout << "NO" << endl;
else {
if (e >= x)
cout << "YES" << endl;
else {
if ((x - e) % 2 == 0) {
if (e != 0 && (x - e) <= c - 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
} else {
if ((x - e) <= c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
}
}
return 0;
}
| 7 | CPP |
def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = [0] + li()
d = [a[i] - a[i - 1] for i in range(1, n + 1)]
ans = []
for i in range(1, n + 1):
ok = all(d[j] == d[j % i] for j in range(n))
if ok: ans.append(i)
print(len(ans))
print(*ans)
| 8 | PYTHON3 |
n=int(input())
a=[input() for i in range(n)]
c=0
for i in range(1,n-1):
for j in range(1,n-1):
c+=(a[i][j]==a[i-1][j-1]==a[i-1][j+1]==a[i+1][j-1]==a[i+1][j+1]=='X')
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
for (i = 1; i <= n; i++) {
if (n > 1) {
if (i % 2 == 0) {
cout << "I "
<< "love ";
} else {
cout << "I "
<< "hate ";
}
if (i == n) {
cout << "it ";
} else {
cout << "that ";
}
} else {
cout << "I hate it";
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int y, z, w = 0, c = 0, n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> y >> z;
if (y > z)
w++;
else if (z > y)
c++;
}
if (w > c)
cout << "Mishka";
else if (w < c)
cout << "Chris";
else
cout << "Friendship is magic!^^";
}
| 7 | CPP |
n, k = map(int, input().split())
a = []
s = input()
for j in s:
a.append(int(j))
b = a[:k]
j = 0
f = 0
while (j < n):
if a[j] > b[j % k]:
f = 1
break
elif a[j]<b[j%k]:
break
else:
pass
j += 1
if f == 1:
j = k - 1
while (j >= 0):
if b[j] == 9:
b[j] = 0
else:
b[j] += 1
break
j += -1
d = []
for j in range(n):
d.append(str(b[j % k]))
j += 1
print(len(d))
print("".join(d)) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long walk(long long nodeCnt, int dir, long long pos) {
if (nodeCnt == 1) return 0;
long long halfNodeCnt = (nodeCnt >> 1);
long long halfLeafCnt = ((halfNodeCnt + 1) >> 1);
if (dir == 0 && pos <= halfLeafCnt || dir == 1 && pos > halfLeafCnt) {
return 1 + walk(halfNodeCnt, dir ^ 1, pos - (dir == 0 ? 0 : halfLeafCnt));
} else {
return 1 + halfNodeCnt +
walk(halfNodeCnt, dir, pos - (dir == 1 ? 0 : halfLeafCnt));
}
}
int main() {
long long h, n;
cin >> h >> n;
cout << walk(((long long)1 << (h + 1)) - 1, 0, n) << endl;
return 0;
}
| 9 | CPP |
# C
S=list(input())
f=0
for i in range(len(S)-1):
if S[i]!=S[i+1]:
f+=1
print(f) | 0 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
int n,k,sum=0;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
cout<<accumulate(a,a+k,sum);
} | 0 | CPP |
a = list(input().split())
dict_c = {}
res = 0
for i in (a):
if i not in dict_c:
dict_c[i] =1
else:
dict_c[i] +=1
res+=1
print(res) | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
int W,H,A,B;
ll D[200010],R[200010];
ll ans = 0;
ll power(ll a,ll b)
{
if(b == 0)return 1;
ll res = power(a * a % mod,b / 2);
if(b & 1)res = res * a % mod;
return res;
}
ll con(int a,int b)
{
if(a < b)return 0;
return (D[a] * R[b] % mod) * R[a - b] % mod;
}
int main()
{
scanf("%d%d%d%d",&H,&W,&A,&B);
ll now = 1;
for(int i = 0; i < H + W + 2; i++){D[i] = now;now *= i + 1;now %= mod;}
for(int i = 0; i < H + W + 2; i++){R[i] = power(D[i],mod - 2);}
for(int i = B + 1; i <= W; i++)
{
ll res = (con(i - 1 + H - A - 1,i - 1) * con(W - i + A - 1,A - 1)) % mod;
ans += res;ans %= mod;
}
printf("%lld\n",ans);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 1e4 + 10;
const int M = 1e5 + 10;
bool vis[N];
int dist[N];
int s, t, ans = 0;
int nedge = -1, p[M], c[M], cc[M], nex[M], head[N];
inline void add(int x, int y, int z, int zz) {
p[++nedge] = y;
c[nedge] = z;
cc[nedge] = zz;
nex[nedge] = head[x];
head[x] = nedge;
}
void addedge(int x, int y, int z, int zz) {
add(x, y, z, zz);
add(y, x, 0, -zz);
}
inline bool spfa(int s, int t) {
memset(vis, 0, sizeof vis);
for (int i = 0; i < N; i++) dist[i] = 1e9;
dist[t] = 0;
vis[t] = 1;
deque<int> q;
q.push_back(t);
while (!q.empty()) {
int now = q.front();
q.pop_front();
for (int k = head[now]; k > -1; k = nex[k])
if (c[k ^ 1] && dist[p[k]] > dist[now] - cc[k]) {
dist[p[k]] = dist[now] - cc[k];
if (!vis[p[k]]) {
vis[p[k]] = 1;
if (!q.empty() && dist[p[k]] < dist[q.front()])
q.push_front(p[k]);
else
q.push_back(p[k]);
}
}
vis[now] = 0;
}
return dist[s] < 1e9;
}
inline int dfs(int x, int low) {
if (x == t) {
vis[t] = 1;
return low;
}
int used = 0, a;
vis[x] = 1;
for (int k = head[x]; k > -1; k = nex[k])
if (!vis[p[k]] && c[k] && dist[x] - cc[k] == dist[p[k]]) {
a = dfs(p[k], min(c[k], low - used));
if (a) ans += a * cc[k], c[k] -= a, c[k ^ 1] += a, used += a;
if (used == low) break;
}
return used;
}
inline int costflow() {
int flow = 0;
while (spfa(s, t)) {
vis[t] = 1;
while (vis[t]) {
memset(vis, 0, sizeof vis);
flow += dfs(s, 1e9);
}
}
return flow;
}
void init() {
memset(nex, -1, sizeof nex);
memset(head, -1, sizeof head);
}
int a[N];
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
init();
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
init();
s = 0;
int st = 2 * n + 1;
t = 2 * n + 2;
addedge(s, st, 4, 0);
for (int i = 1; i <= n; i++) {
addedge(st, i, 1, 0), addedge(n + i, t, 1, 0);
addedge(i, i + n, 1, -1), addedge(i, n + i, inf, 0);
}
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j; j--) {
if (a[j] % 7 == a[i] % 7) {
addedge(n + j, i, 1, 0);
break;
}
}
for (int j = i - 1; j; j--) {
if (a[j] == a[i] + 1) {
addedge(n + j, i, 1, 0);
break;
}
}
for (int j = i - 1; j; j--) {
if (a[j] == a[i] - 1) {
addedge(n + j, i, 1, 0);
break;
}
}
}
costflow();
cout << -ans << '\n';
return 0;
}
| 13 | CPP |
def fillingShape(n):
if n%2==0:
return pow(2,n//2)
return 0
n=int(input())
print(fillingShape(n)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const long long linf = 1e18 + 7;
const long long hh = 523;
pair<pair<int, int>, int> ss[100007];
int hy[100007];
pair<pair<int, int>, int> s1[100007];
vector<int> ans;
bool d1(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
if (a.first.first != b.first.first) {
return a.first.first < b.first.first;
}
return a.first.second > b.first.second;
}
int main() {
int n, p, k;
scanf("%d%d%d", &n, &p, &k);
for (int i = 0; i < n; i++) {
scanf("%d%d", &ss[i].first.second, &ss[i].first.first);
ss[i].second = i;
}
sort(ss, ss + n, d1);
for (int i = 0; i < n; i++) {
hy[i] = ss[i].second;
s1[i].first.first = ss[i].first.second;
s1[i].first.second = ss[i].first.first;
s1[i].second = i;
}
sort(s1 + p - k, s1 + n);
int mn = n;
for (int i = n - 1; i >= n - k; i--) {
ans.push_back(s1[i].second);
mn = min(mn, s1[i].second);
}
for (int i = mn - 1; i >= mn - (p - k); i--) {
ans.push_back(i);
}
for (int i = 0; i <= ans.size() - 1; i++) {
if (i != ans.size() - 1) {
printf("%d ", hy[ans[i]] + 1);
} else {
printf("%d\n", hy[ans[i]] + 1);
}
}
return 0;
}
| 9 | CPP |
import sys
class SegTreeMin:
def __init__(self, n, max_v):
self.n = n
n2 = 1
while n2 < n:
n2 <<= 1
self.n2 = n2
self.tree = [max_v] * (n2 << 1)
self.INF = max_v
def update(self, i, x):
i += self.n2
self.tree[i] = x
while i > 1:
self.tree[i >> 1] = x = min(x, self.tree[i ^ 1])
i >>= 1
def get_min(self, a, b):
result = self.INF
q = [(1, 0, self.n2)]
while q:
k, l, r = q.pop()
if a <= l and r <= b:
result = min(result, self.tree[k])
continue
m = (l + r) // 2
k <<= 1
if a < m and l < b:
q.append((k, l, m))
if a < r and l < m:
q.append((k + 1, m, r))
return result
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, m = list(map(int, input().rstrip('\n').split()))
seg_tree = SegTreeMin(n, 10 ** 15)
seg_tree.update(0, 0)
lrc = [list(map(int, input().rstrip('\n').split())) for _ in range(m)]
lrc.sort()
for l, r, c in lrc:
l -= 1
r -= 1
tm = seg_tree.get_min(l, r)
seg_tree.update(r, min(tm + c, seg_tree.get_min(r, r + 1)))
mt = seg_tree.get_min(n-1, n)
print(mt if mt != 10 ** 15 else -1)
if __name__ == '__main__':
solve()
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<double> p;
vector<double> q;
vector<double> psum;
vector<double> qsum;
double memo[502][502];
double dfs( int l, int r )
{
if( memo[l][r] >= 0 ) return memo[l][r];
if( l == r ) return memo[l][r] = 0;
double res = DBL_MAX;
double total = psum[r] - psum[l] + qsum[r] - qsum[l - 1];
for( int x = l + 1; x <= r; x++ ) {
double left = psum[x - 1] - psum[l] + qsum[x - 1] - qsum[l - 1];
double right = total - left - p[x - 2];
double w = (dfs( l, x - 1 ) + 1) * left / total + (dfs( x, r ) + 1) * right / total;
res = min( res, w );
}
memo[l][r] = res;
return res;
}
int main()
{
int n;
cin >> n;
p = vector<double>( n );
for( int i = 0; i < n; i++ ) cin >> p[i];
q = vector<double>( n + 1 );
for( int i = 0; i < n + 1; i++ ) cin >> q[i];
memset( memo, -1, sizeof( memo ) );
psum = vector<double>( n + 2 );
for( int i = 2; i < n + 2; i++ ) psum[i] = psum[i - 1] + p[i - 2];
qsum = vector<double>( n + 2 );
for( int i = 1; i < n + 2; i++ ) qsum[i] = qsum[i - 1] + q[i - 1];
double ans = dfs( 1, n + 1 ) + 1;
cout << fixed << setprecision(8) << ans << endl;
}
| 0 | CPP |
E = 10 ** -10
while True:
try:
xa, ya, xb, yb, xc, yc, xd, yd = map(float, input().split())
vabx, vaby = xb - xa, yb - ya
vcdx, vcdy = xd - xc, yd - yc
print("YES" if abs(vabx * vcdx + vaby * vcdy) < E else "NO")
except EOFError:
break
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int n, m, gg, p01 = 0, p02 = 0, p11 = 0, p12 = 0;
char c;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> c;
if (c == '0') {
if (p01 == 0) p01 = i;
p02 = i;
}
if (c == '1') {
if (p11 == 0) p11 = i;
p12 = i;
}
}
if ((p01 == 0 && p02 == 0) || (p11 == 0 && p12 == 0))
gg = 1;
else if (p02 - p01 + 1 <= m || p12 - p11 + 1 <= m)
gg = 1;
else if ((p02 - p01 == m && p12 != 0 && p11 != 0 &&
((p11 < p01 && p01 < m) || (p12 > p02 && p12 - p02 < m)) &&
p12 - p11 <= m) ||
(p12 - p11 == m && p02 != 0 && p01 != 0 &&
((p01 < p11 && p11 < m) || (p02 > p12 && p02 - p12 < m))) &&
p02 - p01 <= m)
gg = 0;
else
gg = 2;
if (gg == 1)
cout << "tokitsukaze\n";
else if (gg == 0)
cout << "quailty\n";
else
cout << "once again\n";
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fill(name, val) memset(name, val, sizeof(name));
#define mop(a, op, b) (a%mod op b%mod)%mod
#define mod 1000000007LL
/* Author: 🆉🅴🅽🅾🅻🆄🆂 */
string k;
ll dp[10001][2][101], d;
ll count(ll i, bool tight, ll sum){
if(i == k.size()) return (sum == 0);
if(dp[i][tight][sum] != -1) return dp[i][tight][sum];
ll ans = 0, high = tight ? k[i]-'0' : 9;
for(ll j = 0; j <= high; j++)
ans = mop(ans, +, count(i+1, tight & (j == high), (sum+j)%d));
return dp[i][tight][sum] = ans;
}
int main(){
fill(dp, -1); cin>>k>>d;
cout<<(count(0, 1, 0) + mod - 1) % mod;
}
// Time: O(D*logK)
// Space: O(D*logK) | 0 | CPP |
from collections import *
n=int(input())
a=list(map(int,input().split()))
a.sort()
a=deque(a)
ans=[]
aa=a.pop()
tmp=a.popleft()
while a:
t=a.popleft()
if t<=0:
ans.append((aa,t))
aa-=t
else:
ans.append((tmp,t))
tmp-=t
ans.append((aa,tmp))
print(aa-tmp)
for i in ans:
print(i[0],i[1]) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, s[333333], pz[333333], have[333333], p[333333];
void modify(int x, int v) {
while (x <= n) {
s[x] += v;
x = (x | (x - 1)) + 1;
}
}
int findsum(int x) {
int v = 0;
while (x > 0) {
v += s[x];
x &= x - 1;
}
return v;
}
void put(int x, int v) {
if (have[x] != v) {
modify(x, v - have[x]);
have[x] = v;
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int foo;
scanf("%d", &foo);
p[i] = foo;
pz[foo] = i;
}
for (int i = 1; i <= n; i++) s[i] = have[i] = 0;
for (int i = 1; i < n; i++)
if (pz[i] > pz[i + 1]) put(i, 1);
int tt;
scanf("%d", &tt);
while (tt--) {
int com, x, y;
scanf("%d %d %d", &com, &x, &y);
if (com == 1) {
printf("%d\n", findsum(y - 1) - findsum(x - 1) + 1);
} else {
int tmp = p[x];
p[x] = p[y];
p[y] = tmp;
pz[p[x]] = x;
pz[p[y]] = y;
{
int z = x;
if (p[z] > 1)
if (pz[p[z] - 1] > pz[p[z]])
put(p[z] - 1, 1);
else
put(p[z] - 1, 0);
if (p[z] < n)
if (pz[p[z]] > pz[p[z] + 1])
put(p[z], 1);
else
put(p[z], 0);
}
{
int z = y;
if (p[z] > 1)
if (pz[p[z] - 1] > pz[p[z]])
put(p[z] - 1, 1);
else
put(p[z] - 1, 0);
if (p[z] < n)
if (pz[p[z]] > pz[p[z] + 1])
put(p[z], 1);
else
put(p[z], 0);
}
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
double arr[2002][1002];
int main() {
int a, b, c, d, e, f, g, h;
scanf("%d%d", &a, &b);
e = a + b;
arr[e][a] = 1.0;
f = e;
double res = 0.0;
g = 1;
while (f) {
if (g) {
for (d = 1; d <= f; d++) {
res += arr[f][d] * (double)(d) / (double)(f);
arr[f - 1][d] += arr[f][d] * (double)(f - d) / (double)(f);
}
f -= 1;
} else {
if (f < 2) break;
for (d = 1; d <= f; d++) {
arr[f - 2][d] += arr[f][d] * (double)(f - d) / (double)(f) *
(double)(f - d - 1.0) / (double)(f - 1.0);
arr[f - 2][d - 1] += arr[f][d] * (double)(f - d) / (double)(f) *
(double)(d) / (double)(f - 1.0);
}
f -= 2;
}
g ^= 1;
}
printf("%.9f\n", res);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct scholarship {
long long grade, cost;
} arr[100007];
long long n, r, avg;
bool comp(scholarship a, scholarship b) { return a.cost < b.cost; }
int main() {
long long i, j, temp, ans = 0, sum = 0, com, gap;
scanf("%lld%lld%lld", &n, &r, &avg);
avg *= n;
for (i = 0; i < n; i++) {
scanf("%lld%lld", &arr[i].grade, &arr[i].cost);
sum += arr[i].grade;
}
avg -= sum;
sort(arr, arr + n, comp);
i = 0;
while (avg > 0) {
gap = r - arr[i].grade;
if (gap == avg) {
ans += gap * arr[i].cost;
break;
} else if (gap > avg) {
ans += avg * arr[i].cost;
break;
} else {
ans += gap * arr[i].cost;
avg -= gap;
}
i++;
}
printf("%lld\n", ans);
return 0;
}
| 9 | CPP |
n = int(input())
num = input().split()
for i in range(n):
print(num.index(str(i+1))+1, end=" ") | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
int n, m, i, j, k, p[100005];
long long d[100005], sz[100005];
vector<int> e[100005];
void dfs(int u, int fa, int dep) {
p[u] = fa;
d[u] = dep;
sz[u] = 1;
for (int v : e[u]) {
if (v == fa) continue;
dfs(v, u, dep + 1);
sz[u] += sz[v];
}
}
long long ans = 0, A[100005], ssz[100005], s2sz[100005];
void dp(int u, int fa) {
for (int v : e[u])
if (v != fa) dp(v, u);
A[u] = 0, ssz[u] = 0, s2sz[u] = 0;
for (int v : e[u]) {
if (v == fa) continue;
A[u] += 2 * sz[v] * (sz[1] - sz[u]) + sz[v] * (sz[u] - sz[v] - 1),
ssz[u] += sz[v], s2sz[u] += sz[v] * sz[v];
}
ans += A[u];
}
long long w[100005];
int fa[100005];
int Find(int x) { return fa[x] == x ? x : (fa[x] = Find(fa[x])); }
long long P(int x, int y) {
long long ret = 1;
for (int i = x; i >= x - y + 1; i--) ret *= i;
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
e[u].push_back(v), e[v].push_back(u);
}
dfs(1, 0, 1);
dp(1, 0);
cout << ans << endl;
for (i = 1; i <= n; i++) fa[i] = i, w[i] = 1;
cin >> m;
while (m--) {
int X, Y, V = 0;
cin >> X >> Y;
if (Find(X) == Find(Y)) {
cout << ans << endl;
continue;
}
int x = Find(X), y = Find(Y), tmpx = 0, tmpy = 0;
long long cnt = 0, S = 0, S2 = 0;
while (x != y) {
if (d[x] > d[y]) {
V += w[x], cnt += A[x], S += ssz[x] - sz[tmpx],
S2 += s2sz[x] - sz[tmpx] * sz[tmpx];
tmpx = x, x = fa[x] = Find(p[x]);
} else {
V += w[y], cnt += A[y], S += ssz[y] - sz[tmpy],
S2 += s2sz[y] - sz[tmpy] * sz[tmpy];
tmpy = y, y = fa[y] = Find(p[y]);
}
}
int lca = x;
V += w[lca], cnt += A[lca], S += ssz[lca] - sz[tmpx] - sz[tmpy],
S2 += s2sz[lca] - sz[tmpx] * sz[tmpx] - sz[tmpy] * sz[tmpy];
w[lca] = V, ssz[lca] = S, s2sz[lca] = S2;
A[lca] = P(V, 3) + 2 * P(V, 2) * (sz[1] - V) +
V * (2 * S * (sz[1] - sz[lca]) + (sz[lca] - w[lca]) * S - S2);
ans += A[lca] - cnt;
cout << ans << endl;
}
return 0;
}
| 13 | CPP |
def solve():
n, m, k = list(map(lambda x: int(x), input().split()))
if m <= n/k: return m
rem_ = m - n//k
dist = rem_ / (k - 1)
return n//k - int(dist) if dist == int(dist) else n//k - int(dist+1)
cases = int(input())
ans = []
for case in range(cases):
ans.append(solve())
for el in ans:
print(el)
| 7 | PYTHON3 |
w = int(input())
if w==9 or w==2 or w==77 or w==1 or w==7 or w==3 or w==67:
print('NO')
quit()
if w==4 or w==98 or w==90 or w==10 or w==44 or w==8 or w==32:
print('YES')
quit()
if w%2==1:
print("NO")
quit()
print("YES") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b) {
long long res = 1;
a %= 1000000007;
for (; b; b >>= 1) {
if (b & 1) res = res * a % 1000000007;
a = a * a % 1000000007;
}
return res;
}
int gcd(int x, int y) {
while (y) {
int t = x % y;
x = y;
y = t;
}
return x;
}
template <typename T>
inline bool chkmin(T &a, const T &b) {
return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
return a < b ? a = b, 1 : 0;
}
namespace FastIO {
bool IOError = 0;
inline char NextChar() {
static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, 100000, stdin);
if (pend == p1) {
IOError = 1;
return -1;
}
}
return *p1++;
}
inline bool Blank(char c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t';
}
inline void read(int &x) {
bool sign = 0;
char ch = NextChar();
x = 0;
for (; Blank(ch); ch = NextChar())
;
if (IOError) return;
if (ch == '-') sign = 1, ch = NextChar();
for (; ch >= '0' && ch <= '9'; ch = NextChar()) x = x * 10 + ch - '0';
if (sign) x = -x;
}
inline void read(long long &x) {
bool sign = 0;
char ch = NextChar();
x = 0;
for (; Blank(ch); ch = NextChar())
;
if (IOError) return;
if (ch == '-') sign = 1, ch = NextChar();
for (; ch >= '0' && ch <= '9'; ch = NextChar()) x = x * 10 + ch - '0';
if (sign) x = -x;
}
inline void read(double &x) {
bool sign = 0;
char ch = NextChar();
x = 0;
for (; Blank(ch); ch = NextChar())
;
if (IOError) return;
if (ch == '-') sign = 1, ch = NextChar();
for (; ch >= '0' && ch <= '9'; ch = NextChar()) x = x * 10 + ch - '0';
if (ch == '.') {
double tmp = 1;
ch = NextChar();
for (; ch >= '0' && ch <= '9'; ch = NextChar())
tmp /= 10.0, x += tmp * (ch - '0');
}
if (sign) x = -x;
}
inline void read(char *s) {
char ch = NextChar();
for (; Blank(ch); ch = NextChar())
;
if (IOError) return;
for (; !Blank(ch) && !IOError; ch = NextChar()) *s++ = ch;
*s = 0;
}
inline void read(char &c) {
for (c = NextChar(); Blank(c); c = NextChar())
;
if (IOError) {
c = -1;
return;
}
}
} // namespace FastIO
using namespace FastIO;
int q[601000], l[601000], r[601000], in[601000];
vector<int> g[601000], f[601000];
set<pair<int, int> > al;
int vis[601000], ans[601000];
int main() {
int n, m, k;
read(n), read(m), read(k);
for (int i = 1; i <= n; i++) {
int x;
read(x);
if (x)
l[i] = r[i] = ans[i] = x;
else
l[i] = 1, r[i] = k;
}
for (int i = 0; i < m; i++) {
int u, v;
read(u), read(v);
g[u].push_back(v);
in[v]++;
}
int head = 0, tail = 1;
for (int i = 1; i <= n; i++)
if (!in[i]) q[tail++] = i;
while (head < tail) {
int u = q[++head];
for (int v : g[u]) {
in[v]--;
if (!in[v]) q[tail++] = v;
}
}
if (tail != n + 1) {
puts("-1");
return 0;
}
for (int i = 1; i <= n; i++) {
int u = q[i];
for (int v : g[u]) chkmin(r[v], r[u] - 1);
}
for (int i = n; i; i--) {
int u = q[i];
for (int v : g[u]) chkmax(l[u], l[v] + 1);
}
for (int i = 1; i <= n; i++) {
f[l[i]].push_back(i);
if (l[i] > r[i]) {
puts("-1");
return 0;
}
}
for (int i = 1; i <= k; i++) {
for (int j : f[i]) al.insert(pair<int, int>(r[j], j));
if (al.empty()) {
puts("-1");
return 0;
}
set<pair<int, int> >::iterator it = al.begin();
ans[(*it).second] = i;
al.erase(it);
while (!al.empty()) {
set<pair<int, int> >::iterator it = al.begin();
if ((*it).first > i) break;
al.erase(it);
}
}
for (int i = n; i; i--) {
int u = q[i];
int k = ans[u];
for (int v : g[u]) {
if (k && ans[v] >= ans[u]) {
puts("-1");
return 0;
}
if (!k) chkmax(ans[u], ans[v] + 1);
}
if (!ans[u]) ans[u] = 1;
}
for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool a[(const int)2e5 + 5];
int n, dp[2][(const int)2e5 + 5];
int kill(int pos, bool f) {
if (pos == n) return 0;
if (dp[f][pos] != -1) return dp[f][pos];
int skip1, skip2;
skip1 = skip2 = (1 << 30);
if (!f) {
skip1 = a[pos] + kill(pos + 1, !f);
if (pos < n - 1) skip2 = a[pos] + a[pos + 1] + kill(pos + 2, !f);
} else {
skip1 = kill(pos + 1, !f);
if (pos < n - 1) skip2 = kill(pos + 2, !f);
}
return dp[f][pos] = min(skip1, skip2);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tt;
cin >> tt;
while (tt--) {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < 2; i++)
for (int j = 0; j < n; j++) dp[i][j] = -1;
bool f = 0;
cout << kill(0, f) << '\n';
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
getline(cin, s);
int count = 0;
string n = "";
for (int i = 0; i < s.length(); i++) {
if ((s[i] <= 'z' && s[i] >= 'a') || (s[i] >= 'A' && s[i] <= 'Z')) {
n += s[i];
count++;
}
}
if (count == 0) {
cout << "NO";
} else {
if (n[count - 1] == 'a' || n[count - 1] == 'e' || n[count - 1] == 'i' ||
n[count - 1] == 'o' || n[count - 1] == 'u' || n[count - 1] == 'y' ||
n[count - 1] == 'A' || n[count - 1] == 'E' || n[count - 1] == 'I' ||
n[count - 1] == 'O' || n[count - 1] == 'U' || n[count - 1] == 'Y') {
cout << "YES";
} else {
cout << "NO";
}
}
return 0;
}
| 7 | CPP |
R = lambda:list(map(int,input().split()))
#s = input()
x,y,z,t1,t2,t3 = R()
a = abs(x-y) * t1
b = (abs(x-z) + abs(x-y)) * t2 + 3 * t3
print('YES' if (a >= b) else 'NO') | 7 | PYTHON3 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef pair<int,string> P;
vector<P> a;
int n;
map<int,string> memo,memo2;
int partition(int p,int r){
int x = a[r].first;
int i = p-1;
for(int j=p;j<=r-1;j++){
if(a[j].first<=x){
i++;
swap(a[i],a[j]);
}
}
swap(a[i+1],a[r]);
return i+1;
}
void quicksort(int p, int r){
if(p<r){
int q = partition(p, r);
quicksort(p, q-1);
quicksort(q+1, r);
}
}
void isStable(){
rep(i,n) memo2[a[i+1].first] += a[i+1].second;
bool ok = true;
rep(i,n) if(memo[a[i+1].first] != memo2[a[i+1].first]) ok = false;
cout << ( ok ? "Stable" : "Not stable") << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
a.resize(n+1);
rep(i,n){
cin >> a[i+1].second >> a[i+1].first;
memo[ a[i+1].first ] += a[i+1].second;
}
quicksort(1,n);
isStable();
rep(i,n){
cout << a[i+1].second << " " << a[i+1].first << endl;
}
return 0;
}
| 0 | CPP |
t=int(input())
a=[]
for q in range (t):
n=int(input())
b=3
k=2
x=1
while n%b!=0:
b+=2**k
k+=1
a.append(n//b)
for i in a:
print (i)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool solve(){
int b, r, g, c, s, t;
cin >> b >> r >> g >> c >> s >> t;
if(t==0) return false;
int ans = 100;
int bt = b*5+r*3;
ans += 15*(bt+b+r);
ans += 7*g+2*c;
ans -= 2*bt;
t -= s+bt;
ans -= t*3;
cout << ans << endl;
return true;
}
int main() {
while(solve());
return 0;
}
| 0 | CPP |
Subsets and Splits