solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
namespace {
using Integer = long long;
template <class T, class S>
istream& operator>>(istream& is, pair<T, S>& p) {
return is >> p.first >> p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& vec) {
for (T& val : vec) is >> val;
return is;
}
template <class T>
istream& operator,(istream& is, T& val) {
return is >> val;
}
template <class T, class S>
ostream& operator<<(ostream& os, const pair<T, S>& p) {
return os << p.first << " " << p.second;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
for (size_t i = 0; i < vec.size(); i++)
os << vec[i] << (i == vec.size() - 1 ? "" : " ");
return os;
}
template <class T>
ostream& operator,(ostream& os, const T& val) {
return os << " " << val;
}
template <class H>
void print(const H& head) {
cout << head;
}
template <class H, class... T>
void print(const H& head, const T&... tail) {
cout << head << " ";
print(tail...);
}
template <class... T>
void println(const T&... values) {
print(values...);
cout << endl;
}
template <class H>
void eprint(const H& head) {
cerr << head;
}
template <class H, class... T>
void eprint(const H& head, const T&... tail) {
cerr << head << " ";
eprint(tail...);
}
template <class... T>
void eprintln(const T&... values) {
eprint(values...);
cerr << endl;
}
class range {
Integer start_, end_, step_;
public:
struct range_iterator {
Integer val, step_;
range_iterator(Integer v, Integer step) : val(v), step_(step) {}
Integer operator*() { return val; }
void operator++() { val += step_; }
bool operator!=(range_iterator& x) {
return step_ > 0 ? val < x.val : val > x.val;
}
};
range(Integer len) : start_(0), end_(len), step_(1) {}
range(Integer start, Integer end) : start_(start), end_(end), step_(1) {}
range(Integer start, Integer end, Integer step)
: start_(start), end_(end), step_(step) {}
range_iterator begin() { return range_iterator(start_, step_); }
range_iterator end() { return range_iterator(end_, step_); }
};
inline string operator"" _s(const char* str, size_t size) {
return move(string(str));
}
constexpr Integer my_pow(Integer x, Integer k, Integer z = 1) {
return k == 0 ? z
: k == 1 ? z * x
: (k & 1) ? my_pow(x * x, k >> 1, z * x)
: my_pow(x * x, k >> 1, z);
}
constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z = 1) {
return k == 0 ? z % M
: k == 1 ? z * x % M
: (k & 1) ? my_pow_mod(x * x % M, k >> 1, M, z * x % M)
: my_pow_mod(x * x % M, k >> 1, M, z);
}
constexpr unsigned long long operator"" _ten(unsigned long long value) {
return my_pow(10, value);
}
inline int k_bit(Integer x, int k) { return (x >> k) & 1; }
mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(
chrono::steady_clock::now().time_since_epoch())
.count());
template <class T>
string join(const vector<T>& v, const string& sep) {
stringstream ss;
for (size_t i = 0; i < v.size(); i++) {
if (i > 0) ss << sep;
ss << v[i];
}
return ss.str();
}
inline string operator*(string s, int k) {
string ret;
while (k) {
if (k & 1) ret += s;
s += s;
k >>= 1;
}
return ret;
}
} // namespace
constexpr long long mod = 9_ten + 7;
int main() {
int n;
cin >> n;
vector<string> ex, rg;
for (int i = 0; i < n; i++) {
string name;
int type;
cin >> name, type;
if (type == 1) {
ex.push_back(name);
} else {
rg.push_back(name);
}
}
set<string> unused_e, unused_r;
for (int i = 0; i < ex.size(); i++) {
char buff[50];
sprintf(buff, "%d", i + 1);
unused_e.insert(string(buff));
}
for (int i = 0; i < rg.size(); i++) {
char buff[50];
sprintf(buff, "%d", i + 1 + ex.size());
unused_r.insert(string(buff));
}
set<string> e_to_r, r_to_e, o_to_e, o_to_r;
for (int i = 0; i < ex.size(); i++) {
if (unused_e.count(ex[i])) {
unused_e.erase(ex[i]);
} else if (unused_r.count(ex[i])) {
unused_r.erase(ex[i]);
r_to_e.insert(ex[i]);
} else {
o_to_e.insert(ex[i]);
}
}
for (int i = 0; i < rg.size(); i++) {
if (unused_r.count(rg[i])) {
unused_r.erase(rg[i]);
} else if (unused_e.count(rg[i])) {
unused_e.erase(rg[i]);
e_to_r.insert(rg[i]);
} else {
o_to_r.insert(rg[i]);
}
}
vector<pair<string, string>> ans;
if (unused_e.size() == 0 && unused_r.size() == 0) {
if (e_to_r.size()) {
string name = *e_to_r.begin();
e_to_r.erase(name);
unused_e.insert(name);
o_to_r.insert("0");
ans.emplace_back(name, "0");
} else if (r_to_e.size()) {
string name = *r_to_e.begin();
r_to_e.erase(name);
unused_r.insert(name);
o_to_e.insert("0");
ans.emplace_back(name, "0");
}
}
while (unused_e.size() || unused_r.size()) {
if (unused_e.size()) {
if (r_to_e.size()) {
string name = *r_to_e.begin();
r_to_e.erase(r_to_e.begin());
unused_r.insert(name);
string name_ = *unused_e.begin();
unused_e.erase(unused_e.begin());
ans.emplace_back(name, name_);
} else if (o_to_e.size()) {
string name = *o_to_e.begin();
o_to_e.erase(o_to_e.begin());
string name_ = *unused_e.begin();
unused_e.erase(unused_e.begin());
ans.emplace_back(name, name_);
} else {
abort();
}
} else {
if (e_to_r.size()) {
string name = *e_to_r.begin();
e_to_r.erase(e_to_r.begin());
unused_e.insert(name);
string name_ = *unused_r.begin();
unused_r.erase(unused_r.begin());
ans.emplace_back(name, name_);
} else if (o_to_r.size()) {
string name = *o_to_r.begin();
o_to_r.erase(o_to_r.begin());
string name_ = *unused_r.begin();
unused_r.erase(unused_r.begin());
ans.emplace_back(name, name_);
} else {
abort();
}
}
}
println(ans.size());
for (int i = 0; i < ans.size(); i++) {
println("move", ans[i].first, ans[i].second);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-9;
const long double pi = acos(-1.0);
const int inf = 1e+9;
#pragma comment(linker, "/STACK:36777216")
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
long long xabs(long long a) { return a > 0 ? a : -a; }
long double sqr(long double x) { return x * x; }
class spoint {
public:
long double x, y;
spoint() {}
spoint(long double x, long double y) : x(x), y(y) {}
spoint rotate(long double angle) {
long double x = this->x;
long double y = this->y;
return spoint(x * cos(angle) - y * sin(angle),
x * sin(angle) + y * cos(angle));
}
friend spoint operator+(spoint a, spoint b) {
return spoint(a.x + b.x, a.y + b.y);
}
friend spoint operator-(spoint a, spoint b) {
return spoint(a.x - b.x, a.y - b.y);
}
friend spoint operator*(spoint a, long double k) {
return spoint(a.x * k, a.y * k);
}
friend spoint operator/(spoint a, long double k) {
return spoint(a.x / k, a.y / k);
}
long double dist(spoint a) { return sqrt(sqr(x - a.x) + sqr(y - a.y)); }
};
int sm[5] = {3, 4, 0, 1, 2};
int main() {
int n;
cin >> n;
vector<spoint> star;
long double r = 10 * sin(54.0 / 360 * 2 * pi) / sin(72.0 / 360 * 2 * pi);
star.push_back(spoint(r, 0.0).rotate(18.0 / 360 * 2 * pi));
for (int i = 0; i < 4; i++) {
star.push_back(star.back().rotate(72.0 / 360 * 2 * pi));
}
for (int i = 0; i < 5; i++) {
star[i].y += 20;
star[i].x += 20;
}
long double d = star[0].dist(star[2]);
for (int i = 0; i < n - 1; i++) {
long double plus = d * (i + 1);
for (int k = 0; k < 5; k++)
if (k != 2) star.push_back(spoint(star[k].x + plus, star[k].y));
}
cout.setf(ios::fixed);
cout.precision(12);
cout << star.size() << endl;
for (int i = 0; i < star.size(); i++) {
cout << star[i].x << " " << star[i].y << endl;
}
vector<vector<int> > print(n, vector<int>(5));
for (int i = 1; i < 6; i++) {
print[0][i - 1] = i;
cout << i << " ";
}
cout << endl;
int c = 6;
for (int i = 1; i < n; i++) {
print[i][2] = print[i - 1][0];
for (int k = 0; k < 5; k++) {
if (k != 2) {
print[i][k] = c;
c++;
}
}
for (int k = 0; k < 5; k++) {
cout << print[i][k] << " ";
}
cout << endl;
}
cout << 3 << " ";
for (int i = 0; i < n; i++) cout << print[i][0] << " ";
for (int i = n - 1; i >= 0; i--) {
int pos = 0;
for (int k = 0; k < 4; k++) {
pos = sm[pos];
cout << print[i][pos] << " ";
}
}
cout << endl;
return 0;
}
| 10 | CPP |
def zip_sorted(a,b):
# sorted by a
a,b = zip(*sorted(zip(a,b)))
# sorted by b
sorted(zip(a, b), key=lambda x: x[1])
return a,b
import sys
input = sys.stdin.readline
I = lambda : list(map(int,input().split()))
S = lambda : list(map(str,input().split()))
s = list(str(input()))
four_co = 0
seven_co = 0
for i in range(len(s)):
if s[i]=='4':
four_co = four_co + 1
elif s[i]=='7':
seven_co = seven_co +1
if seven_co==four_co==0:
print(-1)
else:
if seven_co>four_co:
print(7)
elif seven_co<=four_co:
print(4)
'''
for i in range(n):
for j in range(n):
for k1 in range(len(a)):
for k2 in range(len(a)):
for k3 in range(len(a)):
''' | 8 | PYTHON3 |
#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define rg register
using namespace std;
typedef long long LL;
const int MAXN = 200005;
const LL INF = 0x3f3f3f3f3f3f3f3f;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') flag = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
AKNOI = flag * x;
}
template <typename T> inline void cmin(T &x, T y) {
if (x > y) x = y;
}
template <typename T> inline void cmax(T &x, T y) {
if (x < y) x = y;
}
int n, q, A, B, p[MAXN];
LL csum[MAXN], dp[MAXN];
struct BIT {
LL tr[MAXN];
BIT() {
mset(tr, 0x3f);
}
inline int lowbit(int x) {
return x & (-x);
}
inline void update(int x, LL val) {
for (int i=x;i<=n;i+=lowbit(i)) {
cmin(tr[i], val);
}
}
inline LL query(int x) {
LL ret = INF;
for (int i=x;i;i-=lowbit(i)) {
cmin(ret, tr[i]);
}
return ret;
}
}t1, t2;
void init() {
read(n); read(q);
read(A); read(B);
for (int i=1;i<=q;++i) {
read(p[i]);
}
for (int i=2;i<=q;++i) {
csum[i] = csum[i-1] + abs(p[i]-p[i-1]);
}
}
void solve() {
dp[0] = min(abs(A-p[1]), abs(B-p[1]));
t1.update(A, abs(B-p[1]) - A);
t2.update(n-A+1, abs(B-p[1]) + A);
t1.update(B, abs(A-p[1]) - B);
t2.update(n-B+1, abs(A-p[1]) + B);
for (int i=1;i<q;++i) {
dp[i] = min( t1.query(p[i+1]) + csum[i] + p[i+1],
t2.query(n-p[i+1]+1) + csum[i] - p[i+1] );
t1.update(p[i], dp[i] - csum[i+1] - p[i]);
t2.update(n-p[i]+1, dp[i] - csum[i+1] + p[i]);
}
LL ans = INF;
for (int i=0;i<q;++i) {
cmin(ans, dp[i] + csum[q] - csum[i+1]);
}
printf("%lld\n", ans);
}
int main() {
init();
solve();
return 0;
}
| 0 | CPP |
def s():
[n,m,k] = list(map(int,input().split()))
G = dict()
for _ in range(m):
t = list(map(int,input().split()))
if t[0]>t[1]:
t[0],t[1] = t[1],t[0]
if (t[0],t[1]) in G:
G[(t[0],t[1])] = min(G[(t[0],t[1])],t[2])
else:
G[(t[0],t[1])] = t[2]
a = set(map(int,input().split()if k else ''))
r = 1e9+1
for k,v in G.items():
s = (k[0] in a)+(k[1] in a)
if s == 1:
r = min(r,v)
print(-1 if r == 1e9+1 else r)
s() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300000000 + 10;
bitset<MAXN> check;
void Get_prime(int n) {
check.set();
check[0] = check[1] = 0;
for (int i = 2; i <= sqrt(n + 0.5); ++i) {
if (check[i])
for (int j = 2; i * j <= n; ++j) check[i * j] = 0;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int l, r;
cin >> l >> r;
Get_prime(r);
int cnt = 0, i;
if (l <= 2 && 2 <= r) ++cnt;
if (l % 4 <= 1)
i = l / 4 * 4 + 1;
else
i = (l / 4 + 1) * 4 + 1;
for (i; i <= r; i += 4)
if (check[i]) ++cnt;
cout << cnt;
}
| 11 | CPP |
#include <cstdio>
#include <vector>
#include <utility>
#include <map>
/*
\cap_{u,v} \cup_{i\in (u,v) path} E_i
g(N) = |{E | {u,v\in M | \cup_{i\in (u,v) path} E_i} = N}|
G(N) = |{E | {u,v\in M | \cup_{i\in (u,v) path} E_i} \subseteq N}|
= |{E | {u,v\in M-N | \cap_{i\in (u,v) path} !E_i}}|
*/
int n, m;
std::vector<int> E[50];
int D[50][50];
long long int M[20];
long long int A[1<<20];
std::map<std::pair<int, int>, int> edges;
long long int dfs(int u, int v, int p){
if(u == v) return 0;
for(int x: E[u]){
if(x == p) continue;
long long int b = dfs(x, v, u);
if(b != -1) return (1LL << edges[{u, x}]) | b;
}
return -1;
}
int main(){
scanf("%d", &n);
for(int i = 0; i < n-1; i++){
int a, b;
scanf("%d%d", &a, &b);
E[a-1].push_back(b-1);
E[b-1].push_back(a-1);
edges[{a-1,b-1}] = i;
edges[{b-1,a-1}] = i;
}
scanf("%d", &m);
for(int i = 0; i < m; i++){
int a, b;
scanf("%d%d", &a, &b);
M[i] = dfs(a-1, b-1, -1);
}
for(int i = 0; i < (1<<m); i++){
A[i] = A[i&(i-1)] | M[__builtin_ctzll(i)];
}
for(int i = 0; i < (1<<m); i++){
A[i] = 1LL << (n-1-__builtin_popcountll(A[i]));
}
long long int ans = 0;
for(int i = 0; i < (1<<m); i++){
ans += (1-2*__builtin_parity(i))*A[i];
}
printf("%lld\n", ans);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m;
int dif = 0;
int col = 1;
bool pano = true;
int rowt = 1;
int rowb = n;
cout << 1 << " " << 1 << endl;
while (rowt < rowb) {
col = 1;
int posa = 1;
pano = true;
while (posa < 2 * m) {
if (pano)
cout << rowb << " " << m - col + 1 << "\n";
else {
cout << rowt << " " << col + 1 << "\n";
col++;
}
posa++;
pano = !pano;
}
rowt++;
rowb--;
if (rowb == rowt) {
cout << rowt << " " << 1 << endl;
}
if (rowb <= rowt) break;
cout << rowt << " " << 1 << endl;
dif++;
}
if (rowt == rowb) {
int dif = 0;
bool p = 1;
int posa = 1;
while (posa < m) {
if (p)
cout << rowt << " " << m - dif << "\n";
else
cout << rowt << " " << 1 + dif << "\n";
p = !p;
posa++;
if (!p) dif++;
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a[111], b[111], c[111];
int main() {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i < n; i++) {
scanf("%d", &b[i]);
}
for (int i = 1; i <= n; i++) {
scanf("%d", &c[i]);
}
int sol = 0xFFFFFF, sol1 = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i != j) {
sol1 = 0;
for (int k = 1; k < i; k++) {
sol1 += a[k];
}
for (int k = i; k < n; k++) {
sol1 += b[k];
}
for (int k = 1; k < j; k++) {
sol1 += a[k];
}
for (int k = j; k < n; k++) {
sol1 += b[k];
}
sol1 += c[i] + c[j];
sol = min(sol, sol1);
}
printf("%d\n", sol);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int c = (n + 3) / 4;
for (int i = 1; i <= (n - c); i++) cout << "9";
for (int i = 1; i <= c; i++) cout << "8";
cout << endl;
}
}
| 8 | CPP |
def bfs(a,f,g):
v = [0 if i%2 == f else -1 for i in a]
s = [(i,0) for i,v in enumerate(a) if v%2 == f]
while len(s):
ns = [];
for ci,c in s:
# ci,c = s.pop()
for i in g[ci]:
if v[i] > c + 1 or v[i] == -1:
v[i] = c + 1
ns.append((i,c + 1))
s = ns;
return v
def solve():
n = int(input())
a = list(map(int,input().split(' ')))
g = list(map(set,[[]]*n));
for i,v in enumerate(a):
if i - v >= 0:
g[i - v].add(i)
if i + v < len(a):
g[i + v].add(i)
g = list(map(list,g))
o, e = bfs(a,0,g), bfs(a,1,g)
print(*map(sum,zip(o,e)))
solve()
| 11 | PYTHON3 |
t = int(input())
for _ in range(t):
line = input()
if line[-2:] == 'po':
print('FILIPINO')
if line[-4:] == 'desu' or line[-4:] == 'masu':
print('JAPANESE')
if line[-5:] == 'mnida':
print('KOREAN')
| 7 | PYTHON3 |
import math
import os
import sys
import re
import itertools
import functools
import operator
s = list(input())
s[0] = s[0].upper()
print(''.join(s)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
string s, t;
vector<vector<long long> > dp;
long long sol(int l, int r) {
if (dp[l][r] < 0) {
dp[l][r] = 0;
if (l == r) {
if (s[0] == t[l] or t[l] == '*') dp[l][r] = 2;
} else {
int i = r - l;
if (s[i] == t[l] or t[l] == '*')
dp[l][r] = (dp[l][r] + sol(l + 1, r)) % mod;
if (s[i] == t[r] or t[r] == '*')
dp[l][r] = (dp[l][r] + sol(l, r - 1)) % mod;
}
}
return dp[l][r];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> s >> t;
int n = s.size(), m = t.size();
for (int i = 0; i < n - m; i++) t += '*';
dp = vector<vector<long long> >(n, vector<long long>(n, -1));
long long res = 0;
for (int i = m - 1; i < n; i++) {
res = (res + sol(0, i)) % mod;
}
cout << res << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int memo[71][(1 << 19) + 1];
bool isPrime(int x) {
if (x == 1) return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) return false;
}
return true;
}
int b[110];
int app[80];
int PF[110];
int pw[100010];
int dp(int x, int msk) {
if (x == 71) return msk == 0;
int& ans = memo[x][msk];
if (ans != -1) return ans;
ans = 0;
int s = PF[x];
int A = app[x];
int even = dp(x + 1, msk);
int odd = dp(x + 1, msk ^ s);
if (A == 0) return ans = even;
even = ((long long)even * (long long)(pw[A - 1])) % mod;
odd = ((long long)odd * (long long)(pw[A - 1])) % mod;
return ans = (even + odd) % mod;
}
int pf(int x) {
int s = 0;
for (int i = 2; i <= 70; i++) {
while (x % i == 0) {
s ^= (1 << b[i]);
x /= i;
}
}
return s;
}
int main() {
pw[0] = 1;
for (int i = 1; i <= 100000; i++) pw[i] = ((long long)pw[i - 1] * 2LL) % mod;
int x = 0, p = 0;
for (int i = 2; i <= 70; i++) {
if (isPrime(i)) b[i] = p++;
}
for (int i = 2; i <= 70; i++) PF[i] = pf(i);
int n;
scanf("%d", &n);
memset(memo, -1, sizeof(memo));
for (int i = 0; i < n; i++) {
scanf("%d", &x);
app[x]++;
}
int ans = (dp(2, 0) + mod) % mod;
ans = ((long long)ans * (long long)pw[app[1]]) % mod;
printf("%d\n", (ans - 1 + mod) % mod);
return 0;
}
| 9 | CPP |
a,b,c = map(int, input().split())
fiblist = []
fiblist.append(a)
fiblist.append(b)
while (len(fiblist) - 1) < c:
for i in range(2, 22):
x = fiblist[i - 1] + fiblist[i - 2]
fiblist.append(x)
else:
print(fiblist[c]) | 13 | PYTHON3 |
a, b, c, d = list(int(input()) for _ in range(4))
print(min([a, b]) + min([c, d])) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U>
using Pa = pair<T, U>;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
constexpr ll mod = 998244353;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
friend ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
friend istream& operator>>(istream& is, mint& a) {
ll t;
is >> t;
a = mint(t);
return (is);
}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod - a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1) a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint& operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S, T;
cin >> S >> T;
int N = S.size(), M = T.size();
while (T.size() < N) T += '#';
vvec<mint> dp(N + 1, vec<mint>(N + 1, 0));
for (int i = 0; i < N; i++)
if (i >= M || S[0] == T[i]) dp[i][i + 1] = 2;
for (int len = 1; len < N; len++) {
char c = S[len];
for (int l = 0; l < N; l++) {
int r = l + len;
if (r > N) break;
if (l && (T[l - 1] == '#' || T[l - 1] == c)) dp[l - 1][r] += dp[l][r];
if (T[r] == '#' || T[r] == c) dp[l][r + 1] += dp[l][r];
}
}
mint ans = 0;
for (int r = M; r <= N; r++) ans += dp[0][r];
cout << ans << "\n";
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool comp(string s1, string s2) {
int i;
if (s1.length() > s2.length()) return true;
if (s1.length() < s2.length()) return false;
for (i = 0; s1.length() > i; i++) {
if (s1[i] > s2[i]) return true;
if (s1[i] < s2[i]) return false;
}
return false;
}
int main() {
int i, j = 1, f = 0;
string p, k, s, t;
cin >> s;
for (i = 0; s.length() > i; i++) {
if (s[i] != '0' && k.length() > 0) {
f++;
if (comp(k, t)) j = f;
t += k;
k = "";
}
if (s[i] != '0') {
k = s[i];
} else {
k += s[i];
}
}
if (k.length() > 0) {
f++;
if (comp(k, t)) j = f;
t += k;
k = "";
}
cout << f - j + 1 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int co = 0, ce = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x & 1)
co++;
else
ce++;
}
int odd = co & 1 ? co : co - 1;
if (co == 0)
cout << "No"
<< "\n";
else if (k & 1) {
odd = min(k, odd);
if (odd + ce >= k)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
} else {
odd = min(odd, k - 1);
if (odd + ce >= k)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
}
}
return 0;
}
| 7 | CPP |
y = int(input())
x = input().lower()
x = list(set(x))
if len(x) >= 26:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int a[105] = {0};
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int l = -300;
int r = 300;
for (int i = m + 1; i <= n; i++) {
if ((a[i]) <= k && (a[i] != 0)) {
r = i;
break;
}
}
for (int i = m - 1; i >= 1; i--) {
if ((a[i] <= k) && (a[i] != 0)) {
l = i;
break;
}
}
cout << min((m - l) * 10, (r - m) * 10) << endl;
return 0;
}
| 7 | CPP |
m = 10**9+7
h, w, k = map(int, input().split())
a = [0]*(w-1) + [1]
for i in range(w-1):
a[i] = a[i-1] + a[i-2]
dp = [0]*w
tmp = [0]*w
dp[0] = 1
for _ in range(1, h+1):
for i in range(w):
tmp[i] = dp[i]*a[i-1]*a[w-i-2]
if i != w-1:
tmp[i] += dp[i+1]*a[i-1]*a[w-i-3]
if i != 0:
tmp[i] += dp[i-1]*a[i-2]*a[w-i-2]
tmp[i] %= m
dp, tmp = tmp, dp
print(dp[k-1]) | 0 | PYTHON3 |
import math
a, b = map(int, input().split())
def get_factors(a):
fac = {}
for i in range(2, int(math.sqrt(a) + 1)):
while a % i == 0:
fac[i] = fac.get(i, 0) + 1
a = a // i
if a != 1:
fac[a] = fac.get(a, 0) + 1
return fac
def get_intersection(fa, fb):
res = {}
for k in set(fa.keys()).intersection(set(fb.keys())):
res[k] = min(fa[k], fb[k])
return res
def get_symmetric_diff(factors, intersection):
symmetric_diff = {}
for k, v in factors.items():
c = v - intersection.get(k, 0)
if c != 0:
symmetric_diff[k] = v - intersection.get(k, 0)
return symmetric_diff
factors_a = get_factors(a)
factors_b = get_factors(b)
ab = get_intersection(factors_a, factors_b)
a_minus_b = get_symmetric_diff(factors_a, ab)
b_minus_a = get_symmetric_diff(factors_b, ab)
if not all([i in [2, 3, 5] for i in list(a_minus_b.keys()) + list(b_minus_a.keys())]):
print(-1)
exit()
print(sum(a_minus_b.values()) + sum(b_minus_a.values())) | 8 | PYTHON3 |
t=int(input())
for z in range(0,t):
n=int(input())
a=(list(map(int, input().split())))
l=0
b=0
c=0
for i in range(0,n):
if(a[i]%3==0):
l+=1
elif a[i]%3==1:
b+=1
else:
c+=1
p=min(b,c)
if p==b:
c-=b
p+=(c//3)
else:
b-=c
p+=(b//3)
print(l+p) | 8 | PYTHON3 |
k=int(input())
p=int(k/5)
if(k%5==0):
print(p)
else:
print(int(p+1)) | 7 | PYTHON3 |
k,x = map(int,input().split())
out = [i+x for i in range(-k+1,k)]
print(*out) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T gcd(T a, T b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
template <class T>
inline T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
inline int nxt() {
int wow;
scanf("%d", &wow);
return wow;
}
inline long long int lxt() {
long long int wow;
scanf("%lld", &wow);
return wow;
}
inline double dxt() {
double wow;
scanf("%lf", &wow);
return wow;
}
struct child {
long long int v, d, p;
int id, done, scared;
child() { scared = 0; }
};
vector<child> c;
int main() {
int n = nxt(), ans = 0;
child dummy;
c.push_back(dummy);
for (int i = 1; i <= n; i++) {
child temp;
scanf("%I64d %I64d %I64d", &temp.v, &temp.d, &temp.p);
temp.id = i;
c.push_back(temp);
}
for (int i = 1; i <= n; i++) {
if (c[i].scared) continue;
ans++;
long long int val = c[i].v;
for (int j = i + 1; j <= n; j++) {
if (c[j].scared) continue;
c[j].p -= val;
val = max(0LL, val - 1);
}
for (int j = i + 1; j <= n; j++) {
if (c[j].scared == 0 && c[j].p < 0) {
c[j].scared = 1;
for (int k = j + 1; k <= n; k++) c[k].p -= c[j].d;
}
}
}
printf("%d\n", ans);
for (int i = 1; i <= n; i++)
if (c[i].scared == 0) printf("%d ", i);
puts("");
return 0;
}
| 9 | CPP |
# solution
import math
import io
data=int(input())
qwe = (list(map(int,input().split())))
score1=score2=0
cnt1=cnt2=0
for i ,num in enumerate(qwe):
score1+=num
if score1<=0 and i%2==0:
cnt1+=1-score1
score1=1
elif score1>=0 and i%2!=0:
cnt1+=1+score1
score1=-1
score2+=num
if score2<=0 and i%2!=0:
cnt2+=1-score2
score2=1
elif score2>=0 and i%2==0:
cnt2+=1+score2
score2=-1
print(min(cnt1,cnt2)) | 0 | PYTHON3 |
import sys,functools,collections,bisect,math,heapq
input = sys.stdin.readline
#print = sys.stdout.write
sys.setrecursionlimit(300000)
mod = 10**9 + 7
t = int(input())
for _ in range(t):
a,b,c,d = map(int,input().strip().split())
ans = []
if (a+b)%2:
if a or d:
ans.append('Ya')
else:
ans.append('Tidak')
if b or c:
ans.append('Ya')
else:
ans.append('Tidak')
ans.append('Tidak')
ans.append('Tidak')
else:
ans.append('Tidak')
ans.append('Tidak')
if b or c:
ans.append('Ya')
else:
ans.append('Tidak')
if a or d:
ans.append('Ya')
else:
ans.append('Tidak')
print(' '.join(ans))
| 14 | PYTHON3 |
import math
def num2digits(num):
i=0;
digits=[];
while num>0:
digits.append(i);
digits[i]=num%10;
num=math.floor(num/10);
i=i+1;
return digits;
n=int(input());
while 1:
n=n+1;
digits=num2digits(n);
digits.sort();
flag=1;
for i in range (1,len(digits)):
if digits[i]==digits[i-1]:
flag=0;
break;
if flag>0:
break;
print(n); | 7 | PYTHON3 |
# your code goes here
a,b,c,d = map(int,input().split())
p = a/b
q = (1-a/b)*(1-c/d)
print(p/(1-q)) | 8 | PYTHON3 |
import collections
n,k=map(int,input().split())
s=list(input().strip())
f=[0]*n
d=collections.defaultdict(list)
for j in range(n):
d[s[j]].append(j)
keys='abcdefghijklmnopqrstuvwxyz'
for v in keys:
for g in d[v]:
if k>0:
f[g]=1
k=k-1
v=''
for j in range(n):
if f[j]==0:
v=v+s[j]
print(v)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin>>n;
int ans=0;
for(int a=1;a<n;a++) ans+=(n-1)/a;
cout<<ans;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
string s, t;
cin >> s >> t;
int res = 0;
int ind = 0;
for (int i = t.size() - 1; i >= 0; --i) {
if (t[i] == '1') {
res -= (t.size() - 1 - i);
ind = t.size() - 1 - i;
break;
}
}
for (int i = s.size() - ind - 1; i >= 0; --i) {
if (s[i] == '1') {
res += (s.size() - 1 - i);
break;
}
}
cout << res << "\n";
}
}
| 7 | CPP |
n = int(input())
a = input()
a = a.split(' ')
for i in range(n):
a[i] = int(a[i])
for i in range(n):
if (i == 0):
min = a[1] - a[0]
max = a[n-1] - a[0]
elif (i == (n-1)):
min = a[n-1] - a[n-2]
max = a[n-1] - a[0]
else:
min = a[i] - a[i-1]
if (a[i+1] - a[i] < min):
min = a[i+1] - a[i]
max = a[n - 1] - a[i]
if (a[i] - a[0] > max):
max = a[i] - a[0]
print(min, " ", max)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long rb = 0, rs = 0, rc = 0;
for (int i = 0; i < int(s.length()); i++)
if (s[i] == 'B')
rb++;
else if (s[i] == 'S')
rs++;
else
rc++;
long long hb, hs, hc;
cin >> hb >> hs >> hc;
long long pb, ps, pc;
cin >> pb >> ps >> pc;
long long r;
cin >> r;
long long lo = 0, hi = r + 3 * hb;
while (hi - lo > 1) {
long long mid = (lo + hi) / 2, t = r;
if (mid * rb > hb) t -= (mid * rb - hb) * pb;
if (mid * rs > hs) t -= (mid * rs - hs) * ps;
if (mid * rc > hc) t -= (mid * rc - hc) * pc;
if (t >= 0)
lo = mid;
else
hi = mid;
}
cout << lo << endl;
}
| 9 | CPP |
a,b=map(int,input().split())
c1=c2=c3=0
for i in range(1,7):
if abs(a-i)<abs(b-i):
c1+=1
elif abs(a-i)>abs(b-i):
c2+=1
else:
c3+=1
print(c1,c3,c2) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
if (a == b) {
cout << 0 << '\n';
continue;
}
if (a < b) {
cout << (((a + b) % 2 == 0) ? 2 : 1) << endl;
} else {
cout << (((a + b) % 2 == 0) ? 1 : 2) << endl;
}
}
}
| 7 | CPP |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using ordered_set=tree<T,null_type,less<T>,
rb_tree_tag,tree_order_statistics_node_update>;
#define os_find(k) find_by_order(k)
#define os_order(k) order_of_key(k)*/
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
#define f0(i,a,b) for(int i=a;i<b;i++)
#define f1(i,a,b) for(int i=a;i<=b;i++)
#define f2(i,a,b) for(int i=a;i>b;i--)
#define f3(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define int long long
#define fi first
#define se second
#define mod 1000000007//998244353
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define make_graph(k) int x,y; f0(i,0,k){cin>>x>>y; adj[x].pb(y); adj[y].pb(x);}
#define test int t;cin>>t;while(t--)
#define MAXN 200001
//int fact[300000];
int st[4*MAXN];
int binExp(int x,int n)
{
int res=1;
while(n)
{
if(n&1) res=(res*x)%mod;
x=(x*x)%mod;
n>>=1;
}
return res;
}
int modInv(int i) {return binExp(i,mod-2);}
//int ncr(int n,int r) {return (n>=r?(fact[n]*modInv(fact[r]))%mod*modInv(fact[n-r])%mod:0);}
/*void build(int s,int e,int i,int a[])
{ if(s==e){st[i]=a[s];return;}
int mid=s+(e-s)/2;
build(s,mid,2*i+1,a);
build(mid+1,e,2*i+2,a);
st[i]=st[2*i+1]+st[2*i+2];
}
int query(int s,int e,int i,int a[],int l,int r)
{if(s>e||l>r)return 0;
if(s>=l&&e<=r)return st[i];
if(s>r||e<l)return 0;
int mid=s+(e-s)/2;
return query(s,mid,2*i+1,a,l,r)+query(mid+1,e,2*i+2,a,l,r);
}
int update(int s,int e,int i,int pos,int val)
{if(s==e&&s==pos)
{st[i]=val;return 0;}
if(s>pos||e<pos)return 0;
int mid=s+(e-s)/2;
update(s,mid,2*i+1,pos,val);
update(mid+1,e,2*i+2,pos,val);
st[i]=st[2*i+1]+st[2*i+2];
}int parent[200000],size[200000];
int find_set(int v) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v]);
}
void make_set(int v) {
parent[v] = v;
size[v] = 1;
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b) {
if (size[a] < size[b])
swap(a, b);
parent[b] = a;
size[a] += size[b];
}
}*/
signed main()
{
fast
test{
int n,k;
cin>>n>>k;
int a[k],b[k];
map<int,int>m,g;
f0(i,0,k)
{cin>>a[i];
m[a[i]]=i+1;
}
f0(j,0,k)cin>>b[j];
int c[n+1];
int pre[n+1];int suf[n+1];
int mn=1e18;
f0(i,1,n+1)
{
if(m[i])mn=min(mn,-1*a[m[i]-1]+b[m[i]-1]);
pre[i]=mn;
}
mn=1e18;
f3(i,n,1)
{
if(m[i])mn=min(mn,a[m[i]-1]+b[m[i]-1]);
suf[i]=mn;
}
f0(i,1,n+1)
{ //cout<<suf[i]<<" ";
c[i]=min(pre[i]+i,suf[i]-i);
}
// cout<<endl;
f0(i,1,n+1)cout<<c[i]<<" ";
cout<<endl;
}
} | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n = 0, q = 0;
cin >> n >> q;
vector<long> s(n);
int free = 0;
for (int i = 0; i < q; i++) {
long t = 0;
int k = 0, d = 0;
cin >> t >> k >> d;
free = 0;
for (int i = 0; i < n; i++)
if (s[i] < t) {
s[i] = 0;
free++;
}
if (free >= k) {
long sum = 0;
for (int i = 0; i < n; i++) {
if (k && s[i] == 0) {
s[i] = t + d - 1;
free--;
sum += i + 1;
k--;
}
}
cout << sum << endl;
} else {
cout << "-1" << endl;
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c;
long long power(long long n, long long e) {
long long ans = 1;
while (e) {
if (e % 2) {
ans *= n;
e--;
} else {
n *= n;
e /= 2;
}
}
return ans;
}
long long s(long long x) {
long long ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
bool equ(long long x) { return (x == b * power(s(x), a) + c); }
int main() {
vector<int> ans;
cin >> a >> b >> c;
for (int i = 1; i < 82; i++) {
long long x = b * power(i, a) + c;
if (x < 1000000000 && x > 0 && s(x) == i) {
ans.push_back(b * power(i, a) + c);
}
}
cout << ans.size() << "\n";
for (int i : ans) {
cout << i << " ";
}
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int r; cin >> r;
cout << (r < 1200 ? "ABC" : r < 2800 ? "ARC" : "AGC") << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
const int inf = 1039074182;
const int mod = 1e9 + 7;
using namespace std;
long long ny[60];
long long dp[60];
long long sum[60];
long long ksm(long long basic, long long x) {
long long res = 1;
while (x) {
if (x & 1) {
res *= basic;
res %= mod;
}
x >>= 1;
basic *= basic;
basic %= mod;
}
return res;
}
long long calc(long long prime, long long e, long long k) {
for (int i = 0; i <= e; i++) {
dp[i] = ksm(prime, i);
}
sum[0] = dp[0];
for (int i = 1; i <= e; i++) {
sum[i] = sum[i - 1] + dp[i];
sum[i] %= mod;
}
for (int i = 1; i <= k; i++) {
for (int j = 0; j <= e; j++) {
dp[j] = sum[j] * ny[j + 1];
dp[j] %= mod;
}
sum[0] = dp[0];
for (int j = 1; j <= e; j++) {
sum[j] = sum[j - 1] + dp[j];
sum[j] %= mod;
}
}
return dp[e] % mod;
}
int main() {
for (int i = 1; i < 60; i++) {
ny[i] = ksm(i, mod - 2);
}
long long x, k;
cin >> x >> k;
long long tx = x;
int s;
long long res = 1;
for (long long i = 2; i * i <= x; i++) {
if (tx % i) continue;
s = 0;
while (tx % i == 0) {
s++;
tx /= i;
}
res *= calc(i, s, k);
res %= mod;
}
if (tx != 1) {
res *= calc(tx, 1, k);
res %= mod;
}
cout << res << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int read() {
char c;
int w = 1;
while ((c = getchar()) > '9' || c < '0')
if (c == '-') w = -1;
int ans = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
ans = (ans << 1) + (ans << 3) + c - '0';
return ans * w;
}
int n, m;
const int xx = 1e5 + 5;
struct node {
int to[26], fail;
} e[xx];
char s[xx];
string S[xx];
int cst = 1;
int c(int &x) { return !x ? (x = ++cst) : x; }
int insert() {
int p = strlen(s), last = 1;
for (int i = 0; i < p; i++) last = c(e[last].to[s[i] - 'a']);
return last;
}
void getfail() {
queue<int> q;
for (int i = 0; i < 26; i++) {
if (e[1].to[i])
e[e[1].to[i]].fail = 1, q.push(e[1].to[i]);
else
e[1].to[i] = 1;
}
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 0; i < 26; i++) {
if (!e[x].to[i])
e[x].to[i] = e[e[x].fail].to[i];
else
e[e[x].to[i]].fail = e[e[x].fail].to[i], q.push(e[x].to[i]);
}
}
}
int ed[xx], sz[xx];
struct query {
int id, op, v;
};
vector<query> q1[xx], q2[xx];
int dfx[xx], size[xx], YY;
namespace G {
struct node {
int next, to;
} e[xx * 2];
int cnt, h[xx];
void add(int x, int y) {
cnt++;
e[cnt].next = h[x];
h[x] = cnt;
e[cnt].to = y;
}
void dfs(int x, int y) {
size[x] = 1, dfx[x] = ++YY;
for (int i = h[x]; i; i = e[i].next) {
if (e[i].to == y) continue;
dfs(e[i].to, x);
size[x] += size[e[i].to];
}
}
} // namespace G
const int B = 1822;
const int Bs = 317;
int val[xx], tg[xx];
int bel(int x) { return (x - 1) / Bs + 1; }
void cg(int x, int y) {
if (bel(x) == bel(y))
for (int i = x; i <= y; i++) val[i]++;
else {
for (int i = x; i <= bel(x) * Bs; i++) val[i]++;
for (int i = bel(y) * Bs - Bs + 1; i <= y; i++) val[i]++;
for (int i = bel(x) + 1; i < bel(y); i++) tg[i]++;
}
}
int get(int x) { return val[x] + tg[bel(x)]; }
int lb(int x) { return x & -x; }
int sum[xx];
void add(int x, int y) {
for (; x <= cst; x += lb(x)) sum[x] += y;
}
int ask(int x) {
int ans = 0;
for (; x; x -= lb(x)) ans += sum[x];
return ans;
}
long long ans[xx];
signed main() {
n = read(), m = read();
for (int i = 1; i <= n; i++) {
scanf("%s", s);
ed[i] = insert();
sz[i] = strlen(s);
S[i] = s;
}
getfail();
for (int i = 2; i <= cst; i++) G::add(e[i].fail, i);
G::dfs(1, 0);
for (int i = 1; i <= m; i++) {
int l = read(), r = read(), k = read();
if (sz[k] <= B)
q1[r].push_back((query){i, 1, k}), q1[l - 1].push_back((query){i, -1, k});
else
q2[k].push_back((query){i, 1, r}), q2[k].push_back((query){i, -1, l - 1});
}
for (int i = 1; i <= n; i++) {
cg(dfx[ed[i]], dfx[ed[i]] + size[ed[i]] - 1);
for (int j = 0; j < q1[i].size(); j++) {
int x = q1[i][j].v, last = 1;
for (int k = 0; k < sz[x]; k++) {
last = e[last].to[S[x][k] - 'a'];
ans[q1[i][j].id] += q1[i][j].op * get(dfx[last]);
}
}
q1[i].clear();
}
for (int i = 1; i <= n; i++) {
if (!q2[i].size()) continue;
memset(sum, 0, sizeof(sum));
int last = 1;
for (int k = 0; k < sz[i]; k++) {
last = e[last].to[S[i][k] - 'a'];
add(dfx[last], 1);
}
for (int k = 0; k < q2[i].size(); k++) q1[q2[i][k].v].push_back(q2[i][k]);
long long res = 0;
for (int j = 1; j <= n; j++) {
res += ask(dfx[ed[j]] + size[ed[j]] - 1) - ask(dfx[ed[j]] - 1);
for (int k = 0; k < q1[j].size(); k++)
ans[q1[j][k].id] += q1[j][k].op * res;
}
for (int k = 0; k < q2[i].size(); k++) q1[q2[i][k].v].pop_back();
}
for (int i = 1; i <= m; i++) cout << ans[i] << "\n";
return 0;
}
| 12 | CPP |
chat = input()
hello = []
count = 0
for i in chat:
if count == 0 and i == 'h':
count += 1
elif count == 1 and i == 'e':
count += 1
elif count == 2 and i == 'l':
count += 1
elif count == 3 and i == 'l':
count += 1
elif count == 4 and i == 'o':
count += 1
if count == 5:
print("YES")
exit(0)
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e2 + 5;
int n, a[N];
long long ask(int x) {
long long ret = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] % (x + 1) == 0) {
ret += a[i] / (x + 1);
continue;
}
int num = a[i] / (x + 1), y = a[i] % (x + 1);
if (num + y < x) return -1;
ret += num + 1;
}
return ret;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
long long ret = -1;
for (int x = 1; x * x <= a[1]; ++x) {
long long tmp = ask(x);
if (tmp == -1) continue;
if (ret == -1)
ret = tmp;
else
ret = min(ret, tmp);
}
for (int k = 1; k * k <= a[1]; ++k) {
int x = a[1] / k;
long long tmp1 = ask(x);
long long tmp2 = -1;
if (x - 1 != 0) tmp2 = ask(x - 1);
long long tmp;
if (tmp1 == -1 && tmp2 == -1)
tmp = -1;
else if (tmp1 == -1 && tmp2 != -1)
tmp = tmp2;
else if (tmp1 != -1 && tmp2 == -1)
tmp = tmp1;
else
tmp = min(tmp1, tmp2);
if (tmp == -1) continue;
if (ret == -1)
ret = tmp;
else
ret = min(ret, tmp);
}
printf("%lld\n", ret);
return 0;
}
| 11 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define x0 gtmshb
#define y0 gtmsub
#define x1 gtmjtjl
#define y1 gtmsf
int a[100010],b[100010],par[100010],minm[100010],pos[100010],n,m,tot,num;
bool vis[100010];
long long ans;
int find(int x){return x==par[x]?x:par[x]=find(par[x]);}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)par[i]=i;
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=1;i<=m;i++)
{
int x,y;
scanf("%d%d",&x,&y);x++;y++;
par[find(x)]=find(y);
}
for(int i=1;i<=n;i++)minm[i]=1000000001;
for(int i=1;i<=n;i++)
{
int u=find(i);
if(!vis[u])num++;vis[u]=1;
if(minm[u]>a[i]){pos[u]=i;minm[u]=a[i];}
}
for(int i=1;i<=n;i++)
{
int u=find(i);
if(pos[u]==i)ans+=a[i];
else b[++tot]=a[i];
}
if(num==1)
{
puts("0");
return 0;
}
else if(tot<num-2)
{
puts("Impossible");
return 0;
}
sort(b+1,b+tot+1);
for(int i=1;i<=num-2;i++)ans+=b[i];
printf("%lld\n",ans);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int n, m, ans;
char a[N][N];
map<int, bool> used;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i <= n; i++) {
bool p = true;
int pos1, pos2;
for (int j = 1; j <= m; j++) {
if (a[i][j] == 'S') {
pos1 = j;
}
if (a[i][j] == 'G') {
pos2 = j;
}
}
if (pos1 < pos2) {
return cout << "-1", 0;
}
if (!used[pos1 - pos2]) {
ans++;
used[pos1 - pos2] = true;
}
}
cout << ans;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
u--; v--;
g[u].push_back(v);
g[v].push_back(u);
}
vector<int> d(n, -1);
d[0] = 0;
bool ok = false;
function<void(int)> dfs = [&](int u) {
for (auto v : g[u]) {
if (d[v] != -1) {
if (d[v] == d[u]) {
ok = true;
}
} else {
d[v] = 1 - d[u];
dfs(v);
}
}
};
dfs(0);
int cnt = 0;
for (int i = 0; i < n; i++) {
cnt += d[i];
}
long long tot;
if (ok) {
tot = (long long)n * (n - 1) / 2;
} else {
tot = (long long)cnt * (n - cnt);
}
cout << tot - m << endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5, L = 64, V = 100;
int x[MAXN], y[MAXN], N;
double r, pow2[MAXN];
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int main() {
pow2[0] = 1.0;
for (int i = 1; i < MAXN; ++i) pow2[i] = pow2[i - 1] * 2.0;
scanf("%d", &N);
for (int i = 0; i < N; ++i) scanf("%d%d", &x[i], &y[i]);
for (int i = 0; i < N; ++i)
for (int k = 1; k < min(N, L); ++k) {
int j = (i + k) % N;
double p =
N < 100 ? (pow2[N - k - 1] - 1) / (pow2[N] - 1 - N - N * (N - 1) / 2)
: 1.0 / pow2[k + 1];
;
double v = -0.5 * (y[j] + y[i]) * (x[j] - x[i]) -
0.5 * gcd(abs(x[j] - x[i]), abs(y[j] - y[i]));
r += p * v;
}
printf("%.12f", r + 1.0);
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, j, k, q;
cin >> n >> q;
long long tot = n * n;
if (n % 2) tot++;
while (q--) {
cin >> i >> j;
if (i % 2 == 1) {
if (j % 2) {
long long g = ((i - 1) * n) / 2;
long long num = j / 2 + g + 1;
cout << num << '\n';
} else {
long long g = ((i - 1) * n) / 2;
long long num = (tot / 2) + g + (j / 2);
cout << num << '\n';
}
} else {
if (j % 2) {
long long g = ((i - 1) * n) / 2;
long long num = (tot / 2) + g + (j / 2) + 1;
cout << num << '\n';
} else {
long long g = ((i - 1) * n) / 2;
long long num = j / 2 + g;
if (n % 2) num++;
cout << num << '\n';
}
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i;
cin >> n >> k;
if (k > n || (k == 1 && n > 1)) {
cout << "-1";
return 0;
}
if (k == 1 && n == 1) {
cout << "a";
return 0;
}
for (i = 0; i < (n - k + 2); i++) {
if (i % 2 == 0)
cout << "a";
else
cout << "b";
}
char ch = 'c';
for (i = 0; i < k - 2; i++) {
cout << ch;
ch++;
}
return 0;
}
| 9 | CPP |
import sys
# from itertools import
# from collections import deque
import math
# from bisect import bisect
# input = sys.stdin.buffer.readline
input = sys.stdin.readline
n = int(input())
x = input()
c= [ord(s) for s in x]
c.pop()
# print(c)
total =0
while True:
t=0
tv = 0
for i, a in enumerate(c):
if len(c) == 1:
break
if i == 0:
if c[i] - c[i+1] == 1:
if c[i] > tv:
t = i
tv = c[i]
elif i == len(c) - 1:
if c[i] - c[i-1] == 1:
if c[i] > tv:
t= i
tv = c[i]
else:
if (c[i] -c[i-1] ==1) or (c[i] - c[i+1] ==1 ):
if c[i] >tv:
tv = c[i]
t= i
if tv == 0 :
break
if len(c) == 0:
break
total += 1
del c[t]
# print(c)
print(total) | 9 | PYTHON3 |
n = int(input())
for _ in range(n):
t = input()
total = 0
even = False
firstZero = False
for i in range(len(t)):
remain = int(t[i])
total += remain
if not firstZero and remain == 0:
firstZero = True
continue
if remain % 2 == 0:
even = True
if firstZero and even and total % 3 == 0:
print('red')
else:
print('cyan') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
std::ios_base::sync_with_stdio(false);
cin >> a;
long long flag = 0;
long long ans;
long long count = 1;
a = a + 1;
for (;;) {
long long b = abs(a);
flag = 0;
while (b) {
if (b % 10 == 8) {
flag = 1;
break;
}
b = b / 10;
}
if (flag == 1) {
break;
}
count += 1;
a += 1;
}
cout << count << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
int t;
scanf("%d", &t);
int i;
for (i = 0; i < t; i++) {
int n;
scanf("%d", &n);
int count = 0;
int counter = 0;
int j;
for (j = 0; j < n; j++) {
int temp;
scanf("%d", &temp);
if (temp % 2) {
count++;
} else {
counter++;
}
}
if (count && counter) {
printf("YES\n");
} else if (counter == 0 && count % 2 != 0) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return (0);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int edges[8] = {0};
vector<int> e[8];
int mat[8][8];
int common(vector<int> &v1, vector<int> &v2) {
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
int i = 0, j = 0;
int ans = 0;
for (; i < v1.size() && j < v2.size();) {
if (v1[i] == v2[j]) {
ans++;
i++;
j++;
} else if (v1[i] < v2[j]) {
i++;
} else {
j++;
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
int f, s;
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
mat[i][j] = 0;
}
}
for (int i = 0; i < m; i++) {
cin >> f >> s;
e[f].push_back(s);
e[s].push_back(f);
mat[f][s] = 1;
mat[s][f] = 1;
edges[f]++;
edges[s]++;
}
int ans = INT_MAX;
for (int i = 1; i < n + 1; i++) {
ans = min(ans, edges[i]);
}
if (n != 7 || ans <= 1)
cout << m << endl;
else {
if (ans == 6) {
cout << m - ans + 1 << endl;
} else {
int pp = INT_MAX;
for (int i = 1; i < n + 1; i++) {
for (int j = i + 1; j < n + 1; j++) {
pp = min(pp, common(e[i], e[j]));
}
}
cout << m - pp << endl;
}
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
namespace Fast_read {
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
template <typename T>
inline void read(T &x) {
x = (T)0;
T f = 1;
char ssd = gc();
while (ssd < '0' || ssd > '9') f = ssd == '-' ? -1 : 1, ssd = gc();
while (ssd >= '0' && ssd <= '9')
x = (x << 3) + (x << 1) + (ssd - '0'), ssd = gc();
x = x * f;
}
}; // namespace Fast_read
using namespace Fast_read;
const int maxn = 1e6 + 10;
int n;
bool vis[maxn];
long long sta[maxn];
int top;
long long F[maxn];
long long Num[maxn];
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i += 1) scanf("%lld", &Num[i]);
int zero;
scanf("%d", &zero);
for (register int i = 1, x; i <= zero; i += 1) {
scanf("%d", &x);
vis[x] = true;
}
for (register int i = n; i; i -= 1) {
if (vis[i]) {
F[i] = -Num[i];
sta[++top] = F[i];
} else {
if (top && sta[top] == -Num[i])
top -= 1, F[i] = Num[i];
else
F[i] = -Num[i], sta[++top] = F[i];
}
}
if (top) {
puts("NO");
return 0;
}
puts("YES");
for (register int i = 1; i <= n; i += 1) printf("%lld ", F[i]);
puts("");
return 0;
}
| 9 | CPP |
class Solution(object):
def __init__(self):
pass
def apply(self, s, x):
b = 0
prefix = []
for c in s:
if c == '1':
b -= 1
else:
b += 1
prefix.append(b)
s = 0
for nm in prefix:
if b == 0:
if nm == x:
return -1
else:
if (x - nm) % b == 0 and (x - nm) * b >= 0:
s += 1
if x == 0:
s += 1
return s
def main():
sol = Solution()
t = int(input())
for i in range(t):
info = input().split()
n = int(info[0])
x = int(info[1])
s = input()
print(sol.apply(s, x))
return 0
if __name__ == "__main__":
main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5002;
int a[N], n, k, c[1000002], d[1000002];
pair<int, int> v[1000002][6];
int tot[10000002];
int par[N], sz[N];
int find(int x) { return par[x] == x ? x : par[x] = find(par[x]); }
bool can(vector<pair<int, int> > vec) {
for (auto p : vec) {
par[p.first] = p.first;
sz[p.first] = 1;
par[p.second] = p.second;
sz[p.second] = 1;
}
for (auto p : vec) {
if (find(p.first) != find(p.second)) {
sz[find(p.second)] += sz[find(p.first)];
par[find(p.first)] = find(p.second);
}
}
unordered_set<int> st;
for (auto p : vec) st.insert(p.first), st.insert(p.second);
int ans = st.size();
for (auto x : st) {
if (find(x) == x) {
ans--;
}
}
return ans <= k;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) c[a[j] - a[i]]++;
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
if (c[a[j] - a[i]] <= 5) {
v[a[j] - a[i]][++tot[a[j] - a[i]]] = make_pair(i, j);
}
for (int i = 1; i <= 1000000; i++) {
vector<pair<int, int> > tmp;
int ok = 1, s = 0;
for (int j = i; j <= 1000000; j += i) {
if (c[j] > 5) ok = 0;
s += c[j];
if (s > 20) ok = 0;
}
if (!ok) continue;
for (int j = i; j <= 1000000; j += i) {
for (int k = 1; k <= tot[j]; k++) tmp.push_back(v[j][k]);
}
if (can(tmp)) return !printf("%d\n", i);
}
}
| 9 | CPP |
mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.readline
H, W, Q = map(int, input().split())
grid = []
for _ in range(H):
grid.append(input().rstrip('\n'))
V = [[0] * (W+1) for _ in range(H+1)]
for h in range(H):
for w in range(W):
V[h+1][w+1] = V[h+1][w] + V[h][w+1] - V[h][w] + int(grid[h][w])
EH = [[0] * (W+1) for _ in range(H)]
for h in range(H-1):
for w in range(W):
if grid[h][w] == grid[h+1][w] == "1":
add = 1
else:
add = 0
EH[h+1][w+1] = EH[h+1][w] + EH[h][w+1] - EH[h][w] + add
EW = [[0] * (W + 1) for _ in range(H + 1)]
for h in range(H):
for w in range(W-1):
if grid[h][w] == grid[h][w+1] == "1":
add = 1
else:
add = 0
EW[h + 1][w + 1] = EW[h + 1][w] + EW[h][w + 1] - EW[h][w] + add
for _ in range(Q):
h1, w1, h2, w2 = map(int, input().split())
v = V[h2][w2] - V[h2][w1-1] - V[h1-1][w2] + V[h1-1][w1-1]
eh = EH[h2-1][w2] - EH[h2-1][w1-1] - EH[h1-1][w2] + EH[h1-1][w1-1]
ew = EW[h2][w2-1] - EW[h2][w1-1] - EW[h1 - 1][w2-1] + EW[h1 - 1][w1-1]
print(v - eh - ew)
if __name__ == '__main__':
main()
| 0 | PYTHON3 |
#include<stdio.h>
int main(void)
{
int n,m,A[100001],B,C[100001],sum=1,sum1=0,i;
scanf("%d%d",&n,&m);
for(i=1;i<n;i++){
C[i]=0;
}
for(i=1;i<n;i++){
scanf("%d",&A[i]);
C[i+1]=C[i]+A[i];
}
for(i=1;i<=m;i++){
scanf("%d",&B);
if(sum<sum+B){
sum1+=C[sum+B]-C[sum];
}
else{
sum1+=C[sum]-C[sum+B];
}
sum+=B;
sum1%=100000;
}
printf("%d\n",sum1);
return 0;
} | 0 | CPP |
t = int(input())
while t:
t -= 1
a, b, c, d = map(int, input().split())
print(b, c, c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483640;
const int MAXN = 1000005;
int point[MAXN];
int l[MAXN], r[MAXN];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < (n); ++i) scanf("%d", &point[i]);
for (int i = 0; i < (m); ++i) {
int a, b;
scanf("%d%d", &a, &b);
l[i] = a;
r[i] = b;
}
map<int, int> mp;
for (int i = 0; i < (n); ++i) mp.insert(pair<int, int>(point[i], i));
vector<int> ar(n);
int tmp = 0;
for (auto x : mp) {
ar[x.second] = tmp;
if (tmp == 0)
tmp = 1;
else
tmp = 0;
}
vector<int> blue(m), red(m);
for (int i = 0; i < (n); ++i)
for (int j = 0; j < (m); ++j) {
if (point[i] >= l[j] && point[i] <= r[j]) {
if (ar[i] == 0)
blue[j]++;
else
red[j]++;
}
}
bool valid = true;
for (int i = 0; i < (m); ++i)
if (abs(red[i] - blue[i]) > 1) valid = false;
if (valid)
for (int i = 0; i < (n); ++i) printf("%d ", ar[i]);
else
printf("-1\n");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MXN = 2e5 + 10;
const long long INF = 1e9;
long long r, c, n, k, now, ans, kol;
long long X[MXN], Y[MXN], nxt[MXN], prv[MXN], Pnt[MXN];
long long A[MXN], Mx[MXN], zero[MXN];
vector<long long> R[MXN], C[MXN];
long long f(long long x) { return x * (x + 1) / 2; }
void Make(long long l, long long r, bool flag) {
long long pnt = l, ted = A[l];
if (flag) {
for (int i = l; i != r; i = nxt[i])
now -= (zero[i] + 1) * (Mx[i] - i) + f(zero[i]);
}
for (int i = l; i != r; i = nxt[i]) {
while (pnt < i) {
ted += A[nxt[pnt]];
pnt = nxt[pnt];
}
while (nxt[pnt] != -1 && ted + A[nxt[pnt]] <= k) {
ted += A[nxt[pnt]];
pnt = nxt[pnt];
}
Mx[i] = (ted <= k ? nxt[pnt] : pnt);
now += (zero[i] + 1) * (Mx[i] - i) + f(zero[i]);
ted -= A[i];
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> r >> c >> n >> k;
k--;
for (int i = 1; i <= n; i++) {
long long x, y;
cin >> x >> y;
X[i] = x, Y[i] = y;
R[x].push_back(i), C[y].push_back(i);
}
for (int a = 1; a <= r; a++) {
sort(R[a].begin(), R[a].end(),
[&](const int& i, const int& j) { return Y[i] < Y[j]; });
}
for (int b = 1; b <= c; b++) {
sort(C[b].begin(), C[b].end(),
[&](const int& i, const int& j) { return X[i] < X[j]; });
}
for (int up = 1; up <= r; up++) {
A[c + 1] = INF;
for (int i = 1; i <= c; i++) {
while (Pnt[i] < int(C[i].size()) && X[C[i][Pnt[i]]] < up) Pnt[i]++;
A[i] = int(C[i].size()) - Pnt[i];
zero[i] = (i > 1 && A[i - 1] == 0 ? zero[i - 1] + 1 : 0);
}
long long last = -1, bgn = c + 1, fns = c + 1;
for (int i = 1; i <= c + 1; i++) {
if (A[i] == 0) continue;
if (last != -1)
nxt[last] = i;
else
bgn = i;
prv[i] = last;
last = i;
}
if (last != -1) nxt[last] = -1;
now = 0, Make(bgn, fns, 0), Mx[c + 1] = c + 1;
zero[c + 1] = (A[c] == 0 ? zero[c] + 1 : 0);
now += f(zero[c + 1]);
for (int dn = r; dn >= up; dn--) {
ans += now;
for (auto id : R[dn]) {
long long p = Y[id];
A[p]--;
long long ten = k, idx = p;
while (prv[idx] != -1 && ten) {
idx = prv[idx], ten--;
}
if (A[p] > 0)
Make(idx, nxt[p], 1);
else {
ten = nxt[p];
now -= (zero[p] + 1) * (Mx[p] - p) + f(zero[p]);
now -= (zero[ten] + 1) * (Mx[ten] - ten) + f(zero[ten]);
zero[ten] += zero[p] + 1;
now += (zero[ten] + 1) * (Mx[ten] - ten) + f(zero[ten]);
if (prv[p] != -1) nxt[prv[p]] = ten;
prv[ten] = prv[p];
if (idx != p) Make(idx, ten, 1);
}
}
}
}
kol = 1ll * c * r * (c + 1) * (r + 1) / 4;
ans = kol - ans;
cout << ans << '\n';
return 0;
}
| 12 | CPP |
#include<iostream>
#include<sstream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define each(i,c) for(__typeof(c.begin()) i=c.begin();i!=c.end();i++)
#define pb push_back
#define mp make_pair
#define all(c) c.begin(),c.end()
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef long long ll;
const int inf=(int)1e9;
const double EPS=1e-9, INF=1e12;
int main(){
int n;
int s = 0;
cin >> n;
rep(i, n){
char a; int c;
cin >> a >> c;
if(a =='(') s += c;
else s -= c;
if(s < 0){
cout << "NO" << endl;
return 0;
}
}
cout << (s == 0 ? "YES" : "NO") << endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int len = 1 << 16;
string str;
int n, tot;
int son[555][2], fa[555], val[555];
int must[555];
long long int a[55], b[55], f[255][len], tmp1[len], tmp2[len];
inline void FWTAnd(long long int* A, long long int* B, int n) {
for (int len = 2; len <= n; len <<= 1)
for (int i = 0; i < n / len; ++i)
for (int j = 0; j < len / 2; ++j)
A[i * len + j] =
(A[i * len + j] + A[i * len + j + len / 2]) % 1000000007;
for (int len = 2; len <= n; len <<= 1)
for (int i = 0; i < n / len; ++i)
for (int j = 0; j < len / 2; ++j)
B[i * len + j] =
(B[i * len + j] + B[i * len + j + len / 2]) % 1000000007;
for (int i = 0; i < n; ++i) A[i] = A[i] * B[i] % 1000000007;
for (int len = 2; len <= n; len <<= 1)
for (int i = 0; i < n / len; ++i)
for (int j = 0; j < len / 2; ++j)
A[i * len + j] =
(A[i * len + j] - A[i * len + j + len / 2] + 1000000007) %
1000000007;
}
inline void FWTOr(long long int* A, long long int* B, int n) {
for (int len = 2; len <= n; len <<= 1)
for (int i = 0; i < n / len; ++i)
for (int j = 0; j < len / 2; ++j)
A[i * len + j + len / 2] =
(A[i * len + j] + A[i * len + j + len / 2]) % 1000000007;
for (int len = 2; len <= n; len <<= 1)
for (int i = 0; i < n / len; ++i)
for (int j = 0; j < len / 2; ++j)
B[i * len + j + len / 2] =
(B[i * len + j] + B[i * len + j + len / 2]) % 1000000007;
for (int i = 0; i < n; ++i) A[i] = A[i] * B[i] % 1000000007;
for (int len = 2; len <= n; len <<= 1)
for (int i = 0; i < n / len; ++i)
for (int j = 0; j < len / 2; ++j)
A[i * len + j + len / 2] =
(A[i * len + j + len / 2] - A[i * len + j] + 1000000007) %
1000000007;
}
inline int get(int A, int B, int C, int D) {
return (1 << (A << 0)) + (1 << (B << 1)) + (1 << (C << 2)) + (1 << (D << 3));
}
int main() {
ios::sync_with_stdio(false);
cin >> str >> n;
int pos = 1;
tot = 1;
for (int s = 0; s < str.size(); ++s) {
if (str[s] == '(') {
if (!son[pos][0])
son[pos][0] = ++tot;
else
son[pos][1] = ++tot;
fa[tot] = pos;
pos = tot;
} else if (str[s] == ')') {
pos = fa[pos];
if (!son[pos][1]) continue;
if (val[pos] == 1) {
for (int i = 0; i < len; ++i) f[pos][i] = f[son[pos][0]][i];
FWTAnd(f[pos], f[son[pos][1]], len);
} else if (val[pos] == 2) {
for (int i = 0; i < len; ++i) f[pos][i] = f[son[pos][0]][i];
FWTOr(f[pos], f[son[pos][1]], len);
} else {
for (int i = 0; i < len; ++i)
tmp1[i] = f[son[pos][0]][i], tmp2[i] = f[son[pos][1]][i];
FWTAnd(tmp1, tmp2, len);
for (int i = 0; i < len; ++i) f[pos][i] = tmp1[i];
for (int i = 0; i < len; ++i)
tmp1[i] = f[son[pos][0]][i], tmp2[i] = f[son[pos][1]][i];
FWTOr(tmp1, tmp2, len);
for (int i = 0; i < len; ++i)
f[pos][i] = (f[pos][i] + tmp1[i]) % 1000000007;
}
} else if ('A' <= str[s] && str[s] <= 'D') {
int d = 1 << (str[s] - 'A'), S = 0;
for (int i = 0; i < 16; ++i)
if (i & d) S |= 1 << i;
f[pos][S] = 1;
} else if ('a' <= str[s] && str[s] <= 'd') {
int d = 1 << (str[s] - 'a'), S = 0;
for (int i = 0; i < 16; ++i)
if ((~i) & d) S |= 1 << i;
f[pos][S] = 1;
} else if (str[s] == '?' && str[s + 1] != '(') {
for (int i = 0; i < 4; ++i) {
int d = 1 << i, S = 0;
for (int i = 0; i < 16; ++i)
if (i & d) S |= 1 << i;
f[pos][S] = 1;
}
for (int i = 0; i < 4; ++i) {
int d = 1 << i, S = 0;
for (int i = 0; i < 16; ++i)
if ((~i) & d) S |= 1 << i;
f[pos][S] = 1;
}
} else if (str[s] == '&')
val[pos] = 1;
else if (str[s] == '|')
val[pos] = 2;
}
for (int i = 0; i < 16; ++i) must[i] = -1;
for (int i = 1; i <= n; ++i) {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
must[a + b * 2 + c * 4 + d * 8] = e;
}
long long int ans = 0;
for (int S = 0; S < len; ++S) {
for (int i = 0; i < 16; ++i)
if (must[i] != -1 && ((S & (1 << i)) > 0) != must[i]) goto end;
ans = (ans + f[1][S]) % 1000000007;
end:;
}
cout << ans << endl;
return 0;
}
| 11 | CPP |
a, b, c, d = input().split(' ')
a = int(a)
b = int(b)
c = int(c)
d = int(d)
n = 50
m = 48
arr = [['A'] * n if i < n//4 else ['B'] * n if i < 2*n//4 else ['C'] * n if i < 3*n//4 else ['D'] * n for i in range(m)]
for i in range(b - 1):
arr[i // 25 * 2][i % 25 * 2] = 'B'
for i in range(c - 1):
arr[12 + i // 25 * 2][i % 25 * 2] = 'C'
for i in range(d - 1):
arr[24 + i // 25 * 2][i % 25 * 2] = 'D'
for i in range(a - 1):
arr[36 + i // 25 * 2][i % 25 * 2] = 'A'
print(48, 50)
for i in range(48):
print(''.join(arr[i])) | 9 | PYTHON3 |
n,j=map(int,input().split())
c=[]
for i in range(n):
a=list(map(int,input().split()))
if a[1] <= j:
c.append(a[0])
else:
c.append(a[0]-(a[1]-j))
print(max(c))
| 7 | PYTHON3 |
n = int(input())
words = []
for i in range(n):
words.append(input())
for word in words:
if len(word) > 10:
print(f"{word[0]}{len(word[1:-1])}{word[-1]}")
else:
print(word) | 7 | PYTHON3 |
#include<iostream>
using namespace std;
int main () {
int H, A;
cin >> H >> A;
cout << (H - 1) / A + 1 << endl;
} | 0 | CPP |
from collections import Counter
from math import *
n= int(input())
a = list(map(int, input().split(" ")))
b = list(map(int, input().split(" ")))
dic = {}
res = 0
maxi = 0
zeros = []
for i in range(n):
if a[i] != 0:
div = gcd(a[i], b[i])
t1 = a[i]
t2 = b[i]
if t1 < 0:
t1,t2 = -t1,-t2
t1 = t1//div
t2 = t2//div
tup = (t2,t1)
if tup not in dic:
dic[tup] = 0
dic[tup] += 1
maxi = max(maxi, dic[tup])
elif b[i] == 0:
res += 1
try:
print(res + max(dic.values()))
except ValueError:
print(res) | 10 | PYTHON3 |
cities, roads, storages = list(map(int, input().split(" ")))
graph = {}
for i in range(cities):
graph[i + 1] = {}
graph[i + 1].update({'storage': False})
for i in range(roads):
source, destination, length = list(map(int, input().split(" ")))
#take best root between 2 cities, currently overriding
if destination in graph[source].keys():
prevLength = graph[source].get(destination)
graph[source].update({destination: min(prevLength, length)})
else:
graph[source].update({destination: length})
if source in graph[destination].keys():
prevLength = graph[destination].get(source)
graph[destination].update({source: min(prevLength, length)})
else:
graph[destination].update({source: length})
allStorages = []
if storages > 0:
allStorages = list(map(int, input().split(" ")))
for i in allStorages:
graph[i].update({'storage': True})
minimumDistance = 10**10
for i in allStorages:
for j in graph[i].keys():
if j != 'storage' and not graph[j].get('storage'):
minimumDistance = min(minimumDistance, graph[i].get(j))
if minimumDistance == 10**10:
print(-1)
else:
print(minimumDistance)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
const int inf = 0x3f3f3f3f;
int n, m, g1, g2, s1, s2;
int dis[maxn][maxn], fast[maxn], slow[maxn];
long long dp[maxn][maxn][maxn];
bool vis[3][maxn];
long long consider(int g, int b, int su, int sd) {
memset(vis, 0, sizeof(vis));
memset(dp, 0, sizeof(dp));
for (int(i) = (1); (i) <= (n); (i)++)
for (int(j) = (1); (j) <= (n); (j)++)
if (i != j) {
if (dis[i][j] <= g) vis[0][i] = true;
if (dis[i][j] >= b) vis[2][i] = true;
if (dis[i][j] > su && dis[i][j] < sd) vis[1][i] = true;
}
dp[0][0][0] = 1;
for (int(i) = (1); (i) <= (n); (i)++)
for (int(j) = (0); (j) <= ((i + 1) - 1); (j)++)
for (int(k) = (0); (k) <= ((i - j + 1) - 1); (k)++) {
if (vis[0][i] && j >= 1) dp[i][j][k] += dp[i - 1][j - 1][k];
if (vis[1][i] && k >= 1) dp[i][j][k] += dp[i - 1][j][k - 1];
if (vis[2][i]) dp[i][j][k] += dp[i - 1][j][k];
}
long long ret = 0;
for (int(i) = (g1); (i) <= (g2); (i)++)
for (int(j) = (s1); (j) <= (s2); (j)++) ret += dp[n][i][j];
return ret;
}
int main() {
scanf("%d%d", &n, &m);
memset(dis, 0x3f, sizeof(dis));
for (int(i) = (1); (i) <= (n); (i)++) dis[i][i] = 0;
for (int(i) = (0); (i) <= ((m)-1); (i)++) {
int u, v, c;
scanf("%d%d%d", &u, &v, &c);
dis[u][v] = dis[v][u] = c;
}
for (int(k) = (1); (k) <= (n); (k)++)
for (int(i) = (1); (i) <= (n); (i)++)
for (int(j) = (1); (j) <= (n); (j)++)
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
for (int(i) = (1); (i) <= (n); (i)++)
for (int(j) = (1); (j) <= (n); (j)++)
if (dis[i][j] != inf) dis[i][j] = dis[i][j] * n + i;
scanf("%d%d%d%d", &g1, &g2, &s1, &s2);
for (int(i) = (1); (i) <= (n); (i)++) {
int mmax = -inf, mmin = inf;
for (int(j) = (1); (j) <= (n); (j)++)
if (i != j) {
mmax = max(mmax, dis[i][j]);
mmin = min(mmin, dis[i][j]);
}
fast[i] = mmin, slow[i] = mmax;
}
long long ans = 0;
for (int(i) = (1); (i) <= (n); (i)++)
for (int(j) = (1); (j) <= (n); (j)++) {
ans += consider(fast[i], slow[j], fast[i], slow[j]) -
consider(fast[i] - 1, slow[j], fast[i], slow[j]);
ans -= consider(fast[i], slow[j] + 1, fast[i], slow[j]) -
consider(fast[i] - 1, slow[j] + 1, fast[i], slow[j]);
}
printf("%lld", ans);
}
| 14 | CPP |
#include <cstdio>
#include <algorithm>
int quick_power(int a,int b,int Mod){
int ans=1;
while(b>0){
if(b&1){
ans=1ll*ans*a%Mod;
}
b>>=1;
a=1ll*a*a%Mod;
}
return ans;
}
const int Mod=998244353;
const int G=3;
const int Maxk=400000;
int find_inv(int x){
return quick_power(x,Mod-2,Mod);
}
int n,k;
namespace Poly{
int inv[Maxk+5],pow_G[Maxk+5];
void init_G(int len){
int t=quick_power(G,(Mod-1)/len,Mod);
pow_G[len>>1]=1;
for(int i=(len>>1)+1;i<len;i++){
pow_G[i]=1ll*pow_G[i-1]*t%Mod;
}
for(int i=(len>>1)-1;i>0;i--){
pow_G[i]=pow_G[i<<1];
}
}
void init(){
int len=1;
while(len<=Maxk){
len<<=1;
}
len>>=1;
init_G(len);
}
void NTT(int *a,int flag,int n){
static int R[Maxk+5],last_len=0;
int len=1,L=0;
while(len<n){
len<<=1;
L++;
}
if(last_len!=len){
for(int i=0;i<len;i++){
R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
}
}
for(int i=0;i<len;i++){
if(i<R[i]){
std::swap(a[i],a[R[i]]);
}
}
for(int j=1;j<len;j<<=1){
int *t=pow_G+j;
for(int k=0;k<len;k+=(j<<1)){
for(int l=0;l<j;l++){
int Nx=a[k+l],Ny=1ll*t[l]*a[j+k+l]%Mod;
a[k+l]=(Nx+Ny)%Mod;
a[j+k+l]=(Nx-Ny+Mod)%Mod;
}
}
}
if(flag==-1){
std::reverse(a+1,a+len);
for(int i=0,t=find_inv(len);i<len;i++){
a[i]=1ll*a[i]*t%Mod;
}
}
}
}
using Poly::NTT;
int fac[Maxk+5],inv_f[Maxk+5],C[Maxk+5],inv[Maxk+5];
void init(){
fac[0]=1;
for(int i=1;i<=Maxk;i++){
fac[i]=1ll*fac[i-1]*i%Mod;
}
inv_f[Maxk]=find_inv(fac[Maxk]);
for(int i=Maxk-1;i>=0;i--){
inv_f[i]=1ll*inv_f[i+1]*(i+1)%Mod;
}
inv[1]=1;
for(int i=2;i<=Maxk;i++){
inv[i]=1ll*(Mod-Mod/i)*inv[Mod%i]%Mod;
}
C[0]=1;
for(int i=1;i<=k;i++){
C[i]=1ll*C[i-1]*(n-i+1+Mod)%Mod*inv[i]%Mod;
}
}
int f[Maxk+5],g[Maxk+5];
int main(){
Poly::init();
scanf("%d%d",&n,&k);
init();
for(int i=0;i<=k;i++){
if(i&1){
f[i]=(Mod-inv_f[i])%Mod;
}
else{
f[i]=inv_f[i];
}
g[i]=1ll*quick_power(i,k,Mod)*inv_f[i]%Mod;
}
int len=1;
while(len<=(k<<1)){
len<<=1;
}
NTT(f,1,len);
NTT(g,1,len);
for(int i=0;i<len;i++){
f[i]=1ll*f[i]*g[i]%Mod;
}
NTT(f,-1,len);
int ans=0;
for(int i=0;i<=k;i++){
ans=(ans+1ll*C[i]*f[i]%Mod*fac[i]%Mod*quick_power(n+1,n-i,Mod))%Mod;
}
printf("%d\n",ans);
return 0;
}
| 12 | CPP |
import sys
input = sys.stdin.readline
p = int(input())
A = tuple(map(int, input().split()))
B = [0]*p
U = p-1
MOD = p
fact = [1]*(U+1)
fact_inv = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
fact_inv[U] = pow(fact[U], MOD-2, MOD)
for i in range(U,0,-1):
fact_inv[i-1] = (fact_inv[i]*i)%MOD
def comb(n, k):
if k < 0 or k > n:
return 0
z = fact[n]
z *= fact_inv[k]
z %= MOD
z *= fact_inv[n-k]
z %= MOD
return z
for j, a in enumerate(A):
if a:
B[0] += 1
temp = 1
for i in range(p-1, -1, -1):
B[i] -= (-1)**(i%2) * temp * comb(p-1, i)
temp *= j
temp %= p
B[i] %= p
print(*B) | 0 | PYTHON3 |
from itertools import *
N,M = map(int,input().split())
C = [list(map(int,input().split())) for n in range(N)]
print(max([sum(sorted([i*x+j*y+k*z for x,y,z in C],reverse=True)[:M]) for i,j,k in product([-1,1],[-1,1],[-1,1])])) | 0 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define gc getchar()
#define X first
#define Y second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define rep0(i,a,b) for(int i=(a);i<(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define fore(i,V) for(int i=0;i<V.size();++i)
#define lc x<<1
#define rc x<<1|1
#define ls x<<1,l,m
#define rs x<<1|1,m+1,r
inline int rd()
{
int x=0,w=1;char c=gc;
while(c!='-'&&!isdigit(c))c=gc;
if(c=='-')w=-1,c=gc;
while(isdigit(c))x=x*10+c-'0',c=gc;
return x*w;
}
const int N=100005;
int n,m,a[N],c[N][2];
struct st{int l,r;}b[N][2],f[N][2];
inline st operator&(const st&a,const st&b){return (st){max(a.l,b.l),min(a.r,b.r)};}
inline bool chk(st a,int w){return a.l<=w&&w<=a.r;}
int main()
{
n=rd();m=rd();
rep(i,1,n){a[i]=rd();rep(o,0,1)b[i][o].l=rd(),b[i][o].r=rd();}
f[n+1][0]=f[n+1][1]=(st){0,m};
per(i,n,1)rep(o,0,1)
{
if(chk(b[i][o],a[i]))
{
if(chk(f[i+1][o^1],a[i]))f[i][o]=b[i][o^1],c[i][o]=o^1;
else f[i][o]=f[i+1][o]&b[i][o^1],c[i][o]=o;
}
else f[i][o]=(st){m,0},c[i][o]=-1;
}
int o=-1;rep(i,0,1)if(f[1][i].l<=0&&0<=f[1][i].r)o=i;
if(o==-1){puts("No");return 0;}else puts("Yes");
rep(i,1,n)printf("%d ",o),o=c[i][o];return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, q, head[500500], cnt, sd[500500], flag[500500 << 2], num;
long long mi[500500 << 2], depth[500500 << 2], tag[500500 << 2], size[500500];
long long stand = 1e18;
vector<pair<long long, long long> > side[500500];
struct node {
long long v, l, r;
long long ans;
long long id;
} qu[500500];
void dfs1(long long now, long long fa) {
size[now] = 1;
if ((now == 1 && sd[now] == 0) || (now != 1 && sd[now] == 1)) {
flag[now] = 1;
return;
}
for (long long i = 0; i < side[now].size(); i++) {
long long v = side[now][i].first;
if (v == fa) continue;
depth[v] = depth[now] + side[now][i].second;
dfs1(v, now);
size[now] += size[v];
}
}
void push_down(long long x) {
tag[x << 1] += tag[x];
tag[x << 1 | 1] += tag[x];
mi[x << 1] += tag[x];
mi[x << 1 | 1] += tag[x];
tag[x] = 0;
if (tag[x << 1] > stand) tag[x << 1] = stand;
if (tag[x << 1 | 1] > stand) tag[x << 1 | 1] = stand;
if (mi[x << 1] > stand) mi[x << 1] = stand;
if (mi[x << 1 | 1] > stand) mi[x << 1 | 1] = stand;
}
void push_up(long long x) { mi[x] = min(mi[x << 1], mi[x << 1 | 1]); }
void change(long long l, long long r, long long root, long long tl,
long long tr, long long val) {
if (tl > tr) return;
if (mi[root] >= stand) return;
if (l != r) push_down(root);
if (tl <= l && r <= tr) {
if (tag[root] > stand) tag[root] = stand;
if (mi[root] > stand) mi[root] = stand;
tag[root] += val;
mi[root] += val;
return;
}
long long mid = (l + r) >> 1;
if (tl <= mid) change(l, mid, root << 1, tl, tr, val);
if (tr >= mid + 1) change(mid + 1, r, root << 1 | 1, tl, tr, val);
push_up(root);
return;
}
long long query(long long l, long long r, long long root, long long tl,
long long tr) {
if (l != r) push_down(root);
if (tl <= l && r <= tr) {
return mi[root];
}
long long tmp = stand + 1000;
long long mid = (l + r) >> 1;
if (tl <= mid) tmp = min(tmp, query(l, mid, root << 1, tl, tr));
if (tr >= mid + 1) tmp = min(tmp, query(mid + 1, r, root << 1 | 1, tl, tr));
return tmp;
}
bool cop(node x, node y) { return x.v < y.v; }
bool cop2(node x, node y) { return x.id < y.id; }
void dfs2(long long now, long long fa) {
while (num < q && qu[num + 1].v == now) {
num++;
qu[num].ans = query(1, n, 1, qu[num].l, qu[num].r);
}
for (long long i = 0; i < side[now].size(); i++) {
long long v = side[now][i].first;
if (v == fa) continue;
long long w = side[now][i].second;
change(1, n, 1, v, v + size[v] - 1, -w);
change(1, n, 1, 1, v - 1, w);
change(1, n, 1, v + size[v], n, w);
dfs2(v, now);
change(1, n, 1, v, v + size[v] - 1, w);
change(1, n, 1, 1, v - 1, -w);
change(1, n, 1, v + size[v], n, -w);
}
}
signed main() {
scanf("%lld%lld", &n, &q);
for (long long i = 2; i <= n; i++) {
long long u, v, w;
scanf("%lld%lld", &u, &w);
side[u].push_back(make_pair(i, w));
side[i].push_back(make_pair(u, w));
sd[u]++;
sd[i]++;
}
for (long long i = 1; i <= n; i++) sort(side[i].begin(), side[i].end());
for (long long i = 1; i <= q; i++) {
scanf("%lld%lld%lld", &qu[i].v, &qu[i].l, &qu[i].r);
qu[i].id = i;
}
sort(qu + 1, qu + 1 + q, cop);
dfs1(1, 0);
for (long long i = 1; i <= n; i++) {
if (flag[i]) {
change(1, n, 1, i, i, depth[i]);
} else {
change(1, n, 1, i, i, stand + 1000);
}
}
dfs2(1, 0);
sort(qu + 1, qu + 1 + q, cop2);
for (long long i = 1; i <= q; i++) {
printf("%lld\n", qu[i].ans);
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
struct order {
long long price;
long long qty;
};
bool vis[2][100005];
int ind[2][100005];
bool cmp(order a, order b) {
if (a.price != b.price) {
return a.price < b.price;
} else
return a.qty < b.qty;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n, s;
cin >> n >> s;
order st[2][n];
char dir;
int pr, qt;
int k1 = 0, k2 = 0;
for (int i = 0; i < n; i++) {
cin >> dir >> pr >> qt;
if (dir == 'B') {
if (vis[0][pr]) {
int id = ind[0][pr];
st[0][id].qty += qt;
} else {
st[0][k1].price = pr;
st[0][k1].qty = qt;
vis[0][pr] = 1;
ind[0][pr] = k1;
k1++;
}
} else {
if (vis[1][pr]) {
int id = ind[1][pr];
st[1][id].qty += qt;
} else {
st[1][k2].price = pr;
st[1][k2].qty = qt;
vis[1][pr] = 1;
ind[1][pr] = k2;
k2++;
}
}
}
sort(st[0], st[0] + k1, cmp);
sort(st[1], st[1] + k2, cmp);
order ans[2 * s];
for (int i = 0; i < 2 * s; i++) {
ans[i].price = -1;
}
int l = s - 1;
for (int i = k1 - 1; i >= 0; i--) {
if (l < 0) break;
ans[l] = st[0][i];
l--;
}
l = s;
for (int i = 0; i < k2; i++) {
if (l == 2 * s) break;
ans[l] = st[1][i];
l++;
}
for (int i = 2 * s - 1; i >= 0; i--) {
if (ans[i].price != -1) {
if (i >= s)
cout << 'S' << " " << ans[i].price << " " << ans[i].qty << "\n";
else
cout << 'B' << " " << ans[i].price << " " << ans[i].qty << "\n";
}
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long arr[100000];
long long gcd(long long a, long long b) {
if (a % b == 0) return b;
return gcd(b, a % b);
}
int main() {
long long n, sum = 0LL;
cin >> n;
for (int i = 0, _n = n; i < _n; i++) cin >> arr[i];
sort(arr, arr + n);
long long xx = arr[0];
for (int i = 1, _n = n; i < _n; i++) {
sum += (arr[i] * i - xx);
xx += arr[i];
}
sum = sum * 2 + xx;
long long g = gcd(sum, n);
cout << (sum / g) << " " << n / g << "\n";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long n, m, x, y, i, z, k, ok, c, ans, j;
long long a[30], id[315001], idx[4];
long long b[300001];
string s, t;
long long A[100001];
map<long long, long long> mm;
vector<long long> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> s;
for (i = 0; i < n; i++) {
a[s[i] - '0']++;
b[i] = s[i] - '0';
}
if (a[0] == a[1] && a[1] == a[2]) {
cout << s;
} else {
id[1] = id[2] = 0;
for (i = 0; i < n; i++) {
if (b[i] == 0) continue;
id[b[i]]++;
if (a[b[i]] - id[b[i]] >= n / 3) v.push_back(i);
}
j = 0;
for (i = a[0]; i < n / 3; i++) {
b[v[j++]] = 0;
}
v.clear();
for (i = 0; i < n; i++) {
if (b[i] == 1) continue;
if (b[i] == 0) id[0]++;
if (a[0] > n / 3 && id[0] > n / 3 && b[i] == 0) v.push_back(i);
}
for (i = 0; i < n; i++)
if (b[i] == 2 && a[2] > n / 3) v.push_back(i);
j = 0;
for (i = a[1]; i < n / 3; i++) {
a[b[v[j]]]--;
b[v[j++]] = 1;
}
id[0] = id[1] = 0;
v.clear();
for (i = 0; i < n; i++) {
if (b[i] == 2) continue;
id[b[i]]++;
if (id[b[i]] > n / 3 && a[b[i]] > n / 3) v.push_back(i);
}
j = 0;
for (i = a[2]; i < n / 3; i++) b[v[j++]] = 2;
for (i = 0; i < n; i++) cout << b[i];
}
}
| 10 | CPP |
for i in range(int(input())):
n=int(input())
g=[1]*n
print(' '.join(map(str,g))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a, b, C = ~(1<<31), M = (1<<16)-1;
int r() {
a = 36969 * (a & M) + (a >> 16);
b = 18000 * (b & M) + (b >> 16);
return (C & ((a << 16) + b)) % 1000000;
}
class HappySequence{
public:
map<int,int> seq;
HappySequence(){ int inf = 1e9; seq[-inf] = -inf; }
bool insert(int key,int val){
if( (--seq.lower_bound(key))->second >= val ) return false;
seq[key] = val;
auto it = ++seq.find(key);
while( it != seq.end() && (*it).second <= val ) seq.erase(it++);
return true;
}
};
HappySequence seg[1000100];
void ins(int y,int z,int v){
for(int i = y ; i < 1000100 ; i += i & -i ) seg[i].insert(z,v);
}
int get(int y,int z){
int v = 0;
for(int i = y ; i > 0 ; i -= i & -i ){
v = max(v,(--seg[i].seq.lower_bound(z))->second);
}
return v;
}
int main(){
int n,m,A,B;
while( cin >> m >> n >> A >> B && n+m ){
a = A;
b = B;
vector< array<int,3> > ps;
vector<int> uy;
for(int i = 0 ; i < m ; i++){
int x,y,z;
cin >> x >> y >> z;
ps.push_back(array<int,3>{x,y,z});
uy.push_back(y);
}
for(int i = 0 ; i < n ; i++){
int x = r();
int y = r();
int z = r();
ps.push_back(array<int,3>{x,y,z});
uy.push_back(y);
}
sort(uy.begin(),uy.end());
uy.erase(unique(uy.begin(),uy.end()),uy.end());
for(int i = 0 ; i <= uy.size() ; i++) seg[i] = HappySequence();
sort(ps.begin(),ps.end(),[&](array<int,3> a,array<int,3> b){
if( a[0] != b[0] ) return a[0] < b[0];
return make_pair(a[1],a[2]) > make_pair(b[1],b[2]);
});
int ans = 0;
for( auto p : ps ){
p[1] = lower_bound(uy.begin(),uy.end(),p[1]) - uy.begin() + 1;
int mx = get(p[1]-1,p[2]) + 1;
ans = max(ans,mx);
ins(p[1],p[2],mx);
}
cout << ans << endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
char s[MAXN];
int n;
char com[MAXN];
int treeMax[4 * MAXN];
int treeMin[4 * MAXN];
int lazy[4 * MAXN];
void upd(int i, int l, int r, int x, int y, int val) {
if (l >= x && r <= y) {
lazy[i] += val;
treeMax[i] += val;
treeMin[i] += val;
return;
}
if (l > y || r < x) return;
if (lazy[i] != 0) {
upd(i * 2 + 1, l, (l + r) / 2, l, (l + r) / 2, lazy[i]);
upd(i * 2 + 2, (l + r) / 2 + 1, r, (l + r) / 2 + 1, r, lazy[i]);
lazy[i] = 0;
}
upd(i * 2 + 1, l, (l + r) / 2, x, y, val);
upd(i * 2 + 2, (l + r) / 2 + 1, r, x, y, val);
treeMax[i] = max(treeMax[i * 2 + 1], treeMax[i * 2 + 2]);
treeMin[i] = min(treeMin[i * 2 + 1], treeMin[i * 2 + 2]);
}
bool balanced() {
int l, r;
l = 0;
r = n - 1;
int i = 0;
while (l < r) {
if (lazy[i] != 0) {
upd(i * 2 + 1, l, (l + r) / 2, l, (l + r) / 2, lazy[i]);
upd(i * 2 + 2, (l + r) / 2 + 1, r, (l + r) / 2 + 1, r, lazy[i]);
lazy[i] = 0;
}
i = i * 2 + 2;
l = (l + r) / 2 + 1;
}
return treeMax[i] == 0 && treeMin[0] == 0;
}
int solve() {
if (balanced())
return treeMax[0];
else
return -1;
}
int main() {
scanf("%d", &n);
scanf("%s", com);
int ind = 0;
for (int i = 0; i < n; i++) {
if (com[i] == 'R') {
ind++;
} else if (com[i] == 'L') {
ind--;
if (ind < 0) ind = 0;
} else {
char bef = s[ind];
s[ind] = com[i];
int befVal = 0;
int curVal = 0;
if (bef == '(')
befVal = 1;
else if (bef == ')')
befVal = -1;
if (s[ind] == '(')
curVal = 1;
else if (s[ind] == ')')
curVal = -1;
upd(0, 0, n - 1, ind, n - 1, curVal - befVal);
}
printf("%d\n", solve());
}
}
| 11 | CPP |
#include <bits/stdc++.h>
bool ascending(int i, int j) { return (i < j); }
bool descending(int i, int j) { return (i > j); }
using namespace std;
int main() {
string s;
cin >> s;
bool minus = false;
string integ, dec;
if (s[0] == '-') minus = true;
const int isMin = (minus ? 1 : 0);
int i = isMin;
bool reached = false;
while (i < s.length()) {
if (s[i] == '.') {
reached = true;
integ = s.substr(isMin, i - isMin);
}
i++;
}
if (reached)
dec = s.substr(integ.size() + isMin + 1);
else {
integ = s.substr(isMin);
dec = "00";
}
if (atoi(integ.c_str()) == 0 && atoi(dec.c_str()) == 0) {
cout << "$0.00";
return 0;
}
while (dec.size() < 2) dec += "0";
dec = dec.substr(0, 2);
for (int i = integ.length() - 3; i > 0; i -= 3)
integ = integ.substr(0, i) + "," + integ.substr(i, integ.length() - i);
string ret = "$" + integ + "." + dec;
if (minus) ret = "(" + ret + ")";
cout << ret;
}
| 8 | CPP |
n = int(input())
x = []
h = []
for i in range(n):
a, b = map(int, input().split())
x.append(a)
h.append(b)
INF = -10**9
stay = [INF] * (n + 1)
left = [INF] * (n + 1)
right = [INF] * (n + 1)
stay[-1] = 0
left[-1] = 0
right[-1] = 0
for i in range (n):
stay[i] = max(stay[i - 1], left[i - 1], right[i - 1])
if i == 0 or x[i] - h[i] > x[i - 1]:
left[i] = max(left[i - 1], stay[i - 1]) + 1
if x[i] - h[i] > x[i - 1] + h[i - 1]:
left[i] = right[i - 1] + 1
if i == n - 1 or x[i] + h[i] < x[i + 1]:
right[i] = max(right[i - 1], stay[i - 1], left[i - 1]) + 1
print(max(left[n - 1], right[n - 1], stay[n - 1])) | 9 | PYTHON3 |
q = int(input())
for _ in range(q):
n, x = map(int, input().split())
a = sorted({0} | set(map(int, input().split())))
m = 0
for i in range(len(a) - 1):
if a[i + 1] - a[i] - 1 <= x:
x -= a[i + 1] - a[i] - 1
m = a[i + 1]
else:
break
print(m + x) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
using namespace std;
const int MAXN = 100010;
struct Node {
int pref = 0, suff = 0, full = 0, sum = 0;
};
int n, m, k, u, v, x, y, t, a, b;
int f[MAXN];
int E[MAXN][3];
int stt[MAXN], fnt[MAXN], timer = 1;
int sz[MAXN], par[MAXN], head[MAXN], h[MAXN];
int ans[MAXN];
Node seg[MAXN << 2];
vector<int> G[MAXN], vec[MAXN], comp;
vector<pair<pair<int, int>, int> > Q[MAXN];
Node combine(Node x, Node y) {
Node z;
z.pref = x.pref + x.full * y.pref;
z.suff = x.suff * y.full + y.suff;
z.full = x.full & y.full;
z.sum = x.sum + y.sum - f[x.suff] - f[y.pref] + f[x.suff + y.pref];
return z;
}
void Set(int id, int tl, int tr, int pos) {
if (pos < tl || tr <= pos) return;
if (tr - tl == 1) {
seg[id].pref = seg[id].suff = seg[id].full = 1;
seg[id].sum = f[1];
return;
}
int mid = (tl + tr) >> 1;
Set(id << 1, tl, mid, pos);
Set(id << 1 | 1, mid, tr, pos);
seg[id] = combine(seg[id << 1], seg[id << 1 | 1]);
}
Node Get(int id, int tl, int tr, int l, int r) {
if (r <= tl || tr <= l) return seg[0];
if (l <= tl && tr <= r) return seg[id];
int mid = (tl + tr) >> 1;
return combine(Get(id << 1, tl, mid, l, r), Get(id << 1 | 1, mid, tr, l, r));
}
int dfs1(int node) {
h[node] = h[par[node]] + 1;
for (int v : G[node])
if (v != par[node]) {
par[v] = node;
sz[node] += dfs1(v);
}
return ++sz[node];
}
void dfs2(int node, int hd) {
stt[node] = timer++;
head[node] = hd;
int big = 0;
for (int v : G[node])
if (v != par[node] && sz[v] > sz[big]) big = v;
if (big) dfs2(big, hd);
for (int v : G[node])
if (v != par[node] && v != big) dfs2(v, v);
fnt[node] = timer;
}
int Lca(int u, int v) {
while (head[u] != head[v]) {
if (h[head[u]] > h[head[v]]) swap(u, v);
v = par[head[v]];
}
if (h[u] < h[v]) swap(u, v);
return v;
}
Node GetPar(int u, int v) {
Node res;
while (head[u] != head[v]) {
res = combine(Get(1, 1, n + 1, stt[head[v]], stt[v] + 1), res);
v = par[head[v]];
}
return combine(Get(1, 1, n + 1, stt[u] + 1, stt[v] + 1), res);
}
int GetPath(int u, int v) {
int lca = Lca(u, v);
Node x = GetPar(lca, u);
Node y = GetPar(lca, v);
swap(x.pref, x.suff);
return combine(x, y).sum;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i < n; i++) cin >> f[i];
for (int i = 1; i < n; i++) {
cin >> E[i][0] >> E[i][1] >> E[i][2];
G[E[i][0]].push_back(E[i][1]);
G[E[i][1]].push_back(E[i][0]);
comp.push_back(E[i][2]);
}
sort(comp.begin(), comp.end());
comp.resize(unique(comp.begin(), comp.end()) - comp.begin());
for (int i = 1; i < n; i++) {
E[i][2] = lower_bound(comp.begin(), comp.end(), E[i][2]) - comp.begin();
vec[E[i][2]].push_back(i);
}
for (int i = 1; i <= m; i++) {
cin >> u >> v >> x;
x = lower_bound(comp.begin(), comp.end(), x) - comp.begin();
Q[x].push_back({{u, v}, i});
}
dfs1(1);
dfs2(1, 1);
seg[0].full = 1;
for (int i = n; ~i; i--) {
for (int id : vec[i]) {
int v = E[id][0];
if (h[E[id][1]] > h[v]) v = E[id][1];
Set(1, 1, n + 1, stt[v]);
}
for (pair<pair<int, int>, int> p : Q[i]) {
int u = p.first.first, v = p.first.second, id = p.second;
ans[id] = GetPath(u, v);
}
}
for (int i = 1; i <= m; i++) cout << ans[i] << '\n';
return 0;
}
| 11 | CPP |
n,b=map(int,input().split())
list1=list(map(int,input().split()))
s=b
for i in range(n-1):
x=list1[i]
y=max(list1[i+1:])
bb=(b//x)*y+b%x
if(bb>s):
s=bb
print(s) | 8 | PYTHON3 |
t = int(input())
for i in range(t):
l,r=map(int, input().split())
if r>=2*l:
print(l, l+l)
else:
print("-1 -1") | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Tue Oct 13 13:28:24 2020
@author: zyc
"""
n=int(input(''))
colors=input('')
a=0
if colors[0]==colors[-1]:
a=a-1
for i in range(n):
if colors[i]==colors[i-1]:
a=a+1
print(a)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int pw, l, r;
while (1) {
cin >> str;
if (str == "end") return 0;
if (str[0] == 's') {
cout << "? " << 0 << " " << 1 << "\n";
cin >> str;
if (str == "x")
l = 0, r = 1;
else {
for (pw = 0; pw < 31; pw++) {
cout << "? " << (1 << pw) << " " << (1 << (pw + 1)) << "\n";
fflush(stdout);
cin >> str;
if (str == "x") break;
}
l = (1 << pw), r = (1 << (pw + 1));
}
while (r - l > 1) {
int mid = (l + r + 1) / 2;
cout << "? " << mid << " " << l << "\n";
fflush(stdout);
cin >> str;
if (str == "y")
r = mid;
else
l = mid;
}
cout << "! " << r << "\n";
fflush(stdout);
}
}
}
| 10 | CPP |
n = input()
x = 0
for i in range(len(n)):
if (int(n[i]) > 4):
x = 9 - int(n[i])
if ((x == 0) & (i == 0)):
print(9,end='')
else:
print(x,end='')
else:
print(n[i],end='') | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 9, B = 511;
inline long long read() {
long long res = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
res = (res << 3) + (res << 1) + ch - '0';
ch = getchar();
}
return res * f;
}
struct query {
long long p, id;
query(long long _p = 0, long long _id = 0) { p = _p, id = _id; }
};
long long m, n, tri[N][27], fail[N], cnt = 1, siz[N], ind, dfn[N];
long long len[N], fa[N], ed[N], tr[N], ans[N], a[N];
char s[N];
vector<long long> G[N];
vector<query> L[N], R[N], ll[N], rr[N];
inline bool cmp(query a, query b) { return a.p > b.p; }
inline void insert(long long x) {
long long p = 1;
for (long long i = 1; i <= len[x]; i++) {
long long v = s[i] - 'a';
if (!tri[p][v]) tri[p][v] = ++cnt, fa[tri[p][v]] = p;
p = tri[p][v];
}
ed[x] = p;
}
inline void build_fail() {
queue<long long> Q;
for (long long i = 0; i < 26; i++)
if (tri[1][i])
Q.push(tri[1][i]), fail[tri[1][i]] = 1;
else
tri[1][i] = 1;
while (!Q.empty()) {
long long u = Q.front();
Q.pop();
for (long long i = 0; i < 26; i++)
if (tri[u][i])
Q.push(tri[u][i]), fail[tri[u][i]] = tri[fail[u]][i];
else
tri[u][i] = tri[fail[u]][i];
}
}
void dfs(long long u) {
for (auto v : G[u]) dfs(v), a[u] += a[v];
}
void Dfs(long long u) {
siz[u] = 1;
dfn[u] = ++ind;
for (auto v : G[u]) Dfs(v), siz[u] += siz[v];
}
inline void add(long long x, long long c) {
while (x <= ind) tr[x] += c, x += (x & -x);
}
inline long long ask(long long x) {
long long res = 0;
while (x) res += tr[x], x -= (x & -x);
return res;
}
signed main() {
n = read(), m = read();
for (long long i = 1; i <= n; i++) {
scanf("%s", s + 1);
len[i] = strlen(s + 1);
insert(i);
}
build_fail();
for (long long i = 2; i <= cnt; i++) G[fail[i]].push_back(i);
for (long long i = 1; i <= m; i++) {
long long l, r, k;
l = read(), r = read(), k = read();
if (len[k] > B)
L[k].push_back(query(l, i)), R[k].push_back(query(r, i));
else
ll[l].push_back(query(k, i)), rr[r].push_back(query(k, i));
}
for (long long i = 1; i <= n; i++)
if (L[i].size() || R[i].size()) {
sort(L[i].begin(), L[i].end(), cmp);
sort(R[i].begin(), R[i].end(), cmp);
}
for (long long i = 1; i <= n; i++)
if (len[i] > B) {
long long p = ed[i];
while (p != 1) a[p] = 1, p = fa[p];
dfs(1);
for (long long j = 1, val = 0; j <= n; j++) {
while (L[i].size() && L[i].back().p == j)
ans[L[i].back().id] -= val, L[i].pop_back();
val += a[ed[j]];
while (R[i].size() && R[i].back().p == j)
ans[R[i].back().id] += val, R[i].pop_back();
}
memset(a, 0, sizeof a);
}
Dfs(1);
for (long long i = 1; i <= n; i++) {
for (auto j : ll[i]) {
long long p = ed[j.p];
while (p != 1) ans[j.id] -= ask(dfn[p]), p = fa[p];
}
add(dfn[ed[i]], 1), add(dfn[ed[i]] + siz[ed[i]], -1);
for (auto j : rr[i]) {
long long p = ed[j.p];
while (p != 1) ans[j.id] += ask(dfn[p]), p = fa[p];
}
}
for (long long i = 1; i <= m; i++) printf("%lld\n", ans[i]);
return 0;
}
| 12 | CPP |
s=input()
k=input()
temp=s[::-1]
if(temp==k):
print("YES")
else:
print("NO") | 7 | PYTHON3 |
q=int(input())
for i in range(q):
a,b,c,d=map(int,input().split())
if a==b:
if c==a:
print(a,d)
else:
print(a,c)
elif c==d:
if c==a:
print(b,c)
else:
print(a,c)
elif a==d:
print(a,c)
else:
print(a,d) | 7 | PYTHON3 |
import sys
import math
#to read string
get_string = lambda: sys.stdin.readline().strip()
#to read list of integers
get_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )
#to read integers
get_int = lambda: int(sys.stdin.readline())
#to print fast
pt = lambda x: sys.stdout.write(str(x)+'\n')
#--------------------------------WhiteHat010--------------------------------------#
n,l,a = get_int_list()
f = 0
breaks = 0
for i in range(n):
x,y = get_int_list()
if (x-f) >= a:
breaks += (x-f)//a
f = x+y
breaks += (l-f)//a
print(breaks) | 7 | PYTHON3 |
def solve():
entrada = input().split()
n = int(entrada[0])
m = int(entrada[1])
temp = 0
arr_c = [[0 for x in range(5 * pow(10,2) + 4)] for y in range(5 * pow(10,2) + 4)]
for i in range(0, n):
entrada = input().split()
for j in range(0, m):
arr_c[i][j] = int(entrada[j])
for i in range(n):
temp ^= arr_c[i][0]
if (temp != 0):
print('TAK')
for i in range(n):
print('1', end = ' ')
print()
return
else:
for i in range(n):
for j in range(1, m):
if(arr_c[i][j] != arr_c[i][0]):
print('TAK')
for k in range(n):
if(k != i):
print('1', end = ' ')
else:
print(j + 1, end = ' ')
print()
return
print('NIE')
return
solve()
| 8 | PYTHON3 |
Subsets and Splits