solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
def main():
buf = input()
n = int(buf)
buf = input()
buflist = buf.split()
a = list(map(int, buflist))
appearance = {}
for i in a:
if not i in appearance:
appearance.update({i : 1})
else:
appearance[i] += 1
appearance = [[k, v] for k ,v in dict(sorted(appearance.items(), key=lambda x:x[1])).items()]
max_num = appearance[-1][1]
pos = 0
for i in range(1, max_num + 1):
num = 0
prob = i
for j in range(pos, len(appearance)):
if appearance[j][1] >= prob:
num += prob
prob *= 2
if num > max_num:
max_num = num
while appearance[pos][1] == i and pos < len(appearance) - 1:
pos += 1
print(max_num)
if __name__ == '__main__':
main()
| 1,800 | PYTHON3 |
x,y = map(int,input().split())
count = 0
for i in range(1,x+1):
if y%i == 0:
if y/i<=x:
count+=1
print(count) | 1,000 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
s = set(map(int, input().split()))
found = False
for i in range(1, 1024):
ns = set([c ^ i for c in s])
if s == ns:
print(i)
found = True
break
if not found:
print(-1)
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<int, int> > pq[5];
int main() {
int n, m, k, i, j, u, l = 0, r = 0, temp, R[5], ret = 0;
memset(R, 0, sizeof(R));
cin >> n >> m >> k;
for (i = 0; i < n; ++i) {
r = i;
for (j = 0; j < m; ++j) scanf("%d", &u), pq[j].push(make_pair(u, i));
while (l <= r) {
temp = 0;
for (j = 0; j < m; ++j) {
while (pq[j].top().second < l) pq[j].pop();
temp += pq[j].top().first;
}
if (temp <= k) break;
++l;
}
if (r - l + 1 > ret) {
ret = r - l + 1;
for (j = 0; j < m; ++j) R[j] = pq[j].top().first;
}
}
for (j = 0; j < m; ++j) printf("%d ", R[j]);
cout << endl;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long solve(long long l, long long r, long long x) {
long long res = 0;
for (int i = 1; i <= 62; i++) {
long long p = (1LL << i) - 1;
long long val = (x ^ p);
if (l <= p && p <= r) {
res = max(res, val);
}
if (l <= val && val <= r) {
res = max(res, p);
}
}
return res;
}
int main() {
long long l, r;
cin >> l >> r;
if (l == r) {
cout << 0;
} else if (r - l <= 1000) {
long long m = 0;
for (long long i = l; i <= r; i++) {
for (long long j = l; j <= r; j++) {
m = max(m, i ^ j);
}
}
cout << m;
} else {
long long a = solve(l, r, l);
long long b = solve(l, r, r);
long long c = solve(l, r, (l + r) / 2);
cout << max(a, max(b, c));
}
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
set<int> seen;
vector<pair<int, int> > ans;
for (int i = 1, l = 1; i <= n; ++i) {
int x;
cin >> x;
if (seen.count(x)) {
ans.emplace_back(l, i);
seen.clear();
l = i + 1;
} else {
seen.insert(x);
}
}
if (ans.size() == 0) {
cout << -1 << endl;
return 0;
}
ans.back().second = n;
cout << ans.size() << endl;
for (pair<int, int> p : ans) {
cout << p.first << " " << p.second << endl;
}
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1 &x, T2 y) {
if (x > y) x = y;
}
template <typename T1, typename T2>
inline void chkmax(T1 &x, T2 y) {
if (x < y) x = y;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
_out << _p.first << ' ' << _p.second;
return _out;
}
template <typename T, typename U>
inline istream &operator>>(istream &_in, pair<T, U> &_p) {
_in >> _p.first >> _p.second;
return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
if (_v.empty()) {
return _out;
}
_out << _v.front();
for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) {
_out << ' ' << *_it;
}
return _out;
}
template <typename T>
inline istream &operator>>(istream &_in, vector<T> &_v) {
for (auto &_i : _v) {
_in >> _i;
}
return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const set<T> &_s) {
if (_s.empty()) {
return _out;
}
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
_out << ' ' << *_it;
}
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const multiset<T> &_s) {
if (_s.empty()) {
return _out;
}
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
_out << ' ' << *_it;
}
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) {
if (_s.empty()) {
return _out;
}
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
_out << ' ' << *_it;
}
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) {
if (_s.empty()) {
return _out;
}
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
_out << ' ' << *_it;
}
return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
if (_m.empty()) {
return _out;
}
_out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) {
_out << ", (" << _it->first << ": " << _it->second << ')';
}
return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) {
if (_m.empty()) {
return _out;
}
_out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) {
_out << ", (" << _it->first << ": " << _it->second << ')';
}
return _out;
}
const string FILENAME = "input";
int n;
long long a[561], b[561];
long long dp[80][80][80];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] *= 1000;
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long l = 0;
long long r = 1000000000000LL;
for (int it = 0; it < 80; it++) {
long long mid = (l + r) / 2.0;
vector<pair<long long, long long> > s;
for (int i = 0; i < n; i++) {
s.push_back({a[i], -(a[i] - mid * b[i])});
}
sort((s).begin(), (s).end());
for (int i = n; i >= 0; i--) {
for (int curbal = 0; curbal <= n; curbal++) {
for (int t = 0; t <= n; t++) {
dp[i][curbal][t] = -1e18;
}
}
}
dp[n][0][0] = 0;
for (int i = n; i >= 1; i--) {
for (int curbal = 0; curbal <= n; curbal++) {
for (int t = 0; t <= n; t++) {
long long cost = s[i - 1].second;
chkmax(dp[i - 1][curbal + 1]
[(i == n ? 1 : (s[i - 1].first == s[i].first ? t + 1 : 1))],
cost + dp[i][curbal][t]);
if (i != n) {
if (s[i - 1].first == s[i].first) {
if (curbal - t > 0) {
chkmax(dp[i - 1][curbal - 1][t], dp[i][curbal][t]);
}
} else {
if (curbal) {
chkmax(dp[i - 1][curbal - 1][0], dp[i][curbal][t]);
}
}
}
}
}
}
bool good = false;
for (int i = 0; i <= n; i++) {
for (int t = 0; t <= n; t++) {
if (dp[0][i][t] >= 0) {
good = true;
}
}
}
if (good) {
r = mid;
} else {
l = mid + 1;
}
}
cout << l << '\n';
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200;
char c[maxn][maxn];
int dp[maxn][maxn], mx[maxn], mn[maxn];
bool mark[maxn];
int main() {
ios_base::sync_with_stdio(false);
int n, m, tmp = 0;
cin >> n >> m;
for (int i = 0; i < maxn; i++) mn[i] = 1000000000;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> c[i][j];
if (c[i][j] == 'W') {
mark[i] = true;
mx[i] = max(mx[i], j);
mn[i] = min(mn[i], j);
}
}
if (mark[i]) tmp = i;
}
for (int i = 1; i <= m; i++) {
dp[1][i] = i - 1;
if (i < mx[1] && mark[1] == true) dp[1][i] = -1;
}
for (int x = 2; x <= n; x++) {
if (x % 2 == 0) {
for (int i = m; i >= 1; i--) {
if (dp[x - 1][i] != -1 && (!mark[x] || i >= mx[x]))
dp[x][i] = dp[x - 1][i] + 1;
if (i != m) {
if (dp[x - 1][i] != -1 && (!mark[x] || i >= mx[x]))
dp[x][i] = min(dp[x][i], dp[x][i + 1] + 1);
else
dp[x][i] = dp[x][i + 1] + 1;
}
}
if (mark[x]) {
for (int j = mn[x] + 1; j <= m; j++) dp[x][j] = -1;
}
} else {
for (int i = 1; i <= m; i++) {
if (dp[x - 1][i] != -1 && (!mark[x] || i <= mn[x]))
dp[x][i] = dp[x - 1][i] + 1;
if (i != 1)
if (dp[x - 1][i] != -1 && (!mark[x] || i <= mn[x]))
dp[x][i] = min(dp[x][i], dp[x][i - 1] + 1);
else
dp[x][i] = dp[x][i - 1] + 1;
}
if (mark[x]) {
for (int j = 1; j < mx[x]; j++) dp[x][j] = -1;
}
}
}
if (tmp == 0) {
cout << 0;
return 0;
}
int ans = 1000000000;
for (int i = 1; i <= m; i++)
if (dp[tmp][i] != -1) ans = min(ans, dp[tmp][i]);
cout << ans;
}
| 1,500 | CPP |
situation = input()
case1='0000000'
case2='1111111'
result1 = situation.find(case1)
result2=situation.find(case2)
if result1 > -1 or result2 >-1:
print("YES")
else:
print("NO") | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, p[101][3], x, y, i;
string s;
p[0][1] = 0;
p[0][2] = 0;
cin >> a >> b;
cin >> s;
if (a == 0 && b == 0) {
cout << "Yes" << endl;
return 0;
}
for (i = 1; i <= s.size(); i++) {
if (s[i - 1] == 'L') {
p[i][1] = p[i - 1][1] - 1;
p[i][2] = p[i - 1][2];
}
if (s[i - 1] == 'R') {
p[i][1] = p[i - 1][1] + 1;
p[i][2] = p[i - 1][2];
}
if (s[i - 1] == 'U') {
p[i][1] = p[i - 1][1];
p[i][2] = p[i - 1][2] + 1;
}
if (s[i - 1] == 'D') {
p[i][1] = p[i - 1][1];
p[i][2] = p[i - 1][2] - 1;
}
}
if (p[s.size()][1] == 0 || p[s.size()][2] == 0) {
if (p[s.size()][1] == 0 && p[s.size()][2] == 0) {
for (i = 1; i <= s.size(); i++) {
if (a == p[i][1] && b == p[i][2]) {
cout << "Yes" << endl;
return 0;
}
}
} else if (p[s.size()][1] == 0) {
for (i = 1; i <= s.size(); i++) {
x = a - p[i][1];
y = b - p[i][2];
if (x != 0) continue;
if (y % p[s.size()][2] == 0) {
if (y / p[s.size()][2] >= 0) {
cout << "Yes" << endl;
return 0;
}
}
}
} else {
for (i = 1; i <= s.size(); i++) {
x = a - p[i][1];
y = b - p[i][2];
if (y != 0) continue;
if (x % p[s.size()][1] == 0) {
if (x / p[s.size()][1] >= 0) {
cout << "Yes" << endl;
return 0;
}
}
}
}
} else {
for (i = 1; i <= s.size(); i++) {
x = a - p[i][1];
y = b - p[i][2];
if (x % p[s.size()][1] == 0 && y % p[s.size()][2] == 0 &&
x / p[s.size()][1] == y / p[s.size()][2]) {
if (x / p[s.size()][1] >= 0 && y / p[s.size()][2] >= 0) {
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N;
int a[MAXN];
vector<int> lol;
int main(int argc, char *argv[]) {
scanf("%d", &N);
int p = 1;
while (p < MAXN) {
lol.push_back(p);
p <<= 1;
}
for (int i = 0, _i = N; i < _i; ++i) {
scanf("%d", a + i);
}
long long ans = 0;
for (int i = 0, _i = N - 1; i < _i; ++i) {
ans += a[i];
cout << ans << '\n';
a[i + *(--upper_bound(lol.begin(), lol.end(), N - i - 1))] += a[i];
a[i] = 0;
}
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
const int maxn = 2000001, maxm = 23, maxe = 65, INF = ~0u >> 1;
int t, tot, d[maxn], pr[maxn], tr[maxe][maxe], ex[maxe];
long long ans;
inline int min(int a, int b, int c) {
return a < b ? (a < c ? a : c) : (b < c ? b : c);
}
struct Factor {
long long value;
int cnt, p[maxm], e[maxm];
void init(int delta = 1) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
u *= delta;
value = (long long)u * v * w;
cnt = 0;
while (1) {
int pp = min(d[u], d[v], d[w]);
if (pp == INF) break;
e[cnt] = 0;
for (; d[u] == pp; u /= pp, ++e[cnt])
;
for (; d[v] == pp; v /= pp, ++e[cnt])
;
for (; d[w] == pp; w /= pp, ++e[cnt])
;
p[cnt++] = pp;
}
}
} N, M, S;
void pfs(int dep, long long val, int sgn) {
if (dep == N.cnt) {
ans += M.value / val * sgn;
return;
}
pfs(dep + 1, val, sgn * tr[ex[dep]][0]);
for (int i = 1; i <= N.e[dep]; ++i)
pfs(dep + 1, val *= N.p[dep], sgn * tr[ex[dep]][i]);
}
void dfs(int dep, long long val) {
if (dep == S.cnt) {
ans += val <= N.value;
return;
}
dfs(dep + 1, val);
for (int i = 1; i <= S.e[dep]; ++i) dfs(dep + 1, val *= S.p[dep]);
}
int main() {
d[1] = INF;
for (int i = 2; i < maxn; ++i) {
if (!d[i]) pr[tot++] = d[i] = i;
for (int j = 0, k; (k = i * pr[j]) < maxn; ++j) {
d[k] = pr[j];
if (d[i] == pr[j]) break;
}
}
for (int i = 0; i < maxe; ++i)
for (int j = 0; j < maxe; ++j)
for (int k = 0; k <= i && k <= j; ++k)
tr[i][j] += (k == j) - (k == j - 1);
scanf("%d", &t);
while (t--) {
N.init();
M.init();
S.init(2);
for (int i = 0, j = 0; i < N.cnt; ++i) {
for (; j < S.cnt && S.p[j] < N.p[i]; ++j)
;
ex[i] = j < S.cnt && S.p[j] == N.p[i] ? S.e[j] : 0;
}
ans = 0;
pfs(0, 1, 1);
dfs(0, 1);
printf("%I64d\n", ans);
}
return 0;
}
| 2,900 | CPP |
#n,a,b
n,a,b=map(int,input().split())
#No less than a. means >=a people
#No more than b means <b people
print(min(n-a,b+1))
| 1,000 | PYTHON3 |
page_number, current_page, period = map(int, input().split())
right = '>>'
left = '<<'
page_list = range(1, page_number + 1)
res = []
page_index = page_list.index(current_page)
if page_index > period:
res.append(left)
for i in reversed(range(1, period + 1)):
tmp_number = current_page - i
if tmp_number in page_list:
res.append(str(current_page - i))
res.append('({})'.format(str(current_page)))
for i in range(1, period + 1):
tmp_number = current_page + i
if tmp_number in page_list:
res.append(str(current_page + i))
if page_index < page_number - period - 1:
res.append(right)
print(' '.join(res))
| 0 | PYTHON3 |
n, m, k = (int(x) for x in input().split())
prices = [int(x) for x in input().split()]
ans = 1000000
for i, price in enumerate(prices):
if price == 0:
continue
if price <= k:
ans = min(ans, abs(m - 1 - i) * 10)
print(ans)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << "\n"; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
long long int n, m, k, i, j, mod;
vector<long long int> a, b;
int32_t main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int tc;
cin >> tc;
long long int N = 45000;
a.resize(N - 1, 0);
for (long long int i = 2; i <= N; ++i) a[i - 2] = i * (i - 1) / 2;
42;
while (tc--) {
cin >> n;
42;
string s = "";
s = "13";
b.clear();
b.resize(N - 1, 0);
for (long long int i = N - 2; i >= 0; i--) {
b[i] = n / a[i];
n %= a[i];
}
while (!b.empty() && b.back() == '0') b.pop_back();
42;
for (auto tm : b) {
s += "3";
while (tm--) s += "7";
}
cout << s << "\n";
}
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n;
set<int> g[N];
int d[N], len[N];
queue<int> q;
int ans[N];
int main() {
cin >> n;
for (int i = 1, u, v; i < n; i++) {
cin >> u >> v;
g[u].insert(v);
g[v].insert(u);
d[u]++;
d[v]++;
}
for (int i = 1; i <= n; i++)
if (d[i] == 1) q.push(i), len[i] = 1;
int siz = q.size();
for (int i = siz; i <= n; i++) ans[i] = n;
int now = siz;
while (!q.empty()) {
int u = q.front();
q.pop();
if (g[u].empty()) break;
int v = *g[u].begin();
if (len[v] || g[v].size() > 2) {
g[u].erase(v);
g[v].erase(u);
now--;
ans[now] = ans[now + 1] - len[u];
} else {
g[u].erase(v);
g[v].erase(u);
len[v] = len[u] + 1;
q.push(v);
}
}
ans[1] = 1;
for (int i = 1; i <= n; i++) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 2,200 | CPP |
ties = int(input())
scarf = int(input())
vest = int(input())
jacket = int(input())
s1 = int(input())
s2 = int(input())
price1 = 0
price2 = 0
if (max(s1 , s2) == s2):
price1 = s2 * min(vest , scarf , jacket)
if ties > 0 and jacket > 0:
jacket -= min(vest , scarf , jacket)
price1 += s1 * min(ties , jacket)
print(price1)
else:
price2 = s1 * min(ties , jacket)
if vest > 0 and scarf > 0 and jacket > 0:
jacket -= min(ties , jacket)
price2 += s2 * min(scarf , vest , jacket)
print(price2)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e4 + 5;
double sqr(double x) { return x * x; }
struct P {
double x, y;
P() {}
P(double _x, double _y) : x(_x), y(_y) {}
friend P operator-(const P &a, const P &b) { return P(a.x - b.x, a.y - b.y); }
friend double operator*(const P &a, const P &b) {
return a.x * b.x + a.y * b.y;
}
friend double operator^(const P &a, const P &b) {
return a.x * b.y - a.y * b.x;
}
} p[maxn];
double dis(P a, P b) { return sqrt(sqr(a.x - b.x) + sqr(a.y - b.y)); }
int n;
int dec(int x) { return x - 1; }
int inc(int x) { return (x + 1) % n; }
double solve() {
double ans = 1e18, s = 0;
for (int i = 0, j = 1; i < n; ++i) {
while ((p[inc(j)] - p[j]) * (p[inc(i)] - p[i]) > 0) {
s += fabs((p[i] - p[j]) ^ (p[i] - p[inc(j)]));
j = inc(j);
}
double a = fabs((p[i] - p[inc(i)]) ^ (p[i] - p[j])) / dis(p[i], p[inc(i)]);
double c = dis(p[i], p[j]);
double b = sqrt(sqr(c) - sqr(a));
double area = a * b;
ans = min(ans, fabs(fabs(area) - fabs(s)));
s -= fabs((p[j] - p[i]) ^ (p[inc(i)] - p[i]));
}
return ans * 0.5;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%lf%lf", &p[i].x, &p[i].y);
double ans = solve();
reverse(p, p + n);
printf("%.15f\n", min(ans, solve()));
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1100000;
int i, j, len, n, k, idx;
char c[MAXN];
bool flag[MAXN];
string s, str, cmp;
vector<int> prefix;
vector<int> z_function(string s) {
int n = (int)s.length();
vector<int> z(n);
for (int i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r) z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
}
return z;
}
vector<int> z;
bool contains(int left, int right, int k) {
int range = right - left + 1;
if (range == k) return true;
if ((range / k) % 2) {
if (z[right - k + 1] < k) return false;
right -= k;
range -= k;
}
int mid = left + (right - left) / 2;
if (z[mid + 1] < range / 2) return false;
return contains(left, mid, k) and contains(mid + 1, right, k);
}
int main() {
scanf("%d %d\n", &n, &k);
cin >> s;
z = z_function(s);
for (i = k - 1; i < n; i += k) {
flag[i] = contains(0, i, (i + 1) / k);
}
string ans = "";
if (k == 1)
ans = "1";
else
ans = "0";
int rem = 0;
for (i = 1; i < n; i++) {
bool l = flag[i];
if (flag[i - 1]) {
rem = min(max(rem, z[i]), i / k);
}
if (rem > 0) {
l = true;
rem--;
}
if (l)
ans += "1";
else
ans += "0";
}
cout << ans << endl;
return 0;
}
| 2,200 | CPP |
import sys
import math
from collections import defaultdict,Counter,deque
# input=sys.stdin.readline
# def print(x):
# sys.stdout.write(str(x)+"\n")
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# sys.stdout=open("CP1/output.txt",'w')
# sys.stdin=open("CP1/input.txt",'r')
# mod=pow(10,9)+7
t=int(input())
for _ in range(t):
r,c=map(int,input().split())
cnt=0
l=[]
flag=0
flag2=0
h=[0,0]
v=[0,0]
for i in range(r):
s=list(input())
cur=1
for j in range(c):
if s[j]=='A':
s[j]=1
cnt+=1
if j==0 or j==c-1:
flag=1
if j==0:
v[0]+=1
else:
v[1]+=1
if i==0 or i==r-1:
flag=1
if i==0:
h[0]+=1
else:
h[1]+=1
else:
s[j]=0
cur=0
if cur:
flag2=1
l.append(s)
if cnt==0:
print("MORTAL")
elif cnt==r*c:
print(0)
elif flag==0:
print(4)
else:
if max(h)==c or max(v)==r:
print(1)
flag=0
if flag:
if l[0][0] or l[0][c-1] or l[r-1][c-1] or l[r-1][0] or flag2:
print(2)
else:
for j in range(1,c-1):
for k in range(r):
if l[k][j]==0:
break
else:
print(2)
flag2=1
break
if flag2==0:
print(3)
| 1,800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long pa(long long n) { return n * (n + 1) / 2; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, x;
cin >> n >> x;
vector<long long> d(2 * n);
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> d[i];
d[i + n] = d[i];
}
long long pf[2 * n], sum[2 * n];
pf[0] = d[0];
sum[0] = pa(d[0]);
for (int i = 1; i < 2 * n; i++) {
pf[i] = pf[i - 1] + d[i];
sum[i] = sum[i - 1] + pa(d[i]);
}
for (int i = 0; i < n; i++) {
if (d[i] >= x) {
ans = max(ans, pa(d[i]) - pa(d[i] - x));
continue;
}
int l = i, r = 2 * n - 1, m;
int p = i;
while (l <= r) {
m = l + r >> 1;
if (pf[m] - (i ? pf[i - 1] : 0) <= x) {
p = m;
l = m + 1;
} else
r = m - 1;
}
long long res =
sum[p] - (i ? sum[i - 1] : 0) + pa(x - (pf[p] - (i ? pf[i - 1] : 0)));
long long diff = x - (pf[p] - (i ? pf[i - 1] : 0));
int nxt = (p + 1) % (2 * n);
long long leftover = d[nxt] - diff;
res = res - (pa(leftover)) + (pa(leftover + diff) - pa(diff));
ans = max(ans, res);
}
cout << ans << "\n";
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, i, j, k, ans1, ans2;
int a[2005][2005], b[2005][2005];
int qx[4000005], qy[4000005], ll, rr;
int dx[20], dy[20];
char ch;
void add(int x, int y) {
a[x][y] = 0;
++rr;
qx[rr] = x;
qy[rr] = y;
}
void bfs(int sx, int sy) {
int i, j, k, x, y, d;
qx[1] = sx;
qy[1] = sy;
a[sx][sy] = 0;
for (ll = rr = 1; ll <= rr; ++ll) {
x = qx[ll];
y = qy[ll];
if (a[x - 1][y]) add(x - 1, y);
if (a[x + 1][y]) add(x + 1, y);
if (a[x][y - 1]) add(x, y - 1);
if (a[x][y + 1]) add(x, y + 1);
}
if (rr <= 60) return;
dx[1] = 10000;
dy[1] = 10000;
dx[2] = 10000;
dy[2] = -10000;
dx[3] = 10000;
dy[3] = -10000;
dx[4] = -10000;
dy[4] = -10000;
dx[5] = -10000;
dy[5] = -10000;
dx[6] = -10000;
dy[6] = 10000;
dx[7] = -10000;
dy[7] = 10000;
dx[8] = 10000;
dy[8] = 10000;
for (i = 1; i <= rr; ++i) {
x = qx[i];
y = qy[i];
if (x < dx[1] || (x == dx[1] && y < dy[1])) dx[1] = x, dy[1] = y;
if (x < dx[2] || (x == dx[2] && y > dy[2])) dx[2] = x, dy[2] = y;
if (y > dy[3] || (y == dy[3] && x < dx[3])) dx[3] = x, dy[3] = y;
if (y > dy[4] || (y == dy[4] && x > dx[4])) dx[4] = x, dy[4] = y;
if (x > dx[5] || (x == dx[5] && y > dy[5])) dx[5] = x, dy[5] = y;
if (x > dx[6] || (x == dx[6] && y < dy[6])) dx[6] = x, dy[6] = y;
if (y < dy[7] || (y == dy[7] && x > dx[7])) dx[7] = x, dy[7] = y;
if (y < dy[8] || (y == dy[8] && x < dx[8])) dx[8] = x, dy[8] = y;
}
d = 0;
for (i = 1; i <= 8; ++i)
for (j = i + 1; j <= 8; ++j) {
x = dx[i] - dx[j];
y = dy[i] - dy[j];
if (x * x + y * y > d) d = x * x + y * y;
}
double w = ((double)rr) / d;
if (w > 0.6)
++ans1;
else
++ans2;
}
int main() {
scanf("%d", &n);
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j) {
for (ch = getchar(); ch != '0' && ch != '1'; ch = getchar())
;
b[i][j] = ch - '0';
}
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j) {
a[i][j] = b[i][j];
k = a[i - 1][j] + a[i][j - 1] + a[i][j + 1] + a[i + 1][j];
if (k >= 3) a[i][j] = 1;
}
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if (a[i][j]) bfs(i, j);
printf("%d %d\n", ans1, ans2);
}
| 2,000 | CPP |
a,b,c=tuple(map(int,input().split()))
if c==0:
print('Yes' if a==b else 'No')
else:
if b%c==a%c and (b==a or (b-a)//abs(b-a)==c//abs(c)):
print('Yes')
else:
print('No') | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2000010, mod = 1e9 + 7, maxa = 1e6 + 100, maxb = 23;
const long long inf = 2e18 + 13;
long long max(long long x, long long y) { return (x > y ? x : y); }
long long min(long long x, long long y) { return (x < y ? x : y); }
void printAns(int i, int j) {
printf("%d\n", j - i);
for (int k = i + 1; k <= j; k++) {
if (k != i + 1) printf(" ");
printf("%d", k + 1);
}
printf("\n");
}
void solve(int n, int x[], int y[], bool swap) {
long long xs = 0, ys = 0;
int j = -1;
unordered_map<int, pair<int, int> > mp;
mp[0] = make_pair(-1, -1);
for (int i = 0; i < n; i++) {
xs += x[i];
while (j + 1 < n && ys + y[j + 1] <= xs) ys += y[++j];
int diff = (int)(xs - ys);
if (mp.count(diff) != 0) {
int px = mp[diff].first;
int py = mp[diff].second;
if (swap) {
printAns(py, j);
printAns(px, i);
} else {
printAns(px, i);
printAns(py, j);
}
return;
}
mp[diff] = make_pair(i, j);
}
}
int main() {
int n;
scanf("%d", &n);
int x[n], y[n];
long long s1 = 0, s2 = 0;
for (int i = 0, a; i < n; i++) {
scanf("%d", x + i);
s1 += x[i];
}
for (int i = 0, b; i < n; i++) {
scanf("%d", y + i);
s2 += y[i];
}
if (s1 < s2)
solve(n, x, y, false);
else
solve(n, y, x, true);
return 0;
}
| 3,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 5;
unordered_map<int, int> s[N];
int n, a[N], t[N], x[N], pool[N], mx, m;
void add(int u, int x, int val) {
while (u <= n) {
s[u][x] += val;
u += (u & -u);
}
}
int cnt(int u, int x) {
int ans = 0;
while (u) {
ans += s[u][x];
u -= (u & -u);
}
return ans;
}
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i++)
scanf("%d%d%d", &a[i], &t[i], &x[i]), pool[i] = t[i];
sort(pool + 1, pool + n + 1);
int m = unique(pool + 1, pool + n + 1) - (pool + 1);
mx = *max_element(pool + 1, pool + m + 1);
for (register int i = 1; i <= n; i++) {
t[i] = lower_bound(pool + 1, pool + m + 1, t[i]) - pool;
if (a[i] == 1) {
add(t[i], x[i], 1);
} else if (a[i] == 2) {
add(t[i], x[i], -1);
} else if (a[i] == 3) {
printf("%d\n", cnt(t[i], x[i]));
}
}
return 0;
}
| 2,000 | CPP |
import string
import random
il = list(map(int, input().split()))
n = il[0]
d = il[1]
alphal = list(string.ascii_lowercase)
a1 = alphal[0:d]
str1 = []
dL = []
for i in range(n):
if(i == 0):
str1.append(a1[i])
dL.append(a1[i])
else:
x = random.randint(0,d-1)
if(len(dL) != d):
while(a1[x] == str1[i-1] or a1[x] in dL):
x = random.randint(0,d-1)
str1.append(a1[x])
dL.append(a1[x])
else:
while(a1[x] == str1[i-1]):
x = random.randint(0,d-1)
str1.append(a1[x])
print("".join(str1)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int v, w;
node() {}
node(int a, int b) {
v = a;
w = b;
}
};
vector<node> e[100010];
int dep[100010], fa[100010][25] = {{0}}, sum[100010], n;
void dfs(int t, int tem);
int LCA(int a, int b);
int getKth(int x, int k);
int solve(int a, int b);
int main() {
int u, v, k;
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
scanf("%d%d", &u, &v);
node a(v, 1), b(u, 1);
e[u].push_back(a);
e[v].push_back(b);
}
memset(fa, 0, sizeof(fa));
memset(sum, 0, sizeof(sum));
dep[0] = -1;
dfs(1, 0);
scanf("%d", &k);
for (int i = 0; i < k; i++) {
scanf("%d%d", &u, &v);
printf("%d\n", solve(u, v));
}
}
void dfs(int t, int tem) {
sum[t] = 1;
dep[t] = dep[tem] + 1;
fa[t][0] = tem;
for (int i = 1; (1 << i) <= dep[t]; i++) {
fa[t][i] = fa[fa[t][i - 1]][i - 1];
}
for (int i = 0; i < e[t].size(); i++) {
if (sum[e[t][i].v] == 0) {
dfs(e[t][i].v, t);
sum[t] += sum[e[t][i].v];
}
}
}
int getKth(int x, int k) {
for (int i = 23; i >= 0; i--) {
if (1 << i <= k) {
k ^= 1 << i;
x = fa[x][i];
}
}
return x;
}
int LCA(int a, int b) {
if (dep[a] < dep[b]) swap(a, b);
for (int i = 23; i >= 0; i--)
if ((1 << i) <= (dep[a] - dep[b])) a = fa[a][i];
if (a == b) return a;
for (int i = 23; i >= 0; i--) {
if (fa[a][i] != fa[b][i] && dep[a] >= (1 << i)) {
a = fa[a][i];
b = fa[b][i];
}
}
return fa[a][0];
}
int solve(int a, int b) {
if (a == b) return n;
if (dep[a] < dep[b]) swap(a, b);
int lca = LCA(a, b);
int s1 = dep[a] - dep[lca], s2 = dep[b] - dep[lca];
int s = s1 + s2;
if (s % 2) return 0;
if (s1 == s2)
return n - sum[lca] + sum[lca] - sum[getKth(a, s1 - 1)] -
sum[getKth(b, s2 - 1)];
int mid = s / 2;
return sum[getKth(a, mid)] - sum[getKth(a, mid - 1)];
}
| 2,100 | CPP |
n = int(input())
while n % 10 == 0:
n //= 10
l = list(str(n))
while len(l) > 1:
if l[0] == l[len(l) - 1]:
l.pop()
l.pop(0)
else:
print('NO')
exit()
print('YES') | 900 | PYTHON3 |
#include <bits/stdc++.h>
const int MAXN = 2e5 + 15;
using namespace std;
bool cool[101][26], cooler[101][26];
void solve() {
string s1, s2;
cin >> s1 >> s2;
int n = s1.length(), m = s2.length();
if (m > n) {
cout << "need tree";
return;
}
std::vector<int> fs1(26, 0), fs2(26, 0);
for (int i = 0; i < n; i++) fs1[(int)(s1[i] - 'a')]++;
for (int i = 0; i < m; i++) fs2[(int)(s2[i] - 'a')]++;
for (int i = 0; i < 26; i++) {
if (fs1[i] < fs2[i]) {
cout << "need tree";
return;
}
}
int pos = 0, sw = 0;
for (int i = 0; i < m; i++) {
sw = 1;
for (int j = pos; j < n; j++) {
if (s2[i] == s1[j]) {
pos = j + 1;
sw = 0;
break;
}
}
if (sw) break;
}
if (n == m) {
if (sw) {
cout << "array";
}
} else {
if (sw)
cout << "both";
else
cout << "automaton";
}
}
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cout << fixed << setprecision(12);
int t = 1;
for (int i = 1; i <= t; i++) {
solve();
cout << "\n";
}
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
class PQtree {
public:
int siz[2010], sizr[2010], typ[2010];
char *s;
int n, nodecnt;
bool fail;
vector<int> con[2010];
inline int state(int x) {
if (!sizr[x]) return 0;
if (sizr[x] == siz[x]) return 2;
return 1;
}
void init(int N) {
n = N;
nodecnt = n + 1;
for (int i = 1; i <= n; i++) con[n + 1].push_back(i);
}
void dfs(int np) {
siz[np] = (np <= n);
sizr[np] = (np <= n) ? (s[np] == '1') : 0;
for (int &x : con[np]) {
dfs(x);
siz[np] += siz[x];
sizr[np] += sizr[x];
}
}
void getans(int np, vector<int> &ret) {
if (np <= n) ret.push_back(np);
for (int &x : con[np]) getans(x, ret);
}
int mergep(const vector<int> &v) {
if (!v.size()) return 0;
if (v.size() == 1) return v[0];
int p = ++nodecnt;
con[p] = v;
return p;
}
void addedge(int s, int e) {
if (e) con[s].push_back(e);
}
void merge(int a, int b) {
con[a].insert(con[a].end(), con[b].begin(), con[b].end());
}
int solve(int np, int t) {
if (fail) return 0;
vector<int> v[3];
for (int &x : con[np]) v[state(x)].push_back(x);
if (v[1].size() > 2 || (t > 0 && v[1].size() > 1)) {
fail = 1;
return 0;
}
if (t == 0 && v[1].size() == 1 && v[2].size() == 0)
return solve(v[1][0], 0);
if (typ[np] == 0) {
int P = mergep(v[2]);
if (!t) {
con[np] = v[0];
if (!v[1].size())
addedge(np, P);
else {
int p1 = solve(v[1][0], 1);
addedge(p1, P);
if (v[1].size() > 1) merge(p1, solve(v[1][1], 2));
addedge(np, p1);
}
} else {
typ[np] = 1;
con[np].clear();
addedge(np, mergep(v[0]));
if (v[1].size()) merge(np, solve(v[1][0], 1));
addedge(np, P);
if (t == 2) reverse(con[np].begin(), con[np].end());
}
return np;
} else {
if (state(con[np][0]) == 2 || state(con[np].back()) == 0)
reverse(con[np].begin(), con[np].end());
vector<int> tmp;
int cnt = 0;
for (int &x : con[np]) {
int S = state(x);
if (S == 1) {
int p;
if (cnt == 0)
cnt++, p = solve(x, 1);
else if (cnt == 1)
cnt++, p = solve(x, 2);
else {
fail = 1;
return 0;
}
for (int &x : con[p]) tmp.push_back(x);
} else if (S == 2) {
tmp.push_back(x);
if (cnt == 0)
cnt++;
else if (cnt == 2) {
fail = 1;
return 0;
}
} else {
tmp.push_back(x);
if (cnt == 1) cnt++;
}
}
if (t && cnt == 2) {
fail = 1;
return 0;
}
con[np] = tmp;
if (t == 2) reverse(con[np].begin(), con[np].end());
return np;
}
}
void regulate(char *S) {
s = S;
dfs(n + 1);
solve(n + 1, 0);
}
} T;
int n;
char s[1010][1010];
vector<int> ans;
int main() {
scanf("%d", &n);
T.init(n);
for (int i = 1; i <= n; i++) {
scanf("%s", s[i] + 1);
T.regulate(s[i]);
}
if (T.fail)
puts("NO");
else {
puts("YES");
T.getans(n + 1, ans);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) putchar(s[i][ans[j - 1]]);
puts("");
}
}
return 0;
}
| 3,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool fun(int a[], int n) {
for (int i = 1; i <= n; i++) {
if (a[i] != i) return true;
}
return false;
}
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = 0;
while (fun(a, n)) {
ans++;
if (ans % 2 != 0) {
for (int i = 1; i < n; i += 2) {
if (a[i] > a[i + 1]) {
int temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
}
}
} else {
for (int i = 2; i <= n; i += 2) {
if (a[i] > a[i + 1]) {
int temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
}
}
}
}
cout << ans << endl;
}
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
string w;
set<string> s;
int main() {
cin >> w;
int n = w.size();
for (int i = 1; i <= n; i++) {
char c = w.back();
w.pop_back();
w.insert(w.begin(), c);
s.insert(w);
}
cout << (int)s.size() << '\n';
return 0;
}
| 900 | CPP |
n = int(input())
a = list(map(int,input().split()))
m = int(input())
b = list(map(int,input().split()))
i , j =0,0
ans = 0
while(i<n and j<m):
if a[i]==b[j]:
ans+=1
i+=1
j+=1
elif a[i]<b[j]:
if i+1<len(a):
a[i+1]+=a[i]
i+=1
elif b[j]<a[i]:
if j+1<len(b):
b[j+1]+=b[j]
j+=1
if i!=n or j!=m: print(-1)
else:print(ans) | 1,600 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
double vp, vd, t, f, c, dp = 0, dd = 0;
int bijous = 0;
scanf("%lf %lf %lf %lf %lf", &vp, &vd, &t, &f, &c);
if (vp >= vd) {
printf("0\n");
} else {
dp = vp * t;
dd = vd * (dp) / (vd - vp);
dp = dd;
while (dp < c) {
bijous++;
dp += vp * ((dd / vd) + f);
dd = vd * (dp) / (vd - vp);
dp = dd;
}
printf("%d\n", bijous);
}
return 0;
}
| 1,500 | CPP |
t=int(input())
while(t):
a,b,c=map(int,input().split())
k=c//2
if(k<b):
p=(b-k)//2
d=k*3
if(p<a):
d+=p*3
else:
p=min(p,a)
d+=p*3
else:
k=min(k,b)
d=k*3
print(d)
t-=1
| 800 | PYTHON3 |
s = input().lower()
hellowrd = "hello"
j = 0
count = 0
for i in range(len(s)):
if s[i] == hellowrd[j]:
j += 1
count += 1
if count == 5:
break
if count == 5:
print("YES")
else:
print("NO") | 1,000 | PYTHON3 |
a = input()
b = 0
d = 0
c = []
f = []
i = 0
while i<len(a)-1:
if a[i]=="B" and a[i+1]=="A":
f.append([i,i+1])
d += 1
if a[i]=="A" and a[i+1]=="B":
c.append([i,i+1])
b += 1
i += 1
if (b>2 and d>=1) or (b>=1 and d>2) or (b>=2 and d>=2):
i = len(a)+5
print("YES")
if i!=len(a)+5:
for i in c:
for j in f:
if i[0]!=j[0] and i[0]!=j[1] and i[1]!=j[0] and i[1]!=j[1]:
print("YES")
i = -2
break
if i==-2:
break
if i==-2:
break
if i!=-2:
print("NO")
| 1,500 | PYTHON3 |
a=str(input())
word=['H','Q','9']
count=0
n=len(a)
i=0
while(i<n):
if(a[i] in word):
count+=1
break
else:
i+=1
if(count==0):
print("NO")
else:
print("YES") | 900 | PYTHON3 |
import sys
input = sys.stdin.readline
T=int(input())
for q in range(T):
n,s,t=map(int,input().split())
print(min(n,max(n-s,n-t)+1))
| 900 | PYTHON3 |
n=int(input())
tmp=input().split()
num=0
for i in tmp:
num+=int(i)
print('%.12f'%(num/n)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline long long getnum() {
char c = getchar();
long long num, sign = 1;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-') sign = -1;
for (num = 0; c >= '0' && c <= '9';) {
c -= '0';
num = num * 10 + c;
c = getchar();
}
return num * sign;
}
int A[5][4];
int done[1003][1003];
vector<pair<int, int> > V;
int main() {
for (int i = 1; i <= 3; i++)
for (int j = 1; j <= 2; j++) A[i][j] = getnum();
int mx = 1000000, a, b;
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
int t = 0;
for (int a = 1; a <= 3; a++) {
t += abs(A[a][1] - i) + abs(A[a][2] - j);
}
if (t < mx) mx = t, a = i, b = j;
}
}
int ans = 0;
for (int i = 1; i <= 3; i++) {
while (A[i][1] != a) {
done[A[i][1]][A[i][2]] = 1;
if (A[i][1] > a) A[i][1]--;
if (A[i][1] < a) A[i][1]++;
}
while (A[i][2] != b) {
done[A[i][1]][A[i][2]] = 1;
if (A[i][2] > b) A[i][2]--;
if (A[i][2] < b) A[i][2]++;
}
}
done[a][b] = 1;
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
if (done[i][j]) ans++;
}
}
printf("%d\n", ans);
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
if (done[i][j]) printf("%d %d\n", i, j);
}
}
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
x = 0;
int f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) + (x << 3) + (c ^ 48);
c = getchar();
}
x *= f;
}
inline void print(int x) {
if (x < 0) {
x = -x;
putchar('-');
}
if (x > 9) print(x / 10);
putchar(x % 10 + '0');
}
int gcd(int a, int b) {
while (b ^= a ^= b ^= a %= b)
;
return a;
}
int pri[55555];
int miu[55555];
void work(int n) {
miu[1] = 1;
for (register int i = 2; i <= n; i++) {
if (!pri[i]) pri[++pri[0]] = i, miu[i] = -1;
for (register int j = 1; j <= pri[0] && i * pri[j] <= n; j++) {
pri[pri[j] * i] = 1;
if (i % pri[j] == 0)
break;
else
miu[i * pri[j]] = -miu[i];
}
}
}
int main() {
int a, b, c, d;
read(a);
read(b);
read(c);
read(d);
print(((a ^ b) & (c | d)) ^ ((b & c) | (a ^ d)));
}
| 2,000 | CPP |
n = int(input())
for k in range(n):
s = input()
ls = [int(x) for x in s.split()]
if (ls[2] * ls[1] + ls[2] - 1) % (ls[0] - 1) == 0:
ans = (ls[2] * ls[1] + ls[2] - 1) // (ls[0] - 1) + ls[2]
else:
ans = (ls[2] * ls[1] + ls[2] - 1) // (ls[0] - 1) + ls[2] + 1
print(ans) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const double eps = 1e-5;
const int N = 1e5 + 10;
const int M = 4e6 + 10;
const long long MOD = 1000000007;
const int mod = 1000000007;
const int MAX = 1000000010;
const double pi = acos(-1.0);
long long g[N];
int n, a[N], f[N];
int get_k(int x) {
int ret = 0;
for (; x; x -= x & -x) ret += f[x];
return ret;
}
long long get_sum(int x) {
long long ret = 0;
for (; x; x -= x & -x) ret += g[x];
return ret;
}
void add_k(int x, int k) {
for (; x <= n; x += x & -x) f[x] += k;
}
void add_sum(int x, long long sum) {
for (; x <= n; x += x & -x) g[x] += sum;
}
int main() {
int i, k;
long long sumk;
double ans = 0, fmm;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
fmm = 1.0 * n * (n + 1);
for (i = 1; i <= n; i++) {
k = get_k(a[i]);
sumk = get_sum(a[i]);
ans += 1.0 * (i - 1 - k);
ans += (2.0 * sumk - 1.0 * i * (i - 1) / 2.0) * (n - i + 1) / fmm;
add_k(a[i], 1);
add_sum(a[i], i);
}
printf("%.16f\n", ans);
return 0;
}
| 2,400 | CPP |
MOD = 1000000007
C = [[0] * 20 for _ in range(1100)]
for i in range(1100):
C[i][0] = 1
for i in range(1, 1100):
C[i][0] = 1
for j in range(1, 20):
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD
N, M = map(int, input().split())
ans = 0
for endA in range(1, N + 1):
for endB in range(endA, N + 1):
cases = C[M - 1 + endA - 1][M - 1] * C[M - 1 + N + 1 - endB - 1][M - 1]
ans += cases % MOD
print(ans % MOD)
| 1,600 | PYTHON3 |
k = int(input())
for kk in range(k):
n = int(input())
s = input()
t = input()
i = None
j = None
ok = True
for l, (ss, tt) in enumerate(zip(s, t)):
if ss != tt:
if i is None:
i = l
elif j is None:
j = l
else:
ok = False
break
if ok and ((i is None and j is None) or (i is not None and j is not None and s[i] == s[j] and t[j] == t[i])):
print("Yes")
else:
print("No")
| 1,000 | PYTHON3 |
// Problem Statement: https://codeforces.com/contest/1474/problem/E/
/**
* Author: Ravi Kanth Gojur
* Code Forces: ravireddy07
* Code Chef: ravireddy115
* Github: ravireddy07
**/
#include <bits/stdc++.h>
#define ll long long int
#define ravireddy07 return
#define ii(a) scanf("%d", &a)
#define ii2(a, b) scanf("%d%d", &a, &b)
#define ii3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define ill(a) scanf("%lld", &a)
#define ill2(a, b) scanf("%lld%lld", &a, &b)
#define ill3(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define for1(i, a, b) for (int i = a; i < b; ++i)
#define for2(i, a, b) for (int i = b; i >= a; --i)
#define vi vector<int>
#define vii vector<vector<int>>
#define vl vector<ll>
#define vll vector<vector<ll>>
#define pii pair<int,int>
#define unmp unordered_map
#define pqi priority_queue<int>
#define pb push_back
#define sorta(a) sort(a.begin(), a.end())
#define sortd(a) sort(a.begin(), a.end(), greater<>())
#define sortr(a) sort(a.rbegin(), a.rend())
#define yes printf("YES\n")
#define no printf("NO\n")
using namespace std;
template <typename T, typename T1>
T amax(T &a, T1 b)
{
if (b > a)
a = b;
return a;
}
const int N = 100100;
int n, m;
int p[N];
int ans[N][2];
ll sqr(ll x) {
return x * x;
}
void harry() {
ii(n);
m = 0;
for (int i = 1; i <= n; i++)
p[i] = i;
ll w = 0;
int l = 1;
int r = n - 1;
int t = 0;
while (m < n - 1) {
if (t == 0) {
w += sqr(n - l);
ans[m][0] = l;
ans[m][1] = n;
m++;
swap(p[l], p[n]);
l++;
} else {
w += sqr(r - 1);
ans[m][0] = r;
ans[m][1] = 1;
m++;
swap(p[r], p[1]);
r--;
}
t ^= 1;
}
printf("%lld\n", w);
for (int i = 1; i <= n; i++)
printf("%d ", p[i]);
printf("\n");
printf("%d\n", m);
for (int i = m - 1; i >= 0; i--)
printf("%d %d\n", ans[i][0], ans[i][1]);
ravireddy07;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
ii(t);
while (t--)
harry();
return 0;
} | 2,500 | CPP |
# http://codeforces.com/contest/443/problem/A
def solution(s):
alphabets = set()
for c in s:
if c.isalpha():
alphabets.add(c)
return len(alphabets)
if __name__ == "__main__":
s = input()
print(solution(s)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
const long long int mod = 1e9 + 7;
const long long int pinf = ((long long int)2e18);
const long long int ninf = ((long long int)-2e18);
const long long int N = (long long int)3e5 + 5;
const long long int MOD = 998244353;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
{
long long int l, n, x, q, sum = 0, y, i, j, p;
cin >> l;
string a;
cin >> a;
n = a.size();
string ans;
long long int nine = 0;
for (long long int i = 0; i < n; i++) {
nine += (a[i] == '9');
}
if (l > n) {
ans.push_back('1');
for (long long int i = 1; i < l; i++) {
ans.push_back('0');
}
} else if (n % l != 0) {
long long int temp = n / l;
ans.push_back('1');
for (long long int i = 1; i < l; i++) {
ans.push_back('0');
}
string t = ans;
for (long long int i = 0; i < temp; i++) {
ans += t;
}
} else {
string pref = a.substr(0, l);
if (nine == n) {
long long int temp = n / l;
ans.push_back('1');
for (long long int i = 1; i < l; i++) {
ans.push_back('0');
}
string t = ans;
for (long long int i = 0; i < temp; i++) {
ans += t;
}
} else {
long long int flag = 1;
for (long long int i = l; i < n; i++) {
if (a[i % l] < a[i]) {
break;
} else if (a[i % l] > a[i]) {
flag = 0;
break;
}
}
if (flag == 0) {
long long int temp = n / l;
string t = pref;
for (long long int i = 0; i < temp; i++) {
ans += t;
}
} else {
i = l - 1;
while (i >= 0 && pref[i] == '9') {
pref[i] = '0';
i--;
}
if (i >= 0) {
pref[i]++;
}
long long int temp = n / l;
string t = pref;
for (long long int i = 0; i < temp; i++) {
ans += t;
}
}
}
}
cout << ans;
}
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
void dibya() {
long long n;
cin >> n;
string s;
cin >> s;
long long ans = INT_MAX;
for (int i = 'a'; i <= 'z'; i++) {
long long l, r;
l = 0;
r = n - 1;
long long res = 0;
while (l <= r) {
if (s[l] == s[r]) {
l++;
r--;
} else if (s[l] == i) {
l++;
res++;
} else if (s[r] == i) {
r--;
res++;
} else {
res = INT_MAX;
break;
}
}
ans = min(res, ans);
}
if (ans == INT_MAX) {
cout << -1 << "\n";
} else {
cout << ans << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
dibya();
}
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
long long n, k;
cin >> n >> k;
long long total_coins = 0;
long long here = 0;
for (int i = 0; i < k; ++i) {
long long a, b;
cin >> a >> b;
total_coins += b;
here += (a - 1) * b;
here %= n;
}
long long total = (n - 1) * n / 2;
total %= n;
if (n > total_coins) {
cout << 1 << '\n';
} else if (n < total_coins) {
cout << -1 << '\n';
} else {
cout << (total == here ? 1 : -1) << '\n';
}
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long dp[10][25][12];
bool memo[10][25][12];
string s;
long long f(int index, int res, int choosen) {
if (index == s.size()) {
return res == 0;
}
if (memo[index][res][choosen]) {
return dp[index][res][choosen];
}
memo[index][res][choosen] = true;
if (s[index] == 'X' && choosen == 10) {
int ans = 0;
for (int i = (index == 0); i <= 9; i++) {
ans += f(index + 1, (res * 10 + i) % 25, i);
}
return dp[index][res][choosen] = ans;
}
if (s[index] == '_') {
int ans = 0;
for (int i = (index == 0); i <= 9; i++) {
ans += f(index + 1, (res * 10 + i) % 25, choosen);
}
return dp[index][res][choosen] = ans;
}
int i = (s[index] == 'X') ? choosen : s[index] - '0';
return dp[index][res][choosen] = f(index + 1, (res * 10 + i) % 25, choosen);
}
int main() {
cin >> s;
if (s[0] == '0' && s.size() > 1) {
cout << 0 << "\n";
} else {
if (s.size() == 1) {
cout << (s[0] == '0' || s[0] == '_' || s[0] == 'X') << "\n";
} else {
cout << f(0, 0, 10) << "\n";
}
}
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int n;
long long int dn[6010], dinamik2[6010];
int main() {
string ar;
string ar2;
cin >> ar;
cin >> ar2;
n = ((int)(ar2.size()));
long long res = 0;
for (int k = 0; k < ((int)(ar.size())); k++) {
for (int j = 0; j < ((int)(ar2.size())); j++) {
if (ar2[j] == ar[k]) dinamik2[j] = (dinamik2[j] + dn[j - 1] + 1) % MOD;
dinamik2[j + 1] = (dinamik2[j + 1] + dinamik2[j]) % MOD;
}
res = (res + dinamik2[n]) % MOD;
for (int j = 0; j < ((int)(ar2.size())); j++) dn[j] = dinamik2[j];
memset(dinamik2, 0, sizeof dinamik2);
}
cout << res << endl;
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
static const double EPS = 1e-12;
const int MODULO = 1000000007;
typedef struct {
int i, m, v;
} P;
vector<P> mv;
bool mLt(const P& x, const P& y) {
return (x.m != y.m) ? less<int>()(x.m, y.m) : less<int>()(x.v, y.v);
}
int n, k, h;
bool C(double t) {
int i = 1;
for (__typeof__((mv).begin()) it = (mv).begin(); it != (mv).end(); ++it) {
if ((double)i * h <= (*it).v * t) i++;
if (i > k) break;
}
return i > k;
}
int main() {
cin >> n >> k >> h;
mv.resize(n);
for (int i = 0; i < n; i++) mv[i].i = i + 1;
for (int i = 0; i < n; i++) cin >> mv[i].m;
for (int i = 0; i < n; i++) cin >> mv[i].v;
sort(mv.begin(), mv.end(), mLt);
double l = 0, r = 1e10;
double t;
for (int i = 0; i < 100; i++) {
t = (l + r) / 2;
if (C(t))
r = t;
else
l = t;
}
t *= (1 + EPS);
int cnt = 1;
for (__typeof__((mv).begin()) it = (mv).begin(); it != (mv).end(); ++it) {
if ((double)cnt * h <= (*it).v * t) {
printf("%d ", (*it).i);
cnt++;
}
if (cnt > k) break;
}
puts("\n");
return 0;
}
| 2,000 | CPP |
for _ in range(int(input())):
n = int(input())
caixas = []
for i in range(n):
caixas.append([int(x) for x in input().split()])
caixas.sort()
ans = ''
cur = [0,0]
for i in caixas:
a = (i[0] - cur[0])
b = (i[1] - cur[1])
ans += 'R' * a
ans += 'U' * b
if a < 0 or b < 0:
ans = 'NO'
break
cur = i
if ans != 'NO':
print('YES')
print(ans) | 1,200 | PYTHON3 |
I= lambda : list(map(int,input().split()))
for _ in range(int(input())):
n,x = I()
w=sorted(I())
an=n;s=sum(w)
for i in range(n):
if x<=s/an:
break
an-=1;s-=w[i]
print(an)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, x1, x2, m, ans = 0;
vector<pair<long long, long long> > c;
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cin >> n >> x1 >> x2;
c.resize(n);
for (int i = 0; i < n; ++i) {
cin >> c[i].first;
c[i].second = i + 1;
}
sort(c.begin(), c.end());
reverse(c.begin(), c.end());
bool flag1 = true, flag2 = true;
for (int i = 0; i < n - 1; ++i) {
if (flag1 && c[i].first * (i + 1) >= x1) {
for (int j = i + 1; j < n; ++j) {
if (c[j].first * (j - i) >= x2) {
cout << "Yes\n";
cout << i + 1 << ' ' << j - i << endl;
for (int k = 0; k <= i; ++k) cout << c[k].second << ' ';
cout << endl;
for (int k = i + 1; k <= j; ++k) cout << c[k].second << ' ';
return 0;
}
}
flag1 = false;
}
if (flag2 && c[i].first * (i + 1) >= x2) {
for (int j = i + 1; j < n; ++j) {
if (c[j].first * (j - i) >= x1) {
cout << "Yes\n";
cout << j - i << ' ' << i + 1 << endl;
for (int k = i + 1; k <= j; ++k) cout << c[k].second << ' ';
cout << endl;
for (int k = 0; k <= i; ++k) cout << c[k].second << ' ';
return 0;
}
}
flag2 = false;
}
}
cout << "No";
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-13;
const long double PI = acos(-1);
const int INF = (int)1e9;
const long long INFF = (long long)1e15;
const int mod = 998244353;
const int MXN = (int)5e2 + 7;
long long sum[37];
int mn[37];
multiset<int> st[37];
int sol() {
int res = 0;
long long val = 0;
for (int i = 0; i <= 30; i++) {
if (st[i].empty()) continue;
if (val * 2 < mn[i]) res++;
val += sum[i];
}
return res;
}
int main() {
int n;
scanf("%d", &n);
int cur = 0;
for (int i = 1; i <= n; i++) {
char typ[3];
int v;
scanf("%s %d", typ, &v);
int p = 30;
while (!((v >> p) & 1)) p--;
if (typ[0] == '-') {
sum[p] -= v;
st[p].erase(st[p].find(v));
cur--;
} else {
sum[p] += v;
st[p].insert(v);
cur++;
}
if (st[p].empty())
mn[p] = -1;
else
mn[p] = *st[p].begin();
int ans = cur - sol();
printf("%d\n", ans);
}
return 0;
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 10, MAX = 2e5 + 1e4, MOD = 1e9 + 7, MAXL = 25;
void OUT(long double o, int x) {
cout << fixed << setprecision(x) << o;
return;
}
long long a[MAX], b[MAX], vis[MAX], mo = 0;
vector<int> adj[MAX];
void dfs(int v) {
vis[v] = mo;
for (int u : adj[v])
if (!vis[u]) dfs(u);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
if (a[i] < b[i]) swap(a[i], b[i]);
for (int j = 0; j < i; j++) {
if ((a[i] > a[j] && a[j] > b[i] && b[i] > b[j]) ||
(a[j] > a[i] && a[i] > b[j] && b[j] > b[i])) {
adj[2 * i].push_back(2 * j + 1);
adj[2 * i + 1].push_back(2 * j);
adj[2 * j].push_back(2 * i + 1);
adj[2 * j + 1].push_back(2 * i);
}
}
}
for (int i = 0; i < 2 * m; i++)
if (!vis[i]) mo++, dfs(i);
for (int i = 0; i < m; i++)
if (vis[2 * i] == vis[2 * i + 1]) return cout << "Impossible", 0;
for (int i = 0; i < m; i++) {
if (vis[2 * i] < vis[2 * i + 1])
cout << "i";
else
cout << "o";
}
return 0;
}
| 2,200 | CPP |
n = int(input())
p = list(map(int, input().split()))
s = list(map(int, input().split()))
a = [0]*n
a[0] = s[0]
g = [[] for _ in range(n+1)]
for i in range(n-1):
g[p[i]].append(i+2)
for i in range(1, n):
if s[i] == -1:
if len(g[i+1]) == 0:
s[i] = s[p[i-1]-1]
else:
m = s[g[i+1][0]-1]
for j in g[i+1]:
m = min(m, s[j-1])
s[i] = m
if s[i] < s[p[i-1]-1]:
print(-1)
exit(0)
else:
a[i] = s[i]-s[p[i-1]-1]
print(sum(a))
| 1,600 | PYTHON3 |
n = int(input())
c = [*map(int, input().split())]
c.sort()
k = 0
for e in c:
if e > k:
k+=1
print(k) | 1,000 | PYTHON3 |
# coding=utf-8
# Created by TheMisfits
from sys import stdin
_input = stdin.readline
_int, _range = int, range
def solution():
x = 0
for _ in _range(_int(_input())):
val = _input()
if val[1] == '-':
x -= 1
else:
x += 1
print(x)
solution() | 800 | PYTHON3 |
#!/usr/bin/env python
# coding: utf-8
# In[15]:
testcase = int(input())
for t in range(testcase):
n , x = [int(i) for i in input().split()]
if n <3:
print(1)
else :
floor = -(-(n-2)//x) +1
print(floor)
| 800 | PYTHON3 |
def check(lst, slst):
for i in range(len(lst)):
if lst[i] != slst[i] and lst[i]%slst[0]!=0:
print("NO")
return
print("YES")
return
for _ in range(int(input())):
input()
lst = list(map(int, input().split()))
check(lst, sorted(lst)) | 1,300 | PYTHON3 |
import string
if __name__ == '__main__':
n = int(input())
alphabet = list(string.ascii_uppercase)
for word in (input() for _ in range(n)):
a, c, r = 0, 0, ""
s, res = [], []
if sum(z.isalpha() and b.isdigit() for z, b in zip(word, word[1:])) == 2:
r = word[1:word.index("C")]
c = int(word[word.index("C") + 1:])
while c:
c, t = divmod(c - 1, 26)
res += alphabet[t]
res = "".join(reversed(res))
print(res + r)
else:
for letter in word:
if alphabet.__contains__(letter):
s.append(alphabet.index(letter) + 1)
else:
r += letter
c = sum(el * (26 ** i) for i, el in enumerate(reversed(s)))
print("R" + r + "C" + str(c))
| 1,600 | PYTHON3 |
n=int(input())
x,y,z=[],[],[]
for i in range(n):
a,b,c=input().split()
a,b,c=int(a),int(b),int(c)
x.extend([a])
y.extend([b])
z.extend([c])
m=sum(x)
n=sum(y)
w=sum(z)
if m==n==w==0:
print('YES')
else:
print('NO') | 1,000 | PYTHON3 |
import sys, math
# input = lambda: sys.stdin.readline().rstrip()
# return i
for _ in range(int(input())):
n, s = map(int, input().split())
mas = []
while n != 0:
mas.append(n % 10)
n //= 10
# mas = mas[::-1]
if sum(mas) <= s:
print(0)
else:
ans = 0
c = 0
while sum(mas) > s:
if mas[c] != 0:
if mas[c] == 10:
mas[c] = 0
c += 1
if c == len(mas):
mas.append(1)
else:
mas[c] += 1
else:
ans += (10 - mas[c]) * (10 ** c)
mas[c] = 0
c += 1
if c == len(mas):
mas.append(1)
else:
mas[c] += 1
else:
c += 1
print(ans)
| 1,500 | PYTHON3 |
t = int(input())
for _ in range(t):
n = int(input())
arr = [int(i) for i in input().split(' ')]
arr.sort()
print(arr[n] - arr[n-1]) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, m, mid;
scanf("%d%d", &n, &m);
if (m < 3)
mid = 1;
else
mid = 2 * n + 1;
int left = 1;
int right = mid + 1;
if (mid <= m) printf("%d ", mid);
while (left < mid || right <= m) {
if (left < mid && left <= m) printf("%d ", left);
if (right <= m && right <= m) printf("%d ", right);
left++;
right++;
}
printf("\n");
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans = 1000000005, rans = 0, bans = 0;
int numr[20], numb[20], color[20];
int dp[70005][160];
bool life[70005][160];
int nowr, nowb, tempr, tempb;
char s[6];
int nex[20];
void ok(int x) {
int now;
nowr = nowb = now = 0;
while (x) {
if (x % 2) {
if (color[now])
nowb++;
else
nowr++;
}
x /= 2;
now++;
}
}
int main() {
int n;
cin >> n;
int maxx = 1 << n, maxxx = n * (1 + n) / 2;
nex[0] = 1;
life[0][0] = 1;
for (int i = 1; i < n; i++) nex[i] = nex[i - 1] * 2;
for (int i = 0; i < n; i++) {
scanf("%s", s);
if (s[0] == 'R')
color[i] = 0;
else
color[i] = 1;
scanf("%d%d", numr + i, numb + i);
rans += numr[i];
bans += numb[i];
}
for (int i = 0; i < maxx; i++) {
ok(i);
for (int j = 0; j < n; j++) {
if ((nex[j] & i) == 0) {
tempr = min(nowr, numr[j]);
tempb = min(nowb, numb[j]);
for (int k = 0; k <= maxxx; k++)
if (life[i][k]) {
dp[i + nex[j]][k + tempr] =
max(dp[i + nex[j]][k + tempr], dp[i][k] + tempb);
life[i + nex[j]][k + tempr] = 1;
}
}
}
}
for (int i = 0; i < maxxx; i++)
if (life[maxx - 1][i]) {
ans = min(ans, max(rans - i, bans - dp[maxx - 1][i]));
}
cout << ans + n << endl;
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct data {
int x, y;
} a[20];
int b[10][10];
int main() {
a[0].x = 4;
a[0].y = 2;
a[1].x = 1;
a[1].y = 1;
a[2].x = 1;
a[2].y = 2;
a[3].x = 1;
a[3].y = 3;
a[4].x = 2;
a[4].y = 1;
a[5].x = 2;
a[5].y = 2;
a[6].x = 2;
a[6].y = 3;
a[7].x = 3;
a[7].y = 1;
a[8].x = 3;
a[8].y = 2;
a[9].x = 3;
a[9].y = 3;
memset(b, -1, sizeof(b));
for (int i = 0; i <= 9; i++) b[a[i].x][a[i].y] = i;
int n;
scanf("%d", &n);
char ch[15];
scanf("%s", ch + 1);
int t = ch[1] - '0';
for (int i = 0; i <= 9; i++) {
int j = 1, xx = a[i].x, yy = a[i].y;
while (j < n) {
int x1 = a[ch[j] - '0'].x;
int y1 = a[ch[j] - '0'].y;
int x2 = a[ch[j + 1] - '0'].x;
int y2 = a[ch[j + 1] - '0'].y;
xx = xx + x2 - x1;
yy = yy + y2 - y1;
if (xx <= 0 || yy <= 0 || b[xx][yy] == -1) break;
j++;
}
if (j == n && i != t) {
printf("NO");
return 0;
}
}
printf("YES");
return 0;
}
| 1,400 | CPP |
n = int(input())
a = [int(x) for x in input().split()]
b = [0] * n
s = 0
for i in range(n-1,-1,-1):
b[i] = a[i] + s
s = -s + b[i]
print(" ".join(repr(e) for e in b))
| 800 | PYTHON3 |
a,b = map(int,input().split())
c= []
d=0
for i in range(0,a):
e,f= map(int,input().split())
d+=min(e,f)
c.append(min(2*e,f)-min(e,f))
g= sorted(c)
h= b
i= len(g)-1
while h>0:
h-=1
d+=g[i]
i-=1
print(d) | 1,300 | PYTHON3 |
T = int(input())
for t in range(T):
x, y, n = map(int,input().split())
i = (n-y)//x
print(x*i+y) | 800 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()[:n]))
n1=int(input())
b=list(map(int,input().split()[:n1]))
s=0
for i in a:
for j in b:
if((i+j) not in a and (i+j) not in b):
s=s+1
print(i,j)
break
if(s==1):
break
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int c = 100005;
int n, k, t[c], t2[c], kom[c], fel[c], szint[c], sum, kezd, veg;
map<pair<int, int>, vector<int> > m;
void lep(int ut, int st, int spec) {
bool valt = 0;
int dif = -st;
cout << ut << " ";
cout << t2[ut] + st << " ";
t2[ut] += st;
for (int i = 1; i <= k; i++) {
int pos = (ut + i) % n;
if (pos == spec) {
valt = 1;
dif = 0;
}
if (valt) {
cout << t2[pos] << " ";
} else {
if (i < k) {
cout << sum << " ";
dif += t2[pos] - sum;
t2[pos] = sum;
} else {
cout << t2[pos] + dif << " ";
t2[pos] += dif;
}
}
}
cout << "\n";
}
void solve(int a, int b) {
a %= n, b %= n;
if (b == (a + 1) % n) {
return;
}
vector<int> dif;
dif.push_back(sum - t2[a]);
int st = 0, ut = a, ert = t2[a] - sum;
for (int i = (a + 1) % n;; i = (i + 1) % n) {
ert += t2[i] - sum;
st++;
if (st == k && ert >= 0 || i == b) {
while (dif.size() > 0) {
lep(ut, dif.back(), b);
dif.pop_back();
ut -= k;
if (ut < 0) {
ut += n;
}
}
if (i != b) {
solve(i, b);
}
return;
}
if (st == k) {
ut = i, st = 0;
dif.push_back(-ert);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> k;
k--;
for (int i = 1; i <= n; i++) {
cin >> t[i];
t2[i - 1] = t[i];
sum += t[i];
}
sum /= n;
for (int i = 1; i <= n; i++) {
kom[i] = kom[i - 1] + t[i] - sum;
int mar = (i + k - 1) % k, el = (i + 2 * k - 2) % k;
for (auto x : m[{kom[i], el}]) {
fel[x] = i;
}
m[{kom[i], el}].clear();
m[{kom[i], mar}].push_back(i);
}
for (int i = n; i >= 1; i--) {
szint[i] = szint[fel[i]] + 1;
if (szint[i] > szint[kezd]) {
kezd = i;
}
}
cout << (n - szint[kezd] + k - 1) / k << "\n";
veg = kezd;
while (fel[kezd]) {
solve(kezd, fel[kezd]);
kezd = fel[kezd];
}
solve(kezd, veg);
return 0;
}
| 3,500 | CPP |
import math
h1,a1,c1 = map(int,input().split())
h2,a2 = map(int,input().split())
a = math.ceil(h1/a2);b = math.ceil(h2/a1)
if(b<=a):
print(b)
for i in range(b):
print("STRIKE")
else:
A=[]
for i in range(a-1):
A.append("STRIKE")
h2 -= (a-1)*a1
h1-=(a-1)*a2
while(a<b):
A.append("HEAL")
h1+=c1
h1-=a2
a = math.ceil(h1/a2);b = math.ceil(h2/a1)
for i in range(b):
A.append("STRIKE")
print(len(A))
for i in A:
print(i) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool check(long long a[], long long b[], long long n, long long m) {
long long s = m;
long long q = 1;
for (long long i = 1; i < n; i++) {
if (b[i] + s >= a[i])
s = min(b[i] + s - a[i], b[i]);
else {
q = 0;
break;
}
}
if (q == 0) return false;
return true;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n], b[n];
for (long long i = 0; i < n; i++) cin >> a[i];
for (long long i = 0; i < n; i++) cin >> b[i];
long long l = -1, r = b[0];
while (r - l > 1) {
long long mid = (r + l) / 2;
if (check(a, b, n, mid)) {
r = mid;
} else
l = mid;
}
long long s = r;
long long q1 = 1;
for (long long i = 1; i < n; i++) {
if (b[i] + s >= a[i])
s = min(b[i] + s - a[i], b[i]);
else {
q1 = 0;
break;
}
}
if (q1 == 0)
cout << "NO\n";
else {
if (s + b[0] - r >= a[0])
cout << "YES\n";
else
cout << "NO\n";
}
}
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
if (n >= 3) {
ans = ans + (n / 3) * 2;
n = n % 3;
}
if (n > 0) ans++;
cout << ans << endl;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int Get() {
char c;
while (c = getchar(), c < '0' || c > '9')
;
int X = c - 48;
while (c = getchar(), c >= '0' && c <= '9') X = X * 10 + c - 48;
return X;
}
int Pow(int A, int B, int Mod) {
if (!B) return 1;
int T = Pow((long long)A * A % Mod, B / 2, Mod);
if (B & 1) T = (long long)T * A % Mod;
return T;
}
int main() {
int N = Get(), M = Get(), Mod = Get();
static int G[600][600], In[600], Out[600];
memset(G, 0, sizeof(G));
memset(In, 0, sizeof(In));
memset(Out, 0, sizeof(Out));
for (int i = 0; i < M; i++) {
int X = Get() - 1, Y = Get() - 1;
G[X][Y]++;
In[Y]++;
Out[X]++;
}
static vector<int> List[600];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
if (G[i][j]) List[i].push_back(j);
static int Temp[600], Stack[600];
int Top = 0;
for (int i = 0; i < N; i++) {
Temp[i] = In[i];
if (!Temp[i]) Stack[Top++] = i;
}
static int Queue[600];
int Count = 0;
while (Top--) {
int V = Stack[Top];
Queue[Count++] = V;
for (int i = 0; i < List[V].size(); i++) {
int U = List[V][i];
Temp[U] -= G[V][U];
if (!Temp[U]) Stack[Top++] = U;
}
}
static int P[600][600];
memset(P, 0, sizeof(P));
for (int i = 0; i < N; i++) {
int V = Queue[i];
P[V][V] = 1;
for (int j = i; j < N; j++) {
int U = Queue[j];
if (!P[V][U]) continue;
for (int k = 0; k < List[U].size(); k++) {
int _U = List[U][k];
P[V][_U] = ((long long)P[V][U] * G[U][_U] + P[V][_U]) % Mod;
}
}
}
int K0 = 0, K1 = 0;
static int X[600], Y[600];
for (int i = 0; i < N; i++) {
if (!In[i]) X[K0++] = i;
if (!Out[i]) Y[K1++] = i;
}
int K = K0;
static long long A[600][600];
for (int i = 0; i < K; i++)
for (int j = 0; j < K; j++) A[i][j] = P[X[i]][Y[j]];
int Ans = 1;
for (int i = 0; i < K; i++) {
int P = i;
while (P < K && !A[P][i]) P++;
if (P == K) {
printf("0\n");
return 0;
}
if (P != i) {
Ans = -Ans;
for (int j = i; j < K; j++) swap(A[i][j], A[P][j]);
}
int Q = Pow(A[i][i], Mod - 2, Mod);
for (int j = i + 1; j < K; j++) {
int T = (long long)A[j][i] * Q % Mod;
if (!T) continue;
for (int k = i; k < K; k++) {
A[j][k] = (A[j][k] - (long long)T * A[i][k]) % Mod;
if (A[j][k] < 0) A[j][k] += Mod;
}
}
}
for (int i = 0; i < K; i++) Ans = (long long)Ans * A[i][i] % Mod;
if (Ans < 0) Ans += Mod;
printf("%d\n", Ans);
return 0;
}
| 2,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = LONG_LONG_MAX;
const long long NINF = LONG_LONG_MIN;
const long long mmod = 1000000007;
bool check(string& a, string& b) {
long long j = 0;
for (long long i = 0; i < (long long)b.size() && j < (long long)a.size();
i++, j++) {
if (b[i] != a[j]) return false;
}
return (j == (long long)a.size());
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long t;
cin >> t;
while (t-- > 0) {
string s, c;
cin >> s >> c;
string temp = s;
sort((temp).begin(), (temp).end());
for (long long i = 0; i < (long long)s.size(); i++) {
if (temp[i] != s[i]) {
long long max_id = i;
for (long long j = i + 1; j < (long long)s.size(); j++) {
if (s[max_id] >= s[j]) max_id = j;
}
swap(s[max_id], s[i]);
break;
}
}
if (s >= c)
cout << "---" << endl;
else
cout << s << endl;
}
}
| 1,600 | CPP |
def watermelon():
w = int(input())
if w%2==0 and w>2:
print("YES")
else:
print("NO")
watermelon() | 800 | PYTHON3 |
H, L = [int(i) for i in input().split()]
num = L*L - H*H
den = 2*H
print(num/den)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 110;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
long long n, m, dp[maxn][maxn], po[maxn];
vector<pair<long long, long long> > vv[maxn];
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
for (long long i = 1; i <= n; i++) {
long long k;
cin >> k;
for (long long j = 1; j <= k; j++) {
long long l, r;
cin >> l >> r;
vv[i].push_back({l, r});
}
}
for (long long len = 1; len <= m; len++) {
for (long long l = 1; l <= m - len + 1; l++) {
long long r = l + len - 1;
for (long long i = 1; i <= n; i++) {
po[i] = upper_bound(vv[i].begin(), vv[i].end(), make_pair(l, INF)) -
vv[i].begin();
po[i]--;
if (po[i] >= vv[i].size()) return 0;
}
for (long long k = l; k <= r; k++) {
long long now = 0;
for (long long i = 1; i <= n; i++) {
long long l1 = vv[i][po[i]].first, r1 = vv[i][po[i]].second;
if (l1 >= l && r1 <= r) now++;
}
dp[l][r] = max(dp[l][r], dp[l][k - 1] + dp[k + 1][r] + (now * now));
for (long long i = 1; i <= n; i++)
if (vv[i][po[i]].second == k) po[i]++;
}
}
}
cout << dp[1][m];
return 0;
}
| 2,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b, long long mod) {
if (b == 0) return 1;
long long ans = powmod(a, b / 2, mod);
ans = (ans * ans) % mod;
if (b % 2 != 0) ans = (ans * a % mod) % mod;
return ans;
}
int main() {
int n;
cin >> n;
int mod = 1000000007;
long long ans = powmod(27, n, mod) - powmod(7, n, mod);
if (ans < 0) ans = mod + ans;
cout << ans;
return 0;
}
| 1,500 | CPP |
s=input(),input()
c=0
for s in filter(None,''.join(str(min(2,sum(x[i:i+2].count('X')for x in s)))for
i in range(len(s[0])-1)).split('2')):
a,b=([*filter(None,map(len,s.split(c)))]for c in'01')
if s[0]<'1':a=[0]+a
if s[-1]>'0':b+=[0]
k=1
for x,y in zip(a,b):
x+=k
if y:
x-=1;y+=1
k=y%3
if x%2and k>0:
x+=1;k-=1
c+=x//2+y//3*2
c+=k//2
print(c) | 1,500 | PYTHON3 |
d = "AHIMOoTUVvWwXxY"
s = input()
for i in range(len(s) // 2 + 1):
if not (s[i] in d and s[i] == s[-i-1] or s[i] + s[-i-1] in ["bd", "db", "pq", "qp"]):
print("NIE")
break
else:
print("TAK") | 1,600 | PYTHON3 |
n = int(input())
alpha = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
trial = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
word = list(input())
for i in range(n):
tmp = (word[i]).upper()
tmpp = alpha.index(tmp)
trial[tmpp] = 1
if 0 in trial:
print('NO')
else:
print('YES')
| 800 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
char ch[1001];
scanf("%s", ch);
if (ch[0] > 91) {
ch[0] -= 32;
}
printf("%s", ch);
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int c1, c2, x, y, l, r, mid;
int main() {
ios::sync_with_stdio(false);
cin >> c1 >> c2 >> x >> y;
l = c1 + c2;
r = 2000000009;
while (l < r) {
mid = (l + r) / 2;
if ((mid - (mid / x) >= c1) && (mid - (mid / y) >= c2) &&
(mid - (mid / (x * y)) >= (c1 + c2)))
r = mid;
else
l = mid + 1;
}
cout << l << endl;
return 0;
}
| 1,800 | CPP |
for _ in range(int(input())):
n = int(input())
pp = 3
while n % pp != 0:
pp = pp << 1
pp |= 1
print(n//pp) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve(int n, int m, int st, int ed) {
if (!m) return;
if (m == 1) {
int l = st, r = st + n - 1;
for (int i = 1; i <= n; i++) {
if (i & 1) {
printf("%d %d\n", l++, ed);
} else {
printf("%d %d\n", r--, ed);
}
}
} else {
int l = st, r = st + n - 1;
for (int i = 1; i <= 2 * n; i++) {
if (i & 1)
printf("%d %d\n", l++, ed);
else
printf("%d %d\n", r--, ed + m - 1);
}
solve(n, m - 2, st, ed + 1);
}
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
solve(n, m, 1, 1);
return 0;
}
| 1,800 | CPP |
n=int(input())
l=list(map(int,input().split()))
Ans=[0,n-1]
for i in range(1,n):
if abs(l[i]-l[i-1])<abs(l[Ans[0]]-l[Ans[1]]):
Ans[0]=i-1
Ans[1]=i
print(Ans[0]+1,Ans[1]+1)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 20;
long double eps = 1e-17;
inline bool eq(long double a, long double b) { return abs(a - b) < eps; }
inline bool ls(long double a, long double b) { return a <= b - eps; }
inline bool gt(long double a, long double b) { return a >= b + eps; }
inline bool le(long double a, long double b) { return a < b + eps; }
inline bool ge(long double a, long double b) { return a > b - eps; }
inline bool zr(long double lhs) { return fabs(lhs) < eps; }
inline bool nz(long double lhs) { return fabs(lhs) >= eps; }
inline bool ps(long double lhs) { return lhs >= eps; }
inline bool nn(long double lhs) { return lhs >= -eps; }
inline bool ng(long double lhs) { return lhs < -eps; }
inline bool np(long double lhs) { return lhs < eps; }
struct lem {
int w, v, idx;
lem(int a = 0, int b = 0) : w(a), v(b) {}
};
lem lems[MAX];
int n, k, h;
int main() {
scanf("%d%d%d", &n, &k, &h);
for (int i = (1); i <= (n); ++i) {
scanf("%d", &lems[i].w);
}
for (int i = (1); i <= (n); ++i) {
scanf("%d", &lems[i].v);
lems[i].idx = i;
}
sort(lems + 1, lems + n + 1, [](const lem &a, const lem b) {
if (a.w != b.w)
return a.w < b.w;
else
return a.v < b.v;
});
long double l = 0, r = 1e9;
int cnt = 100;
while (cnt--) {
long double t = (r + l) / 2;
int fh = 1, sid = 1;
while (fh <= k && sid <= n) {
if (fh <= t * lems[sid].v / h) {
++sid, ++fh;
} else
++sid;
}
if (fh == k + 1)
r = t;
else
l = t;
}
int fh = 1, sid = 1;
vector<int> ans;
while (fh <= k && sid <= n) {
if (fh <= lems[sid].v * r / h) {
ans.push_back(lems[sid].idx);
++sid, ++fh;
} else
++sid;
}
for (int i = (0); i <= ((int)ans.size() - 1); ++i) {
printf("%d ", ans[i]);
}
printf("\n");
return 0;
}
| 2,000 | CPP |
def haveAsc(s):
min = s[1]
l = s[0]
for i in range(2,l+1):
if s[i] > min:
return True
min = s[i]
return False
n = int(input())
mins = []
maxs = []
blocks = []
free = 0
for i in range(n):
b = [int(s) for s in input().split()]
if haveAsc(b):
free += 1
else:
mins.append(b[-1])
maxs.append(b[1])
# blocks.append((b[-1],b[1])) # min, max
notFree = n - free
ans = free*free + notFree*free*2
mins.sort()
maxs.sort()
end = len(mins)
i = 0
j = 0
while i < end:
if mins[i] >= maxs[j]:
if j == end-1:
break
j += 1
else:
ans += end-j
i += 1
print(ans) | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
double a[505];
int main() {
int num1, num2;
cin >> num1 >> num2;
for (int i = 1; i <= num1; i++) cin >> a[i];
double maxnum = 0;
while (num2--) {
int aa, bb;
double v;
cin >> aa >> bb >> v;
maxnum = max(maxnum, (a[aa] + a[bb]) / v);
}
printf("%.15f\n", maxnum);
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
const int mod = 1e9 + 7;
int col[maxn], ans, n, m, cnt;
bool vis[maxn], dor;
vector<pair<int, int> > g[maxn];
vector<int> ver;
void dfs(int v) {
cnt = cnt + 1;
ver.push_back(v);
vis[v] = 1;
for (auto i : g[v]) {
if (!vis[i.first]) {
col[i.first] = col[v] ^ i.second;
dfs(i.first);
} else {
if (col[i.first] != col[v] ^ i.second) dor = 1;
}
}
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cin.tie(0);
int t = 1;
cin >> t;
while (t--) {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int v, u;
string s;
cin >> v >> u >> s;
bool x = (s == "imposter");
g[v].push_back(make_pair(u, x));
g[u].push_back(make_pair(v, x));
}
ans = 0;
for (int i = 1; i <= n; i++)
if (!vis[i]) {
cnt = 0;
ver.clear();
dfs(i);
int imp = 0;
for (int i = 0; i < ver.size(); i++) imp = imp + col[ver[i]];
ans = ans + max(imp, cnt - imp);
}
cout << ((dor) ? -1 : ans) << '\n';
dor = 0;
for (int i = 1; i <= n; i++) {
col[i] = vis[i] = 0;
g[i].clear();
}
}
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, root;
bool vis[300100];
long long a[300100], b[300100], A[300100], ans = -1e10;
vector<int> adj[300100];
void dfs(int u) {
if (vis[u]) return;
vis[u] = 1;
ans = max(ans, a[u]);
for (int v : adj[u]) {
a[v]++;
a[v] += b[u];
b[v]++;
}
for (int v : adj[u]) dfs(v);
return;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
A[i] = a[i];
ans = max(ans, a[i]);
}
for (int i = 0; i < n - 1; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
int num = -1;
for (int i = 1; i <= n; i++) {
if (ans == a[i]) {
int x = 0;
for (int v : adj[i]) x += (a[v] == ans);
if (x > num) {
num = x;
root = i;
}
}
}
dfs(root);
long long Ans = ans;
root = num = -1;
ans = -1e10;
for (int i = 1; i <= n; i++) {
vis[i] = 0;
b[i] = 0;
a[i] = A[i];
ans = max(ans, a[i]);
}
for (int i = 1; i <= n; i++) {
int x = 0;
for (int v : adj[i]) x += (a[v] == ans);
if (x > num) {
num = x;
root = i;
}
}
dfs(root);
cout << min(Ans, ans);
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T min(T &a, T &b) {
return a < b ? a : b;
}
template <class T>
inline T max(T &a, T &b) {
return a > b ? a : b;
}
template <class T>
void read(T &x) {
char ch;
while ((ch = getchar()) && !isdigit(ch))
;
x = ch - '0';
while ((ch = getchar()) && isdigit(ch)) x = x * 10 + ch - '0';
}
struct point {
int x, y;
point() {}
point(int _x, int _y) : x(_x), y(_y) {}
};
const int N = 120000, Mod = 1000000007;
char S[N], s[N];
string ch[N];
int Len[N], To[N], n;
int Chen(int a, int b) { return (long long)a * b % (long long)Mod; }
inline int Pow(int a, int k) {
int ans = 1, b = a;
while (k) {
if (k & 1) ans = (long long)ans * b % (long long)Mod;
b = (long long)b * b % (long long)Mod;
k >>= 1;
}
return ans;
}
int main() {
scanf("%s", S);
scanf("%d", &n);
for (int i = 0; i <= 9; i++) Len[i] = 1, To[i] = i;
for (int i = 1; i <= n; i++) cin >> ch[i];
for (int i = n; i >= 1; i--) {
int l = -1;
for (int j = 0; j < ch[i].size(); j++) s[++l] = ch[i][j];
int len = 0, to = 0;
for (int j = 3; j <= l; j++)
to = (Chen(to, Pow(10, Len[s[j] - '0'])) + To[s[j] - '0']) % Mod,
len = (len + Len[s[j] - '0']) % (Mod - 1);
Len[s[0] - '0'] = len;
To[s[0] - '0'] = to;
}
int l = strlen(S) - 1, ans = 0;
for (int i = 0; i <= l; i++)
ans = (Chen(ans, Pow(10, Len[S[i] - '0'])) + To[S[i] - '0']) % Mod;
printf("%d\n", ans);
}
| 2,100 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.