solution
stringlengths 52
181k
| difficulty
int64 0
6
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k, n, b[2001], s = 0, ans = 0;
cin >> k >> n;
set<int> S;
for (int i = 0; i < k; ++i) {
int a;
cin >> a;
s += a;
S.insert(s);
}
vector<int> v;
for (auto ss : S) v.push_back(ss);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
sort(b, b + n);
for (int i = 1; i < n; ++i) b[i] -= b[0];
for (int i = 0; i < v.size() - n + 1; ++i) {
int j;
set<int> S2;
for (int j = 1; j < v.size(); ++j) S2.insert(v[j] - v[i]);
for (j = 1; j < n; ++j) {
if (S2.count(b[j]) == 0) break;
}
ans += j == n;
}
cout << ans << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t, n, a;
string s;
cin >> t;
while (t--) {
cin >> n;
cin >> s;
map<pair<int, int>, int> m;
pair<int, int> p;
p = make_pair(0, 0);
m[p] = 0;
long long int i = 0, j = 0, len, min = 1000000, l = -1, r;
for (int k = 1; k <= n; k++) {
if (s[k - 1] == 'U') j++;
if (s[k - 1] == 'D') j--;
if (s[k - 1] == 'L') i--;
if (s[k - 1] == 'R') i++;
p = make_pair(i, j);
if (m.find(p) != m.end()) {
auto itr = m.find(p);
len = k - itr->second;
if (len < min) {
min = len;
l = itr->second + 1;
r = k;
}
}
m[p] = k;
}
if (l == -1)
cout << "-1" << endl;
else
cout << l << " " << r << endl;
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long power(long long x, long long y) {
long long res = 1;
while (y) {
if (y % 2) res = (res * x) % mod;
x = (x * x) % mod;
y = y / 2;
}
return res;
}
int main() {
long long n, m;
cin >> n >> m;
cout << power((power(2, m) - 1), n);
return 0;
}
| 2 |
#include<iostream>
using namespace std;
#define fr(i,n) for(i=0;i++<n;)
int main(){
int i,n,m,a;
bool c[100010]={};
cin>>n>>m;
for(;cin>>a;) c[a]=!c[a];
fr(i,n){
if(c[i]&1){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<int> g[210000];
int n, x, f[210000], size[210000];
void dfs(int x, int fa) {
f[x] = fa;
size[x] = 1;
for (int i = 0; i < g[x].size(); i++) {
int t = g[x][i];
if (t != fa) {
dfs(t, x);
size[x] += size[t];
}
}
}
void find(int x) {
for (int i = 0; i < g[x].size(); i++) {
int t = g[x][i];
if (t != f[x])
if (size[t] % 2 == 0) find(t);
}
cout << x << endl;
for (int i = 0; i < g[x].size(); i++) {
int t = g[x][i];
if (t != f[x])
if (size[t] % 2 == 1) find(t);
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
if (x) {
g[x].push_back(i);
g[i].push_back(x);
}
}
if (n % 2 == 1) {
cout << "YES" << endl;
dfs(1, 0);
find(1);
} else
cout << "NO";
return 0;
}
| 2 |
#include <algorithm>
#include <string>
#include <sstream>
#include <iostream>
#include <math.h>
#include <random>
#include <cstdio>
using namespace std;
const int LOOP = 1000; //??????????????°
const double EPS = 1e-6; //??????????????¨(?°??????????????????????)
int L;
int N; //???????????±???????????°
//???????????±????????????????????????????????¨?????¨???????¨????????¨??????????
double Evaluate(int r[12]) {
double val = r[0] + r[N-1];
for (int i = 0; i < N - 1; i++)
{
int a = abs(r[i] - r[i+1]), c = r[i] + r[i+1];
val += sqrt(c*c - a*a);
}
return val;
}
//?????¨?????????????????°???????????¨??????????????????????§???????????±???????
//(????§?????????????true)
bool Changes(int cnt) {
return cnt < rand()%LOOP;
}
//?????????????????????????????¢??°
//?????????????°??????????????¨?????????????
//int r[12] : ???????????±?????????0??????N-1???????????????????????????????????????????????????????´???????
double Solve(int r[12]) {
double score = Evaluate(r); //?????¨?????¶???r[]????¨???????????´????????????°
double mi = score; //???????????§?????¶???????¨???????????°???????????´????????????°
for (int cnt = 0; cnt < LOOP; cnt++)
{
//===============================================
///random
int i=rand()%N;
int j=rand()%N;
int t=r[i];
r[i]=r[j];
r[j]=t;
score = Evaluate(r);
if(score<mi){
mi=score;
}else{
if(Changes(cnt)){
mi=score;
}else{
int a=r[i];
r[i]=r[j];
r[j]=a;
}
}
//===============================================
}
return mi; //????°?????????????
}
//??\?????¢????????????????????¢????????£????????§???????????????
int main() {
srand(time(NULL));
while (cin >> L)
{
N = 0;
int r[12];
string S;
getline(cin, S);
stringstream SS(S);
while (!SS.eof()) SS >> r[N++];
double ans;
if (N == 1) ans = r[0]*2;
else ans = Solve(r);
if (L - ans + EPS > 0) puts("OK");
else puts("NA");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<pair<int, int>, int> > Q;
vector<pair<int, int> > tab;
pair<pair<int, int>, int> p;
int n, m, x, l1, l2, ans[200010], ans2[200010];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int a = 1; a <= n; a++) {
cin >> x;
tab.push_back(make_pair(x, a));
}
sort(tab.begin(), tab.end());
reverse(tab.begin(), tab.end());
for (int a = 1; a <= m; a++) {
cin >> x;
Q.push(make_pair(make_pair(x, 0), a));
}
for (int a = 0; a < tab.size(); a++) {
while (!Q.empty() && Q.top().first.first > tab[a].first) {
p = Q.top();
Q.pop();
p.first.first = (p.first.first + 1) / 2;
p.first.second *= -1;
p.first.second++;
p.first.second *= -1;
Q.push(p);
}
if (!Q.empty() && tab[a].first == Q.top().first.first) {
ans[tab[a].second] = Q.top().second;
ans2[Q.top().second] = -Q.top().first.second;
Q.pop();
}
}
for (int a = 1; a <= n; a++)
if (ans[a]) l1++;
for (int a = 1; a <= m; a++) l2 += ans2[a];
cout << l1 << " " << l2 << "\n";
for (int a = 1; a <= m; a++) cout << ans2[a] << " ";
cout << "\n";
for (int a = 1; a <= n; a++) cout << ans[a] << " ";
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, N = 4e5 + 10;
long long n, Rt, ans, inv[N];
int r[N], sz[N], lim, son[N], fa[N];
vector<int> g[N];
vector<long long> a[N], f[N];
void Add(long long &x, long long y) { x = (x + y) % mod; }
long long add(long long x, long long y) { return (x + y) % mod; }
void Mul(long long &x, long long y) { x = x * y % mod; }
long long mul(long long x, long long y) { return x * y % mod; }
void Sub(long long &x, long long y) { x = (x - y + mod) % mod; }
long long sub(long long x, long long y) { return (x - y + mod) % mod; }
long long qpow(long long a, long long b) {
long long ret = 1;
for (; b; b >>= 1, Mul(a, a))
if (b & 1) Mul(ret, a);
return ret;
}
void TNT(vector<long long> &a, int op) {
for (int i = 1; i <= lim - 1; i++)
if (i < r[i]) swap(a[i], a[r[i]]);
for (int mid = 1; mid < lim; mid <<= 1) {
long long W = qpow(op == 1 ? 3 : (mod + 1) / 3, (mod - 1) / (mid << 1));
for (int j = 0; j < lim; j += (mid << 1)) {
long long w = 1;
for (int k = 0; k < mid; ++k, Mul(w, W)) {
long long x = a[j + k], y = mul(w, a[j + k + mid]);
a[j + k] = add(x, y), a[j + k + mid] = sub(x, y);
}
}
}
if (op == -1) {
long long Inv = qpow(lim, mod - 2);
for (int i = 0; i <= lim - 1; i++) Mul(a[i], Inv);
}
}
vector<long long> operator*(vector<long long> a, vector<long long> b) {
int t = a.size() + b.size() - 1;
lim = 1;
while (lim <= t) lim <<= 1;
for (int i = 0; i <= lim - 1; i++)
r[i] = (r[i >> 1] >> 1) | ((i & 1) * (lim >> 1));
a.resize(lim), b.resize(lim);
TNT(a, 1), TNT(b, 1);
for (int i = 0; i <= lim - 1; i++) Mul(a[i], b[i]);
TNT(a, -1);
a.resize(t);
return a;
}
vector<long long> operator+(vector<long long> a, vector<long long> b) {
int t = max(a.size(), b.size());
a.resize(t), b.resize(t);
for (int i = 0; i <= t - 1; i++) Add(a[i], b[i]);
return a;
}
void dfs(int x, int fat) {
sz[x] = 1;
fa[x] = fat;
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
if (y == fat) continue;
dfs(y, x);
sz[x] += sz[y];
if (sz[son[x]] < sz[y]) son[x] = y;
}
}
void calc(int l, int r, vector<long long> &F, vector<long long> &G) {
if (l == r) {
F = G = a[l];
return;
}
int mid = (l + r) >> 1;
vector<long long> Fl, Fr, Gl, Gr;
calc(l, mid, Fl, Gl), calc(mid + 1, r, Fr, Gr);
F = Fl * Fr;
G = Gl + Fl * Gr;
}
vector<long long> solve(int u) {
for (int x = u; x; x = son[x]) {
for (int i = 0; i < g[x].size(); i++)
if (g[x][i] != fa[x] && g[x][i] != son[x]) f[x] = solve(g[x][i]);
if (!f[x].size()) f[x].push_back(0);
++f[x][0];
f[x].insert(f[x].begin(), 0);
}
int top = 0;
for (int x = u; x; x = son[x]) swap(a[++top], f[x]);
vector<long long> F, G;
calc(1, top, F, G);
return G;
}
int main() {
cin >> n >> Rt;
inv[0] = inv[1] = 1;
for (int i = 2; i <= n; i++) inv[i] = mul(mod - mod / i, inv[mod % i]);
int x, y;
for (int i = 1; i <= n - 1; i++)
scanf("%d%d", &x, &y), g[x].push_back(y), g[y].push_back(x);
dfs(1, 0);
vector<long long> F = solve(1);
long long c = 1;
for (int i = 1; i < F.size(); i++) {
Add(ans, mul(F[i], c));
Mul(c, mul(add(Rt, i), inv[i]));
}
printf("%lld\n", ans);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int a[N];
int main() {
int n, s, t, s1 = 0, s2 = 0;
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i];
cin >> s >> t;
if (s > t) swap(s, t);
for (int i = s; i < t; ++i) s1 += a[i];
for (int i = t; i <= n; ++i) s2 += a[i];
for (int i = 1; i < s; ++i) s2 += a[i];
cout << min(s1, s2) << endl;
}
| 1 |
#include <bits/stdc++.h>
typedef struct x {
int a, b;
} move;
int n, a[300], b[300];
move ans[1000000];
int idx, temp;
int main() {
int i, j;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; ++i) {
scanf("%d", &b[i]);
}
for (i = 0; i < n; ++i) {
if (a[i] != b[i]) {
for (j = i; j < n; ++j) {
if (a[i] == b[j]) break;
}
for (; j > i; --j) {
temp = b[j];
b[j] = b[j - 1];
b[j - 1] = temp;
ans[idx].a = j - 1;
ans[idx].b = j;
idx++;
}
}
}
printf("%d\n", idx);
for (i = 0; i < idx; ++i) {
printf("%d %d\n", ans[i].a + 1, ans[i].b + 1);
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
vector<int> g[200309];
int n, par[200309];
long long s[200309], a[200309];
bool ok = true;
void dfs(int u) {
if (s[u] == -1) {
if (g[u].empty())
a[u] = 0;
else {
a[u] = 0x3f3f3f3f3f3f3f3f;
for (int v : g[u]) {
a[u] = min(a[u], s[v] - s[par[u]]);
}
s[u] = a[u] + s[par[u]];
}
} else {
a[u] = s[u] - s[par[u]];
}
if (a[u] < 0) ok = false;
for (int v : g[u]) dfs(v);
}
int main() {
scanf("%d", &n);
for (int i = 1; (i) <= int(n - 1); (i)++) {
int p;
scanf("%d", &p);
g[p].push_back(i + 1);
par[i + 1] = p;
}
par[1] = 0;
s[0] = 0;
for (int i = 1; (i) <= int(n); (i)++) {
scanf("%lld", &s[i]);
}
dfs(1);
long long ans = 0;
for (int u = 1; (u) <= int(n); (u)++) ans += a[u];
if (!ok) ans = -1;
printf("%lld\n", ans);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
inline void print(vector<int> &v) {
for (int i : v) cout << i << " ";
cout << "\n";
}
inline void print(vector<long long> &v) {
for (long long i : v) cout << i << " ";
cout << "\n";
}
inline void print(vector<vector<int> > &v) {
for (vector<int> i : v) print(i);
}
inline void print(pair<int, int> p) {
cout << "(" << p.first << ":" << p.second << "), ";
}
inline void print(vector<pair<int, int> > &P) {
for (pair<int, int> i : P) print(i);
cout << "\n";
}
inline void print(set<int> &s) {
for (int i : s) cout << i << " ";
cout << "\n";
}
inline void print(map<int, int> &m) {
for (auto i : m) print(i);
cout << "\n";
}
inline void srt(vector<long long> &v) { sort(v.begin(), v.end()); }
long long power(long long a, long long b, long long MOD) {
long long res = 1;
while (b) {
if (b % 2) res = (res * a) % MOD;
a = (a * a) % MOD;
b /= 2;
}
return res;
}
long long iMOD(long long a, long long p) { return power(a, p - 2, p); }
bool compare(int a, int b) { return a > b; }
inline void srtc(vector<long long> &v) { sort(v.begin(), v.end(), compare); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int pety = min(n, m);
int vasya = n + m - 1 - pety;
cout << vasya << " " << pety;
return 0;
}
| 2 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int ten[6],ans=0;
for(int i=0;i<6;i++)cin>>ten[i];
for(int i=0;i<3;i++){
int kawa=0;
for(int j=1;j<4;j++)if(ten[kawa]<ten[j])kawa=j;
ans+=ten[kawa];
ten[kawa]=-1;
}
ans+=max(ten[4],ten[5]);
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
string str1, str2;
cin >> str1;
cin >> str2;
int arr[30][30], cnt = 0, num[30];
for (int i = 0; i < 30; i++)
for (int j = 0; j < 30; j++) {
arr[i][j] = -1;
num[i] = -1;
}
for (int i = 0; i < t; i++) {
char b, c;
b = str1[i];
c = str2[i];
int x = b - 'a';
int y = c - 'a';
if (x != y) {
cnt++;
if (arr[x][y] == -1) arr[x][y] = i;
num[x] = i;
}
}
int min = 0, ind1 = -2, ind2 = -2;
for (int i = 0; i < t; i++) {
char b = str1[i];
char c = str2[i];
int x = b - 'a';
int y = c - 'a';
if (x != y && num[y] != -1) {
if (arr[y][x] == -1) {
min = -1;
ind1 = i;
ind2 = num[y];
} else {
ind1 = i;
ind2 = arr[y][x];
cnt = cnt - 2;
min = 0;
break;
}
}
}
if (min == -1) {
cnt = cnt - 1;
}
cout << cnt << endl;
cout << ind1 + 1 << " " << ind2 + 1 << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 444, mod = 1000000007;
int mul(long long a, long long b){
return a * b % mod;
}
int pw[maxn][maxn];
int f[maxn][maxn], a[maxn], b[maxn], sum[maxn][maxn];
int main(){
for(int i = 0; i < maxn; i++){
pw[i][0] = 1;
for(int j = 1; j < maxn; j++){
pw[i][j] = mul(pw[i][j - 1], i);
}
}
int n, c; cin >> n >> c;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> b[i];
for(int i = 0; i < n; i++){
for(int j = 0; j <= c; j++){
for(int k = a[i]; k <= b[i]; k++){
sum[i][j] += pw[k][j];
if(sum[i][j] >= mod) sum[i][j] -= mod;
}
}
}
f[0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j <= c; j++){
if(f[i][j]){
for(int k = 0; k <= c && j + k <= c; k++){
f[i + 1][j + k] += mul(f[i][j], sum[i][k]);
if(f[i + 1][j + k] >= mod) f[i + 1][j + k] -= mod;
}
}
}
}
cout << f[n][c] << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c[10001], d, e, f, g, h, j, i, cnt = 0;
int n;
cin >> n >> d;
for (i = 0; i < n; i++) {
cin >> c[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (abs(c[i] - c[j]) <= d) {
cnt++;
}
}
}
cout << cnt - n << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int u[4040][4040];
int pre[4040][4040], p[4040][4040];
int dp[880][4040];
void rnc(int K, int l, int r, int lo, int hi) {
if (l > r) return;
int mid = (l + r) / 2;
int mn = 1001001001, mni = -1;
for (int i = lo; i <= hi; i++) {
if (mn > dp[K - 1][i] + p[i][mid]) {
mn = dp[K - 1][i] + p[i][mid];
mni = i;
}
}
dp[K][mid] = mn;
rnc(K, l, mid - 1, lo, mni);
rnc(K, mid + 1, r, mni, hi);
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char qw = getchar();
while (qw < '0' || qw > '9') qw = getchar();
u[i][j] = qw - '0';
pre[i][j] = (j ? pre[i][j - 1] : 0) + (i ? pre[i - 1][j] : 0) -
(i && j ? pre[i - 1][j - 1] : 0) + u[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) p[i][j] = 1001001001;
for (int j = i; j < n; j++) {
p[i][j] = pre[j][j] - pre[i][j] - pre[j][i] + pre[i][i];
}
}
for (int i = 0; i < n; i++) {
dp[0][i] = pre[i][i];
}
for (int i = 1; i < k; i++) {
rnc(i, 0, n - 1, 0, n - 1);
}
printf("%d\n", dp[k - 1][n - 1] / 2);
return 0;
}
| 5 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<utility>
#include<cstring>
using namespace std;
typedef pair<int, int> PII;
int w, h, n;
int mas_x_s[1010], mas_y_s[1010];
int mas_x_e[1010], mas_y_e[1010];
vector<int> vmas_x, vmas_y;
bool plate[2010][2010];
int ans = 0;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
void bfs(PII start)
{
queue<PII> qbfs;
qbfs.push(start);
while(!qbfs.empty()){
PII now = qbfs.front();
qbfs.pop();
for(int i = 0; i < 4; i++){
PII next = make_pair(now.first + dx[i], now.second + dy[i]);
if(0 <= next.first && next.first < vmas_x.size() - 1 && 0 <= next.second && next.second < vmas_y.size() - 1 && !plate[next.first][next.second]){
plate[next.first][next.second] = true;
qbfs.push(next);
}
}
}
return;
}
int main()
{
while(true){
scanf("%d%d", &w, &h);
if(!w && !h)
break;
ans = 0;
memset(plate, false, sizeof plate);
vmas_x.clear();
vmas_y.clear();
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d%d%d%d", &mas_x_s[i], &mas_y_s[i], &mas_x_e[i], &mas_y_e[i]);
vmas_x.push_back(mas_x_s[i]);
vmas_x.push_back(mas_x_e[i]);
vmas_y.push_back(mas_y_s[i]);
vmas_y.push_back(mas_y_e[i]);
}
vmas_x.push_back(mas_x_s[n] = 0);
vmas_x.push_back(mas_x_e[n] = w);
vmas_y.push_back(mas_y_s[n] = 0);
vmas_y.push_back(mas_y_e[n] = h);
sort(vmas_x.begin(), vmas_x.end());
sort(vmas_y.begin(), vmas_y.end());
vmas_x.erase(unique(vmas_x.begin(), vmas_x.end()), vmas_x.end());
vmas_y.erase(unique(vmas_y.begin(), vmas_y.end()), vmas_y.end());
for(int i = 0; i <= n; i++){
mas_x_s[i] = lower_bound(vmas_x.begin(), vmas_x.end(), mas_x_s[i]) - vmas_x.begin();
mas_x_e[i] = lower_bound(vmas_x.begin(), vmas_x.end(), mas_x_e[i]) - vmas_x.begin();
mas_y_s[i] = lower_bound(vmas_y.begin(), vmas_y.end(), mas_y_s[i]) - vmas_y.begin();
mas_y_e[i] = lower_bound(vmas_y.begin(), vmas_y.end(), mas_y_e[i]) - vmas_y.begin();
}
for(int i = 0; i < n; i++)
for(int j = mas_x_s[i]; j < mas_x_e[i]; j++)
for(int k = mas_y_s[i]; k < mas_y_e[i]; k++){
plate[j][k] = true;
}
for(int i = 0; i < vmas_x.size() - 1; i++)
for(int j = 0; j < vmas_y.size() - 1; j++)
if(!plate[i][j]){
bfs(make_pair(i, j));
ans++;
}
printf("%d\n", ans);
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 500;
const int mod1 = 1e9 + 9;
const int mod2 = 1e9 + 7;
const int bas = 33;
inline int read() {
char ch;
while ((ch = getchar()) < '0' || ch > '9')
;
int res = ch - '0';
while ((ch = getchar()) >= '0' && ch <= '9') res = res * 10 + ch - '0';
return res;
}
set<pair<int, int> > str[N];
char s[N];
int n, c[N];
struct Edge {
int nxt, to;
} e[N << 1];
int h[N], e_num;
void add(int from, int to) {
e[++e_num] = (Edge){h[from], to};
h[from] = e_num;
}
int ans, cnt;
void dfs(int u, int pre, int tmp1, int tmp2) {
(tmp1 = 1ll * tmp1 * bas % mod1 + s[u] - 'a' + 1) % mod1;
(tmp2 = 1ll * tmp2 * bas % mod2 + s[u] - 'a' + 1) % mod2;
str[u].insert(make_pair(tmp1, tmp2));
for (int i = h[u]; i; i = e[i].nxt) {
int v = e[i].to;
if (v == pre) continue;
dfs(v, u, tmp1, tmp2);
if (str[v].size() > str[u].size()) swap(str[u], str[v]);
str[u].insert(str[v].begin(), str[v].end());
}
int res = str[u].size() + c[u];
if (res > ans)
ans = res, cnt = 1;
else if (ans == res)
cnt++;
}
int main() {
n = read();
for (int i = 1; i <= n; i++) c[i] = read();
scanf("%s", s + 1);
int u, v;
for (int i = 1; i < n; i++) {
u = read();
v = read();
add(u, v);
add(v, u);
}
dfs(1, 0, 0, 0);
printf("%d\n%d", ans, cnt);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 79;
vector<int> a(maxn), cnt(maxn), u(maxn, 0), is(maxn, 0);
vector<vector<int> > d(maxn);
void update_cnt(int in, int delta) {
for (int j : d[in]) cnt[j] += delta;
}
int gcd(int a, int b) {
if (a < b) swap(a, b);
while (b) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < maxn; i++) {
int pr = 0, a = i, sq = 0;
for (int j = 1; j * j <= i; j++) {
if (j > 1 && a % j == 0) {
pr++;
while (a % j == 0) a /= j;
}
if (j > 1 && i % (j * j) == 0) sq = 1;
if (i % j == 0) {
d[i].push_back(j);
if (j * j < i) d[i].push_back(i / j);
}
}
if (a > 1) pr++;
u[i] = (sq ? 0 : (pr % 2 == 0 ? 1 : -1));
sort(d[i].begin(), d[i].end());
}
int n;
cin >> n;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans = max(ans, (long long)a[i]);
is[a[i]] = 1;
}
for (int mygcd = 1; mygcd < maxn; mygcd++) {
vector<int> st;
for (int j = ((maxn - 1) / mygcd); j; j--) {
if (!is[j * mygcd]) continue;
int coprime = 0;
for (int i : d[j]) coprime += u[i] * cnt[i];
if (coprime) {
while (coprime) {
update_cnt(st.back(), -1);
if (gcd(j, st.back()) == 1) {
ans = max(ans, (j * 1ll * st.back() * (long long)(mygcd)));
coprime--;
}
st.pop_back();
}
}
update_cnt(j, 1);
st.push_back(j);
}
while (!st.empty()) update_cnt(st.back(), -1), st.pop_back();
}
cout << ans << "\n";
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int INF = 1e9;
const long long mod = 1e9 + 7;
int n, arr[N], byk;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
if (arr[i] == 1) byk++;
}
if (byk) {
cout << n - byk << endl;
return 0;
}
int mini = INF;
for (int i = 1; i < n; i++) {
int now = gcd(arr[i], arr[i + 1]);
int cnt = 1;
for (int j = i; j >= 1; j--) {
if (now == 1) {
mini = min(mini, cnt);
break;
}
now = gcd(now, arr[j - 1]);
cnt++;
}
now = gcd(arr[i], arr[i + 1]);
cnt = 1;
for (int j = i + 1; j <= n; j++) {
if (now == 1) {
mini = min(mini, cnt);
break;
}
now = gcd(now, arr[j + 1]);
cnt++;
}
}
if (mini == INF) {
cout << -1 << endl;
return 0;
}
cout << mini + (n - 1) << endl;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, typ[510], id[510];
int P;
vector<int> s[510];
long double mp[510][510];
template <typename T>
void chkmin(T &x, T y) {
x = min(x, y);
}
template <typename T>
void chkmax(T &x, T y) {
x = max(x, y);
}
template <typename T>
void read(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
struct MAT {
long double a[510][510];
} mat;
struct VEC {
long double a[510];
} vec;
MAT operator*(const MAT &a, const MAT &b) {
MAT ret;
for (int i = 1; i <= P; ++i)
for (int j = 1; j <= P; ++j) ret.a[i][j] = 0;
for (int i = 1; i <= P; ++i)
for (int t = 1; t <= P; ++t) {
if (a.a[i][t] < 5e-8) continue;
for (int j = 1; j <= P; ++j) {
ret.a[i][j] += a.a[i][t] * b.a[t][j];
}
}
return ret;
}
VEC operator*(const MAT &a, const VEC &b) {
VEC ret;
for (int i = 1; i <= P; ++i) {
ret.a[i] = 0;
for (int t = 1; t <= P; ++t) ret.a[i] += a.a[i][t] * b.a[t];
}
return ret;
}
void write() {
puts("-------");
for (int i = 1; i <= P; ++i)
for (int j = 1; j <= P; ++j) printf("%.10Lf%c", mat.a[i][j], " \n"[j == P]);
}
int main() {
read(n), read(m), read(k);
for (int i = 1; i <= n; ++i) read(typ[i]);
for (int i = 1; i <= m; ++i) {
int u, v;
read(u), read(v);
s[u].push_back(v);
s[v].push_back(u);
}
for (int i = 1; i <= n; ++i) {
if (typ[i] == 1) {
mat.a[i][i] = 1;
continue;
}
for (unsigned j = 0, si = s[i].size(); j < si; ++j) {
int to = s[i][j];
mat.a[to][i] += 1.0 / si;
}
}
P = n;
for (int p = 1; p <= 15; ++p) mat = mat * mat;
int tot = 0;
for (int p = 1; p <= n; ++p) {
if (!typ[p]) continue;
id[p] = ++tot;
for (int i = 1; i <= P; ++i) vec.a[i] = 0;
for (unsigned j = 0, si = s[p].size(); j < si; ++j) {
int to = s[p][j];
vec.a[to] += 1.0 / si;
}
vec = mat * vec;
for (int i = 1; i <= n; ++i) mp[p][i] = vec.a[i];
}
memset(vec.a, 0, sizeof(vec.a));
vec.a[1] = 1;
vec = mat * vec;
static VEC tmp = vec;
memset(vec.a, 0, sizeof(vec.a));
for (int i = 1; i <= n; ++i)
if (typ[i]) vec.a[id[i]] = tmp.a[i];
memset(mat.a, 0, sizeof(mat.a));
P = tot;
for (int i = 1; i <= n; ++i)
if (typ[i]) {
for (int j = 1; j <= n; ++j)
if (typ[j]) {
mat.a[id[j]][id[i]] = mp[i][j];
}
}
MAT ret;
memset(ret.a, 0, sizeof(ret.a));
for (int i = 1; i <= P; ++i) ret.a[i][i] = 1;
k -= 2;
while (k) {
if (k & 1) ret = ret * mat;
mat = mat * mat;
k >>= 1;
}
vec = ret * vec;
printf("%.10Lf\n", vec.a[id[n]]);
return 0;
}
| 4 |
#include<bits/stdc++.h>
using namespace std;
int foo(string a){
int i, size = (int)a.size();
for(i = 0; i < size; i++){
if(!('0' <= a[i] && a[i] <= '9' ))return 0;
}
return 1;
}
int huga(int pl[], int count , int m){
int k = 1;
while(k <= m){
if(count == m)count = 1;
else count++;
if(pl[count] != -1) return count;
k++;
}
return -1;
}
int hoge(string str, int i){
int keta = log10(i) + 1, size = (int)str.size(), an = 0, k, j = 1;
if(keta != size)return 0;
for(k = size - 1; k >= 0; k--){
an += (str[k] - '0') * j;
j *= 10;
} if(an == i)return 1;
else return 0;
}
int main(){
string str[10010];
int m, n, temp;
int i, j, k;
while(1){
int count = 1, pl [1010] ={};
cin>>m>>n;
if(m == 0 && n == 0) break;
for(i = 1; i <= n; i++){
cin>>str[i];
}
for(i = 1; i <= n; i++ ){
if(i%5 == 0 && i%3 == 0){
if(str[i] != "FizzBuzz"){
pl[count] = -1;
}
}else if(i%5 == 0){
if(str[i] != "Buzz"){
pl[count] = -1;
}
} else if(i%3 == 0){
if(str[i] != "Fizz"){
pl[count] = -1;
}
}else{
if(foo(str[i]) == 1){
if(hoge(str[i], i) == 0){
pl[count] = -1;
}
}else{
pl[count] = -1;
}
}
count = huga(pl, count , m);
k = 0;
for(j = 1; j <= m; j++){
if(pl[j] != -1)k++;
}
if(k == 1){
break;
}
}
k = 0;
for(i = 1; i <= m; i++){
if(pl[i] != -1){
if(k) {cout<<" ";}
cout<<i;
k++;
}
}cout<<endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int head[1005], tot = 0, n, m, k, kx[1005], ky[1005], belong[1005], dep[1005],
fa[1005][10], lg[1005];
struct edge {
int to, nxt;
} e[2005];
struct circle {
int x, y, r;
} c[1005];
bool cmp(circle a, circle b) { return a.r > b.r; }
void add_edge(int x, int y) {
e[tot].to = y;
e[tot].nxt = head[x];
head[x] = tot++;
}
void dfs(int now, int f) {
dep[now] = dep[f] + 1;
fa[now][0] = f;
for (int i = 1; (1 << i) <= dep[now]; i++)
fa[now][i] = fa[fa[now][i - 1]][i - 1];
for (int i = head[now]; ~i; i = e[i].nxt)
if (e[i].to != f) dfs(e[i].to, now);
}
int dis(int x, int y) {
if (dep[x] < dep[y]) swap(x, y);
int tx = x, ty = y;
while (dep[x] > dep[y]) x = fa[x][lg[dep[x] - dep[y]] - 1];
if (x == y) return dep[tx] - dep[ty];
for (int i = lg[dep[x]] - 1; i >= 0; i--)
if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
x = fa[x][0];
return -2 * dep[x] + dep[tx] + dep[ty];
}
double ddis(long long x1, long long y1, long long x2, long long y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int main() {
memset(head, -1, sizeof(head));
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= m + 1; i++) lg[i] = lg[i - 1] + (1 << lg[i - 1] == i);
for (int i = 1; i <= n; i++) scanf("%d%d", &kx[i], &ky[i]);
for (int i = 1; i <= m; i++) scanf("%d%d%d", &c[i].r, &c[i].x, &c[i].y);
sort(c + 1, c + m + 1, cmp);
for (int i = 1; i <= m; i++) {
int flag = 0;
for (int j = i - 1; j >= 1; j--)
if (ddis(c[i].x, c[i].y, c[j].x, c[j].y) <= c[j].r - c[i].r) {
add_edge(i, j);
add_edge(j, i);
flag = 1;
break;
}
if (!flag) {
add_edge(0, i);
add_edge(i, 0);
}
}
for (int i = 1; i <= n; i++) {
int flag = 0;
for (int j = m; j >= 1; j--)
if (ddis(kx[i], ky[i], c[j].x, c[j].y) <= c[j].r) {
belong[i] = j;
flag = 1;
break;
}
if (!flag) belong[i] = 0;
}
dep[0] = 0;
dfs(0, 0);
while (k--) {
int x, y;
scanf("%d%d", &x, &y);
printf("%d\n", dis(belong[x], belong[y]));
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int dp[2005][2005];
int main() {
int i, j, k, n, kk, t, s;
scanf("%d%d", &n, &t);
memset(dp, 0, sizeof(dp));
for (i = 1; i <= n; i++) dp[i][1] = 1;
for (j = 2; j <= t; j++) {
for (i = 1; i <= n; i++) {
for (k = i; k <= n; k += i)
dp[k][j] = (dp[k][j] + dp[i][j - 1]) % 1000000007;
}
}
s = 0;
for (i = 1; i <= n; i++) s = (s + dp[i][t]) % 1000000007;
printf("%d\n", s);
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
const int M = 1e9 + 7;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
long long mod(long long x) { return ((x % M + M) % M); }
long long add(long long a, long long b) { return mod(mod(a) + mod(b)); }
long long mul(long long a, long long b) { return mod(mod(a) * mod(b)); }
long long minu(long long a, long long b) { return mod(mod(a) - mod(b)); }
long long modPow(long long a, long long b) {
if (b == 0) return 1LL;
if (b == 1) return a % M;
long long res = 1;
while (b) {
if (b % 2 == 1) res = mul(res, a);
a = mul(a, a);
b = b / 2;
}
return res;
}
int main() {
int t = 1;
cin >> t;
while (t--) {
long long x;
cin >> x;
long long k = 0, cnt = 0, f = 0, m = 1;
for (int i = 1;; i++) {
f = (1LL << i) - 1;
k += f * (f + 1) / 2;
if (k > x) break;
cnt++;
}
cout << cnt << endl;
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fr first
#define sc second
int lg(ll n) {
assert(n > 0);
int ans = -1;
while (n) {
ans++;
n >>= 1;
}
return ans;
}
void solve() {
int n;
cin >> n;
string l, r;
cin >> l >> r;
assert(n == (int)l.length() && n == (int)r.length());
if (r == "0") {
cout << "0" << '\n';
return;
}
assert(r[0] == '1');
if (l[0] == '0') {
cout << string(n, '1') << '\n';
return;
}
if (r.back() == '1') {
cout << r << '\n';
return;
}
// r is even now
auto add = [&](string s) {
int pnt = (int)s.length() - 1;
while (s[pnt] == '1') {
s[pnt] = '0';
pnt--;
}
s[pnt] = '1';
return s;
};
if (add(l) >= r) {
cout << r << '\n';
} else {
cout << add(r) << '\n';
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
while (t--) solve();
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long min1, min2, min3;
long long max1, max2, max3;
long long n;
cin >> n;
cin >> min1 >> max1;
cin >> min2 >> max2;
cin >> min3 >> max3;
for (long long i = max1; i >= min1; i--) {
if (n - i >= (min3 + min2)) {
for (long long j = max2; j >= min2; j--) {
if (n - i - j >= min3) {
cout << i << " " << j << " " << n - i - j;
break;
}
}
break;
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
char di[1100000];
int sum[1100000];
char ans[5000000];
int main() {
while (scanf(" %s", di) != -1) {
int len = strlen(di);
reverse(di, di + len);
char *ptr = ans;
int num = 0;
for (int i = 0; i < len; i++) {
if (di[i] == '0') continue;
int j = i;
while (j + 1 < len && di[j + 1] == '1') j++;
if (i == j) {
sprintf(ptr, "+2^%d\n", i);
ptr += strlen(ptr);
num++;
} else {
sprintf(ptr, "-2^%d\n", i);
ptr += strlen(ptr);
num++;
di[j + 1] = '1';
i = j;
if (j + 1 == len) {
sprintf(ptr, "+2^%d\n", j + 1);
num++;
}
}
}
printf("%d\n%s", num, ans);
}
}
| 4 |
#include<iostream>
using namespace std;
int main()
{
int X1,A;
cin>>X1>>A;
if(X1<A) cout<<"0";
else cout<<"10";
} | 0 |
#include<bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;
int main(){
int n;cin>>n;
int a[n],x[n][n],y[n][n];
rep(i,n){
cin>>a[i];
rep(j,a[i])cin>>x[i][j]>>y[i][j];
}
int mx=0;
for(int tmp=0;tmp<(1<<16);tmp++){
bitset<15> s(tmp);
int sum=0;
bool hon = true;
rep(i,n){
if(s.test(i)){
sum++;
rep(j,a[i]){
if(s.test(x[i][j]-1)!=y[i][j]){
hon=false;
break;
}//if
}//rep
}//if
}//rep
if(hon){mx=max(mx,sum);}
}//for
cout<<mx;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
if (s1 == s2) {
cout << s1 << endl;
} else {
cout << "1" << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int K = 100;
int n;
vector<int> p;
int sum(int x) {
int cnt = 0;
if (x <= 0) return 0;
while (x) {
cnt += x % 10;
x /= 10;
}
return cnt;
}
int main() {
cin >> n;
for (int i = 1; i <= K; i++) {
if (sum(n - i) == i) p.push_back(n - i);
}
sort(p.begin(), p.end());
cout << (int)p.size() << endl;
for (auto i : p) {
cout << i << " ";
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
vector<int> G[MAXN];
int color[MAXN];
long long dp[MAXN][2];
void init() {
for (int i = 0; i < MAXN; i++) {
G[i].clear();
}
}
long long qpow(long long x, long long k) {
long long res = 1;
while (k > 0) {
if (k & 1) {
res = (res * x) % MOD;
}
x = (x * x) % MOD;
k >>= 1;
}
return res;
}
void DFS(int u, int pa) {
dp[u][0] = 1;
dp[u][1] = 0;
long long tmp1 = 0, tmp2 = 1;
for (int v : G[u]) {
if (v != pa) {
DFS(v, u);
tmp1 = (tmp1 + (dp[v][1] * qpow(dp[v][0], MOD - 2)) % MOD) % MOD;
tmp2 = (tmp2 * dp[v][0]) % MOD;
dp[u][0] = (dp[u][0] * dp[v][0]) % MOD;
}
}
dp[u][1] = (tmp2 * tmp1) % MOD;
if (color[u] == 1) {
dp[u][1] = dp[u][0];
} else {
dp[u][0] += dp[u][1];
}
}
int main() {
int n;
while (~scanf("%d", &n)) {
init();
for (int i = 0; i <= n - 2; i++) {
int u;
scanf("%d", &u);
G[u].push_back(i + 1);
G[i + 1].push_back(u);
}
for (int i = 0; i < n; i++) {
scanf("%d", color + i);
}
DFS(0, -1);
printf("%I64d\n", dp[0][1] % MOD);
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
vector<long long> v(n + 1);
for (long long i = 1; i <= n; i++) {
cin >> v[i];
}
vector<long long> s(n + 1), p(n + 1);
for (long long i = 1; i <= n; i++) {
p[i] = v[i];
if (i >= 2) p[i] += p[i - 2];
}
for (long long i = n; i >= 1; i--) {
s[i] = v[i];
if (i + 2 <= n) s[i] += s[i + 2];
}
long long ans = 0;
for (long long i = 1; i <= n; i++) {
ans = max(ans, s[i] + p[i - 1]);
}
cout << ans;
return 0;
}
| 4 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <cassert>
using namespace std;
typedef long long ll;
#define REP(i,n) for (ll i=0; i<(ll)(n); ++i)
#define FOR(i,k,n) for (ll i=(k); i<(ll)(n); ++i)
#define FOREQ(i,k,n) for (ll i=(k); i<=(ll)(n); ++i)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define SZ(v) (ll)((v).size())
#define MEMSET(v,h) memset((v),(h),sizeof(v))
typedef ll Weight;
struct Edge {
ll src;
ll dest;
Weight weight;
Edge() {;}
Edge(ll src, ll dest, Weight weight) : src(src), dest(dest), weight(weight) {;}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
typedef vector<Weight> Array;
typedef vector<Array> Matrix;
/*
void PrllMatrix(const Matrix &mat) {
REP(y, h) {
REP(x, w) {
prllf("%d ", mat[y][x]);
}
puts("");
}
}
*/
ll MaxFlow(const Graph &g, ll s, ll t, Matrix &flow) {
const ll n = g.size();
flow = Matrix(n, Array(n, 0));
Matrix capacity(n, Array(n, 0));
REP(i, n) {
FORIT(it, g[i]) {
capacity[it->src][it->dest] += it->weight;
}
}
ll ret = 0;
vector<ll> parent(n);
while (true) {
fill(parent.begin(), parent.end(), -1);
queue<Edge> que;
que.push(Edge(s, s, 0));
while (!que.empty()) {
Edge node = que.front();
que.pop();
if (parent[node.dest] != -1) { continue; }
parent[node.dest] = node.src;
if (node.dest == t) { break; }
ll from = node.dest;
FORIT(it, g[from]) {
ll to = it->dest;
if (capacity[from][to] == 0 || parent[to] != -1) { continue; }
que.push(Edge(from, to, 0));
}
}
if (parent[t] == -1) { break; }
Weight f = 1 << 30;
ll from = parent[t];
ll to = t;
while (from != to) {
f = min(f, capacity[from][to]) ;
from = parent[from];
to = parent[to];
}
from = parent[t];
to = t;
while (from != to) {
capacity[from][to] -= f;
capacity[to][from] += f;
flow[from][to] += f;
flow[to][from] -= f;
from = parent[from];
to = parent[to];
}
ret += f;
}
return ret;
}
void AddEdge(Graph &g, ll from, ll to, ll weight) {
if (weight == 0) { return; }
g[from].push_back(Edge(from, to, weight));
g[to].push_back(Edge(to, from, weight));
cout << from << " " << to << " " << weight << endl;
}
//====================================
ll Getll(const char *str, ll &index) {
ll ret = 1;
if (isdigit(str[index])) {
ret = atoi(str + index);
while (isdigit(str[index])) { index++; }
}
return ret;
}
vector<ll> Parse(const char *str) {
vector<ll> ret(52, 0);
//ll len = strlen(str);
ll index = 0;
while (str[index]) {
ll a = Getll(str, index);;
ll degree = 0;
if (str[index] == 'x') {
degree = 1;
index++;
if (str[index] == '^') {
index++;
degree = Getll(str, index);
}
}
if (str[index] == '+') { index++; }
ret[degree] = a;
}
return ret;
}
void PrintAns(vector<ll> &ans) {
bool first = true;
for (ll i = 51; i >= 0; i--) {
if (ans[i] == 0) { continue; }
if (!first) { printf("+"); }
first = false;
if (i == 0) {
printf("%lld", ans[i]);
} else if (i >= 1) {
if (ans[i] >= 2) {
printf("%lld", ans[i]);
}
printf("x");
if (i >= 2) {
printf("^%lld", i);
}
}
}
if (first) {
printf("0");
}
puts("");
}
const ll INF = 1 << 28;
ll n, m;
//ll u[1000];
//ll v[1000];
vector<ll> poly[60][60];
//vector<ll> poly[1000];
char str[6666];
int main() {
while (scanf("%lld %lld", &n, &m), n|m) {
REP(y, 60) REP(x, 60) { poly[y][x] = vector<ll>(52, 0); }
REP(i, m) {
ll u, v;
scanf("%lld %lld %s", &u, &v, str);
u--; v--;
vector<ll> p = Parse(str);
REP(j, 51) {
poly[u][v][j] += p[j];
poly[v][u][j] += p[j];
}
}
vector<ll> ans(52, 0);
for (ll i = 51; i >= 0; i--) {
Graph g(n);
REP(y, n) {
REP(x, n) {
if (poly[y][x][i] == 0) { continue; }
g[y].push_back(Edge(y, x, poly[y][x][i]));
}
}
Matrix flow;
ans[i] = MaxFlow(g, 0, n - 1, flow);
if (i != 0) {
REP(y, n) {
REP(x, n) {
if (poly[y][x][i] - flow[y][x] == 0) { continue; }
if (poly[y][x][i] + flow[y][x] == 0) { continue; }
poly[y][x][i - 1] = INF;
}
}
}
}
PrintAns(ans);
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)(1e5 + 100);
int n;
long long num[maxn * 2];
int main() {
scanf("%d", &n);
for (int i = 1; i <= 2 * n; i++) scanf("%lld", &num[i]);
sort(num + 1, num + 2 * n + 1);
if (n == 1) {
printf("0\n");
return 0;
}
long long ans = (long long)(1e18 + 200);
for (int i = 1; i <= n + 1; i++) {
if (i == n + 1) {
ans = min(ans, (num[2 * n] - num[n + 1]) * (num[n] - num[1]));
} else {
ans = min(ans, (num[n + 1] - num[1]) * (num[2 * n] - num[i]));
ans = min(ans, (num[2 * n] - num[1]) * (num[i + n - 1] - num[i]));
}
}
printf("%lld\n", ans);
return 0;
}
| 3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:100000000")
#pragma GCC optimize("O3")
using namespace std;
const long long N = 1e5 + 10;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const long long inf = -1e18;
const long long M = 1e6;
int n, x, y, us[2 * 1000000], a[2 * 1000000], used[2 * 1000000];
long long ans = INF;
int main() {
cin >> n >> x >> y;
for (int i = 1; i <= n; i++) {
cin >> a[i];
used[a[i]]++;
}
for (int i = 2; i <= 1000000; i++) {
if (us[i] == false) {
long long kol = used[i];
for (int j = i + i; j <= 1000000; j += i) {
us[j] = true;
kol += used[j];
}
if ((n - kol) * min(x, y) >= ans) continue;
long long cnt = 0;
for (int j = 1; j <= n; j++) {
if (a[j] % i == 0) continue;
long long t = a[j] % i;
cnt += min(x * 1ll, 1ll * y * (i - t));
}
ans = min(ans, cnt);
}
}
cout << ans;
cin.get(), cin.get();
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
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++;
}
long long read() {
char ch = getchar();
long long x = 0;
int op = 1;
for (; !isdigit(ch); ch = getchar())
if (ch == '-') op = -1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';
return x * op;
}
int n, k, a[55], ans;
char s[55];
int main() {
n = read(), k = read();
scanf("%s", s + 1);
for (int i = (1); i <= (n); i++) a[i] = s[i] - 'a' + 1;
sort(&a[1], &a[n + 1]);
ans = 1000000001;
for (int i = (1); i <= (n); i++) {
int p = i, q, tmp = 0;
bool flag = 1;
for (int j = (1); j <= (k); j++) {
if (p > n) {
flag = 0;
break;
}
tmp += a[p];
q = p, p++;
while (p <= n && abs(a[p] - a[q]) <= 1) p++;
}
if (flag) ans = min(ans, tmp);
}
if (ans == 1000000001)
puts("-1");
else
printf("%d\n", ans);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int s2i(string s){
stringstream ss;
int res;
ss<<s;
ss>>res;
return res;
}
int m,n;
map<string,int> t;
int l[100],r[100];
vector<int> change(int x){
vector<int> res(256);
for(int i=l[x];i<=r[x];i++)res[i]=1;
return res;
}
vector<int> change(string s){
vector<int> res(256);
res[s2i(s)]=1;
return res;
}
bool solve(){
string str,tmp;
getline(cin,str);
stringstream ss(str);
stack< vector<int> > st;
while(ss>>tmp){
if(tmp=="+"){
vector<int> a,b,c;
b=st.top();st.pop();
a=st.top();st.pop();
c.resize(256);
for(int i=0;i<256;i++){
if(a[i]==0)continue;
for(int j=0;j<256;j++){
if(b[j]==0)continue;
c[(i+j)%256]=1;
}
}
st.push(c);
}else if(tmp=="-"){
vector<int> a,b,c;
b=st.top();st.pop();
a=st.top();st.pop();
c.resize(256);
for(int i=0;i<256;i++){
if(a[i]==0)continue;
for(int j=0;j<256;j++){
if(b[j]==0)continue;
c[(i-j+256)%256]=1;
}
}
st.push(c);
}else if(tmp=="*"){
vector<int> a,b,c;
b=st.top();st.pop();
a=st.top();st.pop();
c.resize(256);
for(int i=0;i<256;i++){
if(a[i]==0)continue;
for(int j=0;j<256;j++){
if(b[j]==0)continue;
c[(i*j)%256]=1;
}
}
st.push(c);
}else if(tmp=="/"){
vector<int> a,b,c;
b=st.top();st.pop();
a=st.top();st.pop();
c.resize(256);
for(int i=0;i<256;i++){
if(a[i]==0)continue;
for(int j=0;j<256;j++){
if(b[j]==0)continue;
if(j==0)return false;
c[i/j]=1;
}
}
st.push(c);
}else if(t.count(tmp)){
st.push( change( t[tmp] ) );
}else{
st.push( change(tmp) );
}
}
return true;
}
int main(){
cin>>m;
for(int i=0;i<m;i++){
string s;
cin>>s>>l[i]>>r[i];
t[s]=i;
}
cin>>n;
cin.ignore();
cout<<(solve()?"correct":"error")<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
long long int sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum = sum + arr[i];
}
float x = sum / n;
if (x != (int)x)
cout << "Unrecoverable configuration.";
else {
int count = 0;
vector<int> v;
vector<int> v1;
for (int i = 0; i < n; i++) {
if (arr[i] != x) {
v.push_back(arr[i]);
v1.push_back(i + 1);
} else
count++;
}
if (count == n)
cout << "Exemplary pages.";
else if (v.size() != 2)
cout << "Unrecoverable configuration.";
else {
if (v[1] > v[0] && (x - v[0] == v[1] - x))
cout << v[1] - x << " ml. from cup #" << v1[0] << " to cup #" << v1[1]
<< ".";
else if (v[0] > v[1] && (v[0] - x == x - v[1]))
cout << v[0] - x << " ml. from cup #" << v1[1] << " to cup #" << v1[0]
<< ".";
else
cout << "Unrecoverable configuration.";
}
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
while (n--) {
int m;
cin >> m;
long long a[2][m];
bool b[2][m];
long long c[2][m];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
b[i][j] = 0;
}
}
if (m == 1) {
cout << 0 << endl;
} else {
c[0][m - 1] = a[0][m - 1];
for (int i = m - 2; i >= 1; i--) {
c[0][i] = a[0][i];
c[0][i] += c[0][i + 1];
}
long long maxx = c[0][1];
c[1][0] = a[1][0];
for (int i = 1; i < m - 1; i++) {
c[1][i] = a[1][i];
c[1][i] += c[1][i - 1];
}
if (c[1][m - 2] < maxx) {
maxx = c[1][m - 2];
}
long long u;
for (int i = 1; i <= m - 2; i++) {
u = max(c[0][i + 1], c[1][i - 1]);
if (u < maxx) {
maxx = u;
}
}
cout << maxx << endl;
}
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N, M;
int u[MAXN], v[MAXN];
vector<int> E[MAXN];
int dp[MAXN];
int dfs(int x) {
if (dp[x]) return dp[x];
for (int i = 0; i < E[x].size(); i++) dp[x] = max(dp[x], dfs(E[x][i]));
return ++dp[x];
}
bool check(int k) {
memset(dp, 0, sizeof dp);
for (int i = 1; i <= N; i++) E[i].clear();
for (int i = 0; i < k; i++) E[u[i]].push_back(v[i]);
for (int i = 1; i <= N; i++)
if (dfs(i) == N) return true;
return false;
}
int main() {
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++) scanf("%d%d", u + i, v + i);
int lo = 0, hi = M + 1;
while (lo < hi) {
int mid = (lo + hi) / 2;
if (check(mid))
hi = mid;
else
lo = mid + 1;
}
printf("%d\n", lo > M ? -1 : lo);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n, k, a, b, Q;
int D[200020];
int T[2][2000020];
void Update(int v, int tl, int tr, int cur) {
if (tl > cur || tr <= cur) return;
if (tl == tr - 1) {
T[0][v] = min(a, D[tl]);
T[1][v] = min(b, D[tl]);
return;
}
Update(2 * v, tl, (tl + tr) / 2, cur);
Update(2 * v + 1, (tl + tr) / 2, tr, cur);
T[0][v] = T[0][2 * v] + T[0][2 * v + 1];
T[1][v] = T[1][2 * v] + T[1][2 * v + 1];
}
int Get(int v, int tl, int tr, int l, int r, int cur) {
if (tl >= r || tr <= l) return 0;
if (l <= tl && tr <= r) return T[cur][v];
int A, B;
A = Get(2 * v, tl, (tl + tr) / 2, l, r, cur);
B = Get(2 * v + 1, (tl + tr) / 2, tr, l, r, cur);
return A + B;
}
int main() {
scanf("%d%d%d%d%d", &n, &k, &b, &a, &Q);
while (Q--) {
int indicator;
scanf("%d", &indicator);
if (indicator == 1) {
int d, val;
scanf("%d%d", &d, &val);
D[d] += val;
Update(1, 1, n + 1, d);
} else {
int d;
scanf("%d", &d);
int ans = 0;
ans += Get(1, 1, n + 1, 1, d, 0);
ans += Get(1, 1, n + 1, d + k, n + 1, 1);
printf("%d\n", ans);
}
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 100005;
vector<pair<long long, char>> adj[maxn];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n, m;
cin >> n >> m;
for (long long i = 0; i < m; i++) {
long long u, v;
char c;
cin >> u >> v >> c;
adj[u].push_back({v, c});
adj[v].push_back({u, c});
}
vector<long long> res(2e5, 0);
for (long long c : {'R', 'B'}) {
vector<long long> vec;
bool vis[maxn], color[maxn];
for (long long i = 0; i <= n; i++) vis[i] = color[i] = false;
for (long long i = 1; i <= n; i++) {
if (vis[i]) continue;
vector<long long> s, t;
queue<long long> q;
q.push(i);
vis[i] = true;
while (!q.empty()) {
long long u = q.front();
q.pop();
if (color[u])
s.push_back(u);
else
t.push_back(u);
for (pair<long long, char> e : adj[u]) {
if (vis[e.first]) continue;
if (e.second == c)
color[e.first] = !color[u];
else
color[e.first] = color[u];
vis[e.first] = true;
q.push(e.first);
}
}
if (s.size() < t.size())
for (long long u : s) vec.push_back(u);
else
for (long long u : t) vec.push_back(u);
}
bool ok = true;
for (long long u = 1; u <= n; u++) {
for (pair<long long, char> e : adj[u]) {
if (e.second == c)
ok &= color[e.first] != color[u];
else
ok &= color[e.first] == color[u];
}
}
if (!ok) continue;
if (vec.size() < res.size()) res = vec;
}
if (res.size() == 2e5)
cout << "-1\n";
else {
cout << res.size() << '\n';
for (long long i : res) cout << i << ' ';
cout << '\n';
}
}
| 3 |
#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#define loop(i,a,b) for(int i=a; i<b; i++)
#define rep(i,b) loop(i,0,b)
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> vi;
int main(){
int n;
while (cin >> n && n){
vi v(n);
int c = 0;
rep(i, n) cin >> v[i];
while(1){
vi next(n);
map<int, int> m;
rep(i, n) m[v[i]]++;
rep(i, n) next[i] = m[v[i]];
if (next == v) break;
c++;
v = next;
}
cout << c << endl;
rep(i, n - 1){
cout << v[i] << " ";
}
cout << v.back() << endl;
}
} | 0 |
#include<bits/stdc++.h>
#define INF 0x7fffffff
typedef long long ll;
using namespace std;
int n,C,d[31][31],col[3][31],ans=INF;
bool used[31];
void search(int x,int res)
{
if(x>2)
{
ans=min(ans,res);
return;
}
int sum;
for(int i=1;i<=C;i++)
{
if(used[i])
continue;
sum=0;
for(int j=1;j<=C;j++)
sum+=col[x][j]*d[j][i];
used[i]=true;
search(x+1,res+sum);
used[i]=false;
}
}
int main()
{
int c;
cin>>n>>C;
for(int i=1;i<=C;i++)
for(int j=1;j<=C;j++)
scanf("%d",&d[i][j]);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
scanf("%d",&c);
col[(i+j)%3][c]++;
}
search(0,0);
cout<<ans<<endl;
return 0;
} | 0 |
/*
* author: lcwyyds
* time: 2021-05-28 22:05:58
*/
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
!is_same<T_container, string>::value,
typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
os << '{';
string sep;
for (const T &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
cerr << ' ' << H;
dbg_out(T...);
}
#ifdef WA_DEBUG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
using ll = long long;
using ull = unsigned long long;
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = int(a); i <= (int)(b); i++)
#define per(i, a, b) for (int i = int(a); i >= (int)(b); i--)
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int maxn = 2e5 + 10;
ll qpow(ll a, int b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
ll jc[maxn], inv[maxn];
void cinit(int n) {
jc[0] = inv[0] = 1;
rep(i, 1, n) jc[i] = jc[i - 1] * i % mod;
inv[n] = qpow(jc[n], mod - 2);
per(i, n - 1, 1) inv[i] = inv[i + 1] * (i + 1) % mod;
}
ll C(int n, int m, int p = mod) {
return m > n ? 0 : jc[n] * inv[m] % p * inv[n - m] % p;
}
int main() {
#ifndef WA_DEBUG
ios::sync_with_stdio(false);
cin.tie(nullptr);
#endif
cinit(maxn - 5);
int n, k;
cin >> n >> k;
vector<int> a(n + 1), pos(n + 1);
rep(i, 1, n) {
cin >> a[i];
pos[a[i]] = i;
}
pos[n] = 0;
int num = 1, p = a[1];
rep(i, 2, n) {
int now = a[i];
if (pos[p + 1] < pos[now + 1])
p = now;
else {
p = now;
num++;
}
}
ll ans = 0;
rep(i, num, n) {
ans = ans + C(k, i) * C(n - num, i - num) % mod;
ans %= mod;
}
cout << ans << '\n';
return 0;
}
| 5 |
#include <bits/stdc++.h>
const long long MOD = 1000 * 1000 * 1000 + 7;
const long long MOD1 = 998244353;
const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
using namespace std;
long long power(long long x, long long y) {
long long res = 1;
while (y > 0) {
if (y & 1) res = (long long)(res * x);
y = y >> 1;
if (x <= 100000000) x = (long long)(x * x);
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
long long a[2 * n];
for (int(i) = (0); (i) < (2 * n); ++(i)) cin >> a[i];
sort(a, a + 2 * n);
long long ans = INF;
for (int i = 0; i < 2 * n; i++) {
for (int j = i + 1; j < 2 * n; j++) {
long long sum = 0;
vector<long long> b;
for (int k = 0; k < 2 * n; k++) {
if (k != i && k != j) {
b.push_back(a[k]);
}
}
sort(b.begin(), b.end());
for (int p = 0; p < int((b).size()); p += 2) sum += b[p + 1] - b[p];
ans = min(sum, ans);
}
}
cout << ans;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)1 << 60;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, m;
cin >> n >> m;
vector<pair<long long, long long>> antennas(n);
for (auto& i : antennas) {
cin >> i.first >> i.second;
}
antennas.push_back({0, 0});
vector<long long> dp(m + 1, inf);
dp[m] = 0;
for (long long i = m - 1; i >= 0; i--) {
dp[i] = min(dp[i], (m - i));
for (auto j : antennas) {
long long l = j.first - j.second;
long long r = j.first + j.second;
if (l <= (i + 1) && (i + 1) <= r) {
dp[i] = min(dp[i], dp[i + 1]);
}
if (i < l) {
long long u = l - i - 1;
if (r + u <= m) {
dp[i] = min(dp[i], dp[r + u] + u);
} else {
dp[i] = min(dp[i], u);
}
}
}
}
cout << dp[0] << endl;
}
| 5 |
#include<bits/stdc++.h>
#define reg register
using namespace std;
typedef long long ll;
const int MN=1e5+5;
int n,a[MN],c[MN][2];
int main(){
scanf("%d",&n);
for(reg int i=1;i<=n;i++)scanf("%d",a+i);
for(reg int i=1;i<=n;i++)c[a[i]][i&1]++;
reg int mx1=0,smx1=0,mx2=0,smx2=0;
for(reg int i=1;i<=MN-5;i++){
if(c[mx1][1]<c[i][1])smx1=mx1,mx1=i;
else if(c[smx1][1]<c[i][1])smx1=i;
if(c[mx2][0]<c[i][0])smx2=mx2,mx2=i;
else if(c[smx2][0]<c[i][0])smx2=i;
}
reg int ans;
if(mx1!=mx2)ans=n-c[mx1][1]-c[mx2][0];
else ans=min(n-c[mx1][1]-c[smx2][0],n-c[smx1][1]-c[mx2][0]);
printf("%d\n",ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int getInt() {
int ret = 0;
char ch = ' ';
bool flag = 0;
while (!(ch >= '0' && ch <= '9')) {
if (ch == '-') flag ^= 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
ret = ret * 10 + ch - '0';
ch = getchar();
}
return flag ? -ret : ret;
}
const int N = 200010, MOD = 1000000007;
struct Node {
static int tot;
int child[2], num, sum, tag;
} tr[N * 2];
int Node::tot = 0;
struct Operation {
int opt, p, val;
Operation() {}
Operation(int _opt, int _p, int _val) { opt = _opt, p = _p, val = _val; }
} data[N];
int n, m, arr[N];
int first[N], edge[N], nex[N], tot;
int size[N], father[N], path[N], lSide[N], rSide[N], cnt[N];
inline void insert(int u, int v) {
tot++;
edge[tot] = v, nex[tot] = first[u];
first[u] = tot;
}
inline void input() {
cin >> arr[1] >> m;
n = 1;
for (int i = 1; i <= m; i++) {
int opt, p, val = 0;
cin >> opt >> p;
if (opt == 1) cin >> val;
data[i] = Operation(opt, p, val);
if (opt == 1) {
arr[++n] = val;
insert(p, n);
}
}
}
inline void buildPath() {
static int que[N], head, tail;
que[head = tail = 1] = 1;
while (head <= tail) {
int u = que[head++];
for (int tab = first[u]; tab; tab = nex[tab])
father[que[++tail] = edge[tab]] = u;
}
for (int i = n; i >= 1; i--) {
size[que[i]]++;
if (father[que[i]]) size[father[que[i]]] += size[que[i]];
}
lSide[1] = 1, rSide[1] = n, path[1] = 1;
for (int i = 1; i <= n; i++)
for (int u = que[i], tab = first[u], v, now = 1; tab; tab = nex[tab]) {
v = edge[tab];
path[lSide[v] = lSide[u] + now] = v;
rSide[v] = lSide[v] + size[v] - 1;
now += size[v];
}
}
inline int buildTree(int left, int right) {
int x = ++Node::tot, mid = (left + right) >> 1;
if (left < right) {
(tr[x].child[0]) = buildTree(left, mid);
(tr[x].child[1]) = buildTree(mid + 1, right);
}
return x;
}
inline void pushDown(int x) {
if ((tr[x].tag) == 1) return;
for (int t = 0, u; t < 2; t++)
if ((u = (tr[x].child[t]))) {
(tr[u].num) = ((tr[u].num) * 1LL * (tr[x].tag)) % MOD;
(tr[u].sum) = ((tr[u].sum) * 1LL * (tr[x].tag)) % MOD;
(tr[u].tag) = ((tr[u].tag) * 1LL * (tr[x].tag)) % MOD;
}
(tr[x].tag) = 1;
}
inline void updata(int x) {
(tr[x].sum) = 0;
for (int t = 0; t < 2; t++)
(tr[x].sum) = ((tr[x].sum) + (tr[(tr[x].child[t])].sum)) % MOD;
}
inline int getNum(int x, int l, int r, int u) {
if (l >= r) return (tr[x].num);
pushDown(x);
int mid = (l + r) >> 1;
if (u <= mid) return getNum((tr[x].child[0]), l, mid, u);
return getNum((tr[x].child[1]), mid + 1, r, u);
}
inline void setNum(int x, int l, int r, int u, int v) {
if (l >= r) {
(tr[x].num) = v;
(tr[x].sum) = ((tr[x].num) * 1LL * arr[path[l]]) % MOD;
} else {
pushDown(x);
int mid = (l + r) >> 1;
if (u <= mid)
setNum((tr[x].child[0]), l, mid, u, v);
else
setNum((tr[x].child[1]), mid + 1, r, u, v);
updata(x);
}
}
inline void multiply(int x, int l, int r, int left, int right, int v) {
if (right < l || left > r) return;
if (l >= left && r <= right) {
(tr[x].num) = ((tr[x].num) * 1LL * v) % MOD;
(tr[x].sum) = ((tr[x].sum) * 1LL * v) % MOD;
(tr[x].tag) = ((tr[x].tag) * 1LL * v) % MOD;
} else {
pushDown(x);
int mid = (l + r) >> 1;
multiply((tr[x].child[0]), l, mid, left, right, v);
multiply((tr[x].child[1]), mid + 1, r, left, right, v);
updata(x);
}
}
inline long long extGcd(int x, int y, long long &a, long long &b) {
if (!y) return a = 1, b = 0, x;
long long ta, tb, g = extGcd(y, x % y, ta, tb), t = x / y;
return a = tb, b = ta - t * tb, g;
}
inline int inverse(int x, int M) {
long long t1, t2;
extGcd(x, M, t1, t2);
return (t1 + M) % M;
}
inline void add(int x) {
int y = father[x];
int now = getNum(1, 1, n, lSide[y]);
setNum(1, 1, n, lSide[x], now);
int delta = (inverse(cnt[y], MOD) * 1LL * (cnt[y] + 1)) % MOD;
multiply(1, 1, n, lSide[y], rSide[y], delta);
cnt[y]++, cnt[x]++;
}
inline int querySum(int x, int l, int r, int left, int right) {
if (l >= left && r <= right) return (tr[x].sum);
pushDown(x);
int mid = (l + r) >> 1, ret = 0;
if (right <= mid)
ret = querySum((tr[x].child[0]), l, mid, left, right);
else if (left > mid)
ret = querySum((tr[x].child[1]), mid + 1, r, left, right);
else {
ret = querySum((tr[x].child[0]), l, mid, left, mid);
ret = (ret + querySum((tr[x].child[1]), mid + 1, r, mid + 1, right)) % MOD;
}
return ret;
}
inline int query(int x) {
int y = father[x];
int past = y ? getNum(1, 1, n, lSide[y]) : 1;
int ret = querySum(1, 1, n, lSide[x], rSide[x]);
return (ret * 1LL * inverse(past, MOD)) % MOD;
}
inline void solve() {
buildPath();
buildTree(1, n);
setNum(1, 1, n, 1, 1), cnt[1] = 1;
int now = 1;
for (int i = 1; i <= m; i++) {
int opt = data[i].opt, p = data[i].p;
if (opt == 1)
add(++now);
else
cout << query(p) << "\n";
}
}
int main() {
ios::sync_with_stdio(0);
input();
solve();
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
string s;
int n, m;
long long a[N], sum1[N], b[N], sum2[N], sum3[N], sum4[N], sum5[N], sum6[N];
string s1, s2, s3, s4, s5, s6;
void init() {
string s11 = "abc", s12 = "acb", s13 = "bca", s14 = "bac", s15 = "cab",
s16 = "cba";
for (int i = 1; i <= N / 3 + 1; i++) {
s1 += s11;
s2 += s12;
s3 += s13;
s4 += s14;
s5 += s15;
s6 += s16;
}
}
void init1() {
int l, r, cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0, cnt5 = 0, cnt6 = 0;
for (int i = 1, j = 1; j <= n; j++) {
if (s[j] != s1[j])
sum1[j] = sum1[j - 1] + 1;
else
sum1[j] = sum1[j - 1];
}
for (int i = 1, j = 1; j <= n; j++) {
if (s[j] != s2[j])
sum2[j] = sum2[j - 1] + 1;
else
sum2[j] = sum2[j - 1];
}
for (int i = 1, j = 1; j <= n; j++) {
if (s[j] != s3[j])
sum3[j] = sum3[j - 1] + 1;
else
sum3[j] = sum3[j - 1];
}
for (int i = 1, j = 1; j <= n; j++) {
if (s[j] != s4[j])
sum4[j] = sum4[j - 1] + 1;
else
sum4[j] = sum4[j - 1];
}
for (int i = 1, j = 1; j <= n; j++) {
if (s[j] != s5[j])
sum5[j] = sum5[j - 1] + 1;
else
sum5[j] = sum5[j - 1];
}
for (int i = 1, j = 1; j <= n; j++) {
if (s[j] != s6[j])
sum6[j] = sum6[j - 1] + 1;
else
sum6[j] = sum6[j - 1];
}
}
void Test() {
s.clear();
init();
cin >> n >> m;
string ss;
s += "0";
cin >> ss;
s += ss;
init1();
while (m--) {
int l, r, cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0, cnt5 = 0, cnt6 = 0;
cin >> l >> r;
long long ans = 0x3f3f3f3f;
ans = min(sum1[r] - sum1[l - 1], ans);
ans = min(sum2[r] - sum2[l - 1], ans);
ans = min(sum3[r] - sum3[l - 1], ans);
ans = min(sum4[r] - sum4[l - 1], ans);
ans = min(sum5[r] - sum5[l - 1], ans);
ans = min(sum6[r] - sum6[l - 1], ans);
cout << ans << endl;
}
}
int main() {
ios::sync_with_stdio(false);
int t;
Test();
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxx = 15e4 + 7;
const int Inf = 1 << 30;
const long long INF = 1ll << 60;
int n;
char S[maxx], T[maxx];
int s[maxx], t[maxx];
int tot[maxx];
int pos[30][maxx];
bool vis[maxx];
bool visT[maxx];
queue<int> qua;
queue<int> que;
int ans;
struct PP {
int ss, tt;
} f[maxx];
int main() {
scanf("%d %s %s", &n, S + 1, T + 1);
for (int i = 1; i <= n; i++) {
if (S[i] != '?') s[i] = S[i] - 'a' + 1;
}
for (int i = 1; i <= n; i++) {
if (T[i] != '?')
t[i] = T[i] - 'a' + 1;
else
qua.push(i);
}
for (int i = 1; i <= 26; i++) {
for (int j = 1; j <= n; j++) {
if (t[j] == i) {
tot[i]++;
pos[i][tot[i]] = j;
}
}
}
for (int i = 1; i <= n; i++) {
if (tot[s[i]]) {
ans++;
f[ans].ss = i;
f[ans].tt = pos[s[i]][tot[s[i]]];
vis[f[ans].ss] = 1;
visT[f[ans].tt] = 1;
tot[s[i]]--;
}
}
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
if (S[i] != '?') {
if (!qua.empty()) {
ans++;
f[ans].ss = i;
f[ans].tt = qua.front();
visT[f[ans].tt] = 1;
qua.pop();
}
}
}
}
for (int i = 1; i <= n; i++) {
if (!visT[i]) que.push(i);
}
for (int i = 1; i <= n; i++) {
if (S[i] == '?') {
if (!que.empty()) {
ans++;
f[ans].ss = i;
f[ans].tt = que.front();
que.pop();
}
}
}
printf("%d\n", ans);
for (int i = 1; i <= ans; i++) printf("%d %d\n", f[i].ss, f[i].tt);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
long long a[n + 1], sum = 0;
for (long long i = 0; i < n; i++) {
cin >> a[i + 1];
sum += a[i + 1];
}
if (sum % n) {
cout << -1 << endl;
return;
}
cout << (n - 1) * 3 << endl;
long long m = sum / n;
for (long long i = 2; i <= n; i++) {
cout << "1 " << i << ' ' << (a[i] % i == 0 ? 0 : i - a[i] % i) << endl;
cout << i << " 1 " << (a[i] / i + (a[i] % i == 0 ? 0 : 1)) << endl;
}
for (long long i = 2; i <= n; i++) {
cout << "1 " << i << ' ' << m << endl;
}
}
int32_t main() {
long long t;
cin >> t;
while (t--) solve();
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int one = 0;
int n = s.length();
for (int i = 0, _i = (n); i < _i; ++i) {
if (s[i] == '1') {
for (int j = (i), _j = (n); j < _j; ++j) {
if (s[j] == '0') one++;
}
break;
}
}
if (one >= 6)
cout << "yes" << endl;
else
cout << "no" << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=305;
char s[maxn][maxn];
int a[maxn][maxn];
int main()
{
int h,w;scanf("%d%d",&h,&w);int k;scanf("%d",&k);
for(int i=1;i<=h;i++) scanf("%s",s[i]+1);
int now=0;memset(a,-1,sizeof a);
for(int i=1;i<=h;i++)
{
int vis=0;
for(int j=1;j<=w;j++)
{
if(s[i][j]=='#') a[i][j]=++now,vis=1;
else if(vis&&a[i][j]==-1)
{
a[i][j]=now;
}
}
}
for(int i=1;i<=h;i++)
{
int vis=0;int now=0;
for(int j=w;j>=1;j--)
{
if(a[i][j]!=-1) now=a[i][j],vis=1;
else if(vis&&a[i][j]==-1)
{
a[i][j]=now;
}
}
}
for(int i=1;i<=h;i++)
{
if(a[i][1]==-1)
{
if(i==1)
{
int x=i+1;
while(a[x][1]==-1) x++;
for(int j=1;j<=w;j++)
a[i][j]=a[x][j];
}
else
{
int x=i-1;
while(a[x][1]==-1) x--;
for(int j=1;j<=w;j++)
a[i][j]=a[x][j];
}
}
}
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
cout<<a[i][j]<<" ";
}
cout<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
inline char get() {
static char buf[30000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 30000, stdin), p1 == p2)
? EOF
: *p1++;
}
inline long long read() {
register char c = getchar();
register long long f = 1, _ = 0;
while (c > '9' || c < '0') f = (c == '-') ? -1 : 1, c = getchar();
while (c <= '9' && c >= '0')
_ = (_ << 3) + (_ << 1) + (c ^ 48), c = getchar();
return _ * f;
}
long long n;
long long prime[10000005], ind;
bool book[10000005];
signed main() {
cin >> n;
for (register long long i = 2; i <= 1e6 + 3; i++) {
if (!book[i]) prime[++ind] = i;
for (register long long j = 1; j <= ind; j++) {
if (i * prime[j] > 1e6 + 3) break;
book[i * prime[j]] = 1;
if (!i % prime[j]) break;
}
}
for (register long long i = 2; i * i <= n; i++) {
if (n % i == 0) goto next;
}
printf("%lld\n", n);
return 0;
next:;
long long pos = -1;
for (register long long i = 1; i < ind; i++) {
if (prime[i] == 0) break;
if (prime[i] > n) break;
if (n == 1) break;
if (n % prime[i] == 0 && pos != -1) {
puts("1");
return 0;
}
while (n % prime[i] == 0) {
pos = prime[i];
n /= prime[i];
}
}
if (n != 1)
puts("1");
else
printf("%lld\n", pos);
return 0;
}
| 3 |
#include <bits/stdc++.h>
struct treenode {
double L, R;
};
treenode tree[500000];
int i, m, n, t, x, y, z;
inline treenode merge(treenode l, treenode r) {
return (treenode){l.L + (1 - l.L) * r.L * (1 - l.R) / (1 - r.L * l.R),
r.R + (1 - r.R) * l.R * (1 - r.L) / (1 - r.L * l.R)};
}
inline void buildtree(int l, int r, int node) {
if (l == r) {
scanf("%d%d", &x, &y);
tree[node].L = 1 - 1.0 * x / y;
tree[node].R = 1.0 * x / y;
} else {
int mid = (l + r) >> 1;
buildtree(l, mid, node << 1);
buildtree(mid + 1, r, node << 1 | 1);
tree[node] = merge(tree[node << 1], tree[node << 1 | 1]);
}
return;
}
inline void inserttree(int l, int r, int x, int y, int z, int node) {
if (l == r) {
tree[node].L = 1 - 1.0 * y / z;
tree[node].R = 1.0 * y / z;
} else {
int mid = (l + r) >> 1;
if (x <= mid)
inserttree(l, mid, x, y, z, node << 1);
else
inserttree(mid + 1, r, x, y, z, node << 1 | 1);
tree[node] = merge(tree[node << 1], tree[node << 1 | 1]);
}
return;
}
inline treenode asktree(int l, int r, int x, int y, int node) {
if ((l == x) && (r == y)) return tree[node];
int mid = (l + r) >> 1;
if (y <= mid) return asktree(l, mid, x, y, node << 1);
if (x > mid) return asktree(mid + 1, r, x, y, node << 1 | 1);
return merge(asktree(l, mid, x, mid, node << 1),
asktree(mid + 1, r, mid + 1, y, node << 1 | 1));
}
int main() {
scanf("%d%d", &n, &m);
buildtree(1, n, 1);
for (i = 1; i <= m; i++) {
scanf("%d", &t);
if (t == 1) {
scanf("%d%d%d", &x, &y, &z);
inserttree(1, n, x, y, z, 1);
} else {
scanf("%d%d", &x, &y);
printf("%.10lf\n", 1 - asktree(1, n, x, y, 1).L);
}
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int fun(int x) {
int res = 0;
while (x) {
res = res * 10 + x % 10;
x /= 10;
}
return res;
}
int main() {
int a, b;
cin >> a >> b;
cout << a + fun(b) << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, mx = 0, p = -1;
vector<int> Tree[100005];
void dfs(int x, int d, int fa) {
if (d > mx) {
mx = d;
p = x;
}
for (int i = 0; i < Tree[x].size(); ++i)
if (Tree[x][i] != fa) dfs(Tree[x][i], d + 1, x);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i < n; ++i) {
int x, y;
scanf("%d%d", &x, &y);
Tree[x].push_back(y);
Tree[y].push_back(x);
}
dfs(1, 0, 0);
dfs(p, 0, 0);
printf("%d\n", mx);
return 0;
}
| 3 |
#include<cstdio>
#include<iostream>
using namespace std;
int num[60][3010];
int main(){
int n,m,s;
while(scanf("%d %d %d",&n,&m,&s) && (n||m||s)){
n = n*n;
for(int i=0;i<=n;i++)
for(int j=0;j<=s;j++)num[i][j] = 0;
num[0][0] = 1;
for(int i=1;i<=m;i++){
for(int j=n-1;j>=0;j--){
for(int k=s-i;k>=0;k--){
if(num[j][k]>0){
num[j+1][k+i] += num[j][k];
num[j+1][k+i] %= 100000;
}
}
}
}
printf("%d\n",num[n][s]);
}
} | 0 |
#include <bits/stdc++.h>
const int N = 1001;
const int s[] = {
0, 4784, 8978, 12981, 16901, 20732, 24523, 28249,
31916, 35585, 39176, 42818, 46430, 49962, 53516, 57023,
60523, 64040, 67489, 70985, 74417, 77879, 81285, 84679,
88055, 91433, 94878, 98240, 101608, 104979, 108284, 111653,
115039, 118375, 121695, 124997, 128270, 131626, 134912, 138219,
141503, 144830, 148121, 151368, 154619, 157925, 161166, 164444,
167675, 170946, 174194, 177433, 180617, 183844, 187048, 190283,
193493, 196709, 199900, 203111, 206333, 209526, 212732, 215966,
219123, 222272, 225463, 228651, 231844, 235069, 238261, 241443,
244581, 247733, 250868, 253974, 257141, 260352, 263482, 266623,
269760, 272885, 276014, 279149, 282271, 285396, 288556, 291710,
294878, 297984, 301101, 304177, 307326, 310444, 313579, 316642,
319813, 322904, 326007, 329106, 332181, 335268, 338394, 341465,
344551, 347665, 350739, 353840, 356909, 360000, 363080, 366160,
369261, 372328, 375439, 378518, 381635, 384728, 387817, 390920,
393993, 397033, 400087, 403209, 406288, 409309, 412333, 415431,
418499, 421556, 424569, 427583, 430660, 433680, 436753, 439791,
442818, 445857, 448901, 451962, 454974, 457972, 461015, 464069,
467135, 470153, 473178, 476215, 479250, 482265, 485275, 488279,
491293, 494311, 497242, 500236, 503251, 506276, 509308, 512383,
515414, 518404, 521398, 524428, 527422, 530472, 533469, 536442,
539450, 542467, 545501, 548499, 551461, 554513, 557493, 560489,
563514, 566514, 569508, 572481, 575503, 578464, 581445, 584484,
587448, 590416, 593357, 596373, 599365, 602379, 605357, 608340,
611346, 614316, 617284, 620283, 623219, 626204, 629187, 632137,
635171, 638124, 641088, 644018, 646968, 649933, 652929, 655897,
658857, 661819, 664771, 667743, 670676, 673688, 676670, 679672,
682576, 685541, 688504, 691478, 694490, 697405, 700326, 703273,
706181, 709115, 712113, 715038, 717989, 720960, 723896, 726882,
729831, 732782, 735740, 738676, 741606, 744563, 747458, 750384,
753318, 756217, 759188, 762199, 765150, 768087, 771012, 773928,
776896, 779827, 782754, 785698, 788611, 791513, 794449, 797361,
800286, 803241, 806180, 809116, 812028, 814963, 817868, 820796,
823752, 826720, 829643, 832596, 835498, 838436, 841364, 844292,
847194, 850080, 853022, 855895, 858875, 861761, 864672, 867592,
870514, 873482, 876358, 879282, 882186, 885138, 888023, 890933,
893857, 896758, 899686, 902573, 905460, 908421, 911332, 914214,
917110, 920007, 922881, 925822, 928780, 931678, 934604, 937520,
940453, 943326, 946295, 949181, 952088, 955026, 957871, 960726,
963624, 966507, 969407, 972309, 975196, 978085, 980962, 983867,
986746, 989647, 992538, 995405, 998272, 1001141, 1004047, 1006935,
1009828, 1012698, 1015619, 1018497, 1021407, 1024321, 1027185, 1030064,
1032962, 1035803, 1038722, 1041665, 1044521, 1047338, 1050175, 1053074,
1055897, 1058798, 1061676, 1064500, 1067388, 1070268, 1073174, 1076029,
1078883, 1081790, 1084692, 1087554, 1090413, 1093331, 1096221, 1099056,
1101903, 1104801, 1107645, 1110568, 1113425, 1116309, 1119226, 1122066,
1124941, 1127772, 1130652, 1133559, 1136475, 1139334, 1142195, 1145026,
1147867, 1150738, 1153592, 1156490, 1159339, 1162244, 1165140, 1168043,
1170911, 1173746, 1176591, 1179444, 1182370, 1185244, 1188093, 1190925,
1193801, 1196660, 1199545, 1202432, 1205285, 1208198, 1211026, 1213868,
1216688, 1219588, 1222393, 1225259, 1228119, 1230996, 1233830, 1236682,
1239605, 1242422, 1245272, 1248112, 1250996, 1253792, 1256652, 1259537,
1262363, 1265205, 1268047, 1270890, 1273689, 1276506, 1279377, 1282286,
1285127, 1287980, 1290771, 1293580, 1296434, 1299249, 1302081, 1304899,
1307765, 1310565, 1313437, 1316314, 1319179, 1321953, 1324799, 1327680,
1330570, 1333417, 1336222, 1339091, 1341880, 1344730, 1347558, 1350402,
1353252, 1356098, 1358925, 1361746, 1364529, 1367411, 1370266, 1373089,
1375934, 1378787, 1381608, 1384448, 1387240, 1390062, 1392850, 1395709,
1398555, 1401374, 1404179, 1407069, 1409899, 1412745, 1415626, 1418381,
1421271, 1424100, 1426913, 1429775, 1432595, 1435430, 1438258, 1441129,
1443939, 1446779, 1449605, 1452383, 1455248, 1458083, 1460920, 1463729,
1466529, 1469369, 1472195, 1475031, 1477838, 1480667, 1483501, 1486323,
1489166, 1491981, 1494787, 1497648, 1500453, 1503239, 1506081, 1508873,
1511686, 1514527, 1517367, 1520184, 1523011, 1525806, 1528622, 1531402,
1534201, 1536997, 1539894, 1542683, 1545503, 1548241, 1551093, 1553884,
1556702, 1559565, 1562352, 1565117, 1567943, 1570716, 1573536, 1576359,
1579176, 1581960, 1584772, 1587542, 1590356, 1593212, 1596005, 1598783,
1601564, 1604386, 1607165, 1609974, 1612824, 1615617, 1618452, 1621217,
1624007, 1626767, 1629636, 1632421, 1635222, 1637991, 1640857, 1643718,
1646485, 1649297, 1652064, 1654854, 1657619, 1660460, 1663265, 1666081,
1668892, 1671700, 1674594, 1677356, 1680125, 1682935, 1685691, 1688539,
1691341, 1694101, 1696863, 1699639, 1702441, 1705278, 1708110, 1710912,
1713725, 1716510, 1719267, 1722095, 1724880, 1727671, 1730436, 1733217,
1736052, 1738807, 1741642, 1744421, 1747205, 1750007, 1752772, 1755537,
1758337, 1761093, 1763839, 1766647, 1769444, 1772246, 1775046, 1777876,
1780671, 1783464, 1786236, 1789019, 1791841, 1794680, 1797448, 1800274,
1803074, 1805871, 1808647, 1811416, 1814143, 1816933, 1819707, 1822528,
1825244, 1828005, 1830793, 1833548, 1836360, 1839214, 1841996, 1844792,
1847581, 1850327, 1853089, 1855856, 1858663, 1861433, 1864207, 1866991,
1869796, 1872540, 1875345, 1878117, 1880878, 1883646, 1886490, 1889297,
1892075, 1894867, 1897679, 1900521, 1903296, 1906069, 1908797, 1911589,
1914346, 1917129, 1919906, 1922737, 1925489, 1928318, 1931029, 1933873,
1936618, 1939421, 1942195, 1944975, 1947727, 1950518, 1953327, 1956076,
1958882, 1961653, 1964430, 1967231, 1969999, 1972724, 1975510, 1978238,
1981017, 1983809, 1986618, 1989438, 1992205, 1994950, 1997721, 2000489,
2003304, 2006033, 2008816, 2011607, 2014373, 2017180, 2019933, 2022702,
2025513, 2028256, 2031020, 2033803, 2036610, 2039323, 2042136, 2044905,
2047682, 2050502, 2053230, 2055971, 2058719, 2061484, 2064275, 2067035,
2069780, 2072561, 2075349, 2078104, 2080845, 2083584, 2086330, 2089097,
2091864, 2094672, 2097407, 2100185, 2102972, 2105738, 2108433, 2111259,
2113990, 2116784, 2119527, 2122304, 2125069, 2127838, 2130618, 2133419,
2136173, 2138962, 2141713, 2144481, 2147172, 2149924, 2152702, 2155442,
2158237, 2161008, 2163758, 2166537, 2169247, 2171965, 2174706, 2177470,
2180269, 2183018, 2185806, 2188547, 2191332, 2194100, 2196835, 2199596,
2202324, 2205083, 2207860, 2210669, 2213444, 2216182, 2218953, 2221739,
2224515, 2227246, 2230006, 2232708, 2235482, 2238231, 2240991, 2243756,
2246480, 2249227, 2252025, 2254788, 2257554, 2260312, 2263079, 2265828,
2268545, 2271245, 2274003, 2276736, 2279483, 2282217, 2284983, 2287747,
2290512, 2293240, 2295997, 2298702, 2301494, 2304177, 2306931, 2309704,
2312443, 2315163, 2317910, 2320691, 2323417, 2326186, 2328942, 2331676,
2334374, 2337139, 2339871, 2342642, 2345411, 2348163, 2350887, 2353608,
2356373, 2359139, 2361872, 2364678, 2367432, 2370149, 2372878, 2375651,
2378388, 2381162, 2383896, 2386653, 2389450, 2392222, 2394902, 2397618,
2400363, 2403099, 2405857, 2408603, 2411351, 2414127, 2416904, 2419627,
2422296, 2425056, 2427745, 2430503, 2433251, 2436001, 2438719, 2441528,
2444352, 2447016, 2449765, 2452482, 2455256, 2458031, 2460744, 2463429,
2466187, 2468912, 2471679, 2474403, 2477113, 2479832, 2482617, 2485399,
2488154, 2490869, 2493631, 2496331, 2499026, 2501804, 2504528, 2507234,
2509986, 2512726, 2515473, 2518175, 2520875, 2523614, 2526330, 2529122,
2531839, 2534604, 2537308, 2540008, 2542791, 2545541, 2548284, 2551055,
2553802, 2556546, 2559256, 2562021, 2564750, 2567510, 2570148, 2572929,
2575664, 2578403, 2581128, 2583836, 2586615, 2589384, 2592090, 2594819,
2597536, 2600254, 2602944, 2605706, 2608394, 2611086, 2613806, 2616565,
2619321, 2622048, 2624787, 2627470, 2630206, 2632916, 2635613, 2638344,
2641068, 2643874, 2646581, 2649274, 2651923, 2654664, 2657389, 2660089,
2662840, 2665564, 2668329, 2671039, 2673788, 2676540, 2679254, 2682014,
2684761, 2687515, 2690185, 2692884, 2695614, 2698331, 2701067, 2703798,
2706497, 2709174, 2711871, 2714585, 2717374, 2720152, 2722854, 2725559,
2728236, 2730937, 2733698, 2736447, 2739146, 2741927, 2744682, 2747379,
2750078, 2752811, 2755521, 2758290, 2761026, 2763725, 2766426, 2769153,
2771910, 2774616, 2777363, 2780032, 2782759, 2785459, 2788181, 2790935,
2793661, 2796375, 2799109, 2801844, 2804531, 2807261, 2809930, 2812655,
2815400, 2818088, 2820817, 2823539, 2826276, 2828967, 2831689, 2834417,
2837100, 2839799, 2842571, 2845296, 2847955, 2850686, 2853362, 2856131,
2858814, 2861494, 2864215, 2866912, 2869649, 2872353, 2875061, 2877770,
2880505, 2883226, 2885940, 2888661, 2891324, 2894042, 2896737, 2899482,
2902173, 2904857, 2907606, 2910319, 2913026, 2915749, 2918453, 2921165,
2923834, 2926597, 2929265, 2931966, 2934703, 2937422, 2940118, 2942867,
2945636, 2948312, 2951035, 2953764, 2956447, 2959193, 2961881, 2964616,
2967240, 2969938, 2972638, 2975367, 2978051, 2980755, 2983431, 2986123,
2988902, 2991612, 2994331, 2997075, 2999799, 3002504, 3005203, 3007900,
3010597, 3013324, 3016009, 3018743, 3021417, 3024129, 3026843, 3029542,
3032258, 3034938, 3037647, 3040326, 3043022, 3045754, 3048458, 3051170,
3053831, 3056533, 3059268, 3061963, 3064626, 3067352, 3069997, 3072755,
3075490, 3078186, 3080941, 3083637, 3086305, 3089049, 3091766, 3094461,
3097083, 3099791, 3102503, 3105214, 3107929, 3110676, 3113376, 3116121,
3118822, 3121506, 3124226, 3126914, 3129663, 3132389, 3135041, 3137800,
3140465, 3143179, 3145895, 3148595, 3151359, 3154060, 3156704, 3159381,
3162037, 3164764, 3167422, 3170165, 3172860, 3175583, 3178276, 3180981,
3183679, 3186336, 3189067, 3191741, 3194439, 3197144, 3199905, 3202633,
3205350, 3208093, 3210815, 3213514, 3216212, 3218845, 3221531, 3224234,
3226984, 3229664, 3232326, 3235040, 3237756, 3240412, 3243108, 3245793,
3248448, 3251142, 3253794, 3256465, 3259118, 3261786, 3264499, 3267184,
3269881, 3272566, 3275208, 3277990, 3280684, 3283348, 3286023, 3288733,
3291422, 3294158, 3296809, 3299511, 3302209, 3304882, 3307587, 3310219,
3312951, 3315658, 3318340, 3321024, 3323750, 3326372, 3329060, 3331730,
3334387, 3337067, 3339778, 3342472, 3345126, 3347848, 3350545, 3353226,
3355956, 3358630, 3361303, 3363969, 3366670, 3369387, 3372104, 3374796,
3377477, 3380175, 3382885, 3385555, 3388181, 3390855, 3393551, 3396270,
3398959, 3401658, 3404348, 3407022, 3409749, 3412424, 3415112, 3417799,
3420476, 3423164, 3425804, 3428513, 3431140, 3433831, 3436495, 3439209,
3441873, 3444597, 3447272, 3450005, 3452685, 3455326, 3458010, 3460716,
3463433, 3466044, 3468740, 3471402, 3474095, 3476807, 3479443, 3482094,
3484813, 3487498, 3490171, 3492860, 3495568, 3498297, 3500974, 3503652,
3506387, 3509080, 3511783, 3514444, 3517154, 3519834, 3522520, 3525176,
3527908, 3530582, 3533256, 3535969, 3538668, 3541338, 3543978, 3546667,
3549376, 3552022, 3554739, 3557385, 3560090, 3562780, 3565457, 3568117,
3570777, 3573441, 3576162, 3578838, 3581527, 3584202, 3586899, 3589608,
3592224, 3594895, 3597609, 3600284, 3602937, 3605598, 3608315, 3611057,
3613719, 3616375, 3619063, 3621779, 3624437, 3627138, 3629813, 3632494,
3635172, 3637897, 3640546, 3643225, 3645881, 3648522, 3651242, 3653950,
3656685, 3659419, 3662084, 3664727, 3667446, 3670105, 3672775, 3675493,
3678172, 3680848, 3683590, 3686168, 3688865, 3691503, 3694149, 3696775,
3699495, 3702151, 3704779, 3707476, 3710195, 3712861, 3715571, 3718229,
3720907, 3723622, 3726326, 3729014, 3731697, 3734399, 3737057, 3739687,
3742387, 3745052, 3747736, 3750447, 3753093, 3755763, 3758470, 3761125,
3763798, 3766488, 3769101, 3771838, 3774512, 3777096, 3779799, 3782494,
3785161, 3787804, 3790455, 3793100, 3795810, 3798471, 3801142, 3803841,
3806532, 3809252, 3811893, 3814570, 3817240, 3819899, 3822594, 3825303,
3827949, 3830626, 3833257, 3835966, 3838551, 3841206, 3843893, 3846531,
3849184, 3851821, 3854488, 3857123, 3859809, 3862541, 3865213, 3867908,
3870566, 3873197, 3875855, 3878498, 3881127, 3883820, 3886491, 3889196,
3891882, 3894547, 3897254, 3899883, 3902460, 3905110, 3907779, 3910369,
3913050, 3915712, 3918400, 3921049, 3923696, 3926401, 3929085, 3931738,
3934443, 3937079, 3939772, 3942498, 3945191, 3947875, 3950555, 3953194,
3955921, 3958645, 3961297, 3963906, 3966568, 3969211, 3971880, 3974536,
3977155, 3979753, 3982460, 3985072, 3987720, 3990416, 3993126, 3995735,
3998438, 4001109, 4003807, 4006464, 4009128, 4011827, 4014469, 4017140,
4019846, 4022481, 4025096, 4027765, 4030424, 4033095, 4035734, 4038441,
4041068, 4043777, 4046464, 4049121, 4051770, 4054424, 4057114, 4059771,
4062451, 4065123, 4067794, 4070475, 4073176, 4075821, 4078473, 4081177,
4083782, 4086435, 4089090, 4091774, 4094421, 4097099, 4099748, 4102417,
4105056, 4107702, 4110356, 4113050, 4115722, 4118385, 4121052, 4123728,
4126380, 4129050, 4131700, 4134353, 4137024, 4139686, 4142364, 4145061,
4147677, 4150324, 4153011, 4155686, 4158364, 4160967, 4163597, 4166236,
4168923, 4171606, 4174224, 4176870, 4179522, 4182183, 4184850, 4187489,
4190141, 4192811, 4195422, 4198063, 4200732, 4203355, 4206045, 4208687,
4211357, 4213982, 4216686, 4219357, 4221985, 4224628, 4227283, 4229915,
4232565, 4235233, 4237862, 4240503, 4243170, 4245785, 4248402, 4251066,
4253702, 4256360, 4259015, 4261661, 4264294, 4266922, 4269625, 4272264,
4274957, 4277598, 4280202, 4282798, 4285399, 4288065, 4290688, 4293351,
4296021, 4298654, 4301295, 4303982, 4306609, 4309218, 4311887, 4314529,
4317235, 4319923, 4322593, 4325294, 4327912, 4330591, 4333234, 4335879,
4338516, 4341144, 4343802, 4346451, 4349053, 4351735, 4354389, 4357049,
4359663, 4362342, 4364926, 4367588, 4370299, 4372936, 4375553, 4378193,
4380845, 4383575, 4386240, 4388879, 4391542, 4394200, 4396851, 4399521,
4402187, 4404832, 4407487, 4410086, 4412694, 4415371, 4418023, 4420721,
4423372, 4425992, 4428609, 4431243, 4433902, 4436580, 4439170, 4441823,
4444490, 4447138, 4449673, 4452307, 4454923, 4457555, 4460241, 4462894,
4465544, 4468140, 4470785, 4473457, 4476148, 4478750, 4481417, 4484076,
4486724, 4489312, 4492007, 4494652, 4497293, 4499966, 4502619, 4505253,
4507856, 4510573, 4513194, 4515919, 4518560, 4521186, 4523774, 4526427,
4529073, 4531708, 4534347, 4536968, 4539593, 4542204, 4544861, 4547523,
4550196, 4552844, 4555492, 4558141, 4560804, 4563438, 4566061, 4568706,
4571337, 4574015, 4576657, 4579285, 4581977, 4584687, 4587326, 4589993,
4592654, 4595266, 4597877, 4600572, 4603201, 4605817, 4608469, 4611140,
4613737, 4616385, 4619006, 4621593, 4624232, 4626876, 4629508, 4632187,
4634797, 4637399, 4640031, 4642678, 4645360, 4647919, 4650560, 4653231,
4655889, 4658586, 4661190, 4663804, 4666451, 4669055, 4671705, 4674351,
4676997, 4679633, 4682243, 4684949, 4687533, 4690161, 4692790, 4695463,
4698103, 4700735, 4703363, 4706007, 4708643, 4711274, 4713900, 4716608,
4719202, 4721853, 4724481, 4727184, 4729855, 4732496, 4735168, 4737851,
4740486, 4743083, 4745721, 4748367, 4750950, 4753627, 4756289, 4758913,
4761561, 4764205, 4766823, 4769430, 4772013, 4774673, 4777296, 4779967,
4782597, 4785262, 4787905, 4790546, 4793167, 4795770, 4798436, 4801064,
4803668, 4806333, 4808985, 4811623, 4814267, 4816891, 4819529, 4822161,
4824805, 4827436, 4830058, 4832685, 4835379, 4838000, 4840681, 4843322,
4845982, 4848640, 4851212, 4853838, 4856492, 4859127, 4861763, 4864388,
4867028, 4869676, 4872296, 4874854, 4877529, 4880180, 4882798, 4885427,
4888078, 4890746, 4893365, 4896011, 4898673, 4901286, 4903891, 4906512,
4909157, 4911785, 4914384, 4917033, 4919690, 4922306, 4924919, 4927573,
4930213, 4932818, 4935488, 4938140, 4940775, 4943379, 4946070, 4948680,
4951297, 4953911, 4956558, 4959210, 4961878, 4964538, 4967185, 4969806,
4972410, 4975039, 4977662, 4980311, 4982941, 4985647, 4988226, 4990898,
4993516, 4996145, 4998802, 5001443, 5004057, 5006709, 5009406, 5012065,
5014695, 5017340, 5019950, 5022572, 5025179, 5027802, 5030447, 5033047,
5035681, 5038280, 5040863, 5043508, 5046095, 5048766, 5051412, 5054025,
5056629, 5059278, 5061913, 5064512, 5067205, 5069825, 5072492, 5075114,
5077659, 5080256, 5082860, 5085500, 5088135, 5090728, 5093333, 5095989,
5098616, 5101203, 5103826, 5106459, 5109090, 5111744, 5114362, 5116967,
5119591, 5122214, 5124845, 5127515, 5130154, 5132783, 5135431, 5138076,
5140731, 5143346, 5145981, 5148606, 5151275, 5153900, 5156547, 5159150,
5161734, 5164342, 5166954, 5169574, 5172232, 5174885, 5177522, 5180106,
5182723, 5185364, 5187966, 5190596, 5193213, 5195881, 5198500, 5201126,
5203797, 5206415, 5209050, 5211713, 5214289, 5216846, 5219488, 5222091,
5224741, 5227387, 5230075, 5232642, 5235256, 5237883, 5240497, 5243171,
5245787, 5248349, 5250964, 5253604, 5256295, 5258925, 5261560, 5264198,
5266812, 5269432, 5272057, 5274678, 5277359, 5279981, 5282588, 5285176,
5287825, 5290378, 5292984, 5295576, 5298144, 5300709, 5303300, 5305965,
5308565, 5311160, 5313783, 5316423, 5319019, 5321597, 5324214, 5326785,
5329410, 5332021, 5334623, 5337228, 5339868, 5342497, 5345130, 5347796,
5350422, 5353090, 5355703, 5358368, 5360987, 5363545, 5366148, 5368777,
5371412, 5374088, 5376687, 5379310, 5381929, 5384561, 5387172, 5389785,
5392412, 5395046, 5397629, 5400260, 5402887, 5405527, 5408176, 5410794,
5413434, 5415999, 5418615, 5421235, 5423862, 5426485, 5429133, 5431730,
5434359, 5436989, 5439576, 5442164, 5444785, 5447430, 5450050, 5452630,
5455226, 5457874, 5460458, 5463064, 5465636, 5468292, 5470840, 5473438,
5476040, 5478624, 5481234, 5483862, 5486492, 5489062, 5491685, 5494277,
5496930, 5499560, 5502195, 5504849, 5507484, 5510039, 5512631, 5515229,
5517813, 5520451, 5523148, 5525740, 5528354, 5530960, 5533526, 5536136,
5538821, 5541485, 5544171, 5546787, 5549334, 5551962, 5554594, 5557156,
5559794, 5562401, 5564989, 5567668, 5570318, 5572922, 5575559, 5578173,
5580735, 5583348, 5585968, 5588600, 5591257, 5593883, 5596537, 5599126,
5601766, 5604343, 5606978, 5609544, 5612150, 5614795, 5617364, 5619974,
5622604, 5625220, 5627890, 5630520, 5633085, 5635731, 5638332, 5640958,
5643587, 5646179, 5648777, 5651328, 5653955, 5656616, 5659237, 5661891,
5664467, 5667110, 5669724, 5672315, 5674898, 5677516, 5680112, 5682698,
5685283, 5687873, 5690537, 5693138, 5695725, 5698354, 5700962, 5703597,
5706173, 5708793, 5711418, 5713948, 5716608, 5719236, 5721870, 5724432,
5727030, 5729670, 5732291, 5734927, 5737555, 5740151, 5742760, 5745303,
5747922, 5750484, 5753109, 5755700, 5758284, 5760903, 5763488, 5766103,
5768742, 5771329, 5773921, 5776526, 5779099, 5781662, 5784324, 5786983,
5789590, 5792263, 5794904, 5797482, 5800089, 5802685, 5805349, 5807963,
5810588, 5813145, 5815758, 5818375, 5820930, 5823533, 5826127, 5828742,
5831423, 5834055, 5836688, 5839332, 5841893, 5844529, 5847110, 5849741,
5852352, 5854947, 5857519, 5860154, 5862786, 5865406, 5868021, 5870662,
5873255, 5875845, 5878520, 5881140, 5883729, 5886329, 5888952, 5891561,
5894167, 5896791, 5899352, 5901946, 5904577, 5907199, 5909822, 5912399,
5914980, 5917583, 5920157, 5922796, 5925412, 5928032, 5930672, 5933314,
5935941, 5938528, 5941165, 5943777, 5946380, 5949001, 5951600, 5954206,
5956845, 5959490, 5962107, 5964740, 5967358, 5969954, 5972550, 5975142,
5977742, 5980358, 5982939, 5985529, 5988135, 5990733, 5993379, 5995955,
5998500, 6001091, 6003727, 6006283, 6008887, 6011523, 6014158, 6016757,
6019332, 6021859, 6024475, 6027082, 6029692, 6032264, 6034853, 6037496,
6040041, 6042691, 6045299, 6047914, 6050499, 6053126, 6055662, 6058265,
6060852, 6063464, 6066107, 6068704, 6071358, 6073902, 6076512, 6079117,
6081675, 6084293, 6086846, 6089462, 6092066, 6094754, 6097313, 6099890,
6102471, 6105113, 6107732, 6110282, 6112891, 6115533, 6118146, 6120762,
6123306, 6125905, 6128580, 6131219, 6133813, 6136360, 6139005, 6141600,
6144218, 6146820, 6149371, 6152008, 6154675, 6157271, 6159871, 6162461,
6164976, 6167591, 6170168, 6172803, 6175450, 6178055, 6180645, 6183213,
6185805, 6188462, 6191134, 6193761, 6196339, 6198883, 6201446, 6204006,
6206615, 6209208, 6211825, 6214485, 6217047, 6219685, 6222252, 6224827,
6227426, 6230025, 6232618, 6235254, 6237903, 6240568, 6243137, 6245745,
6248383, 6250968, 6253594, 6256157, 6258704, 6261229, 6263772, 6266353,
6268950, 6271545, 6274153, 6276725, 6279295, 6281850, 6284431, 6287079,
6289703, 6292248, 6294880, 6297458, 6300083, 6302647, 6305225, 6307854,
6310423, 6313002, 6315578, 6318146, 6320783, 6323413, 6326011, 6328577,
6331172, 6333770, 6336395, 6339009, 6341630, 6344208, 6346739, 6349347,
6351927, 6354521, 6357116, 6359727, 6362295, 6364935, 6367512, 6370124,
6372759, 6375330, 6377932, 6380538, 6383126, 6385750, 6388317, 6390928,
6393566, 6396156, 6398760, 6401309, 6403894, 6406444, 6409020, 6411621,
6414240, 6416840, 6419444, 6421985, 6424585, 6427175, 6429774, 6432352,
6434905, 6437478, 6440084, 6442694, 6445293, 6447930, 6450524, 6453111,
6455682, 6458326, 6460917, 6463538, 6466171, 6468741, 6471304, 6473882,
6476474, 6479075, 6481719, 6484300, 6486895, 6489472, 6492070, 6494656,
6497314, 6499923, 6502519, 6505097, 6507692, 6510279, 6512873, 6515451,
6518114, 6520675, 6523259, 6525868, 6528444, 6531066, 6533690, 6536273,
6538887, 6541470, 6544021, 6546672, 6549285, 6551864, 6554452, 6556996,
6559587, 6562188, 6564770, 6567411, 6569951, 6572574, 6575116, 6577700,
6580260, 6582892, 6585456, 6588087, 6590708, 6593326, 6595957, 6598515,
6601071, 6603686, 6606273, 6608834, 6611498, 6614095, 6616698, 6619295,
6621894, 6624418, 6627012, 6629605, 6632211, 6634763, 6637327, 6639847,
6642444, 6645043, 6647598, 6650124, 6652723, 6655351, 6657923, 6660525,
6663028, 6665670, 6668208, 6670804, 6673402, 6676025, 6678603, 6681238,
6683806, 6686331, 6688966, 6691555, 6694117, 6696711, 6699329, 6701946,
6704527, 6707200, 6709795, 6712367, 6714983, 6717599, 6720189, 6722794,
6725391, 6727968, 6730547, 6733134, 6735695, 6738207, 6740828, 6743394,
6745968, 6748552, 6751153, 6753724, 6756299, 6758910, 6761489, 6764062,
6766666, 6769185, 6771775, 6774395, 6776965, 6779497, 6782076, 6784634,
6787249, 6789787, 6792400, 6795031, 6797654, 6800239, 6802810, 6805406,
6807999, 6810601, 6813192, 6815770, 6818374, 6820939, 6823539, 6826057,
6828648, 6831224, 6833809, 6836379, 6838975, 6841545, 6844146, 6846743,
6849310, 6851866, 6854427, 6857053, 6859666, 6862301, 6864928, 6867491,
6870031, 6872597, 6875182, 6877737, 6880327, 6882924, 6885471, 6888050,
6890595, 6893240, 6895824, 6898361, 6900909, 6903508, 6906086, 6908592,
6911194, 6913799, 6916351, 6918938, 6921532, 6924153, 6926760, 6929345,
6932010, 6934558, 6937122, 6939699, 6942266, 6944833, 6947433, 6950048,
6952622, 6955229, 6957811, 6960447, 6963003, 6965624, 6968229, 6970814,
6973374, 6975908, 6978553, 6981142, 6983701, 6986303, 6988895, 6991452,
6994053, 6996636, 6999239, 7001827, 7004386, 7006943, 7009509, 7012092,
7014637, 7017247, 7019911, 7022468, 7025101, 7027733, 7030312, 7032873,
7035446, 7038006, 7040537, 7043119, 7045744, 7048342, 7050888, 7053483,
7056063, 7058671, 7061274, 7063885, 7066487, 7069099, 7071649, 7074208,
7076794, 7079414, 7081992, 7084585, 7087182, 7089730, 7092253, 7094829,
7097378, 7099975, 7102560, 7105136, 7107734, 7110341, 7112923, 7115505,
7118105, 7120687, 7123329, 7125909, 7128529, 7131104, 7133676, 7136261,
7138851, 7141412, 7143963, 7146532, 7149099, 7151678, 7154306, 7156895,
7159502, 7162172, 7164744, 7167291, 7169862, 7172477, 7175070, 7177687,
7180299, 7182859, 7185447, 7188010, 7190543, 7193111, 7195725, 7198306,
7200837, 7203410, 7206026, 7208623, 7211221, 7213777, 7216339, 7218922,
7221467, 7224118, 7226696, 7229224, 7231835, 7234448, 7237074, 7239661,
7242248, 7244831, 7247438, 7250010, 7252624, 7255179, 7257777, 7260342,
7262872, 7265456, 7267970, 7270545, 7273095, 7275708, 7278251, 7280851,
7283410, 7285994, 7288560, 7291115, 7293745, 7296316, 7298848, 7301442,
7304018, 7306655, 7309180, 7311705, 7314293, 7316887, 7319531, 7322112,
7324659, 7327260, 7329881, 7332442, 7335022, 7337604, 7340210, 7342739,
7345280, 7347817, 7350378, 7352945, 7355504, 7358025, 7360615, 7363210,
7365832, 7368429, 7371013, 7373605, 7376145, 7378732, 7381276, 7383811,
7386365, 7388933, 7391502, 7394032, 7396642, 7399245, 7401866, 7404457,
7406982, 7409538, 7412102, 7414691, 7417288, 7419884, 7422441, 7424989,
7427522, 7430101, 7432639, 7435216, 7437740, 7440294, 7442912, 7445516,
7448114, 7450684, 7453261, 7455841, 7458445, 7461027, 7463635, 7466198,
7468787, 7471320, 7473930, 7476552, 7479118, 7481641, 7484264, 7486781,
7489342, 7491952, 7494521, 7497063, 7499688, 7502254, 7504815, 7507392,
7509988, 7512553, 7515087, 7517707, 7520308, 7522824, 7525392, 7527945,
7530543, 7533105, 7535700, 7538260, 7540804, 7543418, 7545943, 7548535,
7551130, 7553729, 7556313, 7558844, 7561435, 7563980, 7566505, 7569080,
7571641, 7574170, 7576783, 7579338, 7581897, 7584422, 7587022, 7589577,
7592151, 7594705, 7597276, 7599794, 7602390, 7604973, 7607619, 7610137,
7612748, 7615269, 7617858, 7620416, 7622960, 7625549, 7628196, 7630753,
7633277, 7635834, 7638354, 7640910, 7643496, 7646121, 7648660, 7651279,
7653833, 7656431, 7659011, 7661580, 7664134, 7666612, 7669193, 7671776,
7674356, 7676915, 7679488, 7682031, 7684595, 7687146, 7689731, 7692293,
7694861, 7697419, 7700031, 7702574, 7705205, 7707783, 7710348, 7712918,
7715474, 7718028, 7720597, 7723207, 7725778, 7728305, 7730889, 7733442,
7736038, 7738641, 7741178, 7743670, 7746199, 7748766, 7751407, 7753967,
7756540, 7759095, 7761686, 7764213, 7766793, 7769379, 7771905, 7774461,
7777035, 7779545, 7782119, 7784671, 7787226, 7789834, 7792385, 7795028,
7797627, 7800194, 7802758, 7805346, 7807903, 7810459, 7813000, 7815577,
7818155, 7820761, 7823285, 7825842, 7828445, 7830988, 7833550, 7836167,
7838714, 7841312, 7843890, 7846422, 7848885, 7851434, 7854000, 7856583,
7859172, 7861776, 7864364, 7866909, 7869478, 7872018, 7874591, 7877131,
7879768, 7882314, 7884851, 7887428, 7890024, 7892632, 7895233, 7897844,
7900429, 7902975, 7905546, 7908066, 7910582, 7913125, 7915728, 7918312,
7920913, 7923470, 7926037, 7928634, 7931211, 7933766, 7936281, 7938828,
7941378, 7943902, 7946432, 7949032, 7951602, 7954217, 7956760, 7959316,
7961868, 7964451, 7967003, 7969567, 7972124, 7974694, 7977293, 7979866,
7982413, 7985018, 7987569, 7990128, 7992722, 7995266, 7997861, 8000394,
8002935, 8005473, 8008047, 8010615, 8013200, 8015753, 8018323, 8020862,
8023413, 8025983, 8028499, 8031030, 8033583, 8036158, 8038758, 8041400,
8043966, 8046482, 8049029, 8051591, 8054132, 8056748, 8059305, 8061849,
8064377, 8066944, 8069508, 8072033, 8074668, 8077206, 8079782, 8082323,
8084914, 8087510, 8090092, 8092568, 8095135, 8097678, 8100189, 8102726,
8105256, 8107767, 8110337, 8112936, 8115467, 8118011, 8120631, 8123161,
8125719};
inline bool check(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
}
if (n % 4 != 1) {
return false;
}
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
int gao(int n) {
int ret = s[n / 100000];
for (int i = n / 100000 * 100000 + 1; i <= n; ++i) {
ret += check(i) ? 1 : 0;
}
return ret;
}
int main() {
int pl, pr;
scanf("%d%d", &pl, &pr);
printf("%d\n", gao(pr) - gao(pl - 1));
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, m, i, j, k;
cin >> n >> m;
string s[n];
for (i = 0; i < n; i++) {
cin >> s[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (s[i][j] == '#') {
for (k = 0; k < n; k++) {
if (s[k][j] == '#') {
if (s[i] != s[k]) {
cout << "No";
return 0;
}
}
}
}
}
}
cout << "Yes";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[111], n;
int res = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = i; j < n; j++) {
tmp ^= arr[j];
if (tmp > res) res = tmp;
}
}
printf("%d\n", res);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
struct Vote {
int p, c;
} v[3005];
bool cmp(const Vote &a, const Vote &b) { return a.c > b.c; }
int main() {
int n, m, vote[3005] = {0};
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d%d", &v[i].p, &v[i].c);
int mx = 0;
long long ans = 1e16;
bool vis[3005];
sort(v, v + n, cmp);
for (int i = 1; i <= n; i++) {
memset(vis, 0, sizeof(vis));
memset(vote, 0, sizeof(vote));
long long sum = 0;
for (int j = 0; j < n; j++) {
if (v[j].p == 1)
vote[1]++;
else {
if (vote[v[j].p] + 1 >= i)
sum += v[j].c, vote[1]++, vis[j] = true;
else
vote[v[j].p]++;
}
}
for (int j = n - 1; j >= 0; j--)
if (v[j].p != 1 && !vis[j] && vote[1] < i)
vis[j] = true, sum += v[j].c, vote[1]++;
ans = min(ans, sum);
}
printf("%lld\n", ans);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
struct mindol {
int b, g, r;
};
bool check[201][201][201];
queue<mindol> q;
int main() {
int n;
scanf("%d\n", &n);
int r = 0, g = 0, b = 0;
for (int i = 1; i <= n; i++) {
char c;
scanf("%c", &c);
if (c == 'R')
r++;
else if (c == 'G')
g++;
else
b++;
}
q.push({b, g, r});
bool B = false, G = false, R = false;
while (!q.empty()) {
mindol now = q.front();
q.pop();
b = now.b, g = now.g, r = now.r;
if (b + g + r == 1) {
if (b) B = true;
if (g) G = true;
if (r) R = true;
continue;
}
if (b >= 2) {
if (!check[b - 1][g][r]) check[b - 1][g][r] = true, q.push({b - 1, g, r});
}
if (g >= 2) {
if (!check[b][g - 1][r]) check[b][g - 1][r] = true, q.push({b, g - 1, r});
}
if (r >= 2) {
if (!check[b][g][r - 1]) check[b][g][r - 1] = true, q.push({b, g, r - 1});
}
if (b && g) {
if (!check[b - 1][g - 1][r + 1])
check[b - 1][g - 1][r + 1] = true, q.push({b - 1, g - 1, r + 1});
}
if (b && r) {
if (!check[b - 1][g + 1][r - 1])
check[b - 1][g + 1][r - 1] = true, q.push({b - 1, g + 1, r - 1});
}
if (g && r) {
if (!check[b + 1][g - 1][r - 1])
check[b + 1][g - 1][r - 1] = true, q.push({b + 1, g - 1, r - 1});
}
}
if (B) printf("B");
if (G) printf("G");
if (R) printf("R");
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void Read(T& x) {
x = 0;
int flag = 0, sgn = 1;
char c;
while (c = getchar()) {
if (c == '-')
sgn = -1;
else if (c >= '0' && c <= '9')
x *= 10, x += c - '0', flag = 1;
else if (flag)
break;
}
x *= sgn;
}
const int MAXN = 1e5 + 10;
long long n, A, cf, cm, m;
struct Skill {
long long id, lev, ans;
Skill(long long id = 0, long long lev = 0, long long ans = 0)
: id(id), lev(lev), ans(lev) {}
} ski[MAXN];
bool cmp(const Skill& x, const Skill& y) { return x.lev < y.lev; }
bool cmpid(const Skill& x, const Skill& y) { return x.id < y.id; }
long long sum[MAXN], ans = 0, mnn = 0x3f3f3f3f, Mn = 0x3f3f3f3f;
long long buy = n + 1, mn = 0x3f3f3f3f;
long long judge(int k, long long res, bool flag) {
long long per = k;
long long tmp = per == 0 ? 0 : res / per;
mnn = ski[k].lev + tmp;
long long c = !flag ? ski[k + 1].lev : A;
if (mnn > c) mnn = c;
mn = k;
}
int main() {
int cnt = 0;
Read(n), Read(A), Read(cf), Read(cm), Read(m);
for (int i = 1; i <= n; i++) {
int v;
Read(v);
ski[i] = Skill(i, v, 0);
if (v == A) cnt++;
}
ski[n + 1] = Skill(n + 1, A, 0);
n++;
cnt++;
sort(ski + 1, ski + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + ski[i].lev;
}
if (ski[1].lev == A) {
cout << (long long)(n - 1) * cf + A * cm << endl;
for (int i = 1; i < n; i++) printf("%I64d ", A);
return 0;
}
for (int i = 1; i <= n; i++) {
int org = i - 1;
while (i + 1 <= n && ski[i].lev == ski[i + 1].lev) i++;
long long low = sum[i];
low = m - (ski[i].lev * i - low);
if (low < 0 || ski[i].lev >= A) {
mn = org;
judge(org, m - (ski[org].lev * mn - sum[org]), 0);
ans = max(mnn * cm + (cnt - 1) * cf, ans);
Mn = mnn;
break;
}
}
mn = min(mn, n - 1);
int p = n - cnt + 1;
for (int i = p - 1; i >= 1; i--) {
int flag = 0;
m -= (A - ski[i].lev);
if (m < 0) break;
while (m - (ski[mn].lev * mn - sum[mn]) < 0) mn--;
mn = min(mn, (long long)i - 1);
long long mo = m - (ski[mn].lev * mn - sum[mn]);
if (mn == i - 1) flag = 1;
if (mn == 0)
mnn = A;
else
judge(mn, mo, flag);
if (mnn * cm + (n - i) * cf > ans)
ans = mnn * cm + (n - i) * cf, p = i, Mn = mnn;
}
cout << ans << endl;
for (int i = n; i >= p; i--) ski[i].ans = A;
for (int i = 1; i <= n; i++)
if (ski[i].ans <= Mn) ski[i].ans = Mn;
sort(ski + 1, ski + 1 + n, cmpid);
for (int i = 1; i < n; i++) printf("%I64d ", ski[i].ans);
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3010;
int n;
int x[N], y[N], top;
pair<int, pair<int, int> > st[N * N];
bitset<N> adj[N];
int sqr(int u) { return u * u; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d", &x[i], &y[i]);
}
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
int dis = sqr(abs(x[i] - x[j])) + sqr(abs(y[i] - y[j]));
st[top++] = make_pair(dis, make_pair(i, j));
}
}
sort(st, st + top);
for (int i = top - 1; i >= 0; i--) {
int dis = st[i].first;
int a = st[i].second.first;
int b = st[i].second.second;
if ((adj[a] & adj[b]).any()) {
printf("%0.17f", sqrt(dis) / 2);
return 0;
}
adj[a][b] = 1;
adj[b][a] = 1;
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }
const int MAXN = 2010;
const long long INF = 1e14;
long long a[MAXN], dp[MAXN];
long long N, M;
bool judge(long long mid) {
for (int i = 1; i <= N; i++) dp[i] = i - 1;
for (int i = 2; i <= N; i++) {
for (int j = 1; j < i; j++) {
if (abs(a[i] - a[j]) <= mid * (i - j))
dp[i] = min(dp[i], dp[j] + i - j - 1);
}
}
for (int i = 1; i <= N; i++) {
if (dp[i] + N - i <= M) return true;
}
return false;
}
int main() {
while (scanf("%I64d%I64d", &N, &M) != EOF) {
for (int i = 1; i <= N; i++) scanf("%I64d", &a[i]);
long long L = 0, R = INF;
while (L < R) {
long long mid = (L + R) / 2;
if (judge(mid))
R = mid;
else
L = mid + 1;
}
printf("%I64d\n", L);
}
return 0;
}
| 4 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
#define WIN 1000
#define LOSE -1
struct Bigger {
bool operator()(pair<int, char>a, pair<int, char>b) {
return a.first > b.first;
}
};
int main() {
int n;
while (cin >> n) {
if (n == 0) break;
vector< pair<int, char> > team(n);
for (int i = 0; i < n; i++) {
char t; cin >> t;
int r;
int point = 0;
for (int j = 0; j < n-1; j++) {
cin >> r;
if (r == 0) point += WIN;
if (r == 1) point += LOSE;
}
team[i].first = point;
team[i].second = t;
}
stable_sort(team.begin(), team.end(), Bigger());
for (int i = 0; i < n; i++) {
cout << team[i].second << endl;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> n >> m;
string a = "";
bool l = 0;
int b, aa;
for (int j = 0; j < m; j++) cin >> b >> aa;
for (int i = 0; i < n; i++) {
if (l)
a += "1";
else
a += "0";
l = l ^ 1;
}
cout << a << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, -1, 0, 1, -1, -1, 1};
int dy[] = {1, 0, 0, -1, 1, -1, 1, -1};
string dim[] = {"R", "D", "U", "L", "RD", "LU", "RU", "LD"};
void File_input(string pathIn) { freopen(pathIn.c_str(), "r", stdin); }
void File_output(string pathOut) { freopen(pathOut.c_str(), "w", stdout); }
int msg() {
srand(time(0));
vector<string> st = {"Wish everyone high ratings!", "Good luck!", "Have fun!",
"Please, read all the problems!", "Go Go fight!"};
cerr << st[rand() % (int)st.size()];
return 0;
}
void FastInputOutput() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long n, a, b, c, sum;
string st, ans;
long long mx = -19999900;
int main() {
FastInputOutput();
cin >> n;
for (int i = 0; i < n; i++) {
cin >> st;
cin >> a >> b;
sum = 0;
for (int j = 0; j < 5; j++) {
cin >> c;
sum += c;
}
sum += a * 100;
sum -= b * 50;
if (sum > mx) {
mx = sum;
ans = st;
}
}
cout << ans << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
vector<int> adj[N], adjt[N];
int dist[N];
int n, m, k;
void bfs(int orig) {
memset(dist, -1, sizeof(dist));
queue<int> q;
dist[orig] = 0;
q.push(orig);
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto v : adj[u]) {
if (dist[v] == -1) dist[v] = dist[u] + 1, q.push(v);
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
int a, b;
vector<int> seq;
for (int i = 1; i <= m; i++) {
cin >> a >> b;
adj[b].push_back(a);
adjt[a].push_back(b);
}
cin >> k;
for (int i = 1; i <= k; i++) {
cin >> a;
seq.push_back(a);
}
bfs(a);
int mini = 0, maxi = 0;
for (int i = 0; i < k - 1; i++) {
int cur = seq[i], prox = seq[i + 1];
int aux = 0;
mini++;
for (auto u : adjt[cur]) {
if (dist[cur] == dist[u] + 1) {
if (prox == u)
mini--;
else
aux = 1;
}
}
maxi += aux;
}
cout << mini << " " << maxi << '\n';
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const long long mod = 1e9 + 7;
const int oo = 1e9;
set<int> s[101];
char mat[101][10000];
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) scanf("%s", mat[i]);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (mat[i][j] == '1') s[i].insert(j);
}
if (s[i].size() == 0) {
printf("-1");
return 0;
}
}
long long cost = 1e18;
for (int j = 0; j < m; ++j) {
long long curr = 0;
for (int i = 0; i < n; ++i) {
if (s[i].find(j) != s[i].end()) continue;
long long c1 = 1e18, c2 = 1e18;
auto it1 = s[i].upper_bound(j);
if (it1 == s[i].end()) it1 = s[i].begin();
c1 = *it1;
if (it1 == s[i].begin()) it1 = s[i].end();
it1--;
c2 = *it1;
curr += min(min(abs(j - c1), min(abs(m - j + c1), abs(m - c1 + j))),
min(abs(j - c2), min(abs(m - j + c2), abs(m - c2 + j))));
}
cost = min(cost, curr);
if (cost == 0) break;
}
cout << cost;
}
| 1 |
#include <bits/stdc++.h>
int a[2000], b[2000];
int n, k;
int t[2000];
long long inverse(long long a, long long mod) {
long long b = mod, x = 0, y = 1, t, q, lastx = 1, lasty = 0;
while (b) {
q = a / b;
t = a, a = b, b = t % b;
t = x, x = lastx - q * x, lastx = t;
t = y, y = lasty - q * y, lasty = t;
}
return a == 1 ? (lastx % mod + mod) % mod : 0;
}
int main() {
int i, j, mul, div, val;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) scanf("%d", &a[i]), b[i] = a[i];
if (!k) goto end;
for (i = 1; i < n; i++) t[i] = 0;
t[0] = 1;
for (i = 0; i < n; i++) {
for (mul = k, div = 1, val = 1, j = i - 1; j >= 0; j--, mul++, div++) {
val = ((long long)val * mul) % 1000000007;
val = (val * inverse(div, 1000000007)) % 1000000007;
b[i] = (b[i] + (long long)a[j] * val) % 1000000007;
}
}
end:
printf("%d", b[0]);
for (i = 1; i < n; i++) printf(" %d", b[i]);
putchar('\n');
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
char a[50][50];
int dd[50];
int d[50];
int ind[50][50];
int ans;
vector<pair<pair<int, int>, pair<int, int> > > bl;
int cc[50];
int cnt[10][10];
void search(int x) {
int i, j, xx, yy, b1;
if (x == 7) {
b1 = 1;
memset(cnt, 0, sizeof(cnt));
for (i = 0; i < 28; i++) {
xx = d[ind[bl[i].first.first][bl[i].first.second]];
yy = d[ind[bl[i].second.first][bl[i].second.second]];
if (cnt[xx][yy] != 0) {
b1 = 0;
break;
}
cnt[xx][yy]++;
cnt[yy][xx]++;
}
if (b1 == 1) {
ans++;
if (ans == 1) {
memcpy(dd, d, sizeof(d));
}
}
return;
}
for (j = 0; j < 14; j++)
if (d[j] == -1) break;
d[j] = x;
for (i = j + 1; i < 14; i++)
if (d[i] == -1) {
d[i] = x;
search(x + 1);
d[i] = -1;
}
d[j] = -1;
}
int main() {
int i, j, tmp, m, n, nn;
scanf("%d%d", &m, &n);
for (i = 0; i < m; i++) scanf("%s", a[i]);
memset(ind, -1, sizeof(ind));
nn = 0;
for (i = 0; i < m; i++)
for (j = 0; j < n; j++)
if ((a[i][j] != '.') && (ind[i][j] == -1)) {
ind[i][j] = nn;
ind[i + 1][j] = nn;
ind[i][j + 1] = nn;
ind[i + 1][j + 1] = nn;
nn++;
}
memset(cc, 0, sizeof(cc));
bl.clear();
for (i = 0; i < 28; i++)
bl.push_back(make_pair(make_pair(0, 0), make_pair(0, 0)));
for (i = 0; i < m; i++)
for (j = 0; j < n; j++)
if (a[i][j] != '.') {
if ((a[i][j] >= 'a') && (a[i][j] <= 'z'))
tmp = a[i][j] - 'a';
else
tmp = a[i][j] - 'A' + 26;
if (cc[tmp] == 0)
bl[tmp].first = make_pair(i, j);
else
bl[tmp].second = make_pair(i, j);
cc[tmp]++;
}
memset(d, -1, sizeof(d));
search(0);
printf("%d\n", ans * 7 * 6 * 5 * 4 * 3 * 2);
for (i = 0; i < m; i++)
for (j = 0; j < n; j++)
if (ind[i][j] != -1) a[i][j] = dd[ind[i][j]] + '0';
for (i = 0; i < m; i++) printf("%s\n", a[i]);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e7;
int prime[N];
bool is_prime[N];
int main(){
//高速エラトステネスできるようになりたい
int p = 0;
fill(is_prime + 2,is_prime + N,1);
for(int i = 2; i < N; i++){
if(is_prime[i]){
prime[p++] = i;
for(int j = 2*i; j < N; j+=i) is_prime[j] = 0;
}
}
int n;
cin >> n;
int cnt = 0;
for(int i = 1; i < 1e6; i++){
if(prime[i]+2 == prime[i+1] && prime[i] <= n) cnt++;
}
cout << cnt*2 << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long i, n, j, k, l;
long long a[105], b[105];
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] % 2 == 0) {
l += a[i];
} else {
j++;
b[j] = a[i];
}
}
if (j == 0) {
cout << 0 << endl;
} else {
sort(b + 1, b + 1 + j);
for (i = 1; i <= j; i++) {
l += b[i];
}
if (j % 2 == 0) {
l -= b[1];
}
cout << l << endl;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
using VI = vector<int>;
int n, d, t, x, y;
int main() {
cin >> t;
while (t--) {
cin >> n >> x >> y >> d;
if (x % d == y % d)
cout << abs(x - y) / d << endl;
else {
int ans = -1;
if (y % d == 1 % d) ans = (x - 1 + d - 1) / d + (y - 1 + d - 1) / d;
if (y % d == n % d) {
int tmp = (n - x + d - 1) / d + (n - y + d - 1) / d;
if (ans == -1 || ans > tmp) ans = tmp;
}
cout << ans << endl;
}
}
return 0;
}
| 1 |
#include<stdio.h>
int main(){
char str[4];
scanf("%s",str);
printf("ABC%s",str);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int x, y;
int ct1 = 0, ct2 = 0;
map<pair<int, int>, int> m1, m2;
for (int i = int(1); i <= int(n); i++) {
cin >> x >> y;
if (x < y)
m1[make_pair(x, y)] = i;
else
m2[make_pair(x, y)] = i;
}
if (m1.size() >= m2.size()) {
cout << m1.size() << "\n";
for (auto it = m1.rbegin(); it != m1.rend(); it++)
cout << (*it).second << " ";
} else {
cout << m2.size() << "\n";
for (auto it : m2) cout << it.second << " ";
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a1;
cin >> a1;
char c, d;
c = 'a';
d = 'z';
int e, f, s = 0;
for (int i = 0; i < a1.size(); i++) {
if (i != 0) {
e = min((abs(a1[i - 1] - c) + abs(d - a1[i]) + 1),
(abs(a1[i - 1] - d) + abs(c - a1[i]) + 1));
f = abs(a1[i] - a1[i - 1]);
s += min(e, f);
} else {
e = abs(c - a1[i]);
f = abs(d - a1[i]) + 1;
s += min(e, f);
}
}
cout << s << endl;
return 0;
}
| 1 |
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int a,b;
while(cin>>a>>b)
{
int i=0;
for(i=0;a+b>=pow(10,i);i++){}
cout<<i<<endl;
}
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<complex>
#include<algorithm>
#include<set>
#define rep(i,n) for(int i = 0;i < n ; ++i)
using namespace std;
using ll = long long;
using Point = complex<double>;
const double eps = 1e-7;
double dot(Point a, Point b){
return real(conj(a)*b);
}
double cross(Point a, Point b){
return imag(conj(a)*b);
}
struct Line{
Point a,b;
};
bool isis_sp(Line s, Point p){
return (abs(s.a-p)+abs(s.b-p)-abs(s.b-s.a)<eps);
}
Point proj(Line l, Point p){
double t = dot(p-l.a,l.a-l.b)/norm(l.a-l.b);
return l.a + t * (l.a-l.b);
}
double dist_sp(Line s, Point p){
Point r = proj(s,p);
return isis_sp(s,r) ? abs(p-r) : min(abs(p-s.a),abs(p-s.b));
}
bool solve(){
Point p[3];
rep(i,3){
int x,y;
cin>>x>>y;
if(x==0&&y==0)return false;
p[i]=Point(x,y);
}
Point c;
int x,y;
cin>>x>>y;
c = Point(x,y);
double r; cin>>r;
int f = 0;
rep(i,3)if(abs(p[i]-c)>=r+eps)++f;
if(f==0){
cout<<"b"<<endl;
return true;
}
if(f<3){
cout<<"c"<<endl;
return true;
}
double sum = 0;
rep(i,3){
sum += arg((p[(i+1)%3]-c)/(p[i]-c));
}
bool in = (abs(sum)>3);
if(in){
bool cr = false;
rep(i,3){
Line l = Line{p[i],p[(i+1)%3]};
if(dist_sp(l,c)<r-eps)cr = true;
}
if(cr)cout<<"c"<<endl;
else cout<<"a"<<endl;
}
else {
bool cr = false;
rep(i,3){
Line l = Line{p[i],p[(i+1)%3]};
if(dist_sp(l,c)<r+eps)cr = true;
}
if(cr)cout<<"c"<<endl;
else cout<<"d"<<endl;
}
return true;
}
int main(){
while(solve());
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
inline int sgn(double x) { return (x > -1e-10) ? ((x > 1e-10) ? 1 : 0) : -1; }
struct Point {
double x, y;
Point() {}
Point(double a, double b) : x(a), y(b) {}
double ang() { return atan2(y, x); }
double len() { return sqrt(x * x + y * y); }
Point nor() {
double l = len();
return Point(-y / l, x / l);
}
Point operator+(Point b) { return Point(x + b.x, y + b.y); }
Point operator-(Point b) { return Point(x - b.x, y - b.y); }
Point operator*(double b) { return Point(x * b, y * b); }
Point operator/(double b) { return Point(x / b, y / b); }
};
inline double cross(Point x, Point y) { return x.x * y.y - x.y * y.x; }
struct Line {
Point x, y;
double ang;
Line() {}
Line(Point a, Point b) : x(a), y(b) { ang = (y - x).ang(); }
bool operator<(const Line& b) const {
if (sgn(ang - b.ang)) return ang < b.ang;
Point t1 = y, t2 = b.y;
return sgn(cross(t1 - x, t2 - x)) < 0;
}
};
inline Point inter(Line x, Line y) {
double s1 = cross(y.x - x.x, x.y - x.x);
double s2 = cross(x.y - x.x, y.y - x.x);
return (y.x * s2 + y.y * s1) / (s1 + s2);
}
Line p[605];
bool in[605];
Point curp;
bool half_plane(int n) {
static Line q1[605];
static Point q2[605];
int l = 1, r = 0;
for (int i = 1; i <= n; i++)
if (in[i] && (l > r || sgn(p[i].ang - q1[r].ang))) {
Line t = p[i];
while (l < r && sgn(cross(t.y - t.x, q2[r] - t.x)) < 0) r--;
while (l < r && sgn(cross(t.y - t.x, q2[l + 1] - t.x)) < 0) l++;
q1[++r] = t;
if (l < r) q2[r] = inter(q1[r - 1], t);
}
while (l < r && sgn(cross(q1[l].y - q1[l].x, q2[r] - q1[l].x)) < 0) r--;
if (r - l < 2) return 0;
curp = q2[r];
return 1;
}
Line a[305], b[305], q[605];
int id1[305], id2[305], rpos[305];
Point bel[305];
bool cmp(int x, int y) { return q[x] < q[y]; }
bool check_half(int n, int l, int r) {
memset(in, 0, sizeof(in));
for (int i = 1; i <= n; i++) in[id1[i]] = 1;
for (int i = l; i <= r; i++) in[id2[(i - 1) % n + 1]] = 1;
return half_plane(2 * n);
}
Point ans1, ans2;
bool check(int n, double r) {
static int cur[605];
for (int i = 1; i <= n; i++) {
Point t = (a[i].y - a[i].x).nor();
b[i] = Line(a[i].y + t * r, a[i].x + t * r);
}
for (int i = 1; i <= n; i++) {
q[i] = a[i];
q[n + i] = b[i];
}
for (int i = 1; i <= 2 * n; i++) cur[i] = i;
sort(cur + 1, cur + 2 * n + 1, cmp);
for (int i = 1; i <= 2 * n; i++) {
if (cur[i] <= n)
id1[cur[i]] = i;
else
id2[cur[i] - n] = i;
p[i] = q[cur[i]];
}
int nr = 0;
for (int i = 1; i <= n; i++) {
while (nr < 2 * n && check_half(n, i, nr + 1)) nr++;
check_half(n, i, nr);
rpos[i] = nr;
bel[i] = curp;
}
if (rpos[1] >= n) {
ans1 = ans2 = bel[1];
return 1;
}
for (int i = 1; i < n; i++)
for (int j = i + 1; j <= n; j++)
if (rpos[i] >= j - 1 && rpos[j] >= n + i - 1) {
ans1 = bel[i];
ans2 = bel[j];
return 1;
}
return 0;
}
Point fir[305];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d%d", &x, &y);
fir[i] = Point(x, y);
}
for (int i = 1; i <= n; i++) a[i] = Line(fir[i], fir[i % n + 1]);
double l = 0, r = 1e5;
while (r - l > 1e-7) {
double mid = (l + r) * .5;
if (check(n, mid))
r = mid;
else
l = mid;
}
check(n, l + 5e-8);
printf("%.10f\n", l);
printf("%.10f %.10f\n", ans1.x, ans1.y);
printf("%.10f %.10f\n", ans2.x, ans2.y);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 300000 + 77;
long double m, R;
long double ans, d = sqrt(2);
int main() {
cin >> m >> R;
ans += R * (2 * (m + 2) * (m + 1) * m / 3 - 2 * m);
ans -= R * (2 - d) * ((m - 2) * (m - 1) + m * (m - 1));
ans = ans / m / m;
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| 2 |
#include<bits/stdc++.h>
using namespace std;
#define reps(i,j,n) for(int i = (j) ; i < (int)(n) ; ++i)
#define rep(i,n) reps(i,0,n)
#define each(it,c) for(__typeof (c).begin() it = (c).begin(); it != (c).end(); it++)
typedef pair< int , int > Pi;
typedef pair< int , Pi > Pii;
typedef long long int64;
const int INF = 1 << 30;
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1,T2>& a){ return is>>a.first>>a.second; }
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1,T2>& a){ return os<<a.first<<" "<<a.second; }
template<typename T> istream& operator>>(istream& is, vector< T >& vc){ rep(i,sz(vc)) is >> vc[i]; return is;}
template<typename T> ostream& operator<<(ostream& os, vector< T >& vc){ rep(i,sz(vc)) os << vc[i] << endl; return os; }
int N;
Pi data[300000];
int calc(int value) { //value:許容匹数
int64 sum = 0; //放出量の合計
priority_queue< Pi, vector< Pi >, greater< Pi > > que; //許容量が小さい順
for(int i = 0; i < N; i++){
que.push( Pi( data[i].second, data[i].first));
sum += data[i].first;
// sum / que.size() を摂取する → sum / que.size() <= que.top()
while(que.size() > value || !que.empty() && sum > (int64)value * que.top().first){
sum -= que.top().second;
que.pop();
}
if(que.size() >= value) return true;
}
return false;
}
int Binary_Search( int row, int high) {
int mid = (row + high + 1) >> 1;
if(row == high) return(row);
else if(calc(mid)) return(Binary_Search( mid, high));
else return(Binary_Search( row, mid - 1));
}
int main() {
scanf("%d", &N);
for(int i = 0; i < N; i++){
scanf("%d %d", &data[i].first, &data[i].second);
}
sort( data, data + N);
cout << Binary_Search( 0, N) << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b) b ^= a ^= b ^= a %= b;
return a;
}
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
inline int src() {
int ret;
scanf("%d", &ret);
return ret;
}
int x, t, a, b, da, db;
int main() {
int i, j, k;
int TC, tc;
cin >> x >> t >> a >> b >> da >> db;
bool isSol = false;
if (x == 0) {
cout << "YES\n";
return 0;
}
for (int i = (int)0; i <= (int)t - 1; i++) {
for (int j = (int)0; j <= (int)t - 1; j++)
if ((a - i * da) + (b - j * db) == x || (a - i * da) == x ||
(b - i * db) == x) {
isSol = true;
break;
}
}
if (isSol)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
long long cnt = 0,ans = 0;
for(int i = 0; i < s.size() - 1; ++i){
if(s[i] == 'A') cnt++;
else if(s[i] == 'B' && s[i+1] == 'C') {
i++;
ans += cnt;
} else cnt = 0;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
inline bool isPrime(long long int n) {
if (n <= 1) {
return false;
}
if (n <= 3) {
return true;
}
if (n % 2 == 0 || n % 3 == 0) {
return false;
}
for (int i = 5; i * i <= n; i = i + 6) {
if (n % i == 0 || n % (i + 2) == 0) {
return false;
}
}
return true;
}
inline bool isEven(long long int x) {
if (x & 1)
return false;
else
return true;
}
int main() {
ios_base::sync_with_stdio(0);
long long int t, n, a, b, c, d, e, f, x, y;
string s, ss;
cin >> s >> ss;
a = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '1') {
a++;
}
}
b = 0;
for (int i = 0; i < ss.size(); ++i) {
if (ss[i] == '1') b++;
}
a += (a % 2);
if (a >= b)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
ans += (n - i) * i;
}
ans += n;
cout << ans << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r, x, y, x1, y1;
cin >> r >> x >> y >> x1 >> y1;
double d = sqrt(pow(x - x1, 2) + pow(y - y1, 2));
cout << ceil(d / (2 * r)) << "\n";
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename L>
bool smax(T &x, L y) {
return x < y ? (x = y, true) : false;
}
template <typename T, typename L>
bool smin(T &x, L y) {
return y < x ? (x = y, true) : false;
}
void calc();
const int MAXN = 1e6 + 15;
string s;
bool can;
int f[MAXN];
vector<int> vec;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
cerr << "HELLO WORLD :|\n";
cin >> s;
calc();
int v = f[s.size()];
while (true) {
if (v <= 0) return cout << "Just a legend\n", false;
for (int j = 1; j < (int)s.size(); j++) {
if (f[j] == v) return cout << s.substr(0, v) << '\n', false;
}
v = f[v];
}
}
void calc() {
memset(f, false, sizeof f);
int len = 0;
string t = s;
f[0] = -1;
for (int i = 1; i <= (int)t.size(); i++) {
len = f[i - 1];
while (~len) {
if (t[len] == t[i - 1]) break;
len = f[len];
}
f[i] = len + 1;
}
}
| 4 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
using namespace std;
int f(int n, int k, vector<int> a){
int c1 = 0;
for(int i=0;i<=n-k;i++){
int num = 1;
for(int j=0;j<k;j++){
num *= a[i+j];
}
c1 = max(c1, num);
}
return c1;
}
bool solve(){
int n, k;
cin>> n>> k;
if(n==0 && k==0) return false;
vector<int> a(n);
for(int i=0;i<n;i++){
cin>> a[i];
}
int c1 = f(n, k, a);
//cout<< c1<< endl;
int ans = -1;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
vector<int> b = a;
swap(b[i],b[j]);
int c2 = f(n, k, b);
if(c2 >= c1) ans = max(ans, c2-c1);
}
}
if(ans != -1){
cout<< ans<< endl;
}else{
cout<< "NO GAME"<< endl;
}
return true;
}
int main(){
cout.setf(ios::fixed);
cout.precision(10);
while(solve());
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void scan(int &n) {
int sign = 1;
n = 0;
char c = getchar_unlocked();
while (c < '0' || c > '9') {
if (c == '-') sign = -1;
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
n = (n << 3) + (n << 1) + c - '0', c = getchar_unlocked();
n = n * sign;
}
void lscan(long long int &n) {
int sign = 1;
n = 0;
char c = getchar_unlocked();
while (c < '0' || c > '9') {
if (c == '-') sign = -1;
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
n = (n << 3) + (n << 1) + c - '0', c = getchar_unlocked();
n = n * (long long int)(sign);
}
int sscan(char a[]) {
char c = getchar_unlocked();
while (c == ' ' || c == '\n') c = getchar_unlocked();
int i = 0;
while (c != '\n') a[i++] = c, c = getchar_unlocked();
a[i] = 0;
return i;
}
int wscan(char a[]) {
char c = getchar_unlocked();
while (c == ' ' || c == '\n') c = getchar_unlocked();
int i = 0;
while (c != '\n' && c != ' ') a[i++] = c, c = getchar_unlocked();
a[i] = 0;
return i;
}
void print(int n) {
if (n < 0) {
n = -n;
putchar_unlocked('-');
}
int i = 10;
char o[10];
do {
o[--i] = (n % 10) + '0';
n /= 10;
} while (n);
do {
putchar_unlocked(o[i]);
} while (++i < 10);
}
void lprint(long long int n) {
if (n < 0LL) {
n = -n;
putchar_unlocked('-');
}
int i = 21;
char o[21];
do {
o[--i] = (n % 10LL) + '0';
n /= 10LL;
} while (n);
do {
putchar_unlocked(o[i]);
} while (++i < 21);
}
void sprint(const char a[]) {
const char *p = a;
while (*p) putchar_unlocked(*p++);
}
long long int po(long long int a, long long int b, long long int m) {
long long int x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > m) x %= m;
}
y = (y * y);
if (y > m) y %= m;
b /= 2;
}
return x;
}
int main() {
long long int n, start;
cin >> n >> start;
long long int a[n];
for (long long int i = 0; i < n; i++) cin >> a[i];
if (n <= 1)
cout << 0 << endl;
else {
sort(a, a + n);
long long int sum1 = 0, sum2 = 0, sum3 = 0, sum4 = 0;
sum1 = abs(a[0] - start);
for (long long int i = 1; i < n - 1; i++) {
sum1 = sum1 + abs(a[i] - a[i - 1]);
}
sum3 = abs(a[n - 2] - start);
for (long long int i = n - 2; i >= 1; i--) {
sum3 = sum3 + abs(a[i] - a[i - 1]);
}
sum2 = abs(a[1] - start);
for (long long int i = 2; i < n; i++) {
sum2 = sum2 + abs(a[i] - a[i - 1]);
}
sum4 = abs(a[n - 1] - start);
for (long long int i = n - 1; i >= 2; i--) {
sum4 = sum4 + abs(a[i] - a[i - 1]);
}
cout << min(min(sum1, sum2), min(sum3, sum4)) << endl;
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
unsigned long long int n, m, counter = 0;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
counter += (m + (i % 5)) / 5;
}
cout << counter << '\n';
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793238462643383279;
const long double EPS = 1e-6;
const int INF = 1e9 + 7;
const long long MOD = INF;
const long long maxn = 5e5 + 2;
const long long HASH_MODS[] = {1000000007333, 1000000009367, 1000000075747,
1000000158923, 1000000203119};
int n, m;
int num[maxn];
int f[maxn];
int child[maxn];
int tin[maxn];
int tout[maxn];
int cnt = 0;
int timer;
string s;
vector<pair<int, int> > hsh[maxn];
void add_edge(int a, int b) {
child[++cnt] = b;
num[cnt] = f[a];
f[a] = cnt;
}
void dfs(int v, int h) {
tin[v] = ++timer;
hsh[h].push_back({timer, hsh[h].back().second ^ (1 << (s[v] - 'a'))});
for (int e = f[v]; e; e = num[e]) {
dfs(child[e], h + 1);
}
tout[v] = ++timer;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> m;
for (int i = (0); i < (n); ++i) hsh[i].resize(1);
for (int i = (1); i < (n); ++i) {
int t;
cin >> t;
add_edge(t - 1, i);
}
cin >> s;
dfs(0, 0);
while (m--) {
int v, h;
cin >> v >> h;
v--;
h--;
int l = lower_bound(hsh[h].begin(), hsh[h].end(), make_pair(tin[v], -1)) -
hsh[h].begin() - 1;
int r = lower_bound(hsh[h].begin(), hsh[h].end(), make_pair(tout[v], -1)) -
hsh[h].begin() - 1;
int t = hsh[h][r].second ^ hsh[h][l].second;
bool ok = t - (t & -t);
if (!ok)
cout << "Yes\n";
else
cout << "No\n";
}
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
long long mo = 1000000007;
long long n, p, a[123456], ans;
long long f[123456][3][3][3], mul[123456];
int main() {
scanf("%lld%lld", &n, &p);
for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
mul[0] = 1;
for (long long i = 1; i <= n; i++) {
mul[i] = (mul[i - 1] * 2) % mo;
}
f[0][0][0][0] = 1;
for (long long i = 1; i <= n; i++)
for (long long num = 0; num <= 1; num++)
for (long long bla = 0; bla <= 1; bla++)
for (long long whi = 0; whi <= 1; whi++) {
long long x = f[i - 1][num][bla][whi];
if (a[i] == 1 || a[i] == -1) {
if (bla == 1) {
f[i][num][bla][whi] =
(f[i][num][bla][whi] + (mul[i - 2] * x) % mo) % mo;
f[i][1 - num][bla][1] =
(f[i][1 - num][bla][1] + (mul[i - 2] * x) % mo) % mo;
} else
f[i][1 - num][bla][1] =
(f[i][1 - num][bla][1] + (mul[i - 1] * x) % mo) % mo;
}
if (a[i] == 0 || a[i] == -1) {
if (whi == 1) {
f[i][num][bla][whi] =
(f[i][num][bla][whi] + (mul[i - 2] * x) % mo) % mo;
f[i][1 - num][1][whi] =
(f[i][1 - num][1][whi] + (mul[i - 2] * x) % mo) % mo;
} else
f[i][1 - num][1][whi] =
(f[i][1 - num][1][whi] + (mul[i - 1] * x) % mo) % mo;
}
}
for (long long bla = 0; bla <= 1; bla++)
for (long long whi = 0; whi <= 1; whi++)
ans = (ans + f[n][p][bla][whi]) % mo;
printf("%lld", ans);
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
int n, m;
int a[maxn], rk[maxn], tr[maxn], ope[maxn], typ[maxn], ans[maxn];
bool cmp1(int q, int w) { return q < w; }
bool cmp2(int q, int w) { return q > w; }
int main() {
while (~scanf("%d%d", &n, &m)) {
rk[0] = 0, ope[0] = 0;
int len = 0;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= m; i++) scanf("%d%d", &tr[i], &rk[i]);
for (int i = m; i >= 1; i--) {
if (rk[i] > ope[len] || len == 0) {
len++;
ope[len] = rk[i];
typ[len] = tr[i];
}
}
sort(a + 1, a + ope[len] + 1);
int l = 1, r = ope[len];
for (int i = len; i >= 1; i--) {
if (typ[i] == 1) {
for (int j = ope[i]; j > ope[i - 1]; j--) {
ans[j] = a[r];
r--;
}
} else if (typ[i] == 2) {
for (int j = ope[i]; j > ope[i - 1]; j--) {
ans[j] = a[l];
l++;
}
}
}
for (int i = 1; i <= n; i++) {
if (i <= ope[len])
printf("%d", ans[i]);
else
printf("%d", a[i]);
if (i == n)
printf("\n");
else
printf(" ");
}
}
return 0;
}
| 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.