problem_id
stringlengths 6
6
| language
stringclasses 2
values | original_status
stringclasses 3
values | original_src
stringlengths 19
243k
| changed_src
stringlengths 19
243k
| change
stringclasses 3
values | i1
int64 0
8.44k
| i2
int64 0
8.44k
| j1
int64 0
8.44k
| j2
int64 0
8.44k
| error
stringclasses 270
values | stderr
stringlengths 0
226k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
for (int i = M; i > 0; i--) {
if (M % i == 0 and M / i >= N) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
for (int i = M / N; i > 0; i--) {
if (M % i == 0 and M / i >= N) {
cout << i << endl;
return 0;
}
}
return 0;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p03241 | C++ | Time Limit Exceeded | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265358979323846
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// ใใผใใซใไฝใๅๅฆ็
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
string Toupper(string s) {
string ans = "";
rep(i, s.size()) {
if ('a' <= s[i] && s[i] <= 'z')
ans += (char)s[i] - 32;
else
ans += s[i];
}
return ans;
}
string Tolower(string s) {
string ans = "";
rep(i, s.size()) {
if ('A' <= s[i] && s[i] <= 'Z')
ans += (char)s[i] + 32;
else
ans += s[i];
}
return ans;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/*โโโโโโโโโโโโโโโ*/
int main() {
IOS;
ll n, m;
cin >> n >> m;
ll cnt = m / n;
ll ans = 0;
Rep(i, cnt + 1) {
if (m % i == 0)
chmax(ans, i);
}
cout << ans << endl;
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define PI 3.14159265358979323846
ll fac[MAX], finv[MAX], inv[MAX];
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// ใใผใใซใไฝใๅๅฆ็
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
string Toupper(string s) {
string ans = "";
rep(i, s.size()) {
if ('a' <= s[i] && s[i] <= 'z')
ans += (char)s[i] - 32;
else
ans += s[i];
}
return ans;
}
string Tolower(string s) {
string ans = "";
rep(i, s.size()) {
if ('A' <= s[i] && s[i] <= 'Z')
ans += (char)s[i] + 32;
else
ans += s[i];
}
return ans;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/*โโโโโโโโโโโโโโโ*/
int main() {
IOS;
ll n, m;
cin >> n >> m;
ll cnt = m / n;
ll ans = 0;
Rep(i, sqrt(m) + 1) {
if (m % i == 0) {
ll a = i;
ll b = m / i;
if (a <= cnt)
chmax(ans, a);
if (b <= cnt)
chmax(ans, b);
}
}
cout << ans << endl;
} | replace | 165 | 168 | 165 | 174 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int lim = m / n;
int maxi = 0;
for (int i = 1; i <= lim; ++i) {
if (m % i == 0) {
if (m / i >= n) {
maxi = i;
}
}
}
cout << maxi << endl;
return 0;
}
/*
123 ใ 10 ๅใฎๆฐใงๅใใ
123 / 3 = 41
41 ใ 10 ๅใฎๆฐใงใใใใใใ
x ใ y ๅใฎๆฐใงใใใใใใ๏ผ
โ x >= y ใชใ OK
N M
i โ [2, ?]
if( M ใ i ใงๅฒใใ )
s = M ใ i ใงๅฒใ
if( s ใ N ใงใใใใใใ๏ผ ){
i ใง OK
}
123 / 3
s = 123/3
s == 41
41 ใ 10 ใงใใใใใพใ
M/i >= N
1/i >= N/M
i <= M/N
*/ | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int lim = m / n;
int maxi = 0;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (int i = 1; i <= lim; ++i) {
if (m % i == 0) {
if (m / i >= n) {
maxi = i;
}
}
}
cout << maxi << endl;
return 0;
}
/*
123 ใ 10 ๅใฎๆฐใงๅใใ
123 / 3 = 41
41 ใ 10 ๅใฎๆฐใงใใใใใใ
x ใ y ๅใฎๆฐใงใใใใใใ๏ผ
โ x >= y ใชใ OK
N M
i โ [2, ?]
if( M ใ i ใงๅฒใใ )
s = M ใ i ใงๅฒใ
if( s ใ N ใงใใใใใใ๏ผ ){
i ใง OK
}
123 / 3
s = 123/3
s == 41
41 ใ 10 ใงใใใใใพใ
M/i >= N
1/i >= N/M
i <= M/N
*/ | insert | 12 | 12 | 12 | 16 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define PER(i, n) for (ll i = n; i >= 1; i--)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#define se second
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vc = vector<char>;
using vcc = vector<vc>;
using vP = vector<P>;
using vPP = vector<vP>;
using vPl = vector<Pl>;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll &a, const ll &b) { return ((a) + (b)-1) / b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 1; i <= m / n; i++) {
if (m % i == 0)
ans = i;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define PER(i, n) for (ll i = n; i >= 1; i--)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#define se second
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vc = vector<char>;
using vcc = vector<vc>;
using vP = vector<P>;
using vPP = vector<vP>;
using vPl = vector<Pl>;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll &a, const ll &b) { return ((a) + (b)-1) / b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 1; i * i <= m; i++) {
if (m % i != 0)
continue;
if (i >= n)
chmax(ans, m / i);
if (m / i >= n)
chmax(ans, i);
}
cout << ans << endl;
} | replace | 52 | 55 | 52 | 59 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <vector>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD = 1000000007;
// const int MOD=998244353;
const int INTMAX = 1001001000;
const ll LLMAX = 1010010010010010000;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N >> M;
for (ll i = M; i >= 1; i--) {
if (M % i == 0 && M / i >= N) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <vector>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using namespace std;
using ll = long long int;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
const int MOD = 1000000007;
// const int MOD=998244353;
const int INTMAX = 1001001000;
const ll LLMAX = 1010010010010010000;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, M;
cin >> N >> M;
if (N == 1) {
cout << M << endl;
return 0;
}
for (ll i = 1; i <= sqrt(M); i++) {
if (M % i == 0 && i >= N) {
cout << M / i << endl;
return 0;
}
}
for (ll i = sqrt(M); i >= 1; i--) {
if (M % i == 0 && M / i >= N) {
cout << i << endl;
return 0;
}
}
return 0;
}
| replace | 43 | 44 | 43 | 55 | TLE | |
p03241 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
int mx = M / N;
int rem = M % N;
while (rem) {
mx--;
rem = M - N * mx;
rem %= mx;
}
cout << mx << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
int mx = M / N;
int rem = M % N;
rem %= mx;
while (rem) {
mx--;
rem = M - N * mx;
rem %= mx;
}
cout << mx << "\n";
return 0;
}
| insert | 13 | 13 | 13 | 14 | 0 | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll mx = 1;
for (ll i = m - 1; i >= 2; i--) {
if ((i % 2 == 0 && m % 2 != 0)) {
continue;
}
ll u = m - i * (n - 1);
if (u <= 0) {
continue;
}
if (u % i == 0) {
mx = i;
break;
}
}
cout << mx << endl;
}
| #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
ll mx = 1;
for (ll i = m - 2 * (n - 1); i >= 2; i--) {
if ((i % 2 == 0 && m % 2 != 0)) {
continue;
}
ll u = m - i * (n - 1);
if (u <= 0) {
continue;
}
if (u % i == 0) {
mx = i;
break;
}
}
cout << mx << endl;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
for (long long int i = m; i > 0; i--) {
if (m % i == 0 && (m / i) >= n) {
cout << i;
break;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
for (long long int i = int(m / n); i > 0; i--) {
if (m % i == 0 && (m / i) >= n) {
cout << i;
break;
}
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p03241 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int yakusu_count = 1;
vector<long long> yakusu(m);
yakusu.at(0) = m;
int current = 1;
for (int i = m / 2; i > 0; i--) {
if (m % i == 0) {
yakusu.at(current) = i;
current++;
yakusu_count++;
}
}
bool flag = 0;
rep(i, yakusu_count) {
if (m >= n * yakusu.at(i)) {
cout << yakusu.at(i) << endl;
flag = 1;
break;
}
}
if (flag == 0)
cout << 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int yakusu_count = 1;
vector<long long> yakusu(1000000);
yakusu.at(0) = m;
int current = 1;
for (int i = m / 2; i > 0; i--) {
if (m % i == 0) {
yakusu.at(current) = i;
current++;
yakusu_count++;
}
}
bool flag = 0;
rep(i, yakusu_count) {
if (m >= n * yakusu.at(i)) {
cout << yakusu.at(i) << endl;
flag = 1;
break;
}
}
if (flag == 0)
cout << 1 << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p03241 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define EPS 1e-9
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; --i)
#define REPC(i, obj) for (auto i : obj)
#define R_UP(a, b) (((a) + (b)-1) / (b))
#define ALL(obj) (obj).begin(), (obj).end()
#define SETP cout << fixed << setprecision(8)
using namespace std;
using ll = long long;
template <typename T = ll> inline T in() {
T x;
cin >> x;
return x;
}
signed main() {
int n = in(), m = in();
REPR1(i, m) {
if (m % i == 0 && i * n <= m) {
cout << i << endl;
return 0;
}
}
} | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define EPS 1e-9
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; --i)
#define REPC(i, obj) for (auto i : obj)
#define R_UP(a, b) (((a) + (b)-1) / (b))
#define ALL(obj) (obj).begin(), (obj).end()
#define SETP cout << fixed << setprecision(8)
using namespace std;
using ll = long long;
template <typename T = ll> inline T in() {
T x;
cin >> x;
return x;
}
signed main() {
int n = in(), m = in();
REPR1(i, m / n) {
if (m % i == 0 && i * n <= m) {
cout << i << endl;
return 0;
}
}
} | replace | 22 | 23 | 22 | 23 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> div(0);
for (int i = 1; i <= m; i++)
if (m % i == 0)
div.emplace_back(i), div.emplace_back(m / i);
sort(div.begin(), div.end());
int res = 0;
for (auto x : div)
if (m / x >= n)
res = x;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> div(0);
for (int i = 1; i * i <= m; i++)
if (m % i == 0)
div.emplace_back(i), div.emplace_back(m / i);
sort(div.begin(), div.end());
int res = 0;
for (auto x : div)
if (m / x >= n)
res = x;
cout << res << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <random>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, ans;
cin >> N >> M;
for (int i = 1; i <= M / N; i++) {
if (M % i == 0)
ans = i;
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <random>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, ans;
cin >> N >> M;
for (int i = 1; i * i <= M; i++) {
if (M % i == 0) {
int j = M / i;
if (i <= M / N) {
ans = max(ans, i);
}
if (j <= M / N) {
ans = max(ans, j);
}
}
}
cout << ans << endl;
}
| replace | 20 | 23 | 20 | 30 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long ans = 1;
for (long long i = 2; i * n <= m; i++) {
if ((m - i * n) % i == 0)
ans = i;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long ans = 1;
if (n == 1) {
cout << m << endl;
return 0;
}
for (long long i = 2; i * n <= m; i++) {
if ((m - i * n) % i == 0)
ans = i;
}
cout << ans << endl;
} | insert | 7 | 7 | 7 | 11 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int kotae = 1;
for (int i = m / n + 1; i >= 2; --i) {
int tmp = kotae;
if (m % i == 0)
kotae = max(kotae, i);
if (m / kotae < n) {
kotae = tmp;
break;
}
}
cout << kotae << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n == 1) {
cout << m << endl;
return 0;
}
int kotae = 1;
for (int i = m / n + 1; i >= 2; --i) {
int tmp = kotae;
if (m % i == 0)
kotae = max(kotae, i);
if (m / kotae < n) {
kotae = tmp;
break;
}
}
cout << kotae << endl;
return 0;
} | insert | 6 | 6 | 6 | 10 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
ll ans;
for (int i = M; i > 0; i--) {
if (M % i == 0 && i * N <= M) {
ans = i;
break;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
ll ans;
for (int i = M / N; i > 0; i--) {
if (M % i == 0 && i * N <= M) {
ans = i;
break;
}
}
cout << ans << endl;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long n, m;
cin >> n >> m;
long long ans = 1;
for (long long i = m / n; i > 0; i--) {
long long a = max(m - i * n, i);
long long b = min(m - i * n, i);
long long cmp = gcd(a, b);
ans = max(ans, cmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long n, m;
cin >> n >> m;
long long ans = 1;
for (long long i = m / n; i > 0; i--) {
if ((m - i * n) % i == 0) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
} | replace | 16 | 20 | 16 | 20 | TLE | |
p03241 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef map<ll, ll> M;
const ll INF = 1e9 + 100;
const ll MOD = 1e9 + 7;
ll n, m, m_;
V ya, pr;
vector<P> ps;
vector<ll> prime(ll n) {
vector<bool> num;
vector<ll> p;
for (ll i = 0; i <= n + 10; i++)
num.push_back(true);
FOR(i, 2, n) {
if (!num[i])
continue;
p.push_back(i);
for (ll j = i * 2; j <= n; j += i) {
num[j] = false;
}
}
return p;
}
ll solve(ll pos, ll val) {
ll hoge = m_;
if (pos == ps.size() - 1) {
REP(i, ps[pos].first + 1) {
ll hoge_ = val * pow(ps[pos].second, i);
if (hoge_ >= n) {
hoge = min(hoge_, hoge);
}
}
return hoge;
}
REP(i, ps[pos].first + 1) {
ll hoge_ = solve(pos + 1, val * pow(ps[pos].second, i));
if (hoge_ >= n)
hoge = min(hoge_, hoge);
}
return hoge;
}
int main() {
pr = prime(1000000);
cin >> n >> m;
m_ = m;
ll ind = 0;
while (m > 1) {
if (m % pr[ind] != 0) {
ind++;
if (ind >= pr.size()) {
ya.push_back(m);
ps.push_back(P(1, m));
m = 1;
}
} else {
m /= pr[ind];
ya.push_back(pr[ind]);
if (ps.size() == 0 || ps[ps.size() - 1].second != pr[ind]) {
ps.push_back(P(0, pr[ind]));
}
ps[ps.size() - 1].first++;
}
}
cout << m_ / solve(0, 1) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef map<ll, ll> M;
const ll INF = 1e9 + 100;
const ll MOD = 1e9 + 7;
ll n, m, m_;
V ya, pr;
vector<P> ps;
vector<ll> prime(ll n) {
vector<bool> num;
vector<ll> p;
for (ll i = 0; i <= n + 10; i++)
num.push_back(true);
FOR(i, 2, n) {
if (!num[i])
continue;
p.push_back(i);
for (ll j = i * 2; j <= n; j += i) {
num[j] = false;
}
}
return p;
}
ll solve(ll pos, ll val) {
ll hoge = m_;
if (pos == ps.size() - 1) {
REP(i, ps[pos].first + 1) {
ll hoge_ = val * pow(ps[pos].second, i);
if (hoge_ >= n) {
hoge = min(hoge_, hoge);
}
}
return hoge;
}
REP(i, ps[pos].first + 1) {
ll hoge_ = solve(pos + 1, val * pow(ps[pos].second, i));
if (hoge_ >= n)
hoge = min(hoge_, hoge);
}
return hoge;
}
int main() {
pr = prime(1000000);
cin >> n >> m;
m_ = m;
if (m == 1) {
cout << 1 << endl;
return 0;
}
ll ind = 0;
while (m > 1) {
if (m % pr[ind] != 0) {
ind++;
if (ind >= pr.size()) {
ya.push_back(m);
ps.push_back(P(1, m));
m = 1;
}
} else {
m /= pr[ind];
ya.push_back(pr[ind]);
if (ps.size() == 0 || ps[ps.size() - 1].second != pr[ind]) {
ps.push_back(P(0, pr[ind]));
}
ps[ps.size() - 1].first++;
}
}
cout << m_ / solve(0, 1) << endl;
return 0;
} | insert | 80 | 80 | 80 | 85 | 0 | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
register int n, m, ans;
cin >> n >> m;
for (register int i = m; i >= 1; i--) {
if (m / i >= n && m % i == 0) {
ans = i;
break;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
register int n, m, ans;
cin >> n >> m;
for (register int i = m / n; i >= 1; i--) {
if (m / i >= n && m % i == 0) {
ans = i;
break;
}
}
cout << ans;
return 0;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p03241 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll N, M;
cin >> N >> M;
ll ans = 1;
for (ll x = 1; x * x <= M; x++) {
if (M % x == 0 && x * N <= M) {
ans = max(ans, x);
}
ll y = N / x;
if (M % y == 0 && y * N <= M) {
ans = max(ans, y);
}
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll N, M;
cin >> N >> M;
ll ans = 1;
for (ll x = 1; x * x <= M; x++) {
if (M % x == 0 && x * N <= M) {
ans = max(ans, x);
}
ll y = M / x;
if (M % y == 0 && y * N <= M) {
ans = max(ans, y);
}
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p03241 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl
const ll mod = 1e9 + 7;
const ll inf = 1e18;
void pV(vector<ll> A) {
cout << "[vector]" << endl;
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// input
int N, M;
cin >> N >> M;
vector<ll> devisorList;
// Mใฎ็ดๆฐใๆฑใใ & ็ญใใซใชใใชใใใฎใฏๅ
ฅใใชใ
ll sqrtM = sqrt(M);
ll M_N = M / N;
FOR(i, 1, sqrtM) {
if (M % i == 0) {
ll yaku0 = i;
if (yaku0 <= M_N) {
devisorList.push_back(yaku0);
}
ll yaku1 = M / i;
if (yaku1 <= M_N) {
devisorList.push_back(yaku1);
}
}
}
sort(ALL(devisorList));
ll len = devisorList.size();
p(devisorList[len - 1]);
return 0;
} | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl
const ll mod = 1e9 + 7;
const ll inf = 1e18;
void pV(vector<ll> A) {
cout << "[vector]" << endl;
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// input
int N, M;
cin >> N >> M;
vector<ll> devisorList;
// Mใฎ็ดๆฐใๆฑใใ & ็ญใใซใชใใชใใใฎใฏๅ
ฅใใชใ
ll sqrtM = sqrt(M);
ll M_N = M / N;
FOR(i, 1, sqrtM + 1) {
if (M % i == 0) {
ll yaku0 = i;
if (yaku0 <= M_N) {
devisorList.push_back(yaku0);
}
ll yaku1 = M / i;
if (yaku1 <= M_N) {
devisorList.push_back(yaku1);
}
}
}
sort(ALL(devisorList));
ll len = devisorList.size();
p(devisorList[len - 1]);
return 0;
} | replace | 49 | 50 | 49 | 50 | 0 | |
p03241 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const ll INF = 1LL << 60;
const int dh[4] = {1, 0, -1, 0};
const int dw[4] = {0, 1, 0, -1};
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 1; i * i <= m; i++) {
if (m % i != 0)
continue;
if (i <= (m - 1) / (n - 1))
chmax(ans, i);
if (m / i <= (m - 1) / (n - 1))
chmax(ans, m / i);
}
std::cout << ans << '\n';
}
| #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const ll INF = 1LL << 60;
const int dh[4] = {1, 0, -1, 0};
const int dw[4] = {0, 1, 0, -1};
int main() {
int n, m;
cin >> n >> m;
if (n == 1) {
std::cout << m << '\n';
return 0;
}
int ans = 0;
for (int i = 1; i * i <= m; i++) {
if (m % i != 0)
continue;
if (i <= (m - 1) / (n - 1))
chmax(ans, i);
if (m / i <= (m - 1) / (n - 1))
chmax(ans, m / i);
}
std::cout << ans << '\n';
}
| insert | 47 | 47 | 47 | 51 | 0 | |
p03241 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> veca;
int main() {
cin >> n >> m;
for (int i = 1; i < sqrt(m); i++) {
if (m % i == 0) {
if ((m / (m / i)) >= n)
veca.push_back(m / i);
if ((m / i) >= n)
veca.push_back(i);
}
}
sort(veca.begin(), veca.end());
cout << veca[veca.size() - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> veca;
int main() {
cin >> n >> m;
for (int i = 1; i <= sqrt(m); i++) {
if (m % i == 0) {
if ((m / (m / i)) >= n)
veca.push_back(m / i);
if ((m / i) >= n)
veca.push_back(i);
}
}
sort(veca.begin(), veca.end());
cout << veca[veca.size() - 1] << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
ll ans = 1;
for (ll i = n; i <= m; i++) {
if (m % i == 0)
ans = max(ans, m / i);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
ll ans = 1;
for (ll i = 2; i * i <= m; i++) {
if (m % i == 0) {
if (i >= n)
ans = max(ans, m / i);
if (m / i >= n)
ans = max(ans, i);
}
}
cout << ans << endl;
return 0;
} | replace | 30 | 33 | 30 | 37 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (int i = 0; i < (ll)rept; ++i)
typedef long long ll;
using namespace std;
int main() {
ll n = 0, m = 0;
cin >> n >> m;
if (n == 1) {
cout << m << endl;
return 0;
}
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (ll i = m / 2; i >= 1; i--) {
if (m % i == 0 && m / i >= n) {
cout << i << endl;
return 0;
}
}
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (int i = 0; i < (ll)rept; ++i)
typedef long long ll;
using namespace std;
int main() {
ll n = 0, m = 0;
cin >> n >> m;
if (n == 1) {
cout << m << endl;
return 0;
}
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (ll i = 100000000; i >= 1; i--) {
if (m % i == 0 && m / i >= n) {
cout << i << endl;
return 0;
}
}
} | replace | 32 | 33 | 32 | 33 | TLE | |
p03241 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
vector<pair<ll, ll>> prime_factor(int64_t n) {
vector<pair<ll, ll>> ret;
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0)
ret.push_back(pair<ll, ll>(i, 0));
while (n % i == 0) {
ret.back().second++;
n /= i;
}
}
if (n != 1)
ret.push_back(pair<ll, ll>(n, 1));
return ret;
}
int main() {
ll n, m;
cin >> n >> m;
auto primes = prime_factor(m);
vector<vector<ll>> dp(primes.size() + 1, vector<ll>(n + 1, -1));
dp[0][1] = 0;
REP(i, primes.size()) {
REP(j, n) if (dp[i][j] != -1) dp[i + 1][j] = 0;
dp[i + 1][n] = dp[i][n];
REP(j, n) if (dp[i][j] != -1) {
if (j * primes[i].first >= n) {
if (dp[i + 1][n] == -1) {
dp[i + 1][n] = j * primes[i].first;
} else {
dp[i + 1][n] = min(dp[i + 1][n], j * primes[i].first);
}
} else if (dp[i + 1][j * primes[i].first] != 0) {
dp[i + 1][j * primes[i].first] = 1;
}
}
REP(j, n) if (dp[i + 1][j] != -1) {
if (dp[i + 1][j] >= primes[i].second)
continue;
if (j * primes[i].first >= n) {
if (dp[i + 1][n] == -1) {
dp[i + 1][n] = j * primes[i].first;
} else {
dp[i + 1][n] = min(dp[i + 1][n], j * primes[i].first);
}
} else if (dp[i + 1][j] + 1 < dp[i + 1][j * primes[i].first]) {
dp[i + 1][j * primes[i].first] = dp[i + 1][j] + 1;
} else if (dp[i + 1][j * primes[i].first] == -1) {
dp[i + 1][j * primes[i].first] = dp[i + 1][j] + 1;
}
}
}
cout << m / dp[primes.size()][n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
vector<pair<ll, ll>> prime_factor(int64_t n) {
vector<pair<ll, ll>> ret;
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0)
ret.push_back(pair<ll, ll>(i, 0));
while (n % i == 0) {
ret.back().second++;
n /= i;
}
}
if (n != 1)
ret.push_back(pair<ll, ll>(n, 1));
return ret;
}
int main() {
ll n, m;
cin >> n >> m;
auto primes = prime_factor(m);
vector<vector<ll>> dp(primes.size() + 1, vector<ll>(n + 1, -1));
dp[0][1] = 1;
REP(i, primes.size()) {
REP(j, n) if (dp[i][j] != -1) dp[i + 1][j] = 0;
dp[i + 1][n] = dp[i][n];
REP(j, n) if (dp[i][j] != -1) {
if (j * primes[i].first >= n) {
if (dp[i + 1][n] == -1) {
dp[i + 1][n] = j * primes[i].first;
} else {
dp[i + 1][n] = min(dp[i + 1][n], j * primes[i].first);
}
} else if (dp[i + 1][j * primes[i].first] != 0) {
dp[i + 1][j * primes[i].first] = 1;
}
}
REP(j, n) if (dp[i + 1][j] != -1) {
if (dp[i + 1][j] >= primes[i].second)
continue;
if (j * primes[i].first >= n) {
if (dp[i + 1][n] == -1) {
dp[i + 1][n] = j * primes[i].first;
} else {
dp[i + 1][n] = min(dp[i + 1][n], j * primes[i].first);
}
} else if (dp[i + 1][j] + 1 < dp[i + 1][j * primes[i].first]) {
dp[i + 1][j * primes[i].first] = dp[i + 1][j] + 1;
} else if (dp[i + 1][j * primes[i].first] == -1) {
dp[i + 1][j * primes[i].first] = dp[i + 1][j] + 1;
}
}
}
cout << m / dp[primes.size()][n] << endl;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using namespace boost::multiprecision;
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
bool pairCompareSecond(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.second < secondElof.second;
}
// ๅๆนๅใธใฎ็งปๅใใฏใใซ
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct edge { // ใฐใฉใใซไฝฟใใคใ
ll from, to, cost;
};
typedef vector<vector<edge>> G;
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
int main() {
ll n, m;
cin >> n >> m;
for (ll i = m; i >= 1; i--) {
if (m % i == 0 and m / i >= n) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using namespace boost::multiprecision;
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
bool pairCompareSecond(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.second < secondElof.second;
}
// ๅๆนๅใธใฎ็งปๅใใฏใใซ
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
struct edge { // ใฐใฉใใซไฝฟใใคใ
ll from, to, cost;
};
typedef vector<vector<edge>> G;
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
int main() {
ll n, m;
cin >> n >> m;
for (ll i = m / n; i >= 1; i--) {
if (m % i == 0 and m / i >= n) {
cout << i << endl;
return 0;
}
}
return 0;
}
| replace | 50 | 51 | 50 | 51 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
// ใซใผใใใฏใญ
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; 0 <= i; i--)
// ๅ
ฅๅบๅ
#define SCOUT(x) cout << (x) << " "
#define VECCIN(x) \
for (auto &ele : (x)) \
cin >> ele
#define VECOUT(x) \
for (auto &ele : (x)) \
cout << ele << " "; \
cout << endl;
// ใใฎไป
#define ALL(obj) (obj).begin(), (obj).end()
#define P pair<int, int>
#define V vector<int>
#define M map<int, int>
#define S set<int>
#define PQ priority_queue<int>
#define PQG priority_queue<int, V, greater<int>>
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
for (ll i = m; 1 <= i; i--) {
if (m % i == 0 && m / i >= n) {
cout << i << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
// ใซใผใใใฏใญ
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; 0 <= i; i--)
// ๅ
ฅๅบๅ
#define SCOUT(x) cout << (x) << " "
#define VECCIN(x) \
for (auto &ele : (x)) \
cin >> ele
#define VECOUT(x) \
for (auto &ele : (x)) \
cout << ele << " "; \
cout << endl;
// ใใฎไป
#define ALL(obj) (obj).begin(), (obj).end()
#define P pair<int, int>
#define V vector<int>
#define M map<int, int>
#define S set<int>
#define PQ priority_queue<int>
#define PQG priority_queue<int, V, greater<int>>
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
for (ll i = m / n + 1; 1 <= i; i--) {
if (m % i == 0 && m / i >= n) {
cout << i << endl;
break;
}
}
return 0;
} | replace | 35 | 36 | 35 | 36 | TLE | |
p03241 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int isprime(int x) {
for (int p = 2; p * p <= x; p++)
if (x % p == 0)
return 0;
return 1;
}
int main() {
int N, M;
scanf("%d%d", &N, &M);
if (isprime(M)) {
printf("%d\n", 1);
return 1;
}
for (int n = N;; n++) {
if (M % n == 0) {
printf("%d\n", M / n);
break;
}
}
} | #include <iostream>
#include <vector>
using namespace std;
int isprime(int x) {
for (int p = 2; p * p <= x; p++)
if (x % p == 0)
return 0;
return 1;
}
int main() {
int N, M;
scanf("%d%d", &N, &M);
if (isprime(M)) {
printf("%d\n", 1);
return 0;
}
for (int n = N;; n++) {
if (M % n == 0) {
printf("%d\n", M / n);
break;
}
}
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IN1(x) \
ll x; \
cin >> x;
// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int)(lower_bound(s, t, x) - s)
#define UB(s, t, x) (int)(upper_bound(s, t, x) - s)
ll qp(ll a, ll b, int mo) {
ll ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp ? (a / temp * b) : 0;
}
int mDays[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = {1, -1, 0, 0, 1, 1, -1, -1}, dy8[] = {0, 0, -1, 1, -1, 1, -1, 1};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) {
return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);
const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);
template <typename T> vector<T> pows(int b, int n) {
vector<T> ret;
T x = 1;
while (ret.size() < n) {
ret.push_back(x);
x *= b;
}
return ret;
}
// find string "from" in "str", and replace them to "to"
void strReplace(std::string &str, const std::string &from,
const std::string &to) {
std::string::size_type pos = 0;
while (pos = str.find(from, pos), pos != std::string::npos) {
str.replace(pos, from.length(), to);
pos += to.length();
}
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
inline tuple<ll, ll> rotate45(tuple<ll, ll> point) {
ll x = get<0>(point), y = get<1>(point);
return tuple<ll, ll>(x + y, x - y);
}
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) {
return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}
template <typename T> vector<T> INPA(ll n) {
vector<T> x;
REP(i, n) {
T tmp;
cin >> tmp;
x.push_back(tmp);
}
return move(x);
}
template <typename T> void out(T o) { cout << o << endl; }
template <typename T> void out(vector<T> &out) {
REP(i, (int)out.size()) {
cout << out[i];
if (i == (int)out.size() - 1)
cout << endl;
else
cout << " ";
}
}
template <typename T> void out(vector<vector<T>> o) {
REP(i, o.size()) out(o[i]);
}
void YesNo(bool f) { cout << (f ? "Yes" : "No") << endl; }
void YESNO(bool f) { cout << (f ? "YES" : "NO") << endl; }
int main(void) {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
IN1(N);
IN1(M);
ll sm = ll(sqrt(M));
ll ans = 1;
for (int i = M / N; i >= 1; i--) {
if (M % i == 0) {
chmax(ans, ll(i));
}
}
out(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IN1(x) \
ll x; \
cin >> x;
// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int)(lower_bound(s, t, x) - s)
#define UB(s, t, x) (int)(upper_bound(s, t, x) - s)
ll qp(ll a, ll b, int mo) {
ll ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp ? (a / temp * b) : 0;
}
int mDays[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = {1, -1, 0, 0, 1, 1, -1, -1}, dy8[] = {0, 0, -1, 1, -1, 1, -1, 1};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) {
return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);
const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);
template <typename T> vector<T> pows(int b, int n) {
vector<T> ret;
T x = 1;
while (ret.size() < n) {
ret.push_back(x);
x *= b;
}
return ret;
}
// find string "from" in "str", and replace them to "to"
void strReplace(std::string &str, const std::string &from,
const std::string &to) {
std::string::size_type pos = 0;
while (pos = str.find(from, pos), pos != std::string::npos) {
str.replace(pos, from.length(), to);
pos += to.length();
}
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
inline tuple<ll, ll> rotate45(tuple<ll, ll> point) {
ll x = get<0>(point), y = get<1>(point);
return tuple<ll, ll>(x + y, x - y);
}
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) {
return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}
template <typename T> vector<T> INPA(ll n) {
vector<T> x;
REP(i, n) {
T tmp;
cin >> tmp;
x.push_back(tmp);
}
return move(x);
}
template <typename T> void out(T o) { cout << o << endl; }
template <typename T> void out(vector<T> &out) {
REP(i, (int)out.size()) {
cout << out[i];
if (i == (int)out.size() - 1)
cout << endl;
else
cout << " ";
}
}
template <typename T> void out(vector<vector<T>> o) {
REP(i, o.size()) out(o[i]);
}
void YesNo(bool f) { cout << (f ? "Yes" : "No") << endl; }
void YESNO(bool f) { cout << (f ? "YES" : "NO") << endl; }
int main(void) {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
IN1(N);
IN1(M);
ll sm = ll(sqrt(M));
ll ans = 1;
for (int i = M / N; i >= 1; i--) {
if (M % i == 0) {
out(i);
return 0;
}
}
out(ans);
return 0;
} | replace | 145 | 146 | 145 | 147 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans;
scanf("%d%d", &n, &m);
for (int i = 1; m / i >= n; i++)
if (m % i == 0)
ans = i;
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, ans;
scanf("%d%d", &n, &m);
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
if (i < n) {
if (m / i >= n)
ans = i;
} else {
ans = m / i;
break;
}
}
}
printf("%d\n", ans);
}
| replace | 6 | 9 | 6 | 17 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
int MOD = 1000000007;
signed main() {
int n, m;
cin >> n >> m;
vector<int> prime = {
2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
73, 79, 83, 89, 97, 101, 103, 107, 109, 113,
127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
283, 293, 307, 311, 313, 317, 331, 337, 347, 349,
353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
419, 421, 431, 433, 439, 443, 449, 457, 461, 463,
467, 479, 487, 491, 499, 503, 509, 521, 523, 541,
547, 557, 563, 569, 571, 577, 587, 593, 599, 601,
607, 613, 617, 619, 631, 641, 643, 647, 653, 659,
661, 673, 677, 683, 691, 701, 709, 719, 727, 733,
739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
811, 821, 823, 827, 829, 839, 853, 857, 859, 863,
877, 881, 883, 887, 907, 911, 919, 929, 937, 941,
947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013,
1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069,
1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151,
1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223,
1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291,
1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373,
1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451,
1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511,
1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583,
1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657,
1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733,
1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811,
1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889,
1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987,
1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053,
2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129,
2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213,
2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287,
2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357,
2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423,
2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531,
2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617,
2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687,
2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741,
2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819,
2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903,
2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999,
3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079,
3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181,
3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257,
3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331,
3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413,
3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511,
3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571,
3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643,
3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727,
3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821,
3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907,
3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989,
4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057,
4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139,
4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231,
4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297,
4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409,
4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493,
4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583,
4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657,
4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751,
4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831,
4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937,
4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003,
5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087,
5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179,
5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279,
5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387,
5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443,
5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521,
5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639,
5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693,
5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791,
5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857,
5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939,
5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053,
6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133,
6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221,
6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301,
6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367,
6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473,
6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571,
6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673,
6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761,
6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833,
6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917,
6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997,
7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103,
7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207,
7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297,
7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411,
7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499,
7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561,
7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643,
7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723,
7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829,
7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919,
7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017,
8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111,
8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219,
8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291,
8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387,
8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501,
8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597,
8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677,
8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741,
8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831,
8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929,
8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011,
9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109,
9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199,
9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283,
9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377,
9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439,
9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533,
9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631,
9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733,
9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811,
9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887,
9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973, 10007,
10009, 10037, 10039, 10061, 10067, 10069, 10079, 10091, 10093, 10099,
10103, 10111, 10133, 10139, 10141, 10151, 10159, 10163, 10169, 10177,
10181, 10193, 10211, 10223, 10243, 10247, 10253, 10259, 10267, 10271,
10273, 10289, 10301, 10303, 10313, 10321, 10331, 10333, 10337, 10343,
10357, 10369, 10391, 10399, 10427, 10429, 10433, 10453, 10457, 10459,
10463, 10477, 10487, 10499, 10501, 10513, 10529, 10531, 10559, 10567,
10589, 10597, 10601, 10607, 10613, 10627, 10631, 10639, 10651, 10657,
10663, 10667, 10687, 10691, 10709, 10711, 10723, 10729, 10733, 10739,
10753, 10771, 10781, 10789, 10799, 10831, 10837, 10847, 10853, 10859,
10861, 10867, 10883, 10889, 10891, 10903, 10909, 10937, 10939, 10949,
10957, 10973, 10979, 10987, 10993, 11003, 11027, 11047, 11057, 11059,
11069, 11071, 11083, 11087, 11093, 11113, 11117, 11119, 11131, 11149,
11159, 11161, 11171, 11173, 11177, 11197, 11213, 11239, 11243, 11251,
11257, 11261, 11273, 11279, 11287, 11299, 11311, 11317, 11321, 11329,
11351, 11353, 11369, 11383, 11393, 11399, 11411, 11423, 11437, 11443,
11447, 11467, 11471, 11483, 11489, 11491, 11497, 11503, 11519, 11527,
11549, 11551, 11579, 11587, 11593, 11597, 11617, 11621, 11633, 11657,
11677, 11681, 11689, 11699, 11701, 11717, 11719, 11731, 11743, 11777,
11779, 11783, 11789, 11801, 11807, 11813, 11821, 11827, 11831, 11833,
11839, 11863, 11867, 11887, 11897, 11903, 11909, 11923, 11927, 11933,
11939, 11941, 11953, 11959, 11969, 11971, 11981, 11987, 12007, 12011,
12037, 12041, 12043, 12049, 12071, 12073, 12097, 12101, 12107, 12109,
12113, 12119, 12143, 12149, 12157, 12161, 12163, 12197, 12203, 12211,
12227, 12239, 12241, 12251, 12253, 12263, 12269, 12277, 12281, 12289,
12301, 12323, 12329, 12343, 12347, 12373, 12377, 12379, 12391, 12401,
12409, 12413, 12421, 12433, 12437, 12451, 12457, 12473, 12479, 12487,
12491, 12497, 12503, 12511, 12517, 12527, 12539, 12541, 12547, 12553,
12569, 12577, 12583, 12589, 12601, 12611, 12613, 12619, 12637, 12641,
12647, 12653, 12659, 12671, 12689, 12697, 12703, 12713, 12721, 12739,
12743, 12757, 12763, 12781, 12791, 12799, 12809, 12821, 12823, 12829,
12841, 12853, 12889, 12893, 12899, 12907, 12911, 12917, 12919, 12923,
12941, 12953, 12959, 12967, 12973, 12979, 12983, 13001, 13003, 13007,
13009, 13033, 13037, 13043, 13049, 13063, 13093, 13099, 13103, 13109,
13121, 13127, 13147, 13151, 13159, 13163, 13171, 13177, 13183, 13187,
13217, 13219, 13229, 13241, 13249, 13259, 13267, 13291, 13297, 13309,
13313, 13327, 13331, 13337, 13339, 13367, 13381, 13397, 13399, 13411,
13417, 13421, 13441, 13451, 13457, 13463, 13469, 13477, 13487, 13499,
13513, 13523, 13537, 13553, 13567, 13577, 13591, 13597, 13613, 13619,
13627, 13633, 13649, 13669, 13679, 13681, 13687, 13691, 13693, 13697,
13709, 13711, 13721, 13723, 13729, 13751, 13757, 13759, 13763, 13781,
13789, 13799, 13807, 13829, 13831, 13841, 13859, 13873, 13877, 13879,
13883, 13901, 13903, 13907, 13913, 13921, 13931, 13933, 13963, 13967,
13997, 13999, 14009, 14011, 14029, 14033, 14051, 14057, 14071, 14081,
14083, 14087, 14107, 14143, 14149, 14153, 14159, 14173, 14177, 14197,
14207, 14221, 14243, 14249, 14251, 14281, 14293, 14303, 14321, 14323,
14327, 14341, 14347, 14369, 14387, 14389, 14401, 14407, 14411, 14419,
14423, 14431, 14437, 14447, 14449, 14461, 14479, 14489, 14503, 14519,
14533, 14537, 14543, 14549, 14551, 14557, 14561, 14563, 14591, 14593,
14621, 14627, 14629, 14633, 14639, 14653, 14657, 14669, 14683, 14699,
14713, 14717, 14723, 14731, 14737, 14741, 14747, 14753, 14759, 14767,
14771, 14779, 14783, 14797, 14813, 14821, 14827, 14831, 14843, 14851,
14867, 14869, 14879, 14887, 14891, 14897, 14923, 14929, 14939, 14947,
14951, 14957, 14969, 14983, 15013, 15017, 15031, 15053, 15061, 15073,
15077, 15083, 15091, 15101, 15107, 15121, 15131, 15137, 15139, 15149,
15161, 15173, 15187, 15193, 15199, 15217, 15227, 15233, 15241, 15259,
15263, 15269, 15271, 15277, 15287, 15289, 15299, 15307, 15313, 15319,
15329, 15331, 15349, 15359, 15361, 15373, 15377, 15383, 15391, 15401,
15413, 15427, 15439, 15443, 15451, 15461, 15467, 15473, 15493, 15497,
15511, 15527, 15541, 15551, 15559, 15569, 15581, 15583, 15601, 15607,
15619, 15629, 15641, 15643, 15647, 15649, 15661, 15667, 15671, 15679,
15683, 15727, 15731, 15733, 15737, 15739, 15749, 15761, 15767, 15773,
15787, 15791, 15797, 15803, 15809, 15817, 15823, 15859, 15877, 15881,
15887, 15889, 15901, 15907, 15913, 15919, 15923, 15937, 15959, 15971,
15973, 15991, 16001, 16007, 16033, 16057, 16061, 16063, 16067, 16069,
16073, 16087, 16091, 16097, 16103, 16111, 16127, 16139, 16141, 16183,
16187, 16189, 16193, 16217, 16223, 16229, 16231, 16249, 16253, 16267,
16273, 16301, 16319, 16333, 16339, 16349, 16361, 16363, 16369, 16381,
16411, 16417, 16421, 16427, 16433, 16447, 16451, 16453, 16477, 16481,
16487, 16493, 16519, 16529, 16547, 16553, 16561, 16567, 16573, 16603,
16607, 16619, 16631, 16633, 16649, 16651, 16657, 16661, 16673, 16691,
16693, 16699, 16703, 16729, 16741, 16747, 16759, 16763, 16787, 16811,
16823, 16829, 16831, 16843, 16871, 16879, 16883, 16889, 16901, 16903,
16921, 16927, 16931, 16937, 16943, 16963, 16979, 16981, 16987, 16993,
17011, 17021, 17027, 17029, 17033, 17041, 17047, 17053, 17077, 17093,
17099, 17107, 17117, 17123, 17137, 17159, 17167, 17183, 17189, 17191,
17203, 17207, 17209, 17231, 17239, 17257, 17291, 17293, 17299, 17317,
17321, 17327, 17333, 17341, 17351, 17359, 17377, 17383, 17387, 17389,
17393, 17401, 17417, 17419, 17431, 17443, 17449, 17467, 17471, 17477,
17483, 17489, 17491, 17497, 17509, 17519, 17539, 17551, 17569, 17573,
17579, 17581, 17597, 17599, 17609, 17623, 17627, 17657, 17659, 17669,
17681, 17683, 17707, 17713, 17729, 17737, 17747, 17749, 17761, 17783,
17789, 17791, 17807, 17827, 17837, 17839, 17851, 17863, 17881, 17891,
17903, 17909, 17911, 17921, 17923, 17929, 17939, 17957, 17959, 17971,
17977, 17981, 17987, 17989, 18013, 18041, 18043, 18047, 18049, 18059,
18061, 18077, 18089, 18097, 18119, 18121, 18127, 18131, 18133, 18143,
18149, 18169, 18181, 18191, 18199, 18211, 18217, 18223, 18229, 18233,
18251, 18253, 18257, 18269, 18287, 18289, 18301, 18307, 18311, 18313,
18329, 18341, 18353, 18367, 18371, 18379, 18397, 18401, 18413, 18427,
18433, 18439, 18443, 18451, 18457, 18461, 18481, 18493, 18503, 18517,
18521, 18523, 18539, 18541, 18553, 18583, 18587, 18593, 18617, 18637,
18661, 18671, 18679, 18691, 18701, 18713, 18719, 18731, 18743, 18749,
18757, 18773, 18787, 18793, 18797, 18803, 18839, 18859, 18869, 18899,
18911, 18913, 18917, 18919, 18947, 18959, 18973, 18979, 19001, 19009,
19013, 19031, 19037, 19051, 19069, 19073, 19079, 19081, 19087, 19121,
19139, 19141, 19157, 19163, 19181, 19183, 19207, 19211, 19213, 19219,
19231, 19237, 19249, 19259, 19267, 19273, 19289, 19301, 19309, 19319,
19333, 19373, 19379, 19381, 19387, 19391, 19403, 19417, 19421, 19423,
19427, 19429, 19433, 19441, 19447, 19457, 19463, 19469, 19471, 19477,
19483, 19489, 19501, 19507, 19531, 19541, 19543, 19553, 19559, 19571,
19577, 19583, 19597, 19603, 19609, 19661, 19681, 19687, 19697, 19699,
19709, 19717, 19727, 19739, 19751, 19753, 19759, 19763, 19777, 19793,
19801, 19813, 19819, 19841, 19843, 19853, 19861, 19867, 19889, 19891,
19913, 19919, 19927, 19937, 19949, 19961, 19963, 19973, 19979, 19991,
19993, 19997, 20011, 20021, 20023, 20029, 20047, 20051, 20063, 20071,
20089, 20101, 20107, 20113, 20117, 20123, 20129, 20143, 20147, 20149,
20161, 20173, 20177, 20183, 20201, 20219, 20231, 20233, 20249, 20261,
20269, 20287, 20297, 20323, 20327, 20333, 20341, 20347, 20353, 20357,
20359, 20369, 20389, 20393, 20399, 20407, 20411, 20431, 20441, 20443,
20477, 20479, 20483, 20507, 20509, 20521, 20533, 20543, 20549, 20551,
20563, 20593, 20599, 20611, 20627, 20639, 20641, 20663, 20681, 20693,
20707, 20717, 20719, 20731, 20743, 20747, 20749, 20753, 20759, 20771,
20773, 20789, 20807, 20809, 20849, 20857, 20873, 20879, 20887, 20897,
20899, 20903, 20921, 20929, 20939, 20947, 20959, 20963, 20981, 20983,
21001, 21011, 21013, 21017, 21019, 21023, 21031, 21059, 21061, 21067,
21089, 21101, 21107, 21121, 21139, 21143, 21149, 21157, 21163, 21169,
21179, 21187, 21191, 21193, 21211, 21221, 21227, 21247, 21269, 21277,
21283, 21313, 21317, 21319, 21323, 21341, 21347, 21377, 21379, 21383,
21391, 21397, 21401, 21407, 21419, 21433, 21467, 21481, 21487, 21491,
21493, 21499, 21503, 21517, 21521, 21523, 21529, 21557, 21559, 21563,
21569, 21577, 21587, 21589, 21599, 21601, 21611, 21613, 21617, 21647,
21649, 21661, 21673, 21683, 21701, 21713, 21727, 21737, 21739, 21751,
21757, 21767, 21773, 21787, 21799, 21803, 21817, 21821, 21839, 21841,
21851, 21859, 21863, 21871, 21881, 21893, 21911, 21929, 21937, 21943,
21961, 21977, 21991, 21997, 22003, 22013, 22027, 22031, 22037, 22039,
22051, 22063, 22067, 22073, 22079, 22091, 22093, 22109, 22111, 22123,
22129, 22133, 22147, 22153, 22157, 22159, 22171, 22189, 22193, 22229,
22247, 22259, 22271, 22273, 22277, 22279, 22283, 22291, 22303, 22307,
22343, 22349, 22367, 22369, 22381, 22391, 22397, 22409, 22433, 22441,
22447, 22453, 22469, 22481, 22483, 22501, 22511, 22531, 22541, 22543,
22549, 22567, 22571, 22573, 22613, 22619, 22621, 22637, 22639, 22643,
22651, 22669, 22679, 22691, 22697, 22699, 22709, 22717, 22721, 22727,
22739, 22741, 22751, 22769, 22777, 22783, 22787, 22807, 22811, 22817,
22853, 22859, 22861, 22871, 22877, 22901, 22907, 22921, 22937, 22943,
22961, 22963, 22973, 22993, 23003, 23011, 23017, 23021, 23027, 23029,
23039, 23041, 23053, 23057, 23059, 23063, 23071, 23081, 23087, 23099,
23117, 23131, 23143, 23159, 23167, 23173, 23189, 23197, 23201, 23203,
23209, 23227, 23251, 23269, 23279, 23291, 23293, 23297, 23311, 23321,
23327, 23333, 23339, 23357, 23369, 23371, 23399, 23417, 23431, 23447,
23459, 23473, 23497, 23509, 23531, 23537, 23539, 23549, 23557, 23561,
23563, 23567, 23581, 23593, 23599, 23603, 23609, 23623, 23627, 23629,
23633, 23663, 23669, 23671, 23677, 23687, 23689, 23719, 23741, 23743,
23747, 23753, 23761, 23767, 23773, 23789, 23801, 23813, 23819, 23827,
23831, 23833, 23857, 23869, 23873, 23879, 23887, 23893, 23899, 23909,
23911, 23917, 23929, 23957, 23971, 23977, 23981, 23993, 24001, 24007,
24019, 24023, 24029, 24043, 24049, 24061, 24071, 24077, 24083, 24091,
24097, 24103, 24107, 24109, 24113, 24121, 24133, 24137, 24151, 24169,
24179, 24181, 24197, 24203, 24223, 24229, 24239, 24247, 24251, 24281,
24317, 24329, 24337, 24359, 24371, 24373, 24379, 24391, 24407, 24413,
24419, 24421, 24439, 24443, 24469, 24473, 24481, 24499, 24509, 24517,
24527, 24533, 24547, 24551, 24571, 24593, 24611, 24623, 24631, 24659,
24671, 24677, 24683, 24691, 24697, 24709, 24733, 24749, 24763, 24767,
24781, 24793, 24799, 24809, 24821, 24841, 24847, 24851, 24859, 24877,
24889, 24907, 24917, 24919, 24923, 24943, 24953, 24967, 24971, 24977,
24979, 24989, 25013, 25031, 25033, 25037, 25057, 25073, 25087, 25097,
25111, 25117, 25121, 25127, 25147, 25153, 25163, 25169, 25171, 25183,
25189, 25219, 25229, 25237, 25243, 25247, 25253, 25261, 25301, 25303,
25307, 25309, 25321, 25339, 25343, 25349, 25357, 25367, 25373, 25391,
25409, 25411, 25423, 25439, 25447, 25453, 25457, 25463, 25469, 25471,
25523, 25537, 25541, 25561, 25577, 25579, 25583, 25589, 25601, 25603,
25609, 25621, 25633, 25639, 25643, 25657, 25667, 25673, 25679, 25693,
25703, 25717, 25733, 25741, 25747, 25759, 25763, 25771, 25793, 25799,
25801, 25819, 25841, 25847, 25849, 25867, 25873, 25889, 25903, 25913,
25919, 25931, 25933, 25939, 25943, 25951, 25969, 25981, 25997, 25999,
26003, 26017, 26021, 26029, 26041, 26053, 26083, 26099, 26107, 26111,
26113, 26119, 26141, 26153, 26161, 26171, 26177, 26183, 26189, 26203,
26209, 26227, 26237, 26249, 26251, 26261, 26263, 26267, 26293, 26297,
26309, 26317, 26321, 26339, 26347, 26357, 26371, 26387, 26393, 26399,
26407, 26417, 26423, 26431, 26437, 26449, 26459, 26479, 26489, 26497,
26501, 26513, 26539, 26557, 26561, 26573, 26591, 26597, 26627, 26633,
26641, 26647, 26669, 26681, 26683, 26687, 26693, 26699, 26701, 26711,
26713, 26717, 26723, 26729, 26731, 26737, 26759, 26777, 26783, 26801,
26813, 26821, 26833, 26839, 26849, 26861, 26863, 26879, 26881, 26891,
26893, 26903, 26921, 26927, 26947, 26951, 26953, 26959, 26981, 26987,
26993, 27011, 27017, 27031, 27043, 27059, 27061, 27067, 27073, 27077,
27091, 27103, 27107, 27109, 27127, 27143, 27179, 27191, 27197, 27211,
27239, 27241, 27253, 27259, 27271, 27277, 27281, 27283, 27299, 27329,
27337, 27361, 27367, 27397, 27407, 27409, 27427, 27431, 27437, 27449,
27457, 27479, 27481, 27487, 27509, 27527, 27529, 27539, 27541, 27551,
27581, 27583, 27611, 27617, 27631, 27647, 27653, 27673, 27689, 27691,
27697, 27701, 27733, 27737, 27739, 27743, 27749, 27751, 27763, 27767,
27773, 27779, 27791, 27793, 27799, 27803, 27809, 27817, 27823, 27827,
27847, 27851, 27883, 27893, 27901, 27917, 27919, 27941, 27943, 27947,
27953, 27961, 27967, 27983, 27997, 28001, 28019, 28027, 28031, 28051,
28057, 28069, 28081, 28087, 28097, 28099, 28109, 28111, 28123, 28151,
28163, 28181, 28183, 28201, 28211, 28219, 28229, 28277, 28279, 28283,
28289, 28297, 28307, 28309, 28319, 28349, 28351, 28387, 28393, 28403,
28409, 28411, 28429, 28433, 28439, 28447, 28463, 28477, 28493, 28499,
28513, 28517, 28537, 28541, 28547, 28549, 28559, 28571, 28573, 28579,
28591, 28597, 28603, 28607, 28619, 28621, 28627, 28631, 28643, 28649,
28657, 28661, 28663, 28669, 28687, 28697, 28703, 28711, 28723, 28729,
28751, 28753, 28759, 28771, 28789, 28793, 28807, 28813, 28817, 28837,
28843, 28859, 28867, 28871, 28879, 28901, 28909, 28921, 28927, 28933,
28949, 28961, 28979, 29009, 29017, 29021, 29023, 29027, 29033, 29059,
29063, 29077, 29101, 29123, 29129, 29131, 29137, 29147, 29153, 29167,
29173, 29179, 29191, 29201, 29207, 29209, 29221, 29231, 29243, 29251,
29269, 29287, 29297, 29303, 29311, 29327, 29333, 29339, 29347, 29363,
29383, 29387, 29389, 29399, 29401, 29411, 29423, 29429, 29437, 29443,
29453, 29473, 29483, 29501, 29527, 29531, 29537, 29567, 29569, 29573,
29581, 29587, 29599, 29611, 29629, 29633, 29641, 29663, 29669, 29671,
29683, 29717, 29723, 29741, 29753, 29759, 29761, 29789, 29803, 29819,
29833, 29837, 29851, 29863, 29867, 29873, 29879, 29881, 29917, 29921,
29927, 29947, 29959, 29983, 29989, 30011, 30013, 30029, 30047, 30059,
30071, 30089, 30091, 30097, 30103, 30109, 30113, 30119, 30133, 30137,
30139, 30161, 30169, 30181, 30187, 30197, 30203, 30211, 30223, 30241,
30253, 30259, 30269, 30271, 30293, 30307, 30313, 30319, 30323, 30341,
30347, 30367, 30389, 30391, 30403, 30427, 30431, 30449, 30467, 30469,
30491, 30493, 30497, 30509, 30517, 30529, 30539, 30553, 30557, 30559,
30577, 30593, 30631, 30637, 30643, 30649, 30661, 30671, 30677, 30689,
30697, 30703, 30707, 30713, 30727, 30757, 30763, 30773, 30781, 30803,
30809, 30817, 30829, 30839, 30841, 30851, 30853, 30859, 30869, 30871,
30881, 30893, 30911, 30931, 30937, 30941, 30949, 30971, 30977, 30983,
31013, 31019, 31033, 31039, 31051, 31063, 31069, 31079, 31081, 31091,
31121, 31123, 31139, 31147, 31151, 31153, 31159, 31177, 31181, 31183,
31189, 31193, 31219, 31223, 31231, 31237, 31247, 31249, 31253, 31259,
31267, 31271, 31277, 31307, 31319, 31321, 31327, 31333, 31337, 31357,
31379, 31387, 31391, 31393, 31397, 31469, 31477, 31481, 31489, 31511,
31513, 31517, 31531, 31541, 31543, 31547, 31567, 31573, 31583, 31601,
31607, 31627, 31643, 31649, 31657, 31663, 31667, 31687, 31699, 31721,
31723, 31727, 31729, 31741, 31751, 31769, 31771, 31793, 31799, 31817,
31847, 31849, 31859, 31873, 31883, 31891, 31907, 31957, 31963, 31973,
31981, 31991, 32003, 32009, 32027, 32029, 32051, 32057, 32059, 32063,
32069, 32077, 32083, 32089, 32099, 32117, 32119, 32141, 32143, 32159,
32173, 32183, 32189, 32191, 32203, 32213, 32233, 32237, 32251, 32257,
32261, 32297, 32299, 32303, 32309, 32321, 32323, 32327, 32341, 32353,
32359, 32363, 32369, 32371, 32377, 32381, 32401, 32411, 32413, 32423,
32429, 32441, 32443, 32467, 32479, 32491, 32497, 32503, 32507, 32531,
32533, 32537, 32561, 32563, 32569, 32573, 32579, 32587, 32603, 32609,
32611, 32621, 32633, 32647, 32653, 32687, 32693, 32707, 32713, 32717,
32719, 32749, 32771, 32779, 32783, 32789, 32797, 32801, 32803, 32831,
32833, 32839, 32843, 32869, 32887, 32909, 32911, 32917, 32933, 32939,
32941, 32957, 32969, 32971, 32983, 32987, 32993, 32999, 33013, 33023,
33029, 33037, 33049, 33053, 33071, 33073, 33083, 33091, 33107, 33113,
33119, 33149, 33151, 33161, 33179, 33181, 33191, 33199, 33203, 33211,
33223, 33247, 33287, 33289, 33301, 33311, 33317, 33329, 33331, 33343,
33347, 33349, 33353, 33359, 33377, 33391, 33403, 33409, 33413, 33427,
33457, 33461, 33469, 33479, 33487, 33493, 33503, 33521, 33529, 33533,
33547, 33563, 33569, 33577, 33581, 33587, 33589, 33599, 33601, 33613,
33617, 33619, 33623, 33629, 33637, 33641, 33647, 33679, 33703, 33713,
33721, 33739, 33749, 33751, 33757, 33767, 33769, 33773, 33791, 33797,
33809, 33811, 33827, 33829, 33851, 33857, 33863, 33871, 33889, 33893,
33911, 33923, 33931, 33937, 33941, 33961, 33967, 33997, 34019, 34031,
34033, 34039, 34057, 34061, 34123, 34127, 34129, 34141, 34147, 34157,
34159, 34171, 34183, 34211, 34213, 34217, 34231, 34253, 34259, 34261,
34267, 34273, 34283, 34297, 34301, 34303, 34313, 34319, 34327, 34337,
34351, 34361, 34367, 34369, 34381, 34403, 34421, 34429, 34439, 34457,
34469, 34471, 34483, 34487, 34499, 34501, 34511, 34513, 34519, 34537,
34543, 34549, 34583, 34589, 34591, 34603, 34607, 34613, 34631, 34649,
34651, 34667, 34673, 34679, 34687, 34693, 34703, 34721, 34729, 34739,
34747, 34757, 34759, 34763, 34781, 34807, 34819, 34841, 34843, 34847,
34849, 34871, 34877, 34883, 34897, 34913, 34919, 34939, 34949, 34961,
34963, 34981, 35023, 35027, 35051, 35053, 35059, 35069, 35081, 35083,
35089, 35099, 35107, 35111, 35117, 35129, 35141, 35149, 35153, 35159,
35171, 35201, 35221, 35227, 35251, 35257, 35267, 35279, 35281, 35291,
35311, 35317, 35323, 35327, 35339, 35353, 35363, 35381, 35393, 35401,
35407, 35419, 35423, 35437, 35447, 35449, 35461, 35491, 35507, 35509,
35521, 35527, 35531, 35533, 35537, 35543, 35569, 35573, 35591, 35593,
35597, 35603, 35617, 35671, 35677, 35729, 35731, 35747, 35753, 35759,
35771, 35797, 35801, 35803, 35809, 35831, 35837, 35839, 35851, 35863,
35869, 35879, 35897, 35899, 35911, 35923, 35933, 35951, 35963, 35969,
35977, 35983, 35993, 35999, 36007, 36011, 36013, 36017, 36037, 36061,
36067, 36073, 36083, 36097, 36107, 36109, 36131, 36137, 36151, 36161,
36187, 36191, 36209, 36217, 36229, 36241, 36251, 36263, 36269, 36277,
36293, 36299, 36307, 36313, 36319, 36341, 36343, 36353, 36373, 36383,
36389, 36433, 36451, 36457, 36467, 36469, 36473, 36479, 36493, 36497,
36523, 36527, 36529, 36541, 36551, 36559, 36563, 36571, 36583, 36587,
36599, 36607, 36629, 36637, 36643, 36653, 36671, 36677, 36683, 36691,
36697, 36709, 36713, 36721, 36739, 36749, 36761, 36767, 36779, 36781,
36787, 36791, 36793, 36809, 36821, 36833, 36847, 36857, 36871, 36877,
36887, 36899, 36901, 36913, 36919, 36923, 36929, 36931, 36943, 36947,
36973, 36979, 36997, 37003, 37013, 37019, 37021, 37039, 37049, 37057,
37061, 37087, 37097, 37117, 37123, 37139, 37159, 37171, 37181, 37189,
37199, 37201, 37217, 37223, 37243, 37253, 37273, 37277, 37307, 37309,
37313, 37321, 37337, 37339, 37357, 37361, 37363, 37369, 37379, 37397,
37409, 37423, 37441, 37447, 37463, 37483, 37489, 37493, 37501, 37507,
37511, 37517, 37529, 37537, 37547, 37549, 37561, 37567, 37571, 37573,
37579, 37589, 37591, 37607, 37619, 37633, 37643, 37649, 37657, 37663,
37691, 37693, 37699, 37717, 37747, 37781, 37783, 37799, 37811, 37813,
37831, 37847, 37853, 37861, 37871, 37879, 37889, 37897, 37907, 37951,
37957, 37963, 37967, 37987, 37991, 37993, 37997, 38011, 38039, 38047,
38053, 38069, 38083, 38113, 38119, 38149, 38153, 38167, 38177, 38183,
38189, 38197, 38201, 38219, 38231, 38237, 38239, 38261, 38273, 38281,
38287, 38299, 38303, 38317, 38321, 38327, 38329, 38333, 38351, 38371,
38377, 38393, 38431, 38447, 38449, 38453, 38459, 38461, 38501, 38543,
38557, 38561, 38567, 38569, 38593, 38603, 38609, 38611, 38629, 38639,
38651, 38653, 38669, 38671, 38677, 38693, 38699, 38707, 38711, 38713,
38723, 38729, 38737, 38747, 38749, 38767, 38783, 38791, 38803, 38821,
38833, 38839, 38851, 38861, 38867, 38873, 38891, 38903, 38917, 38921,
38923, 38933, 38953, 38959, 38971, 38977, 38993, 39019, 39023, 39041,
39043, 39047, 39079, 39089, 39097, 39103, 39107, 39113, 39119, 39133,
39139, 39157, 39161, 39163, 39181, 39191, 39199, 39209, 39217, 39227,
39229, 39233, 39239, 39241, 39251, 39293, 39301, 39313, 39317, 39323,
39341, 39343, 39359, 39367, 39371, 39373, 39383, 39397, 39409, 39419,
39439, 39443, 39451, 39461, 39499, 39503, 39509, 39511, 39521, 39541,
39551, 39563, 39569, 39581, 39607, 39619, 39623, 39631, 39659, 39667,
39671, 39679, 39703, 39709, 39719, 39727, 39733, 39749, 39761, 39769,
39779, 39791, 39799, 39821, 39827, 39829, 39839, 39841, 39847, 39857,
39863, 39869, 39877, 39883, 39887, 39901, 39929, 39937, 39953, 39971,
39979, 39983, 39989, 40009, 40013, 40031, 40037, 40039, 40063, 40087,
40093, 40099, 40111, 40123, 40127, 40129, 40151, 40153, 40163, 40169,
40177, 40189, 40193, 40213, 40231, 40237, 40241, 40253, 40277, 40283,
40289, 40343, 40351, 40357, 40361, 40387, 40423, 40427, 40429, 40433,
40459, 40471, 40483, 40487, 40493, 40499, 40507, 40519, 40529, 40531,
40543, 40559, 40577, 40583, 40591, 40597, 40609, 40627, 40637, 40639,
40693, 40697, 40699, 40709, 40739, 40751, 40759, 40763, 40771, 40787,
40801, 40813, 40819, 40823, 40829, 40841, 40847, 40849, 40853, 40867,
40879, 40883, 40897, 40903, 40927, 40933, 40939, 40949, 40961, 40973,
40993, 41011, 41017, 41023, 41039, 41047, 41051, 41057, 41077, 41081,
41113, 41117, 41131, 41141, 41143, 41149, 41161, 41177, 41179, 41183,
41189, 41201, 41203, 41213, 41221, 41227, 41231, 41233, 41243, 41257,
41263, 41269, 41281, 41299, 41333, 41341, 41351, 41357, 41381, 41387,
41389, 41399, 41411, 41413, 41443, 41453, 41467, 41479, 41491, 41507,
41513, 41519, 41521, 41539, 41543, 41549, 41579, 41593, 41597, 41603,
41609, 41611, 41617, 41621, 41627, 41641, 41647, 41651, 41659, 41669,
41681, 41687, 41719, 41729, 41737, 41759, 41761, 41771, 41777, 41801,
41809, 41813, 41843, 41849, 41851, 41863, 41879, 41887, 41893, 41897,
41903, 41911, 41927, 41941, 41947, 41953, 41957, 41959, 41969, 41981,
41983, 41999, 42013, 42017, 42019, 42023, 42043, 42061, 42071, 42073,
42083, 42089, 42101, 42131, 42139, 42157, 42169, 42179, 42181, 42187,
42193, 42197, 42209, 42221, 42223, 42227, 42239, 42257, 42281, 42283,
42293, 42299, 42307, 42323, 42331, 42337, 42349, 42359, 42373, 42379,
42391, 42397, 42403, 42407, 42409, 42433, 42437, 42443, 42451, 42457,
42461, 42463, 42467, 42473, 42487, 42491, 42499, 42509, 42533, 42557,
42569, 42571, 42577, 42589, 42611, 42641, 42643, 42649, 42667, 42677,
42683, 42689, 42697, 42701, 42703, 42709, 42719, 42727, 42737, 42743,
42751, 42767, 42773, 42787, 42793, 42797, 42821, 42829, 42839, 42841,
42853, 42859, 42863, 42899, 42901, 42923, 42929, 42937, 42943, 42953,
42961, 42967, 42979, 42989, 43003, 43013, 43019, 43037, 43049, 43051,
43063, 43067, 43093, 43103, 43117, 43133, 43151, 43159, 43177, 43189,
43201, 43207, 43223, 43237, 43261, 43271, 43283, 43291, 43313, 43319,
43321, 43331, 43391, 43397, 43399, 43403, 43411, 43427, 43441, 43451,
43457, 43481, 43487, 43499, 43517, 43541, 43543, 43573, 43577, 43579,
43591, 43597, 43607, 43609, 43613, 43627, 43633, 43649, 43651, 43661,
43669, 43691, 43711, 43717, 43721, 43753, 43759, 43777, 43781, 43783,
43787, 43789, 43793, 43801, 43853, 43867, 43889, 43891, 43913, 43933,
43943, 43951, 43961, 43963, 43969, 43973, 43987, 43991, 43997, 44017,
44021, 44027, 44029, 44041, 44053, 44059, 44071, 44087, 44089, 44101,
44111, 44119, 44123, 44129, 44131, 44159, 44171, 44179, 44189, 44201,
44203, 44207, 44221, 44249, 44257, 44263, 44267, 44269, 44273, 44279,
44281, 44293, 44351, 44357, 44371, 44381, 44383, 44389, 44417, 44449,
44453, 44483, 44491, 44497, 44501, 44507, 44519, 44531, 44533, 44537,
44543, 44549, 44563, 44579, 44587, 44617, 44621, 44623, 44633, 44641,
44647, 44651, 44657, 44683, 44687, 44699, 44701, 44711, 44729, 44741,
44753, 44771, 44773, 44777, 44789, 44797, 44809, 44819, 44839, 44843,
44851, 44867, 44879, 44887, 44893, 44909, 44917, 44927, 44939, 44953,
44959, 44963, 44971, 44983, 44987, 45007, 45013, 45053, 45061, 45077,
45083, 45119, 45121, 45127, 45131, 45137, 45139, 45161, 45179, 45181,
45191, 45197, 45233, 45247, 45259, 45263, 45281, 45289, 45293, 45307,
45317, 45319, 45329, 45337, 45341, 45343, 45361, 45377, 45389, 45403,
45413, 45427, 45433, 45439, 45481, 45491, 45497, 45503, 45523, 45533,
45541, 45553, 45557, 45569, 45587, 45589, 45599, 45613, 45631, 45641,
45659, 45667, 45673, 45677, 45691, 45697, 45707, 45737, 45751, 45757,
45763, 45767, 45779, 45817, 45821, 45823, 45827, 45833, 45841, 45853,
45863, 45869, 45887, 45893, 45943, 45949, 45953, 45959, 45971, 45979,
45989, 46021, 46027, 46049, 46051, 46061, 46073, 46091, 46093, 46099,
46103, 46133, 46141, 46147, 46153, 46171, 46181, 46183, 46187, 46199,
46219, 46229, 46237, 46261, 46271, 46273, 46279, 46301, 46307, 46309,
46327, 46337, 46349, 46351, 46381, 46399, 46411, 46439, 46441, 46447,
46451, 46457, 46471, 46477, 46489, 46499, 46507, 46511, 46523, 46549,
46559, 46567, 46573, 46589, 46591, 46601, 46619, 46633, 46639, 46643,
46649, 46663, 46679, 46681, 46687, 46691, 46703, 46723, 46727, 46747,
46751, 46757, 46769, 46771, 46807, 46811, 46817, 46819, 46829, 46831,
46853, 46861, 46867, 46877, 46889, 46901, 46919, 46933, 46957, 46993,
46997, 47017, 47041, 47051, 47057, 47059, 47087, 47093, 47111, 47119,
47123, 47129, 47137, 47143, 47147, 47149, 47161, 47189, 47207, 47221,
47237, 47251, 47269, 47279, 47287, 47293, 47297, 47303, 47309, 47317,
47339, 47351, 47353, 47363, 47381, 47387, 47389, 47407, 47417, 47419,
47431, 47441, 47459, 47491, 47497, 47501, 47507, 47513, 47521, 47527,
47533, 47543, 47563, 47569, 47581, 47591, 47599, 47609, 47623, 47629,
47639, 47653, 47657, 47659, 47681, 47699, 47701, 47711, 47713, 47717,
47737, 47741, 47743, 47777, 47779, 47791, 47797, 47807, 47809, 47819,
47837, 47843, 47857, 47869, 47881, 47903, 47911, 47917, 47933, 47939,
47947, 47951, 47963, 47969, 47977, 47981, 48017, 48023, 48029, 48049,
48073, 48079, 48091, 48109, 48119, 48121, 48131, 48157, 48163, 48179,
48187, 48193, 48197, 48221, 48239, 48247, 48259, 48271, 48281, 48299,
48311, 48313, 48337, 48341, 48353, 48371, 48383, 48397, 48407, 48409,
48413, 48437, 48449, 48463, 48473, 48479, 48481, 48487, 48491, 48497,
48523, 48527, 48533, 48539, 48541, 48563, 48571, 48589, 48593, 48611,
48619, 48623, 48647, 48649, 48661, 48673, 48677, 48679, 48731, 48733,
48751, 48757, 48761, 48767, 48779, 48781, 48787, 48799, 48809, 48817,
48821, 48823, 48847, 48857, 48859, 48869, 48871, 48883, 48889, 48907,
48947, 48953, 48973, 48989, 48991, 49003, 49009, 49019, 49031, 49033,
49037, 49043, 49057, 49069, 49081, 49103, 49109, 49117, 49121, 49123,
49139, 49157, 49169, 49171, 49177, 49193, 49199, 49201, 49207, 49211,
49223, 49253, 49261, 49277, 49279, 49297, 49307, 49331, 49333, 49339,
49363, 49367, 49369, 49391, 49393, 49409, 49411, 49417, 49429, 49433,
49451, 49459, 49463, 49477, 49481, 49499, 49523, 49529, 49531, 49537,
49547, 49549, 49559, 49597, 49603, 49613, 49627, 49633, 49639, 49663,
49667, 49669, 49681, 49697, 49711, 49727, 49739, 49741, 49747, 49757,
49783, 49787, 49789, 49801, 49807, 49811, 49823, 49831, 49843, 49853,
49871, 49877, 49891, 49919, 49921, 49927, 49937, 49939, 49943, 49957,
49991, 49993, 49999, 50021, 50023, 50033, 50047, 50051, 50053, 50069,
50077, 50087, 50093, 50101, 50111, 50119, 50123, 50129, 50131, 50147,
50153, 50159, 50177, 50207, 50221, 50227, 50231, 50261, 50263, 50273,
50287, 50291, 50311, 50321, 50329, 50333, 50341, 50359, 50363, 50377,
50383, 50387, 50411, 50417, 50423, 50441, 50459, 50461, 50497, 50503,
50513, 50527, 50539, 50543, 50549, 50551, 50581, 50587, 50591, 50593,
50599, 50627, 50647, 50651, 50671, 50683, 50707, 50723, 50741, 50753,
50767, 50773, 50777, 50789, 50821, 50833, 50839, 50849, 50857, 50867,
50873, 50891, 50893, 50909, 50923, 50929, 50951, 50957, 50969, 50971,
50989, 50993, 51001, 51031, 51043, 51047, 51059, 51061, 51071, 51109,
51131, 51133, 51137, 51151, 51157, 51169, 51193, 51197, 51199, 51203,
51217, 51229, 51239, 51241, 51257, 51263, 51283, 51287, 51307, 51329,
51341, 51343, 51347, 51349, 51361, 51383, 51407, 51413, 51419, 51421,
51427, 51431, 51437, 51439, 51449, 51461, 51473, 51479, 51481, 51487,
51503, 51511, 51517, 51521, 51539, 51551, 51563, 51577, 51581, 51593,
51599, 51607, 51613, 51631, 51637, 51647, 51659, 51673, 51679, 51683,
51691, 51713, 51719, 51721, 51749, 51767, 51769, 51787, 51797, 51803,
51817, 51827, 51829, 51839, 51853, 51859, 51869, 51871, 51893, 51899,
51907, 51913, 51929, 51941, 51949, 51971, 51973, 51977, 51991, 52009,
52021, 52027, 52051, 52057, 52067, 52069, 52081, 52103, 52121, 52127,
52147, 52153, 52163, 52177, 52181, 52183, 52189, 52201, 52223, 52237,
52249, 52253, 52259, 52267, 52289, 52291, 52301, 52313, 52321, 52361,
52363, 52369, 52379, 52387, 52391, 52433, 52453, 52457, 52489, 52501,
52511, 52517, 52529, 52541, 52543, 52553, 52561, 52567, 52571, 52579,
52583, 52609, 52627, 52631, 52639, 52667, 52673, 52691, 52697, 52709,
52711, 52721, 52727, 52733, 52747, 52757, 52769, 52783, 52807, 52813,
52817, 52837, 52859, 52861, 52879, 52883, 52889, 52901, 52903, 52919,
52937, 52951, 52957, 52963, 52967, 52973, 52981, 52999, 53003, 53017,
53047, 53051, 53069, 53077, 53087, 53089, 53093, 53101, 53113, 53117,
53129, 53147, 53149, 53161, 53171, 53173, 53189, 53197, 53201, 53231,
53233, 53239, 53267, 53269, 53279, 53281, 53299, 53309, 53323, 53327,
53353, 53359, 53377, 53381, 53401, 53407, 53411, 53419, 53437, 53441,
53453, 53479, 53503, 53507, 53527, 53549, 53551, 53569, 53591, 53593,
53597, 53609, 53611, 53617, 53623, 53629, 53633, 53639, 53653, 53657,
53681, 53693, 53699, 53717, 53719, 53731, 53759, 53773, 53777, 53783,
53791, 53813, 53819, 53831, 53849, 53857, 53861, 53881, 53887, 53891,
53897, 53899, 53917, 53923, 53927, 53939, 53951, 53959, 53987, 53993,
54001, 54011, 54013, 54037, 54049, 54059, 54083, 54091, 54101, 54121,
54133, 54139, 54151, 54163, 54167, 54181, 54193, 54217, 54251, 54269,
54277, 54287, 54293, 54311, 54319, 54323, 54331, 54347, 54361, 54367,
54371, 54377, 54401, 54403, 54409, 54413, 54419, 54421, 54437, 54443,
54449, 54469, 54493, 54497, 54499, 54503, 54517, 54521, 54539, 54541,
54547, 54559, 54563, 54577, 54581, 54583, 54601, 54617, 54623, 54629,
54631, 54647, 54667, 54673, 54679, 54709, 54713, 54721, 54727, 54751,
54767, 54773, 54779, 54787, 54799, 54829, 54833, 54851, 54869, 54877,
54881, 54907, 54917, 54919, 54941, 54949, 54959, 54973, 54979, 54983,
55001, 55009, 55021, 55049, 55051, 55057, 55061, 55073, 55079, 55103,
55109, 55117, 55127, 55147, 55163, 55171, 55201, 55207, 55213, 55217,
55219, 55229, 55243, 55249, 55259, 55291, 55313, 55331, 55333, 55337,
55339, 55343, 55351, 55373, 55381, 55399, 55411, 55439, 55441, 55457,
55469, 55487, 55501, 55511, 55529, 55541, 55547, 55579, 55589, 55603,
55609, 55619, 55621, 55631, 55633, 55639, 55661, 55663, 55667, 55673,
55681, 55691, 55697, 55711, 55717, 55721, 55733, 55763, 55787, 55793,
55799, 55807, 55813, 55817, 55819, 55823, 55829, 55837, 55843, 55849,
55871, 55889, 55897, 55901, 55903, 55921, 55927, 55931, 55933, 55949,
55967, 55987, 55997, 56003, 56009, 56039, 56041, 56053, 56081, 56087,
56093, 56099, 56101, 56113, 56123, 56131, 56149, 56167, 56171, 56179,
56197, 56207, 56209, 56237, 56239, 56249, 56263, 56267, 56269, 56299,
56311, 56333, 56359, 56369, 56377, 56383, 56393, 56401, 56417, 56431,
56437, 56443, 56453, 56467, 56473, 56477, 56479, 56489, 56501, 56503,
56509, 56519, 56527, 56531, 56533, 56543, 56569, 56591, 56597, 56599,
56611, 56629, 56633, 56659, 56663, 56671, 56681, 56687, 56701, 56711,
56713, 56731, 56737, 56747, 56767, 56773, 56779, 56783, 56807, 56809,
56813, 56821, 56827, 56843, 56857, 56873, 56891, 56893, 56897, 56909,
56911, 56921, 56923, 56929, 56941, 56951, 56957, 56963, 56983, 56989,
56993, 56999, 57037, 57041, 57047, 57059, 57073, 57077, 57089, 57097,
57107, 57119, 57131, 57139, 57143, 57149, 57163, 57173, 57179, 57191,
57193, 57203, 57221, 57223, 57241, 57251, 57259, 57269, 57271, 57283,
57287, 57301, 57329, 57331, 57347, 57349, 57367, 57373, 57383, 57389,
57397, 57413, 57427, 57457, 57467, 57487, 57493, 57503, 57527, 57529,
57557, 57559, 57571, 57587, 57593, 57601, 57637, 57641, 57649, 57653,
57667, 57679, 57689, 57697, 57709, 57713, 57719, 57727, 57731, 57737,
57751, 57773, 57781, 57787, 57791, 57793, 57803, 57809, 57829, 57839,
57847, 57853, 57859, 57881, 57899, 57901, 57917, 57923, 57943, 57947,
57973, 57977, 57991, 58013, 58027, 58031, 58043, 58049, 58057, 58061,
58067, 58073, 58099, 58109, 58111, 58129, 58147, 58151, 58153, 58169,
58171, 58189, 58193, 58199, 58207, 58211, 58217, 58229, 58231, 58237,
58243, 58271, 58309, 58313, 58321, 58337, 58363, 58367, 58369, 58379,
58391, 58393, 58403, 58411, 58417, 58427, 58439, 58441, 58451, 58453,
58477, 58481, 58511, 58537, 58543, 58549, 58567, 58573, 58579, 58601,
58603, 58613, 58631, 58657, 58661, 58679, 58687, 58693, 58699, 58711,
58727, 58733, 58741, 58757, 58763, 58771, 58787, 58789, 58831, 58889,
58897, 58901, 58907, 58909, 58913, 58921, 58937, 58943, 58963, 58967,
58979, 58991, 58997, 59009, 59011, 59021, 59023, 59029, 59051, 59053,
59063, 59069, 59077, 59083, 59093, 59107, 59113, 59119, 59123, 59141,
59149, 59159, 59167, 59183, 59197, 59207, 59209, 59219, 59221, 59233,
59239, 59243, 59263, 59273, 59281, 59333, 59341, 59351, 59357, 59359,
59369, 59377, 59387, 59393, 59399, 59407, 59417, 59419, 59441, 59443,
59447, 59453, 59467, 59471, 59473, 59497, 59509, 59513, 59539, 59557,
59561, 59567, 59581, 59611, 59617, 59621, 59627, 59629, 59651, 59659,
59663, 59669, 59671, 59693, 59699, 59707, 59723, 59729, 59743, 59747,
59753, 59771, 59779, 59791, 59797, 59809, 59833, 59863, 59879, 59887,
59921, 59929, 59951, 59957, 59971, 59981, 59999, 60013, 60017, 60029,
60037, 60041, 60077, 60083, 60089, 60091, 60101, 60103, 60107, 60127,
60133, 60139, 60149, 60161, 60167, 60169, 60209, 60217, 60223, 60251,
60257, 60259, 60271, 60289, 60293, 60317, 60331, 60337, 60343, 60353,
60373, 60383, 60397, 60413, 60427, 60443, 60449, 60457, 60493, 60497,
60509, 60521, 60527, 60539, 60589, 60601, 60607, 60611, 60617, 60623,
60631, 60637, 60647, 60649, 60659, 60661, 60679, 60689, 60703, 60719,
60727, 60733, 60737, 60757, 60761, 60763, 60773, 60779, 60793, 60811,
60821, 60859, 60869, 60887, 60889, 60899, 60901, 60913, 60917, 60919,
60923, 60937, 60943, 60953, 60961, 61001, 61007, 61027, 61031, 61043,
61051, 61057, 61091, 61099, 61121, 61129, 61141, 61151, 61153, 61169,
61211, 61223, 61231, 61253, 61261, 61283, 61291, 61297, 61331, 61333,
61339, 61343, 61357, 61363, 61379, 61381, 61403, 61409, 61417, 61441,
61463, 61469, 61471, 61483, 61487, 61493, 61507, 61511, 61519, 61543,
61547, 61553, 61559, 61561, 61583, 61603, 61609, 61613, 61627, 61631,
61637, 61643, 61651, 61657, 61667, 61673, 61681, 61687, 61703, 61717,
61723, 61729, 61751, 61757, 61781, 61813, 61819, 61837, 61843, 61861,
61871, 61879, 61909, 61927, 61933, 61949, 61961, 61967, 61979, 61981,
61987, 61991, 62003, 62011, 62017, 62039, 62047, 62053, 62057, 62071,
62081, 62099, 62119, 62129, 62131, 62137, 62141, 62143, 62171, 62189,
62191, 62201, 62207, 62213, 62219, 62233, 62273, 62297, 62299, 62303,
62311, 62323, 62327, 62347, 62351, 62383, 62401, 62417, 62423, 62459,
62467, 62473, 62477, 62483, 62497, 62501, 62507, 62533, 62539, 62549,
62563, 62581, 62591, 62597, 62603, 62617, 62627, 62633, 62639, 62653,
62659, 62683, 62687, 62701, 62723, 62731, 62743, 62753, 62761, 62773,
62791, 62801, 62819, 62827, 62851, 62861, 62869, 62873, 62897, 62903,
62921, 62927, 62929, 62939, 62969, 62971, 62981, 62983, 62987, 62989,
63029, 63031, 63059, 63067, 63073, 63079, 63097, 63103, 63113, 63127,
63131, 63149, 63179, 63197, 63199, 63211, 63241, 63247, 63277, 63281,
63299, 63311, 63313, 63317, 63331, 63337, 63347, 63353, 63361, 63367,
63377, 63389, 63391, 63397, 63409, 63419, 63421, 63439, 63443, 63463,
63467, 63473, 63487, 63493, 63499, 63521, 63527, 63533, 63541, 63559,
63577, 63587, 63589, 63599, 63601, 63607, 63611, 63617, 63629, 63647,
63649, 63659, 63667, 63671, 63689, 63691, 63697, 63703, 63709, 63719,
63727, 63737, 63743, 63761, 63773, 63781, 63793, 63799, 63803, 63809,
63823, 63839, 63841, 63853, 63857, 63863, 63901, 63907, 63913, 63929,
63949, 63977, 63997, 64007, 64013, 64019, 64033, 64037, 64063, 64067,
64081, 64091, 64109, 64123, 64151, 64153, 64157, 64171, 64187, 64189,
64217, 64223, 64231, 64237, 64271, 64279, 64283, 64301, 64303, 64319,
64327, 64333, 64373, 64381, 64399, 64403, 64433, 64439, 64451, 64453,
64483, 64489, 64499, 64513, 64553, 64567, 64577, 64579, 64591, 64601,
64609, 64613, 64621, 64627, 64633, 64661, 64663, 64667, 64679, 64693,
64709, 64717, 64747, 64763, 64781, 64783, 64793, 64811, 64817, 64849,
64853, 64871, 64877, 64879, 64891, 64901, 64919, 64921, 64927, 64937,
64951, 64969, 64997, 65003, 65011, 65027, 65029, 65033, 65053, 65063,
65071, 65089, 65099, 65101, 65111, 65119, 65123, 65129, 65141, 65147,
65167, 65171, 65173, 65179, 65183, 65203, 65213, 65239, 65257, 65267,
65269, 65287, 65293, 65309, 65323, 65327, 65353, 65357, 65371, 65381,
65393, 65407, 65413, 65419, 65423, 65437, 65447, 65449, 65479, 65497,
65519, 65521, 65537, 65539, 65543, 65551, 65557, 65563, 65579, 65581,
65587, 65599, 65609, 65617, 65629, 65633, 65647, 65651, 65657, 65677,
65687, 65699, 65701, 65707, 65713, 65717, 65719, 65729, 65731, 65761,
65777, 65789, 65809, 65827, 65831, 65837, 65839, 65843, 65851, 65867,
65881, 65899, 65921, 65927, 65929, 65951, 65957, 65963, 65981, 65983,
65993, 66029, 66037, 66041, 66047, 66067, 66071, 66083, 66089, 66103,
66107, 66109, 66137, 66161, 66169, 66173, 66179, 66191, 66221, 66239,
66271, 66293, 66301, 66337, 66343, 66347, 66359, 66361, 66373, 66377,
66383, 66403, 66413, 66431, 66449, 66457, 66463, 66467, 66491, 66499,
66509, 66523, 66529, 66533, 66541, 66553, 66569, 66571, 66587, 66593,
66601, 66617, 66629, 66643, 66653, 66683, 66697, 66701, 66713, 66721,
66733, 66739, 66749, 66751, 66763, 66791, 66797, 66809, 66821, 66841,
66851, 66853, 66863, 66877, 66883, 66889, 66919, 66923, 66931, 66943,
66947, 66949, 66959, 66973, 66977, 67003, 67021, 67033, 67043, 67049,
67057, 67061, 67073, 67079, 67103, 67121, 67129, 67139, 67141, 67153,
67157, 67169, 67181, 67187, 67189, 67211, 67213, 67217, 67219, 67231,
67247, 67261, 67271, 67273, 67289, 67307, 67339, 67343, 67349, 67369,
67391, 67399, 67409, 67411, 67421, 67427, 67429, 67433, 67447, 67453,
67477, 67481, 67489, 67493, 67499, 67511, 67523, 67531, 67537, 67547,
67559, 67567, 67577, 67579, 67589, 67601, 67607, 67619, 67631, 67651,
67679, 67699, 67709, 67723, 67733, 67741, 67751, 67757, 67759, 67763,
67777, 67783, 67789, 67801, 67807, 67819, 67829, 67843, 67853, 67867,
67883, 67891, 67901, 67927, 67931, 67933, 67939, 67943, 67957, 67961,
67967, 67979, 67987, 67993, 68023, 68041, 68053, 68059, 68071, 68087,
68099, 68111, 68113, 68141, 68147, 68161, 68171, 68207, 68209, 68213,
68219, 68227, 68239, 68261, 68279, 68281, 68311, 68329, 68351, 68371,
68389, 68399, 68437, 68443, 68447, 68449, 68473, 68477, 68483, 68489,
68491, 68501, 68507, 68521, 68531, 68539, 68543, 68567, 68581, 68597,
68611, 68633, 68639, 68659, 68669, 68683, 68687, 68699, 68711, 68713,
68729, 68737, 68743, 68749, 68767, 68771, 68777, 68791, 68813, 68819,
68821, 68863, 68879, 68881, 68891, 68897, 68899, 68903, 68909, 68917,
68927, 68947, 68963, 68993, 69001, 69011, 69019, 69029, 69031, 69061,
69067, 69073, 69109, 69119, 69127, 69143, 69149, 69151, 69163, 69191,
69193, 69197, 69203, 69221, 69233, 69239, 69247, 69257, 69259, 69263,
69313, 69317, 69337, 69341, 69371, 69379, 69383, 69389, 69401, 69403,
69427, 69431, 69439, 69457, 69463, 69467, 69473, 69481, 69491, 69493,
69497, 69499, 69539, 69557, 69593, 69623, 69653, 69661, 69677, 69691,
69697, 69709, 69737, 69739, 69761, 69763, 69767, 69779, 69809, 69821,
69827, 69829, 69833, 69847, 69857, 69859, 69877, 69899, 69911, 69929,
69931, 69941, 69959, 69991, 69997, 70001, 70003, 70009, 70019, 70039,
70051, 70061, 70067, 70079, 70099, 70111, 70117, 70121, 70123, 70139,
70141, 70157, 70163, 70177, 70181, 70183, 70199, 70201, 70207, 70223,
70229, 70237, 70241, 70249, 70271, 70289, 70297, 70309, 70313, 70321,
70327, 70351, 70373, 70379, 70381, 70393, 70423, 70429, 70439, 70451,
70457, 70459, 70481, 70487, 70489, 70501, 70507, 70529, 70537, 70549,
70571, 70573, 70583, 70589, 70607, 70619, 70621, 70627, 70639, 70657,
70663, 70667, 70687, 70709, 70717, 70729, 70753, 70769, 70783, 70793,
70823, 70841, 70843, 70849, 70853, 70867, 70877, 70879, 70891, 70901,
70913, 70919, 70921, 70937, 70949, 70951, 70957, 70969, 70979, 70981,
70991, 70997, 70999, 71011, 71023, 71039, 71059, 71069, 71081, 71089,
71119, 71129, 71143, 71147, 71153, 71161, 71167, 71171, 71191, 71209,
71233, 71237, 71249, 71257, 71261, 71263, 71287, 71293, 71317, 71327,
71329, 71333, 71339, 71341, 71347, 71353, 71359, 71363, 71387, 71389,
71399, 71411, 71413, 71419, 71429, 71437, 71443, 71453, 71471, 71473,
71479, 71483, 71503, 71527, 71537, 71549, 71551, 71563, 71569, 71593,
71597, 71633, 71647, 71663, 71671, 71693, 71699, 71707, 71711, 71713,
71719, 71741, 71761, 71777, 71789, 71807, 71809, 71821, 71837, 71843,
71849, 71861, 71867, 71879, 71881, 71887, 71899, 71909, 71917, 71933,
71941, 71947, 71963, 71971, 71983, 71987, 71993, 71999, 72019, 72031,
72043, 72047, 72053, 72073, 72077, 72089, 72091, 72101, 72103, 72109,
72139, 72161, 72167, 72169, 72173, 72211, 72221, 72223, 72227, 72229,
72251, 72253, 72269, 72271, 72277, 72287, 72307, 72313, 72337, 72341,
72353, 72367, 72379, 72383, 72421, 72431, 72461, 72467, 72469, 72481,
72493, 72497, 72503, 72533, 72547, 72551, 72559, 72577, 72613, 72617,
72623, 72643, 72647, 72649, 72661, 72671, 72673, 72679, 72689, 72701,
72707, 72719, 72727, 72733, 72739, 72763, 72767, 72797, 72817, 72823,
72859, 72869, 72871, 72883, 72889, 72893, 72901, 72907, 72911, 72923,
72931, 72937, 72949, 72953, 72959, 72973, 72977, 72997, 73009, 73013,
73019, 73037, 73039, 73043, 73061, 73063, 73079, 73091, 73121, 73127,
73133, 73141, 73181, 73189, 73237, 73243, 73259, 73277, 73291, 73303,
73309, 73327, 73331, 73351, 73361, 73363, 73369, 73379, 73387, 73417,
73421, 73433, 73453, 73459, 73471, 73477, 73483, 73517, 73523, 73529,
73547, 73553, 73561, 73571, 73583, 73589, 73597, 73607, 73609, 73613,
73637, 73643, 73651, 73673, 73679, 73681, 73693, 73699, 73709, 73721,
73727, 73751, 73757, 73771, 73783, 73819, 73823, 73847, 73849, 73859,
73867, 73877, 73883, 73897, 73907, 73939, 73943, 73951, 73961, 73973,
73999, 74017, 74021, 74027, 74047, 74051, 74071, 74077, 74093, 74099,
74101, 74131, 74143, 74149, 74159, 74161, 74167, 74177, 74189, 74197,
74201, 74203, 74209, 74219, 74231, 74257, 74279, 74287, 74293, 74297,
74311, 74317, 74323, 74353, 74357, 74363, 74377, 74381, 74383, 74411,
74413, 74419, 74441, 74449, 74453, 74471, 74489, 74507, 74509, 74521,
74527, 74531, 74551, 74561, 74567, 74573, 74587, 74597, 74609, 74611,
74623, 74653, 74687, 74699, 74707, 74713, 74717, 74719, 74729, 74731,
74747, 74759, 74761, 74771, 74779, 74797, 74821, 74827, 74831, 74843,
74857, 74861, 74869, 74873, 74887, 74891, 74897, 74903, 74923, 74929,
74933, 74941, 74959, 75011, 75013, 75017, 75029, 75037, 75041, 75079,
75083, 75109, 75133, 75149, 75161, 75167, 75169, 75181, 75193, 75209,
75211, 75217, 75223, 75227, 75239, 75253, 75269, 75277, 75289, 75307,
75323, 75329, 75337, 75347, 75353, 75367, 75377, 75389, 75391, 75401,
75403, 75407, 75431, 75437, 75479, 75503, 75511, 75521, 75527, 75533,
75539, 75541, 75553, 75557, 75571, 75577, 75583, 75611, 75617, 75619,
75629, 75641, 75653, 75659, 75679, 75683, 75689, 75703, 75707, 75709,
75721, 75731, 75743, 75767, 75773, 75781, 75787, 75793, 75797, 75821,
75833, 75853, 75869, 75883, 75913, 75931, 75937, 75941, 75967, 75979,
75983, 75989, 75991, 75997, 76001, 76003, 76031, 76039, 76079, 76081,
76091, 76099, 76103, 76123, 76129, 76147, 76157, 76159, 76163, 76207,
76213, 76231, 76243, 76249, 76253, 76259, 76261, 76283, 76289, 76303,
76333, 76343, 76367, 76369, 76379, 76387, 76403, 76421, 76423, 76441,
76463, 76471, 76481, 76487, 76493, 76507, 76511, 76519, 76537, 76541,
76543, 76561, 76579, 76597, 76603, 76607, 76631, 76649, 76651, 76667,
76673, 76679, 76697, 76717, 76733, 76753, 76757, 76771, 76777, 76781,
76801, 76819, 76829, 76831, 76837, 76847, 76871, 76873, 76883, 76907,
76913, 76919, 76943, 76949, 76961, 76963, 76991, 77003, 77017, 77023,
77029, 77041, 77047, 77069, 77081, 77093, 77101, 77137, 77141, 77153,
77167, 77171, 77191, 77201, 77213, 77237, 77239, 77243, 77249, 77261,
77263, 77267, 77269, 77279, 77291, 77317, 77323, 77339, 77347, 77351,
77359, 77369, 77377, 77383, 77417, 77419, 77431, 77447, 77471, 77477,
77479, 77489, 77491, 77509, 77513, 77521, 77527, 77543, 77549, 77551,
77557, 77563, 77569, 77573, 77587, 77591, 77611, 77617, 77621, 77641,
77647, 77659, 77681, 77687, 77689, 77699, 77711, 77713, 77719, 77723,
77731, 77743, 77747, 77761, 77773, 77783, 77797, 77801, 77813, 77839,
77849, 77863, 77867, 77893, 77899, 77929, 77933, 77951, 77969, 77977,
77983, 77999, 78007, 78017, 78031, 78041, 78049, 78059, 78079, 78101,
78121, 78137, 78139, 78157, 78163, 78167, 78173, 78179, 78191, 78193,
78203, 78229, 78233, 78241, 78259, 78277, 78283, 78301, 78307, 78311,
78317, 78341, 78347, 78367, 78401, 78427, 78437, 78439, 78467, 78479,
78487, 78497, 78509, 78511, 78517, 78539, 78541, 78553, 78569, 78571,
78577, 78583, 78593, 78607, 78623, 78643, 78649, 78653, 78691, 78697,
78707, 78713, 78721, 78737, 78779, 78781, 78787, 78791, 78797, 78803,
78809, 78823, 78839, 78853, 78857, 78877, 78887, 78889, 78893, 78901,
78919, 78929, 78941, 78977, 78979, 78989, 79031, 79039, 79043, 79063,
79087, 79103, 79111, 79133, 79139, 79147, 79151, 79153, 79159, 79181,
79187, 79193, 79201, 79229, 79231, 79241, 79259, 79273, 79279, 79283,
79301, 79309, 79319, 79333, 79337, 79349, 79357, 79367, 79379, 79393,
79397, 79399, 79411, 79423, 79427, 79433, 79451, 79481, 79493, 79531,
79537, 79549, 79559, 79561, 79579, 79589, 79601, 79609, 79613, 79621,
79627, 79631, 79633, 79657, 79669, 79687, 79691, 79693, 79697, 79699,
79757, 79769, 79777, 79801, 79811, 79813, 79817, 79823, 79829, 79841,
79843, 79847, 79861, 79867, 79873, 79889, 79901, 79903, 79907, 79939,
79943, 79967, 79973, 79979, 79987, 79997, 79999, 80021, 80039, 80051,
80071, 80077, 80107, 80111, 80141, 80147, 80149, 80153, 80167, 80173,
80177, 80191, 80207, 80209, 80221, 80231, 80233, 80239, 80251, 80263,
80273, 80279, 80287, 80309, 80317, 80329, 80341, 80347, 80363, 80369,
80387, 80407, 80429, 80447, 80449, 80471, 80473, 80489, 80491, 80513,
80527, 80537, 80557, 80567, 80599, 80603, 80611, 80621, 80627, 80629,
80651, 80657, 80669, 80671, 80677, 80681, 80683, 80687, 80701, 80713,
80737, 80747, 80749, 80761, 80777, 80779, 80783, 80789, 80803, 80809,
80819, 80831, 80833, 80849, 80863, 80897, 80909, 80911, 80917, 80923,
80929, 80933, 80953, 80963, 80989, 81001, 81013, 81017, 81019, 81023,
81031, 81041, 81043, 81047, 81049, 81071, 81077, 81083, 81097, 81101,
81119, 81131, 81157, 81163, 81173, 81181, 81197, 81199, 81203, 81223,
81233, 81239, 81281, 81283, 81293, 81299, 81307, 81331, 81343, 81349,
81353, 81359, 81371, 81373, 81401, 81409, 81421, 81439, 81457, 81463,
81509, 81517, 81527, 81533, 81547, 81551, 81553, 81559, 81563, 81569,
81611, 81619, 81629, 81637, 81647, 81649, 81667, 81671, 81677, 81689,
81701, 81703, 81707, 81727, 81737, 81749, 81761, 81769, 81773, 81799,
81817, 81839, 81847, 81853, 81869, 81883, 81899, 81901, 81919, 81929,
81931, 81937, 81943, 81953, 81967, 81971, 81973, 82003, 82007, 82009,
82013, 82021, 82031, 82037, 82039, 82051, 82067, 82073, 82129, 82139,
82141, 82153, 82163, 82171, 82183, 82189, 82193, 82207, 82217, 82219,
82223, 82231, 82237, 82241, 82261, 82267, 82279, 82301, 82307, 82339,
82349, 82351, 82361, 82373, 82387, 82393, 82421, 82457, 82463, 82469,
82471, 82483, 82487, 82493, 82499, 82507, 82529, 82531, 82549, 82559,
82561, 82567, 82571, 82591, 82601, 82609, 82613, 82619, 82633, 82651,
82657, 82699, 82721, 82723, 82727, 82729, 82757, 82759, 82763, 82781,
82787, 82793, 82799, 82811, 82813, 82837, 82847, 82883, 82889, 82891,
82903, 82913, 82939, 82963, 82981, 82997, 83003, 83009, 83023, 83047,
83059, 83063, 83071, 83077, 83089, 83093, 83101, 83117, 83137, 83177,
83203, 83207, 83219, 83221, 83227, 83231, 83233, 83243, 83257, 83267,
83269, 83273, 83299, 83311, 83339, 83341, 83357, 83383, 83389, 83399,
83401, 83407, 83417, 83423, 83431, 83437, 83443, 83449, 83459, 83471,
83477, 83497, 83537, 83557, 83561, 83563, 83579, 83591, 83597, 83609,
83617, 83621, 83639, 83641, 83653, 83663, 83689, 83701, 83717, 83719,
83737, 83761, 83773, 83777, 83791, 83813, 83833, 83843, 83857, 83869,
83873, 83891, 83903, 83911, 83921, 83933, 83939, 83969, 83983, 83987,
84011, 84017, 84047, 84053, 84059, 84061, 84067, 84089, 84121, 84127,
84131, 84137, 84143, 84163, 84179, 84181, 84191, 84199, 84211, 84221,
84223, 84229, 84239, 84247, 84263, 84299, 84307, 84313, 84317, 84319,
84347, 84349, 84377, 84389, 84391, 84401, 84407, 84421, 84431, 84437,
84443, 84449, 84457, 84463, 84467, 84481, 84499, 84503, 84509, 84521,
84523, 84533, 84551, 84559, 84589, 84629, 84631, 84649, 84653, 84659,
84673, 84691, 84697, 84701, 84713, 84719, 84731, 84737, 84751, 84761,
84787, 84793, 84809, 84811, 84827, 84857, 84859, 84869, 84871, 84913,
84919, 84947, 84961, 84967, 84977, 84979, 84991, 85009, 85021, 85027,
85037, 85049, 85061, 85081, 85087, 85091, 85093, 85103, 85109, 85121,
85133, 85147, 85159, 85193, 85199, 85201, 85213, 85223, 85229, 85237,
85243, 85247, 85259, 85297, 85303, 85313, 85331, 85333, 85361, 85363,
85369, 85381, 85411, 85427, 85429, 85439, 85447, 85451, 85453, 85469,
85487, 85513, 85517, 85523, 85531, 85549, 85571, 85577, 85597, 85601,
85607, 85619, 85621, 85627, 85639, 85643, 85661, 85667, 85669, 85691,
85703, 85711, 85717, 85733, 85751, 85781, 85793, 85817, 85819, 85829,
85831, 85837, 85843, 85847, 85853, 85889, 85903, 85909, 85931, 85933,
85991, 85999, 86011, 86017, 86027, 86029, 86069, 86077, 86083, 86111,
86113, 86117, 86131, 86137, 86143, 86161, 86171, 86179, 86183, 86197,
86201, 86209, 86239, 86243, 86249, 86257, 86263, 86269, 86287, 86291,
86293, 86297, 86311, 86323, 86341, 86351, 86353, 86357, 86369, 86371,
86381, 86389, 86399, 86413, 86423, 86441, 86453, 86461, 86467, 86477,
86491, 86501, 86509, 86531, 86533, 86539, 86561, 86573, 86579, 86587,
86599, 86627, 86629, 86677, 86689, 86693, 86711, 86719, 86729, 86743,
86753, 86767, 86771, 86783, 86813, 86837, 86843, 86851, 86857, 86861,
86869, 86923, 86927, 86929, 86939, 86951, 86959, 86969, 86981, 86993,
87011, 87013, 87037, 87041, 87049, 87071, 87083, 87103, 87107, 87119,
87121, 87133, 87149, 87151, 87179, 87181, 87187, 87211, 87221, 87223,
87251, 87253, 87257, 87277, 87281, 87293, 87299, 87313, 87317, 87323,
87337, 87359, 87383, 87403, 87407, 87421, 87427, 87433, 87443, 87473,
87481, 87491, 87509, 87511, 87517, 87523, 87539, 87541, 87547, 87553,
87557, 87559, 87583, 87587, 87589, 87613, 87623, 87629, 87631, 87641,
87643, 87649, 87671, 87679, 87683, 87691, 87697, 87701, 87719, 87721,
87739, 87743, 87751, 87767, 87793, 87797, 87803, 87811, 87833, 87853,
87869, 87877, 87881, 87887, 87911, 87917, 87931, 87943, 87959, 87961,
87973, 87977, 87991, 88001, 88003, 88007, 88019, 88037, 88069, 88079,
88093, 88117, 88129, 88169, 88177, 88211, 88223, 88237, 88241, 88259,
88261, 88289, 88301, 88321, 88327, 88337, 88339, 88379, 88397, 88411,
88423, 88427, 88463, 88469, 88471, 88493, 88499, 88513, 88523, 88547,
88589, 88591, 88607, 88609, 88643, 88651, 88657, 88661, 88663, 88667,
88681, 88721, 88729, 88741, 88747, 88771, 88789, 88793, 88799, 88801,
88807, 88811, 88813, 88817, 88819, 88843, 88853, 88861, 88867, 88873,
88883, 88897, 88903, 88919, 88937, 88951, 88969, 88993, 88997, 89003,
89009, 89017, 89021, 89041, 89051, 89057, 89069, 89071, 89083, 89087,
89101, 89107, 89113, 89119, 89123, 89137, 89153, 89189, 89203, 89209,
89213, 89227, 89231, 89237, 89261, 89269, 89273, 89293, 89303, 89317,
89329, 89363, 89371, 89381, 89387, 89393, 89399, 89413, 89417, 89431,
89443, 89449, 89459, 89477, 89491, 89501, 89513, 89519, 89521, 89527,
89533, 89561, 89563, 89567, 89591, 89597, 89599, 89603, 89611, 89627,
89633, 89653, 89657, 89659, 89669, 89671, 89681, 89689, 89753, 89759,
89767, 89779, 89783, 89797, 89809, 89819, 89821, 89833, 89839, 89849,
89867, 89891, 89897, 89899, 89909, 89917, 89923, 89939, 89959, 89963,
89977, 89983, 89989, 90001, 90007, 90011, 90017, 90019, 90023, 90031,
90053, 90059, 90067, 90071, 90073, 90089, 90107, 90121, 90127, 90149,
90163, 90173, 90187, 90191, 90197, 90199, 90203, 90217, 90227, 90239,
90247, 90263, 90271, 90281, 90289, 90313, 90353, 90359, 90371, 90373,
90379, 90397, 90401, 90403, 90407, 90437, 90439, 90469, 90473, 90481,
90499, 90511, 90523, 90527, 90529, 90533, 90547, 90583, 90599, 90617,
90619, 90631, 90641, 90647, 90659, 90677, 90679, 90697, 90703, 90709,
90731, 90749, 90787, 90793, 90803, 90821, 90823, 90833, 90841, 90847,
90863, 90887, 90901, 90907, 90911, 90917, 90931, 90947, 90971, 90977,
90989, 90997, 91009, 91019, 91033, 91079, 91081, 91097, 91099, 91121,
91127, 91129, 91139, 91141, 91151, 91153, 91159, 91163, 91183, 91193,
91199, 91229, 91237, 91243, 91249, 91253, 91283, 91291, 91297, 91303,
91309, 91331, 91367, 91369, 91373, 91381, 91387, 91393, 91397, 91411,
91423, 91433, 91453, 91457, 91459, 91463, 91493, 91499, 91513, 91529,
91541, 91571, 91573, 91577, 91583, 91591, 91621, 91631, 91639, 91673,
91691, 91703, 91711, 91733, 91753, 91757, 91771, 91781, 91801, 91807,
91811, 91813, 91823, 91837, 91841, 91867, 91873, 91909, 91921, 91939,
91943, 91951, 91957, 91961, 91967, 91969, 91997, 92003, 92009, 92033,
92041, 92051, 92077, 92083, 92107, 92111, 92119, 92143, 92153, 92173,
92177, 92179, 92189, 92203, 92219, 92221, 92227, 92233, 92237, 92243,
92251, 92269, 92297, 92311, 92317, 92333, 92347, 92353, 92357, 92363,
92369, 92377, 92381, 92383, 92387, 92399, 92401, 92413, 92419, 92431,
92459, 92461, 92467, 92479, 92489, 92503, 92507, 92551, 92557, 92567,
92569, 92581, 92593, 92623, 92627, 92639, 92641, 92647, 92657, 92669,
92671, 92681, 92683, 92693, 92699, 92707, 92717, 92723, 92737, 92753,
92761, 92767, 92779, 92789, 92791, 92801, 92809, 92821, 92831, 92849,
92857, 92861, 92863, 92867, 92893, 92899, 92921, 92927, 92941, 92951,
92957, 92959, 92987, 92993, 93001, 93047, 93053, 93059, 93077, 93083,
93089, 93097, 93103, 93113, 93131, 93133, 93139, 93151, 93169, 93179,
93187, 93199, 93229, 93239, 93241, 93251, 93253, 93257, 93263, 93281,
93283, 93287, 93307, 93319, 93323, 93329, 93337, 93371, 93377, 93383,
93407, 93419, 93427, 93463, 93479, 93481, 93487, 93491, 93493, 93497,
93503, 93523, 93529, 93553, 93557, 93559, 93563, 93581, 93601, 93607,
93629, 93637, 93683, 93701, 93703, 93719, 93739, 93761, 93763, 93787,
93809, 93811, 93827, 93851, 93871, 93887, 93889, 93893, 93901, 93911,
93913, 93923, 93937, 93941, 93949, 93967, 93971, 93979, 93983, 93997,
94007, 94009, 94033, 94049, 94057, 94063, 94079, 94099, 94109, 94111,
94117, 94121, 94151, 94153, 94169, 94201, 94207, 94219, 94229, 94253,
94261, 94273, 94291, 94307, 94309, 94321, 94327, 94331, 94343, 94349,
94351, 94379, 94397, 94399, 94421, 94427, 94433, 94439, 94441, 94447,
94463, 94477, 94483, 94513, 94529, 94531, 94541, 94543, 94547, 94559,
94561, 94573, 94583, 94597, 94603, 94613, 94621, 94649, 94651, 94687,
94693, 94709, 94723, 94727, 94747, 94771, 94777, 94781, 94789, 94793,
94811, 94819, 94823, 94837, 94841, 94847, 94849, 94873, 94889, 94903,
94907, 94933, 94949, 94951, 94961, 94993, 94999, 95003, 95009, 95021,
95027, 95063, 95071, 95083, 95087, 95089, 95093, 95101, 95107, 95111,
95131, 95143, 95153, 95177, 95189, 95191, 95203, 95213, 95219, 95231,
95233, 95239, 95257, 95261, 95267, 95273, 95279, 95287, 95311, 95317,
95327, 95339, 95369, 95383, 95393, 95401, 95413, 95419, 95429, 95441,
95443, 95461, 95467, 95471, 95479, 95483, 95507, 95527, 95531, 95539,
95549, 95561, 95569, 95581, 95597, 95603, 95617, 95621, 95629, 95633,
95651, 95701, 95707, 95713, 95717, 95723, 95731, 95737, 95747, 95773,
95783, 95789, 95791, 95801, 95803, 95813, 95819, 95857, 95869, 95873,
95881, 95891, 95911, 95917, 95923, 95929, 95947, 95957, 95959, 95971,
95987, 95989, 96001, 96013, 96017, 96043, 96053, 96059, 96079, 96097,
96137, 96149, 96157, 96167, 96179, 96181, 96199, 96211, 96221, 96223,
96233, 96259, 96263, 96269, 96281, 96289, 96293, 96323, 96329, 96331,
96337, 96353, 96377, 96401, 96419, 96431, 96443, 96451, 96457, 96461,
96469, 96479, 96487, 96493, 96497, 96517, 96527, 96553, 96557, 96581,
96587, 96589, 96601, 96643, 96661, 96667, 96671, 96697, 96703, 96731,
96737, 96739, 96749, 96757, 96763, 96769, 96779, 96787, 96797, 96799,
96821, 96823, 96827, 96847, 96851, 96857, 96893, 96907, 96911, 96931,
96953, 96959, 96973, 96979, 96989, 96997, 97001, 97003, 97007, 97021,
97039, 97073, 97081, 97103, 97117, 97127, 97151, 97157, 97159, 97169,
97171, 97177, 97187, 97213, 97231, 97241, 97259, 97283, 97301, 97303,
97327, 97367, 97369, 97373, 97379, 97381, 97387, 97397, 97423, 97429,
97441, 97453, 97459, 97463, 97499, 97501, 97511, 97523, 97547, 97549,
97553, 97561, 97571, 97577, 97579, 97583, 97607, 97609, 97613, 97649,
97651, 97673, 97687, 97711, 97729, 97771, 97777, 97787, 97789, 97813,
97829, 97841, 97843, 97847, 97849, 97859, 97861, 97871, 97879, 97883,
97919, 97927, 97931, 97943, 97961, 97967, 97973, 97987, 98009, 98011,
98017, 98041, 98047, 98057, 98081, 98101, 98123, 98129, 98143, 98179,
98207, 98213, 98221, 98227, 98251, 98257, 98269, 98297, 98299, 98317,
98321, 98323, 98327, 98347, 98369, 98377, 98387, 98389, 98407, 98411,
98419, 98429, 98443, 98453, 98459, 98467, 98473, 98479, 98491, 98507,
98519, 98533, 98543, 98561, 98563, 98573, 98597, 98621, 98627, 98639,
98641, 98663, 98669, 98689, 98711, 98713, 98717, 98729, 98731, 98737,
98773, 98779, 98801, 98807, 98809, 98837, 98849, 98867, 98869, 98873,
98887, 98893, 98897, 98899, 98909, 98911, 98927, 98929, 98939, 98947,
98953, 98963, 98981, 98993, 98999, 99013, 99017, 99023, 99041, 99053,
99079, 99083, 99089, 99103, 99109, 99119, 99131, 99133, 99137, 99139,
99149, 99173, 99181, 99191, 99223, 99233, 99241, 99251, 99257, 99259,
99277, 99289, 99317, 99347, 99349, 99367, 99371, 99377, 99391, 99397,
99401, 99409, 99431, 99439, 99469, 99487, 99497, 99523, 99527, 99529,
99551, 99559, 99563, 99571, 99577, 99581, 99607, 99611, 99623, 99643,
99661, 99667, 99679, 99689, 99707, 99709, 99713, 99719, 99721, 99733,
99761, 99767, 99787, 99793, 99809, 99817, 99823, 99829, 99833, 99839,
99859, 99871, 99877, 99881, 99901, 99907, 99923, 99929, 99961, 99971,
99989, 99991};
int num = prime.size();
for (int i = m - 1; i > 0; i--) {
if (i * n <= m) {
if (m % i == 0) {
cout << i << endl;
goto FINE;
}
}
}
cout << 1 << endl;
FINE:
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
int MOD = 1000000007;
signed main() {
int n, m;
cin >> n >> m;
vector<int> prime = {
2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
73, 79, 83, 89, 97, 101, 103, 107, 109, 113,
127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
283, 293, 307, 311, 313, 317, 331, 337, 347, 349,
353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
419, 421, 431, 433, 439, 443, 449, 457, 461, 463,
467, 479, 487, 491, 499, 503, 509, 521, 523, 541,
547, 557, 563, 569, 571, 577, 587, 593, 599, 601,
607, 613, 617, 619, 631, 641, 643, 647, 653, 659,
661, 673, 677, 683, 691, 701, 709, 719, 727, 733,
739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
811, 821, 823, 827, 829, 839, 853, 857, 859, 863,
877, 881, 883, 887, 907, 911, 919, 929, 937, 941,
947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013,
1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069,
1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151,
1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223,
1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291,
1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373,
1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451,
1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511,
1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583,
1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657,
1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733,
1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811,
1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889,
1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987,
1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053,
2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129,
2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213,
2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287,
2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357,
2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423,
2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531,
2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617,
2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687,
2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741,
2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819,
2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903,
2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999,
3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079,
3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181,
3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257,
3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331,
3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413,
3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511,
3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571,
3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643,
3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727,
3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821,
3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907,
3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989,
4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057,
4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139,
4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231,
4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297,
4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409,
4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493,
4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583,
4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657,
4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751,
4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831,
4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937,
4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003,
5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087,
5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179,
5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279,
5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387,
5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443,
5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521,
5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639,
5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693,
5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791,
5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857,
5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939,
5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053,
6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133,
6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221,
6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301,
6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367,
6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473,
6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571,
6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673,
6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761,
6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833,
6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917,
6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997,
7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103,
7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207,
7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297,
7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411,
7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499,
7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561,
7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643,
7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723,
7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829,
7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919,
7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017,
8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111,
8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219,
8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291,
8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387,
8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501,
8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597,
8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677,
8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741,
8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831,
8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929,
8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011,
9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109,
9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199,
9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283,
9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377,
9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439,
9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533,
9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631,
9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733,
9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811,
9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887,
9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973, 10007,
10009, 10037, 10039, 10061, 10067, 10069, 10079, 10091, 10093, 10099,
10103, 10111, 10133, 10139, 10141, 10151, 10159, 10163, 10169, 10177,
10181, 10193, 10211, 10223, 10243, 10247, 10253, 10259, 10267, 10271,
10273, 10289, 10301, 10303, 10313, 10321, 10331, 10333, 10337, 10343,
10357, 10369, 10391, 10399, 10427, 10429, 10433, 10453, 10457, 10459,
10463, 10477, 10487, 10499, 10501, 10513, 10529, 10531, 10559, 10567,
10589, 10597, 10601, 10607, 10613, 10627, 10631, 10639, 10651, 10657,
10663, 10667, 10687, 10691, 10709, 10711, 10723, 10729, 10733, 10739,
10753, 10771, 10781, 10789, 10799, 10831, 10837, 10847, 10853, 10859,
10861, 10867, 10883, 10889, 10891, 10903, 10909, 10937, 10939, 10949,
10957, 10973, 10979, 10987, 10993, 11003, 11027, 11047, 11057, 11059,
11069, 11071, 11083, 11087, 11093, 11113, 11117, 11119, 11131, 11149,
11159, 11161, 11171, 11173, 11177, 11197, 11213, 11239, 11243, 11251,
11257, 11261, 11273, 11279, 11287, 11299, 11311, 11317, 11321, 11329,
11351, 11353, 11369, 11383, 11393, 11399, 11411, 11423, 11437, 11443,
11447, 11467, 11471, 11483, 11489, 11491, 11497, 11503, 11519, 11527,
11549, 11551, 11579, 11587, 11593, 11597, 11617, 11621, 11633, 11657,
11677, 11681, 11689, 11699, 11701, 11717, 11719, 11731, 11743, 11777,
11779, 11783, 11789, 11801, 11807, 11813, 11821, 11827, 11831, 11833,
11839, 11863, 11867, 11887, 11897, 11903, 11909, 11923, 11927, 11933,
11939, 11941, 11953, 11959, 11969, 11971, 11981, 11987, 12007, 12011,
12037, 12041, 12043, 12049, 12071, 12073, 12097, 12101, 12107, 12109,
12113, 12119, 12143, 12149, 12157, 12161, 12163, 12197, 12203, 12211,
12227, 12239, 12241, 12251, 12253, 12263, 12269, 12277, 12281, 12289,
12301, 12323, 12329, 12343, 12347, 12373, 12377, 12379, 12391, 12401,
12409, 12413, 12421, 12433, 12437, 12451, 12457, 12473, 12479, 12487,
12491, 12497, 12503, 12511, 12517, 12527, 12539, 12541, 12547, 12553,
12569, 12577, 12583, 12589, 12601, 12611, 12613, 12619, 12637, 12641,
12647, 12653, 12659, 12671, 12689, 12697, 12703, 12713, 12721, 12739,
12743, 12757, 12763, 12781, 12791, 12799, 12809, 12821, 12823, 12829,
12841, 12853, 12889, 12893, 12899, 12907, 12911, 12917, 12919, 12923,
12941, 12953, 12959, 12967, 12973, 12979, 12983, 13001, 13003, 13007,
13009, 13033, 13037, 13043, 13049, 13063, 13093, 13099, 13103, 13109,
13121, 13127, 13147, 13151, 13159, 13163, 13171, 13177, 13183, 13187,
13217, 13219, 13229, 13241, 13249, 13259, 13267, 13291, 13297, 13309,
13313, 13327, 13331, 13337, 13339, 13367, 13381, 13397, 13399, 13411,
13417, 13421, 13441, 13451, 13457, 13463, 13469, 13477, 13487, 13499,
13513, 13523, 13537, 13553, 13567, 13577, 13591, 13597, 13613, 13619,
13627, 13633, 13649, 13669, 13679, 13681, 13687, 13691, 13693, 13697,
13709, 13711, 13721, 13723, 13729, 13751, 13757, 13759, 13763, 13781,
13789, 13799, 13807, 13829, 13831, 13841, 13859, 13873, 13877, 13879,
13883, 13901, 13903, 13907, 13913, 13921, 13931, 13933, 13963, 13967,
13997, 13999, 14009, 14011, 14029, 14033, 14051, 14057, 14071, 14081,
14083, 14087, 14107, 14143, 14149, 14153, 14159, 14173, 14177, 14197,
14207, 14221, 14243, 14249, 14251, 14281, 14293, 14303, 14321, 14323,
14327, 14341, 14347, 14369, 14387, 14389, 14401, 14407, 14411, 14419,
14423, 14431, 14437, 14447, 14449, 14461, 14479, 14489, 14503, 14519,
14533, 14537, 14543, 14549, 14551, 14557, 14561, 14563, 14591, 14593,
14621, 14627, 14629, 14633, 14639, 14653, 14657, 14669, 14683, 14699,
14713, 14717, 14723, 14731, 14737, 14741, 14747, 14753, 14759, 14767,
14771, 14779, 14783, 14797, 14813, 14821, 14827, 14831, 14843, 14851,
14867, 14869, 14879, 14887, 14891, 14897, 14923, 14929, 14939, 14947,
14951, 14957, 14969, 14983, 15013, 15017, 15031, 15053, 15061, 15073,
15077, 15083, 15091, 15101, 15107, 15121, 15131, 15137, 15139, 15149,
15161, 15173, 15187, 15193, 15199, 15217, 15227, 15233, 15241, 15259,
15263, 15269, 15271, 15277, 15287, 15289, 15299, 15307, 15313, 15319,
15329, 15331, 15349, 15359, 15361, 15373, 15377, 15383, 15391, 15401,
15413, 15427, 15439, 15443, 15451, 15461, 15467, 15473, 15493, 15497,
15511, 15527, 15541, 15551, 15559, 15569, 15581, 15583, 15601, 15607,
15619, 15629, 15641, 15643, 15647, 15649, 15661, 15667, 15671, 15679,
15683, 15727, 15731, 15733, 15737, 15739, 15749, 15761, 15767, 15773,
15787, 15791, 15797, 15803, 15809, 15817, 15823, 15859, 15877, 15881,
15887, 15889, 15901, 15907, 15913, 15919, 15923, 15937, 15959, 15971,
15973, 15991, 16001, 16007, 16033, 16057, 16061, 16063, 16067, 16069,
16073, 16087, 16091, 16097, 16103, 16111, 16127, 16139, 16141, 16183,
16187, 16189, 16193, 16217, 16223, 16229, 16231, 16249, 16253, 16267,
16273, 16301, 16319, 16333, 16339, 16349, 16361, 16363, 16369, 16381,
16411, 16417, 16421, 16427, 16433, 16447, 16451, 16453, 16477, 16481,
16487, 16493, 16519, 16529, 16547, 16553, 16561, 16567, 16573, 16603,
16607, 16619, 16631, 16633, 16649, 16651, 16657, 16661, 16673, 16691,
16693, 16699, 16703, 16729, 16741, 16747, 16759, 16763, 16787, 16811,
16823, 16829, 16831, 16843, 16871, 16879, 16883, 16889, 16901, 16903,
16921, 16927, 16931, 16937, 16943, 16963, 16979, 16981, 16987, 16993,
17011, 17021, 17027, 17029, 17033, 17041, 17047, 17053, 17077, 17093,
17099, 17107, 17117, 17123, 17137, 17159, 17167, 17183, 17189, 17191,
17203, 17207, 17209, 17231, 17239, 17257, 17291, 17293, 17299, 17317,
17321, 17327, 17333, 17341, 17351, 17359, 17377, 17383, 17387, 17389,
17393, 17401, 17417, 17419, 17431, 17443, 17449, 17467, 17471, 17477,
17483, 17489, 17491, 17497, 17509, 17519, 17539, 17551, 17569, 17573,
17579, 17581, 17597, 17599, 17609, 17623, 17627, 17657, 17659, 17669,
17681, 17683, 17707, 17713, 17729, 17737, 17747, 17749, 17761, 17783,
17789, 17791, 17807, 17827, 17837, 17839, 17851, 17863, 17881, 17891,
17903, 17909, 17911, 17921, 17923, 17929, 17939, 17957, 17959, 17971,
17977, 17981, 17987, 17989, 18013, 18041, 18043, 18047, 18049, 18059,
18061, 18077, 18089, 18097, 18119, 18121, 18127, 18131, 18133, 18143,
18149, 18169, 18181, 18191, 18199, 18211, 18217, 18223, 18229, 18233,
18251, 18253, 18257, 18269, 18287, 18289, 18301, 18307, 18311, 18313,
18329, 18341, 18353, 18367, 18371, 18379, 18397, 18401, 18413, 18427,
18433, 18439, 18443, 18451, 18457, 18461, 18481, 18493, 18503, 18517,
18521, 18523, 18539, 18541, 18553, 18583, 18587, 18593, 18617, 18637,
18661, 18671, 18679, 18691, 18701, 18713, 18719, 18731, 18743, 18749,
18757, 18773, 18787, 18793, 18797, 18803, 18839, 18859, 18869, 18899,
18911, 18913, 18917, 18919, 18947, 18959, 18973, 18979, 19001, 19009,
19013, 19031, 19037, 19051, 19069, 19073, 19079, 19081, 19087, 19121,
19139, 19141, 19157, 19163, 19181, 19183, 19207, 19211, 19213, 19219,
19231, 19237, 19249, 19259, 19267, 19273, 19289, 19301, 19309, 19319,
19333, 19373, 19379, 19381, 19387, 19391, 19403, 19417, 19421, 19423,
19427, 19429, 19433, 19441, 19447, 19457, 19463, 19469, 19471, 19477,
19483, 19489, 19501, 19507, 19531, 19541, 19543, 19553, 19559, 19571,
19577, 19583, 19597, 19603, 19609, 19661, 19681, 19687, 19697, 19699,
19709, 19717, 19727, 19739, 19751, 19753, 19759, 19763, 19777, 19793,
19801, 19813, 19819, 19841, 19843, 19853, 19861, 19867, 19889, 19891,
19913, 19919, 19927, 19937, 19949, 19961, 19963, 19973, 19979, 19991,
19993, 19997, 20011, 20021, 20023, 20029, 20047, 20051, 20063, 20071,
20089, 20101, 20107, 20113, 20117, 20123, 20129, 20143, 20147, 20149,
20161, 20173, 20177, 20183, 20201, 20219, 20231, 20233, 20249, 20261,
20269, 20287, 20297, 20323, 20327, 20333, 20341, 20347, 20353, 20357,
20359, 20369, 20389, 20393, 20399, 20407, 20411, 20431, 20441, 20443,
20477, 20479, 20483, 20507, 20509, 20521, 20533, 20543, 20549, 20551,
20563, 20593, 20599, 20611, 20627, 20639, 20641, 20663, 20681, 20693,
20707, 20717, 20719, 20731, 20743, 20747, 20749, 20753, 20759, 20771,
20773, 20789, 20807, 20809, 20849, 20857, 20873, 20879, 20887, 20897,
20899, 20903, 20921, 20929, 20939, 20947, 20959, 20963, 20981, 20983,
21001, 21011, 21013, 21017, 21019, 21023, 21031, 21059, 21061, 21067,
21089, 21101, 21107, 21121, 21139, 21143, 21149, 21157, 21163, 21169,
21179, 21187, 21191, 21193, 21211, 21221, 21227, 21247, 21269, 21277,
21283, 21313, 21317, 21319, 21323, 21341, 21347, 21377, 21379, 21383,
21391, 21397, 21401, 21407, 21419, 21433, 21467, 21481, 21487, 21491,
21493, 21499, 21503, 21517, 21521, 21523, 21529, 21557, 21559, 21563,
21569, 21577, 21587, 21589, 21599, 21601, 21611, 21613, 21617, 21647,
21649, 21661, 21673, 21683, 21701, 21713, 21727, 21737, 21739, 21751,
21757, 21767, 21773, 21787, 21799, 21803, 21817, 21821, 21839, 21841,
21851, 21859, 21863, 21871, 21881, 21893, 21911, 21929, 21937, 21943,
21961, 21977, 21991, 21997, 22003, 22013, 22027, 22031, 22037, 22039,
22051, 22063, 22067, 22073, 22079, 22091, 22093, 22109, 22111, 22123,
22129, 22133, 22147, 22153, 22157, 22159, 22171, 22189, 22193, 22229,
22247, 22259, 22271, 22273, 22277, 22279, 22283, 22291, 22303, 22307,
22343, 22349, 22367, 22369, 22381, 22391, 22397, 22409, 22433, 22441,
22447, 22453, 22469, 22481, 22483, 22501, 22511, 22531, 22541, 22543,
22549, 22567, 22571, 22573, 22613, 22619, 22621, 22637, 22639, 22643,
22651, 22669, 22679, 22691, 22697, 22699, 22709, 22717, 22721, 22727,
22739, 22741, 22751, 22769, 22777, 22783, 22787, 22807, 22811, 22817,
22853, 22859, 22861, 22871, 22877, 22901, 22907, 22921, 22937, 22943,
22961, 22963, 22973, 22993, 23003, 23011, 23017, 23021, 23027, 23029,
23039, 23041, 23053, 23057, 23059, 23063, 23071, 23081, 23087, 23099,
23117, 23131, 23143, 23159, 23167, 23173, 23189, 23197, 23201, 23203,
23209, 23227, 23251, 23269, 23279, 23291, 23293, 23297, 23311, 23321,
23327, 23333, 23339, 23357, 23369, 23371, 23399, 23417, 23431, 23447,
23459, 23473, 23497, 23509, 23531, 23537, 23539, 23549, 23557, 23561,
23563, 23567, 23581, 23593, 23599, 23603, 23609, 23623, 23627, 23629,
23633, 23663, 23669, 23671, 23677, 23687, 23689, 23719, 23741, 23743,
23747, 23753, 23761, 23767, 23773, 23789, 23801, 23813, 23819, 23827,
23831, 23833, 23857, 23869, 23873, 23879, 23887, 23893, 23899, 23909,
23911, 23917, 23929, 23957, 23971, 23977, 23981, 23993, 24001, 24007,
24019, 24023, 24029, 24043, 24049, 24061, 24071, 24077, 24083, 24091,
24097, 24103, 24107, 24109, 24113, 24121, 24133, 24137, 24151, 24169,
24179, 24181, 24197, 24203, 24223, 24229, 24239, 24247, 24251, 24281,
24317, 24329, 24337, 24359, 24371, 24373, 24379, 24391, 24407, 24413,
24419, 24421, 24439, 24443, 24469, 24473, 24481, 24499, 24509, 24517,
24527, 24533, 24547, 24551, 24571, 24593, 24611, 24623, 24631, 24659,
24671, 24677, 24683, 24691, 24697, 24709, 24733, 24749, 24763, 24767,
24781, 24793, 24799, 24809, 24821, 24841, 24847, 24851, 24859, 24877,
24889, 24907, 24917, 24919, 24923, 24943, 24953, 24967, 24971, 24977,
24979, 24989, 25013, 25031, 25033, 25037, 25057, 25073, 25087, 25097,
25111, 25117, 25121, 25127, 25147, 25153, 25163, 25169, 25171, 25183,
25189, 25219, 25229, 25237, 25243, 25247, 25253, 25261, 25301, 25303,
25307, 25309, 25321, 25339, 25343, 25349, 25357, 25367, 25373, 25391,
25409, 25411, 25423, 25439, 25447, 25453, 25457, 25463, 25469, 25471,
25523, 25537, 25541, 25561, 25577, 25579, 25583, 25589, 25601, 25603,
25609, 25621, 25633, 25639, 25643, 25657, 25667, 25673, 25679, 25693,
25703, 25717, 25733, 25741, 25747, 25759, 25763, 25771, 25793, 25799,
25801, 25819, 25841, 25847, 25849, 25867, 25873, 25889, 25903, 25913,
25919, 25931, 25933, 25939, 25943, 25951, 25969, 25981, 25997, 25999,
26003, 26017, 26021, 26029, 26041, 26053, 26083, 26099, 26107, 26111,
26113, 26119, 26141, 26153, 26161, 26171, 26177, 26183, 26189, 26203,
26209, 26227, 26237, 26249, 26251, 26261, 26263, 26267, 26293, 26297,
26309, 26317, 26321, 26339, 26347, 26357, 26371, 26387, 26393, 26399,
26407, 26417, 26423, 26431, 26437, 26449, 26459, 26479, 26489, 26497,
26501, 26513, 26539, 26557, 26561, 26573, 26591, 26597, 26627, 26633,
26641, 26647, 26669, 26681, 26683, 26687, 26693, 26699, 26701, 26711,
26713, 26717, 26723, 26729, 26731, 26737, 26759, 26777, 26783, 26801,
26813, 26821, 26833, 26839, 26849, 26861, 26863, 26879, 26881, 26891,
26893, 26903, 26921, 26927, 26947, 26951, 26953, 26959, 26981, 26987,
26993, 27011, 27017, 27031, 27043, 27059, 27061, 27067, 27073, 27077,
27091, 27103, 27107, 27109, 27127, 27143, 27179, 27191, 27197, 27211,
27239, 27241, 27253, 27259, 27271, 27277, 27281, 27283, 27299, 27329,
27337, 27361, 27367, 27397, 27407, 27409, 27427, 27431, 27437, 27449,
27457, 27479, 27481, 27487, 27509, 27527, 27529, 27539, 27541, 27551,
27581, 27583, 27611, 27617, 27631, 27647, 27653, 27673, 27689, 27691,
27697, 27701, 27733, 27737, 27739, 27743, 27749, 27751, 27763, 27767,
27773, 27779, 27791, 27793, 27799, 27803, 27809, 27817, 27823, 27827,
27847, 27851, 27883, 27893, 27901, 27917, 27919, 27941, 27943, 27947,
27953, 27961, 27967, 27983, 27997, 28001, 28019, 28027, 28031, 28051,
28057, 28069, 28081, 28087, 28097, 28099, 28109, 28111, 28123, 28151,
28163, 28181, 28183, 28201, 28211, 28219, 28229, 28277, 28279, 28283,
28289, 28297, 28307, 28309, 28319, 28349, 28351, 28387, 28393, 28403,
28409, 28411, 28429, 28433, 28439, 28447, 28463, 28477, 28493, 28499,
28513, 28517, 28537, 28541, 28547, 28549, 28559, 28571, 28573, 28579,
28591, 28597, 28603, 28607, 28619, 28621, 28627, 28631, 28643, 28649,
28657, 28661, 28663, 28669, 28687, 28697, 28703, 28711, 28723, 28729,
28751, 28753, 28759, 28771, 28789, 28793, 28807, 28813, 28817, 28837,
28843, 28859, 28867, 28871, 28879, 28901, 28909, 28921, 28927, 28933,
28949, 28961, 28979, 29009, 29017, 29021, 29023, 29027, 29033, 29059,
29063, 29077, 29101, 29123, 29129, 29131, 29137, 29147, 29153, 29167,
29173, 29179, 29191, 29201, 29207, 29209, 29221, 29231, 29243, 29251,
29269, 29287, 29297, 29303, 29311, 29327, 29333, 29339, 29347, 29363,
29383, 29387, 29389, 29399, 29401, 29411, 29423, 29429, 29437, 29443,
29453, 29473, 29483, 29501, 29527, 29531, 29537, 29567, 29569, 29573,
29581, 29587, 29599, 29611, 29629, 29633, 29641, 29663, 29669, 29671,
29683, 29717, 29723, 29741, 29753, 29759, 29761, 29789, 29803, 29819,
29833, 29837, 29851, 29863, 29867, 29873, 29879, 29881, 29917, 29921,
29927, 29947, 29959, 29983, 29989, 30011, 30013, 30029, 30047, 30059,
30071, 30089, 30091, 30097, 30103, 30109, 30113, 30119, 30133, 30137,
30139, 30161, 30169, 30181, 30187, 30197, 30203, 30211, 30223, 30241,
30253, 30259, 30269, 30271, 30293, 30307, 30313, 30319, 30323, 30341,
30347, 30367, 30389, 30391, 30403, 30427, 30431, 30449, 30467, 30469,
30491, 30493, 30497, 30509, 30517, 30529, 30539, 30553, 30557, 30559,
30577, 30593, 30631, 30637, 30643, 30649, 30661, 30671, 30677, 30689,
30697, 30703, 30707, 30713, 30727, 30757, 30763, 30773, 30781, 30803,
30809, 30817, 30829, 30839, 30841, 30851, 30853, 30859, 30869, 30871,
30881, 30893, 30911, 30931, 30937, 30941, 30949, 30971, 30977, 30983,
31013, 31019, 31033, 31039, 31051, 31063, 31069, 31079, 31081, 31091,
31121, 31123, 31139, 31147, 31151, 31153, 31159, 31177, 31181, 31183,
31189, 31193, 31219, 31223, 31231, 31237, 31247, 31249, 31253, 31259,
31267, 31271, 31277, 31307, 31319, 31321, 31327, 31333, 31337, 31357,
31379, 31387, 31391, 31393, 31397, 31469, 31477, 31481, 31489, 31511,
31513, 31517, 31531, 31541, 31543, 31547, 31567, 31573, 31583, 31601,
31607, 31627, 31643, 31649, 31657, 31663, 31667, 31687, 31699, 31721,
31723, 31727, 31729, 31741, 31751, 31769, 31771, 31793, 31799, 31817,
31847, 31849, 31859, 31873, 31883, 31891, 31907, 31957, 31963, 31973,
31981, 31991, 32003, 32009, 32027, 32029, 32051, 32057, 32059, 32063,
32069, 32077, 32083, 32089, 32099, 32117, 32119, 32141, 32143, 32159,
32173, 32183, 32189, 32191, 32203, 32213, 32233, 32237, 32251, 32257,
32261, 32297, 32299, 32303, 32309, 32321, 32323, 32327, 32341, 32353,
32359, 32363, 32369, 32371, 32377, 32381, 32401, 32411, 32413, 32423,
32429, 32441, 32443, 32467, 32479, 32491, 32497, 32503, 32507, 32531,
32533, 32537, 32561, 32563, 32569, 32573, 32579, 32587, 32603, 32609,
32611, 32621, 32633, 32647, 32653, 32687, 32693, 32707, 32713, 32717,
32719, 32749, 32771, 32779, 32783, 32789, 32797, 32801, 32803, 32831,
32833, 32839, 32843, 32869, 32887, 32909, 32911, 32917, 32933, 32939,
32941, 32957, 32969, 32971, 32983, 32987, 32993, 32999, 33013, 33023,
33029, 33037, 33049, 33053, 33071, 33073, 33083, 33091, 33107, 33113,
33119, 33149, 33151, 33161, 33179, 33181, 33191, 33199, 33203, 33211,
33223, 33247, 33287, 33289, 33301, 33311, 33317, 33329, 33331, 33343,
33347, 33349, 33353, 33359, 33377, 33391, 33403, 33409, 33413, 33427,
33457, 33461, 33469, 33479, 33487, 33493, 33503, 33521, 33529, 33533,
33547, 33563, 33569, 33577, 33581, 33587, 33589, 33599, 33601, 33613,
33617, 33619, 33623, 33629, 33637, 33641, 33647, 33679, 33703, 33713,
33721, 33739, 33749, 33751, 33757, 33767, 33769, 33773, 33791, 33797,
33809, 33811, 33827, 33829, 33851, 33857, 33863, 33871, 33889, 33893,
33911, 33923, 33931, 33937, 33941, 33961, 33967, 33997, 34019, 34031,
34033, 34039, 34057, 34061, 34123, 34127, 34129, 34141, 34147, 34157,
34159, 34171, 34183, 34211, 34213, 34217, 34231, 34253, 34259, 34261,
34267, 34273, 34283, 34297, 34301, 34303, 34313, 34319, 34327, 34337,
34351, 34361, 34367, 34369, 34381, 34403, 34421, 34429, 34439, 34457,
34469, 34471, 34483, 34487, 34499, 34501, 34511, 34513, 34519, 34537,
34543, 34549, 34583, 34589, 34591, 34603, 34607, 34613, 34631, 34649,
34651, 34667, 34673, 34679, 34687, 34693, 34703, 34721, 34729, 34739,
34747, 34757, 34759, 34763, 34781, 34807, 34819, 34841, 34843, 34847,
34849, 34871, 34877, 34883, 34897, 34913, 34919, 34939, 34949, 34961,
34963, 34981, 35023, 35027, 35051, 35053, 35059, 35069, 35081, 35083,
35089, 35099, 35107, 35111, 35117, 35129, 35141, 35149, 35153, 35159,
35171, 35201, 35221, 35227, 35251, 35257, 35267, 35279, 35281, 35291,
35311, 35317, 35323, 35327, 35339, 35353, 35363, 35381, 35393, 35401,
35407, 35419, 35423, 35437, 35447, 35449, 35461, 35491, 35507, 35509,
35521, 35527, 35531, 35533, 35537, 35543, 35569, 35573, 35591, 35593,
35597, 35603, 35617, 35671, 35677, 35729, 35731, 35747, 35753, 35759,
35771, 35797, 35801, 35803, 35809, 35831, 35837, 35839, 35851, 35863,
35869, 35879, 35897, 35899, 35911, 35923, 35933, 35951, 35963, 35969,
35977, 35983, 35993, 35999, 36007, 36011, 36013, 36017, 36037, 36061,
36067, 36073, 36083, 36097, 36107, 36109, 36131, 36137, 36151, 36161,
36187, 36191, 36209, 36217, 36229, 36241, 36251, 36263, 36269, 36277,
36293, 36299, 36307, 36313, 36319, 36341, 36343, 36353, 36373, 36383,
36389, 36433, 36451, 36457, 36467, 36469, 36473, 36479, 36493, 36497,
36523, 36527, 36529, 36541, 36551, 36559, 36563, 36571, 36583, 36587,
36599, 36607, 36629, 36637, 36643, 36653, 36671, 36677, 36683, 36691,
36697, 36709, 36713, 36721, 36739, 36749, 36761, 36767, 36779, 36781,
36787, 36791, 36793, 36809, 36821, 36833, 36847, 36857, 36871, 36877,
36887, 36899, 36901, 36913, 36919, 36923, 36929, 36931, 36943, 36947,
36973, 36979, 36997, 37003, 37013, 37019, 37021, 37039, 37049, 37057,
37061, 37087, 37097, 37117, 37123, 37139, 37159, 37171, 37181, 37189,
37199, 37201, 37217, 37223, 37243, 37253, 37273, 37277, 37307, 37309,
37313, 37321, 37337, 37339, 37357, 37361, 37363, 37369, 37379, 37397,
37409, 37423, 37441, 37447, 37463, 37483, 37489, 37493, 37501, 37507,
37511, 37517, 37529, 37537, 37547, 37549, 37561, 37567, 37571, 37573,
37579, 37589, 37591, 37607, 37619, 37633, 37643, 37649, 37657, 37663,
37691, 37693, 37699, 37717, 37747, 37781, 37783, 37799, 37811, 37813,
37831, 37847, 37853, 37861, 37871, 37879, 37889, 37897, 37907, 37951,
37957, 37963, 37967, 37987, 37991, 37993, 37997, 38011, 38039, 38047,
38053, 38069, 38083, 38113, 38119, 38149, 38153, 38167, 38177, 38183,
38189, 38197, 38201, 38219, 38231, 38237, 38239, 38261, 38273, 38281,
38287, 38299, 38303, 38317, 38321, 38327, 38329, 38333, 38351, 38371,
38377, 38393, 38431, 38447, 38449, 38453, 38459, 38461, 38501, 38543,
38557, 38561, 38567, 38569, 38593, 38603, 38609, 38611, 38629, 38639,
38651, 38653, 38669, 38671, 38677, 38693, 38699, 38707, 38711, 38713,
38723, 38729, 38737, 38747, 38749, 38767, 38783, 38791, 38803, 38821,
38833, 38839, 38851, 38861, 38867, 38873, 38891, 38903, 38917, 38921,
38923, 38933, 38953, 38959, 38971, 38977, 38993, 39019, 39023, 39041,
39043, 39047, 39079, 39089, 39097, 39103, 39107, 39113, 39119, 39133,
39139, 39157, 39161, 39163, 39181, 39191, 39199, 39209, 39217, 39227,
39229, 39233, 39239, 39241, 39251, 39293, 39301, 39313, 39317, 39323,
39341, 39343, 39359, 39367, 39371, 39373, 39383, 39397, 39409, 39419,
39439, 39443, 39451, 39461, 39499, 39503, 39509, 39511, 39521, 39541,
39551, 39563, 39569, 39581, 39607, 39619, 39623, 39631, 39659, 39667,
39671, 39679, 39703, 39709, 39719, 39727, 39733, 39749, 39761, 39769,
39779, 39791, 39799, 39821, 39827, 39829, 39839, 39841, 39847, 39857,
39863, 39869, 39877, 39883, 39887, 39901, 39929, 39937, 39953, 39971,
39979, 39983, 39989, 40009, 40013, 40031, 40037, 40039, 40063, 40087,
40093, 40099, 40111, 40123, 40127, 40129, 40151, 40153, 40163, 40169,
40177, 40189, 40193, 40213, 40231, 40237, 40241, 40253, 40277, 40283,
40289, 40343, 40351, 40357, 40361, 40387, 40423, 40427, 40429, 40433,
40459, 40471, 40483, 40487, 40493, 40499, 40507, 40519, 40529, 40531,
40543, 40559, 40577, 40583, 40591, 40597, 40609, 40627, 40637, 40639,
40693, 40697, 40699, 40709, 40739, 40751, 40759, 40763, 40771, 40787,
40801, 40813, 40819, 40823, 40829, 40841, 40847, 40849, 40853, 40867,
40879, 40883, 40897, 40903, 40927, 40933, 40939, 40949, 40961, 40973,
40993, 41011, 41017, 41023, 41039, 41047, 41051, 41057, 41077, 41081,
41113, 41117, 41131, 41141, 41143, 41149, 41161, 41177, 41179, 41183,
41189, 41201, 41203, 41213, 41221, 41227, 41231, 41233, 41243, 41257,
41263, 41269, 41281, 41299, 41333, 41341, 41351, 41357, 41381, 41387,
41389, 41399, 41411, 41413, 41443, 41453, 41467, 41479, 41491, 41507,
41513, 41519, 41521, 41539, 41543, 41549, 41579, 41593, 41597, 41603,
41609, 41611, 41617, 41621, 41627, 41641, 41647, 41651, 41659, 41669,
41681, 41687, 41719, 41729, 41737, 41759, 41761, 41771, 41777, 41801,
41809, 41813, 41843, 41849, 41851, 41863, 41879, 41887, 41893, 41897,
41903, 41911, 41927, 41941, 41947, 41953, 41957, 41959, 41969, 41981,
41983, 41999, 42013, 42017, 42019, 42023, 42043, 42061, 42071, 42073,
42083, 42089, 42101, 42131, 42139, 42157, 42169, 42179, 42181, 42187,
42193, 42197, 42209, 42221, 42223, 42227, 42239, 42257, 42281, 42283,
42293, 42299, 42307, 42323, 42331, 42337, 42349, 42359, 42373, 42379,
42391, 42397, 42403, 42407, 42409, 42433, 42437, 42443, 42451, 42457,
42461, 42463, 42467, 42473, 42487, 42491, 42499, 42509, 42533, 42557,
42569, 42571, 42577, 42589, 42611, 42641, 42643, 42649, 42667, 42677,
42683, 42689, 42697, 42701, 42703, 42709, 42719, 42727, 42737, 42743,
42751, 42767, 42773, 42787, 42793, 42797, 42821, 42829, 42839, 42841,
42853, 42859, 42863, 42899, 42901, 42923, 42929, 42937, 42943, 42953,
42961, 42967, 42979, 42989, 43003, 43013, 43019, 43037, 43049, 43051,
43063, 43067, 43093, 43103, 43117, 43133, 43151, 43159, 43177, 43189,
43201, 43207, 43223, 43237, 43261, 43271, 43283, 43291, 43313, 43319,
43321, 43331, 43391, 43397, 43399, 43403, 43411, 43427, 43441, 43451,
43457, 43481, 43487, 43499, 43517, 43541, 43543, 43573, 43577, 43579,
43591, 43597, 43607, 43609, 43613, 43627, 43633, 43649, 43651, 43661,
43669, 43691, 43711, 43717, 43721, 43753, 43759, 43777, 43781, 43783,
43787, 43789, 43793, 43801, 43853, 43867, 43889, 43891, 43913, 43933,
43943, 43951, 43961, 43963, 43969, 43973, 43987, 43991, 43997, 44017,
44021, 44027, 44029, 44041, 44053, 44059, 44071, 44087, 44089, 44101,
44111, 44119, 44123, 44129, 44131, 44159, 44171, 44179, 44189, 44201,
44203, 44207, 44221, 44249, 44257, 44263, 44267, 44269, 44273, 44279,
44281, 44293, 44351, 44357, 44371, 44381, 44383, 44389, 44417, 44449,
44453, 44483, 44491, 44497, 44501, 44507, 44519, 44531, 44533, 44537,
44543, 44549, 44563, 44579, 44587, 44617, 44621, 44623, 44633, 44641,
44647, 44651, 44657, 44683, 44687, 44699, 44701, 44711, 44729, 44741,
44753, 44771, 44773, 44777, 44789, 44797, 44809, 44819, 44839, 44843,
44851, 44867, 44879, 44887, 44893, 44909, 44917, 44927, 44939, 44953,
44959, 44963, 44971, 44983, 44987, 45007, 45013, 45053, 45061, 45077,
45083, 45119, 45121, 45127, 45131, 45137, 45139, 45161, 45179, 45181,
45191, 45197, 45233, 45247, 45259, 45263, 45281, 45289, 45293, 45307,
45317, 45319, 45329, 45337, 45341, 45343, 45361, 45377, 45389, 45403,
45413, 45427, 45433, 45439, 45481, 45491, 45497, 45503, 45523, 45533,
45541, 45553, 45557, 45569, 45587, 45589, 45599, 45613, 45631, 45641,
45659, 45667, 45673, 45677, 45691, 45697, 45707, 45737, 45751, 45757,
45763, 45767, 45779, 45817, 45821, 45823, 45827, 45833, 45841, 45853,
45863, 45869, 45887, 45893, 45943, 45949, 45953, 45959, 45971, 45979,
45989, 46021, 46027, 46049, 46051, 46061, 46073, 46091, 46093, 46099,
46103, 46133, 46141, 46147, 46153, 46171, 46181, 46183, 46187, 46199,
46219, 46229, 46237, 46261, 46271, 46273, 46279, 46301, 46307, 46309,
46327, 46337, 46349, 46351, 46381, 46399, 46411, 46439, 46441, 46447,
46451, 46457, 46471, 46477, 46489, 46499, 46507, 46511, 46523, 46549,
46559, 46567, 46573, 46589, 46591, 46601, 46619, 46633, 46639, 46643,
46649, 46663, 46679, 46681, 46687, 46691, 46703, 46723, 46727, 46747,
46751, 46757, 46769, 46771, 46807, 46811, 46817, 46819, 46829, 46831,
46853, 46861, 46867, 46877, 46889, 46901, 46919, 46933, 46957, 46993,
46997, 47017, 47041, 47051, 47057, 47059, 47087, 47093, 47111, 47119,
47123, 47129, 47137, 47143, 47147, 47149, 47161, 47189, 47207, 47221,
47237, 47251, 47269, 47279, 47287, 47293, 47297, 47303, 47309, 47317,
47339, 47351, 47353, 47363, 47381, 47387, 47389, 47407, 47417, 47419,
47431, 47441, 47459, 47491, 47497, 47501, 47507, 47513, 47521, 47527,
47533, 47543, 47563, 47569, 47581, 47591, 47599, 47609, 47623, 47629,
47639, 47653, 47657, 47659, 47681, 47699, 47701, 47711, 47713, 47717,
47737, 47741, 47743, 47777, 47779, 47791, 47797, 47807, 47809, 47819,
47837, 47843, 47857, 47869, 47881, 47903, 47911, 47917, 47933, 47939,
47947, 47951, 47963, 47969, 47977, 47981, 48017, 48023, 48029, 48049,
48073, 48079, 48091, 48109, 48119, 48121, 48131, 48157, 48163, 48179,
48187, 48193, 48197, 48221, 48239, 48247, 48259, 48271, 48281, 48299,
48311, 48313, 48337, 48341, 48353, 48371, 48383, 48397, 48407, 48409,
48413, 48437, 48449, 48463, 48473, 48479, 48481, 48487, 48491, 48497,
48523, 48527, 48533, 48539, 48541, 48563, 48571, 48589, 48593, 48611,
48619, 48623, 48647, 48649, 48661, 48673, 48677, 48679, 48731, 48733,
48751, 48757, 48761, 48767, 48779, 48781, 48787, 48799, 48809, 48817,
48821, 48823, 48847, 48857, 48859, 48869, 48871, 48883, 48889, 48907,
48947, 48953, 48973, 48989, 48991, 49003, 49009, 49019, 49031, 49033,
49037, 49043, 49057, 49069, 49081, 49103, 49109, 49117, 49121, 49123,
49139, 49157, 49169, 49171, 49177, 49193, 49199, 49201, 49207, 49211,
49223, 49253, 49261, 49277, 49279, 49297, 49307, 49331, 49333, 49339,
49363, 49367, 49369, 49391, 49393, 49409, 49411, 49417, 49429, 49433,
49451, 49459, 49463, 49477, 49481, 49499, 49523, 49529, 49531, 49537,
49547, 49549, 49559, 49597, 49603, 49613, 49627, 49633, 49639, 49663,
49667, 49669, 49681, 49697, 49711, 49727, 49739, 49741, 49747, 49757,
49783, 49787, 49789, 49801, 49807, 49811, 49823, 49831, 49843, 49853,
49871, 49877, 49891, 49919, 49921, 49927, 49937, 49939, 49943, 49957,
49991, 49993, 49999, 50021, 50023, 50033, 50047, 50051, 50053, 50069,
50077, 50087, 50093, 50101, 50111, 50119, 50123, 50129, 50131, 50147,
50153, 50159, 50177, 50207, 50221, 50227, 50231, 50261, 50263, 50273,
50287, 50291, 50311, 50321, 50329, 50333, 50341, 50359, 50363, 50377,
50383, 50387, 50411, 50417, 50423, 50441, 50459, 50461, 50497, 50503,
50513, 50527, 50539, 50543, 50549, 50551, 50581, 50587, 50591, 50593,
50599, 50627, 50647, 50651, 50671, 50683, 50707, 50723, 50741, 50753,
50767, 50773, 50777, 50789, 50821, 50833, 50839, 50849, 50857, 50867,
50873, 50891, 50893, 50909, 50923, 50929, 50951, 50957, 50969, 50971,
50989, 50993, 51001, 51031, 51043, 51047, 51059, 51061, 51071, 51109,
51131, 51133, 51137, 51151, 51157, 51169, 51193, 51197, 51199, 51203,
51217, 51229, 51239, 51241, 51257, 51263, 51283, 51287, 51307, 51329,
51341, 51343, 51347, 51349, 51361, 51383, 51407, 51413, 51419, 51421,
51427, 51431, 51437, 51439, 51449, 51461, 51473, 51479, 51481, 51487,
51503, 51511, 51517, 51521, 51539, 51551, 51563, 51577, 51581, 51593,
51599, 51607, 51613, 51631, 51637, 51647, 51659, 51673, 51679, 51683,
51691, 51713, 51719, 51721, 51749, 51767, 51769, 51787, 51797, 51803,
51817, 51827, 51829, 51839, 51853, 51859, 51869, 51871, 51893, 51899,
51907, 51913, 51929, 51941, 51949, 51971, 51973, 51977, 51991, 52009,
52021, 52027, 52051, 52057, 52067, 52069, 52081, 52103, 52121, 52127,
52147, 52153, 52163, 52177, 52181, 52183, 52189, 52201, 52223, 52237,
52249, 52253, 52259, 52267, 52289, 52291, 52301, 52313, 52321, 52361,
52363, 52369, 52379, 52387, 52391, 52433, 52453, 52457, 52489, 52501,
52511, 52517, 52529, 52541, 52543, 52553, 52561, 52567, 52571, 52579,
52583, 52609, 52627, 52631, 52639, 52667, 52673, 52691, 52697, 52709,
52711, 52721, 52727, 52733, 52747, 52757, 52769, 52783, 52807, 52813,
52817, 52837, 52859, 52861, 52879, 52883, 52889, 52901, 52903, 52919,
52937, 52951, 52957, 52963, 52967, 52973, 52981, 52999, 53003, 53017,
53047, 53051, 53069, 53077, 53087, 53089, 53093, 53101, 53113, 53117,
53129, 53147, 53149, 53161, 53171, 53173, 53189, 53197, 53201, 53231,
53233, 53239, 53267, 53269, 53279, 53281, 53299, 53309, 53323, 53327,
53353, 53359, 53377, 53381, 53401, 53407, 53411, 53419, 53437, 53441,
53453, 53479, 53503, 53507, 53527, 53549, 53551, 53569, 53591, 53593,
53597, 53609, 53611, 53617, 53623, 53629, 53633, 53639, 53653, 53657,
53681, 53693, 53699, 53717, 53719, 53731, 53759, 53773, 53777, 53783,
53791, 53813, 53819, 53831, 53849, 53857, 53861, 53881, 53887, 53891,
53897, 53899, 53917, 53923, 53927, 53939, 53951, 53959, 53987, 53993,
54001, 54011, 54013, 54037, 54049, 54059, 54083, 54091, 54101, 54121,
54133, 54139, 54151, 54163, 54167, 54181, 54193, 54217, 54251, 54269,
54277, 54287, 54293, 54311, 54319, 54323, 54331, 54347, 54361, 54367,
54371, 54377, 54401, 54403, 54409, 54413, 54419, 54421, 54437, 54443,
54449, 54469, 54493, 54497, 54499, 54503, 54517, 54521, 54539, 54541,
54547, 54559, 54563, 54577, 54581, 54583, 54601, 54617, 54623, 54629,
54631, 54647, 54667, 54673, 54679, 54709, 54713, 54721, 54727, 54751,
54767, 54773, 54779, 54787, 54799, 54829, 54833, 54851, 54869, 54877,
54881, 54907, 54917, 54919, 54941, 54949, 54959, 54973, 54979, 54983,
55001, 55009, 55021, 55049, 55051, 55057, 55061, 55073, 55079, 55103,
55109, 55117, 55127, 55147, 55163, 55171, 55201, 55207, 55213, 55217,
55219, 55229, 55243, 55249, 55259, 55291, 55313, 55331, 55333, 55337,
55339, 55343, 55351, 55373, 55381, 55399, 55411, 55439, 55441, 55457,
55469, 55487, 55501, 55511, 55529, 55541, 55547, 55579, 55589, 55603,
55609, 55619, 55621, 55631, 55633, 55639, 55661, 55663, 55667, 55673,
55681, 55691, 55697, 55711, 55717, 55721, 55733, 55763, 55787, 55793,
55799, 55807, 55813, 55817, 55819, 55823, 55829, 55837, 55843, 55849,
55871, 55889, 55897, 55901, 55903, 55921, 55927, 55931, 55933, 55949,
55967, 55987, 55997, 56003, 56009, 56039, 56041, 56053, 56081, 56087,
56093, 56099, 56101, 56113, 56123, 56131, 56149, 56167, 56171, 56179,
56197, 56207, 56209, 56237, 56239, 56249, 56263, 56267, 56269, 56299,
56311, 56333, 56359, 56369, 56377, 56383, 56393, 56401, 56417, 56431,
56437, 56443, 56453, 56467, 56473, 56477, 56479, 56489, 56501, 56503,
56509, 56519, 56527, 56531, 56533, 56543, 56569, 56591, 56597, 56599,
56611, 56629, 56633, 56659, 56663, 56671, 56681, 56687, 56701, 56711,
56713, 56731, 56737, 56747, 56767, 56773, 56779, 56783, 56807, 56809,
56813, 56821, 56827, 56843, 56857, 56873, 56891, 56893, 56897, 56909,
56911, 56921, 56923, 56929, 56941, 56951, 56957, 56963, 56983, 56989,
56993, 56999, 57037, 57041, 57047, 57059, 57073, 57077, 57089, 57097,
57107, 57119, 57131, 57139, 57143, 57149, 57163, 57173, 57179, 57191,
57193, 57203, 57221, 57223, 57241, 57251, 57259, 57269, 57271, 57283,
57287, 57301, 57329, 57331, 57347, 57349, 57367, 57373, 57383, 57389,
57397, 57413, 57427, 57457, 57467, 57487, 57493, 57503, 57527, 57529,
57557, 57559, 57571, 57587, 57593, 57601, 57637, 57641, 57649, 57653,
57667, 57679, 57689, 57697, 57709, 57713, 57719, 57727, 57731, 57737,
57751, 57773, 57781, 57787, 57791, 57793, 57803, 57809, 57829, 57839,
57847, 57853, 57859, 57881, 57899, 57901, 57917, 57923, 57943, 57947,
57973, 57977, 57991, 58013, 58027, 58031, 58043, 58049, 58057, 58061,
58067, 58073, 58099, 58109, 58111, 58129, 58147, 58151, 58153, 58169,
58171, 58189, 58193, 58199, 58207, 58211, 58217, 58229, 58231, 58237,
58243, 58271, 58309, 58313, 58321, 58337, 58363, 58367, 58369, 58379,
58391, 58393, 58403, 58411, 58417, 58427, 58439, 58441, 58451, 58453,
58477, 58481, 58511, 58537, 58543, 58549, 58567, 58573, 58579, 58601,
58603, 58613, 58631, 58657, 58661, 58679, 58687, 58693, 58699, 58711,
58727, 58733, 58741, 58757, 58763, 58771, 58787, 58789, 58831, 58889,
58897, 58901, 58907, 58909, 58913, 58921, 58937, 58943, 58963, 58967,
58979, 58991, 58997, 59009, 59011, 59021, 59023, 59029, 59051, 59053,
59063, 59069, 59077, 59083, 59093, 59107, 59113, 59119, 59123, 59141,
59149, 59159, 59167, 59183, 59197, 59207, 59209, 59219, 59221, 59233,
59239, 59243, 59263, 59273, 59281, 59333, 59341, 59351, 59357, 59359,
59369, 59377, 59387, 59393, 59399, 59407, 59417, 59419, 59441, 59443,
59447, 59453, 59467, 59471, 59473, 59497, 59509, 59513, 59539, 59557,
59561, 59567, 59581, 59611, 59617, 59621, 59627, 59629, 59651, 59659,
59663, 59669, 59671, 59693, 59699, 59707, 59723, 59729, 59743, 59747,
59753, 59771, 59779, 59791, 59797, 59809, 59833, 59863, 59879, 59887,
59921, 59929, 59951, 59957, 59971, 59981, 59999, 60013, 60017, 60029,
60037, 60041, 60077, 60083, 60089, 60091, 60101, 60103, 60107, 60127,
60133, 60139, 60149, 60161, 60167, 60169, 60209, 60217, 60223, 60251,
60257, 60259, 60271, 60289, 60293, 60317, 60331, 60337, 60343, 60353,
60373, 60383, 60397, 60413, 60427, 60443, 60449, 60457, 60493, 60497,
60509, 60521, 60527, 60539, 60589, 60601, 60607, 60611, 60617, 60623,
60631, 60637, 60647, 60649, 60659, 60661, 60679, 60689, 60703, 60719,
60727, 60733, 60737, 60757, 60761, 60763, 60773, 60779, 60793, 60811,
60821, 60859, 60869, 60887, 60889, 60899, 60901, 60913, 60917, 60919,
60923, 60937, 60943, 60953, 60961, 61001, 61007, 61027, 61031, 61043,
61051, 61057, 61091, 61099, 61121, 61129, 61141, 61151, 61153, 61169,
61211, 61223, 61231, 61253, 61261, 61283, 61291, 61297, 61331, 61333,
61339, 61343, 61357, 61363, 61379, 61381, 61403, 61409, 61417, 61441,
61463, 61469, 61471, 61483, 61487, 61493, 61507, 61511, 61519, 61543,
61547, 61553, 61559, 61561, 61583, 61603, 61609, 61613, 61627, 61631,
61637, 61643, 61651, 61657, 61667, 61673, 61681, 61687, 61703, 61717,
61723, 61729, 61751, 61757, 61781, 61813, 61819, 61837, 61843, 61861,
61871, 61879, 61909, 61927, 61933, 61949, 61961, 61967, 61979, 61981,
61987, 61991, 62003, 62011, 62017, 62039, 62047, 62053, 62057, 62071,
62081, 62099, 62119, 62129, 62131, 62137, 62141, 62143, 62171, 62189,
62191, 62201, 62207, 62213, 62219, 62233, 62273, 62297, 62299, 62303,
62311, 62323, 62327, 62347, 62351, 62383, 62401, 62417, 62423, 62459,
62467, 62473, 62477, 62483, 62497, 62501, 62507, 62533, 62539, 62549,
62563, 62581, 62591, 62597, 62603, 62617, 62627, 62633, 62639, 62653,
62659, 62683, 62687, 62701, 62723, 62731, 62743, 62753, 62761, 62773,
62791, 62801, 62819, 62827, 62851, 62861, 62869, 62873, 62897, 62903,
62921, 62927, 62929, 62939, 62969, 62971, 62981, 62983, 62987, 62989,
63029, 63031, 63059, 63067, 63073, 63079, 63097, 63103, 63113, 63127,
63131, 63149, 63179, 63197, 63199, 63211, 63241, 63247, 63277, 63281,
63299, 63311, 63313, 63317, 63331, 63337, 63347, 63353, 63361, 63367,
63377, 63389, 63391, 63397, 63409, 63419, 63421, 63439, 63443, 63463,
63467, 63473, 63487, 63493, 63499, 63521, 63527, 63533, 63541, 63559,
63577, 63587, 63589, 63599, 63601, 63607, 63611, 63617, 63629, 63647,
63649, 63659, 63667, 63671, 63689, 63691, 63697, 63703, 63709, 63719,
63727, 63737, 63743, 63761, 63773, 63781, 63793, 63799, 63803, 63809,
63823, 63839, 63841, 63853, 63857, 63863, 63901, 63907, 63913, 63929,
63949, 63977, 63997, 64007, 64013, 64019, 64033, 64037, 64063, 64067,
64081, 64091, 64109, 64123, 64151, 64153, 64157, 64171, 64187, 64189,
64217, 64223, 64231, 64237, 64271, 64279, 64283, 64301, 64303, 64319,
64327, 64333, 64373, 64381, 64399, 64403, 64433, 64439, 64451, 64453,
64483, 64489, 64499, 64513, 64553, 64567, 64577, 64579, 64591, 64601,
64609, 64613, 64621, 64627, 64633, 64661, 64663, 64667, 64679, 64693,
64709, 64717, 64747, 64763, 64781, 64783, 64793, 64811, 64817, 64849,
64853, 64871, 64877, 64879, 64891, 64901, 64919, 64921, 64927, 64937,
64951, 64969, 64997, 65003, 65011, 65027, 65029, 65033, 65053, 65063,
65071, 65089, 65099, 65101, 65111, 65119, 65123, 65129, 65141, 65147,
65167, 65171, 65173, 65179, 65183, 65203, 65213, 65239, 65257, 65267,
65269, 65287, 65293, 65309, 65323, 65327, 65353, 65357, 65371, 65381,
65393, 65407, 65413, 65419, 65423, 65437, 65447, 65449, 65479, 65497,
65519, 65521, 65537, 65539, 65543, 65551, 65557, 65563, 65579, 65581,
65587, 65599, 65609, 65617, 65629, 65633, 65647, 65651, 65657, 65677,
65687, 65699, 65701, 65707, 65713, 65717, 65719, 65729, 65731, 65761,
65777, 65789, 65809, 65827, 65831, 65837, 65839, 65843, 65851, 65867,
65881, 65899, 65921, 65927, 65929, 65951, 65957, 65963, 65981, 65983,
65993, 66029, 66037, 66041, 66047, 66067, 66071, 66083, 66089, 66103,
66107, 66109, 66137, 66161, 66169, 66173, 66179, 66191, 66221, 66239,
66271, 66293, 66301, 66337, 66343, 66347, 66359, 66361, 66373, 66377,
66383, 66403, 66413, 66431, 66449, 66457, 66463, 66467, 66491, 66499,
66509, 66523, 66529, 66533, 66541, 66553, 66569, 66571, 66587, 66593,
66601, 66617, 66629, 66643, 66653, 66683, 66697, 66701, 66713, 66721,
66733, 66739, 66749, 66751, 66763, 66791, 66797, 66809, 66821, 66841,
66851, 66853, 66863, 66877, 66883, 66889, 66919, 66923, 66931, 66943,
66947, 66949, 66959, 66973, 66977, 67003, 67021, 67033, 67043, 67049,
67057, 67061, 67073, 67079, 67103, 67121, 67129, 67139, 67141, 67153,
67157, 67169, 67181, 67187, 67189, 67211, 67213, 67217, 67219, 67231,
67247, 67261, 67271, 67273, 67289, 67307, 67339, 67343, 67349, 67369,
67391, 67399, 67409, 67411, 67421, 67427, 67429, 67433, 67447, 67453,
67477, 67481, 67489, 67493, 67499, 67511, 67523, 67531, 67537, 67547,
67559, 67567, 67577, 67579, 67589, 67601, 67607, 67619, 67631, 67651,
67679, 67699, 67709, 67723, 67733, 67741, 67751, 67757, 67759, 67763,
67777, 67783, 67789, 67801, 67807, 67819, 67829, 67843, 67853, 67867,
67883, 67891, 67901, 67927, 67931, 67933, 67939, 67943, 67957, 67961,
67967, 67979, 67987, 67993, 68023, 68041, 68053, 68059, 68071, 68087,
68099, 68111, 68113, 68141, 68147, 68161, 68171, 68207, 68209, 68213,
68219, 68227, 68239, 68261, 68279, 68281, 68311, 68329, 68351, 68371,
68389, 68399, 68437, 68443, 68447, 68449, 68473, 68477, 68483, 68489,
68491, 68501, 68507, 68521, 68531, 68539, 68543, 68567, 68581, 68597,
68611, 68633, 68639, 68659, 68669, 68683, 68687, 68699, 68711, 68713,
68729, 68737, 68743, 68749, 68767, 68771, 68777, 68791, 68813, 68819,
68821, 68863, 68879, 68881, 68891, 68897, 68899, 68903, 68909, 68917,
68927, 68947, 68963, 68993, 69001, 69011, 69019, 69029, 69031, 69061,
69067, 69073, 69109, 69119, 69127, 69143, 69149, 69151, 69163, 69191,
69193, 69197, 69203, 69221, 69233, 69239, 69247, 69257, 69259, 69263,
69313, 69317, 69337, 69341, 69371, 69379, 69383, 69389, 69401, 69403,
69427, 69431, 69439, 69457, 69463, 69467, 69473, 69481, 69491, 69493,
69497, 69499, 69539, 69557, 69593, 69623, 69653, 69661, 69677, 69691,
69697, 69709, 69737, 69739, 69761, 69763, 69767, 69779, 69809, 69821,
69827, 69829, 69833, 69847, 69857, 69859, 69877, 69899, 69911, 69929,
69931, 69941, 69959, 69991, 69997, 70001, 70003, 70009, 70019, 70039,
70051, 70061, 70067, 70079, 70099, 70111, 70117, 70121, 70123, 70139,
70141, 70157, 70163, 70177, 70181, 70183, 70199, 70201, 70207, 70223,
70229, 70237, 70241, 70249, 70271, 70289, 70297, 70309, 70313, 70321,
70327, 70351, 70373, 70379, 70381, 70393, 70423, 70429, 70439, 70451,
70457, 70459, 70481, 70487, 70489, 70501, 70507, 70529, 70537, 70549,
70571, 70573, 70583, 70589, 70607, 70619, 70621, 70627, 70639, 70657,
70663, 70667, 70687, 70709, 70717, 70729, 70753, 70769, 70783, 70793,
70823, 70841, 70843, 70849, 70853, 70867, 70877, 70879, 70891, 70901,
70913, 70919, 70921, 70937, 70949, 70951, 70957, 70969, 70979, 70981,
70991, 70997, 70999, 71011, 71023, 71039, 71059, 71069, 71081, 71089,
71119, 71129, 71143, 71147, 71153, 71161, 71167, 71171, 71191, 71209,
71233, 71237, 71249, 71257, 71261, 71263, 71287, 71293, 71317, 71327,
71329, 71333, 71339, 71341, 71347, 71353, 71359, 71363, 71387, 71389,
71399, 71411, 71413, 71419, 71429, 71437, 71443, 71453, 71471, 71473,
71479, 71483, 71503, 71527, 71537, 71549, 71551, 71563, 71569, 71593,
71597, 71633, 71647, 71663, 71671, 71693, 71699, 71707, 71711, 71713,
71719, 71741, 71761, 71777, 71789, 71807, 71809, 71821, 71837, 71843,
71849, 71861, 71867, 71879, 71881, 71887, 71899, 71909, 71917, 71933,
71941, 71947, 71963, 71971, 71983, 71987, 71993, 71999, 72019, 72031,
72043, 72047, 72053, 72073, 72077, 72089, 72091, 72101, 72103, 72109,
72139, 72161, 72167, 72169, 72173, 72211, 72221, 72223, 72227, 72229,
72251, 72253, 72269, 72271, 72277, 72287, 72307, 72313, 72337, 72341,
72353, 72367, 72379, 72383, 72421, 72431, 72461, 72467, 72469, 72481,
72493, 72497, 72503, 72533, 72547, 72551, 72559, 72577, 72613, 72617,
72623, 72643, 72647, 72649, 72661, 72671, 72673, 72679, 72689, 72701,
72707, 72719, 72727, 72733, 72739, 72763, 72767, 72797, 72817, 72823,
72859, 72869, 72871, 72883, 72889, 72893, 72901, 72907, 72911, 72923,
72931, 72937, 72949, 72953, 72959, 72973, 72977, 72997, 73009, 73013,
73019, 73037, 73039, 73043, 73061, 73063, 73079, 73091, 73121, 73127,
73133, 73141, 73181, 73189, 73237, 73243, 73259, 73277, 73291, 73303,
73309, 73327, 73331, 73351, 73361, 73363, 73369, 73379, 73387, 73417,
73421, 73433, 73453, 73459, 73471, 73477, 73483, 73517, 73523, 73529,
73547, 73553, 73561, 73571, 73583, 73589, 73597, 73607, 73609, 73613,
73637, 73643, 73651, 73673, 73679, 73681, 73693, 73699, 73709, 73721,
73727, 73751, 73757, 73771, 73783, 73819, 73823, 73847, 73849, 73859,
73867, 73877, 73883, 73897, 73907, 73939, 73943, 73951, 73961, 73973,
73999, 74017, 74021, 74027, 74047, 74051, 74071, 74077, 74093, 74099,
74101, 74131, 74143, 74149, 74159, 74161, 74167, 74177, 74189, 74197,
74201, 74203, 74209, 74219, 74231, 74257, 74279, 74287, 74293, 74297,
74311, 74317, 74323, 74353, 74357, 74363, 74377, 74381, 74383, 74411,
74413, 74419, 74441, 74449, 74453, 74471, 74489, 74507, 74509, 74521,
74527, 74531, 74551, 74561, 74567, 74573, 74587, 74597, 74609, 74611,
74623, 74653, 74687, 74699, 74707, 74713, 74717, 74719, 74729, 74731,
74747, 74759, 74761, 74771, 74779, 74797, 74821, 74827, 74831, 74843,
74857, 74861, 74869, 74873, 74887, 74891, 74897, 74903, 74923, 74929,
74933, 74941, 74959, 75011, 75013, 75017, 75029, 75037, 75041, 75079,
75083, 75109, 75133, 75149, 75161, 75167, 75169, 75181, 75193, 75209,
75211, 75217, 75223, 75227, 75239, 75253, 75269, 75277, 75289, 75307,
75323, 75329, 75337, 75347, 75353, 75367, 75377, 75389, 75391, 75401,
75403, 75407, 75431, 75437, 75479, 75503, 75511, 75521, 75527, 75533,
75539, 75541, 75553, 75557, 75571, 75577, 75583, 75611, 75617, 75619,
75629, 75641, 75653, 75659, 75679, 75683, 75689, 75703, 75707, 75709,
75721, 75731, 75743, 75767, 75773, 75781, 75787, 75793, 75797, 75821,
75833, 75853, 75869, 75883, 75913, 75931, 75937, 75941, 75967, 75979,
75983, 75989, 75991, 75997, 76001, 76003, 76031, 76039, 76079, 76081,
76091, 76099, 76103, 76123, 76129, 76147, 76157, 76159, 76163, 76207,
76213, 76231, 76243, 76249, 76253, 76259, 76261, 76283, 76289, 76303,
76333, 76343, 76367, 76369, 76379, 76387, 76403, 76421, 76423, 76441,
76463, 76471, 76481, 76487, 76493, 76507, 76511, 76519, 76537, 76541,
76543, 76561, 76579, 76597, 76603, 76607, 76631, 76649, 76651, 76667,
76673, 76679, 76697, 76717, 76733, 76753, 76757, 76771, 76777, 76781,
76801, 76819, 76829, 76831, 76837, 76847, 76871, 76873, 76883, 76907,
76913, 76919, 76943, 76949, 76961, 76963, 76991, 77003, 77017, 77023,
77029, 77041, 77047, 77069, 77081, 77093, 77101, 77137, 77141, 77153,
77167, 77171, 77191, 77201, 77213, 77237, 77239, 77243, 77249, 77261,
77263, 77267, 77269, 77279, 77291, 77317, 77323, 77339, 77347, 77351,
77359, 77369, 77377, 77383, 77417, 77419, 77431, 77447, 77471, 77477,
77479, 77489, 77491, 77509, 77513, 77521, 77527, 77543, 77549, 77551,
77557, 77563, 77569, 77573, 77587, 77591, 77611, 77617, 77621, 77641,
77647, 77659, 77681, 77687, 77689, 77699, 77711, 77713, 77719, 77723,
77731, 77743, 77747, 77761, 77773, 77783, 77797, 77801, 77813, 77839,
77849, 77863, 77867, 77893, 77899, 77929, 77933, 77951, 77969, 77977,
77983, 77999, 78007, 78017, 78031, 78041, 78049, 78059, 78079, 78101,
78121, 78137, 78139, 78157, 78163, 78167, 78173, 78179, 78191, 78193,
78203, 78229, 78233, 78241, 78259, 78277, 78283, 78301, 78307, 78311,
78317, 78341, 78347, 78367, 78401, 78427, 78437, 78439, 78467, 78479,
78487, 78497, 78509, 78511, 78517, 78539, 78541, 78553, 78569, 78571,
78577, 78583, 78593, 78607, 78623, 78643, 78649, 78653, 78691, 78697,
78707, 78713, 78721, 78737, 78779, 78781, 78787, 78791, 78797, 78803,
78809, 78823, 78839, 78853, 78857, 78877, 78887, 78889, 78893, 78901,
78919, 78929, 78941, 78977, 78979, 78989, 79031, 79039, 79043, 79063,
79087, 79103, 79111, 79133, 79139, 79147, 79151, 79153, 79159, 79181,
79187, 79193, 79201, 79229, 79231, 79241, 79259, 79273, 79279, 79283,
79301, 79309, 79319, 79333, 79337, 79349, 79357, 79367, 79379, 79393,
79397, 79399, 79411, 79423, 79427, 79433, 79451, 79481, 79493, 79531,
79537, 79549, 79559, 79561, 79579, 79589, 79601, 79609, 79613, 79621,
79627, 79631, 79633, 79657, 79669, 79687, 79691, 79693, 79697, 79699,
79757, 79769, 79777, 79801, 79811, 79813, 79817, 79823, 79829, 79841,
79843, 79847, 79861, 79867, 79873, 79889, 79901, 79903, 79907, 79939,
79943, 79967, 79973, 79979, 79987, 79997, 79999, 80021, 80039, 80051,
80071, 80077, 80107, 80111, 80141, 80147, 80149, 80153, 80167, 80173,
80177, 80191, 80207, 80209, 80221, 80231, 80233, 80239, 80251, 80263,
80273, 80279, 80287, 80309, 80317, 80329, 80341, 80347, 80363, 80369,
80387, 80407, 80429, 80447, 80449, 80471, 80473, 80489, 80491, 80513,
80527, 80537, 80557, 80567, 80599, 80603, 80611, 80621, 80627, 80629,
80651, 80657, 80669, 80671, 80677, 80681, 80683, 80687, 80701, 80713,
80737, 80747, 80749, 80761, 80777, 80779, 80783, 80789, 80803, 80809,
80819, 80831, 80833, 80849, 80863, 80897, 80909, 80911, 80917, 80923,
80929, 80933, 80953, 80963, 80989, 81001, 81013, 81017, 81019, 81023,
81031, 81041, 81043, 81047, 81049, 81071, 81077, 81083, 81097, 81101,
81119, 81131, 81157, 81163, 81173, 81181, 81197, 81199, 81203, 81223,
81233, 81239, 81281, 81283, 81293, 81299, 81307, 81331, 81343, 81349,
81353, 81359, 81371, 81373, 81401, 81409, 81421, 81439, 81457, 81463,
81509, 81517, 81527, 81533, 81547, 81551, 81553, 81559, 81563, 81569,
81611, 81619, 81629, 81637, 81647, 81649, 81667, 81671, 81677, 81689,
81701, 81703, 81707, 81727, 81737, 81749, 81761, 81769, 81773, 81799,
81817, 81839, 81847, 81853, 81869, 81883, 81899, 81901, 81919, 81929,
81931, 81937, 81943, 81953, 81967, 81971, 81973, 82003, 82007, 82009,
82013, 82021, 82031, 82037, 82039, 82051, 82067, 82073, 82129, 82139,
82141, 82153, 82163, 82171, 82183, 82189, 82193, 82207, 82217, 82219,
82223, 82231, 82237, 82241, 82261, 82267, 82279, 82301, 82307, 82339,
82349, 82351, 82361, 82373, 82387, 82393, 82421, 82457, 82463, 82469,
82471, 82483, 82487, 82493, 82499, 82507, 82529, 82531, 82549, 82559,
82561, 82567, 82571, 82591, 82601, 82609, 82613, 82619, 82633, 82651,
82657, 82699, 82721, 82723, 82727, 82729, 82757, 82759, 82763, 82781,
82787, 82793, 82799, 82811, 82813, 82837, 82847, 82883, 82889, 82891,
82903, 82913, 82939, 82963, 82981, 82997, 83003, 83009, 83023, 83047,
83059, 83063, 83071, 83077, 83089, 83093, 83101, 83117, 83137, 83177,
83203, 83207, 83219, 83221, 83227, 83231, 83233, 83243, 83257, 83267,
83269, 83273, 83299, 83311, 83339, 83341, 83357, 83383, 83389, 83399,
83401, 83407, 83417, 83423, 83431, 83437, 83443, 83449, 83459, 83471,
83477, 83497, 83537, 83557, 83561, 83563, 83579, 83591, 83597, 83609,
83617, 83621, 83639, 83641, 83653, 83663, 83689, 83701, 83717, 83719,
83737, 83761, 83773, 83777, 83791, 83813, 83833, 83843, 83857, 83869,
83873, 83891, 83903, 83911, 83921, 83933, 83939, 83969, 83983, 83987,
84011, 84017, 84047, 84053, 84059, 84061, 84067, 84089, 84121, 84127,
84131, 84137, 84143, 84163, 84179, 84181, 84191, 84199, 84211, 84221,
84223, 84229, 84239, 84247, 84263, 84299, 84307, 84313, 84317, 84319,
84347, 84349, 84377, 84389, 84391, 84401, 84407, 84421, 84431, 84437,
84443, 84449, 84457, 84463, 84467, 84481, 84499, 84503, 84509, 84521,
84523, 84533, 84551, 84559, 84589, 84629, 84631, 84649, 84653, 84659,
84673, 84691, 84697, 84701, 84713, 84719, 84731, 84737, 84751, 84761,
84787, 84793, 84809, 84811, 84827, 84857, 84859, 84869, 84871, 84913,
84919, 84947, 84961, 84967, 84977, 84979, 84991, 85009, 85021, 85027,
85037, 85049, 85061, 85081, 85087, 85091, 85093, 85103, 85109, 85121,
85133, 85147, 85159, 85193, 85199, 85201, 85213, 85223, 85229, 85237,
85243, 85247, 85259, 85297, 85303, 85313, 85331, 85333, 85361, 85363,
85369, 85381, 85411, 85427, 85429, 85439, 85447, 85451, 85453, 85469,
85487, 85513, 85517, 85523, 85531, 85549, 85571, 85577, 85597, 85601,
85607, 85619, 85621, 85627, 85639, 85643, 85661, 85667, 85669, 85691,
85703, 85711, 85717, 85733, 85751, 85781, 85793, 85817, 85819, 85829,
85831, 85837, 85843, 85847, 85853, 85889, 85903, 85909, 85931, 85933,
85991, 85999, 86011, 86017, 86027, 86029, 86069, 86077, 86083, 86111,
86113, 86117, 86131, 86137, 86143, 86161, 86171, 86179, 86183, 86197,
86201, 86209, 86239, 86243, 86249, 86257, 86263, 86269, 86287, 86291,
86293, 86297, 86311, 86323, 86341, 86351, 86353, 86357, 86369, 86371,
86381, 86389, 86399, 86413, 86423, 86441, 86453, 86461, 86467, 86477,
86491, 86501, 86509, 86531, 86533, 86539, 86561, 86573, 86579, 86587,
86599, 86627, 86629, 86677, 86689, 86693, 86711, 86719, 86729, 86743,
86753, 86767, 86771, 86783, 86813, 86837, 86843, 86851, 86857, 86861,
86869, 86923, 86927, 86929, 86939, 86951, 86959, 86969, 86981, 86993,
87011, 87013, 87037, 87041, 87049, 87071, 87083, 87103, 87107, 87119,
87121, 87133, 87149, 87151, 87179, 87181, 87187, 87211, 87221, 87223,
87251, 87253, 87257, 87277, 87281, 87293, 87299, 87313, 87317, 87323,
87337, 87359, 87383, 87403, 87407, 87421, 87427, 87433, 87443, 87473,
87481, 87491, 87509, 87511, 87517, 87523, 87539, 87541, 87547, 87553,
87557, 87559, 87583, 87587, 87589, 87613, 87623, 87629, 87631, 87641,
87643, 87649, 87671, 87679, 87683, 87691, 87697, 87701, 87719, 87721,
87739, 87743, 87751, 87767, 87793, 87797, 87803, 87811, 87833, 87853,
87869, 87877, 87881, 87887, 87911, 87917, 87931, 87943, 87959, 87961,
87973, 87977, 87991, 88001, 88003, 88007, 88019, 88037, 88069, 88079,
88093, 88117, 88129, 88169, 88177, 88211, 88223, 88237, 88241, 88259,
88261, 88289, 88301, 88321, 88327, 88337, 88339, 88379, 88397, 88411,
88423, 88427, 88463, 88469, 88471, 88493, 88499, 88513, 88523, 88547,
88589, 88591, 88607, 88609, 88643, 88651, 88657, 88661, 88663, 88667,
88681, 88721, 88729, 88741, 88747, 88771, 88789, 88793, 88799, 88801,
88807, 88811, 88813, 88817, 88819, 88843, 88853, 88861, 88867, 88873,
88883, 88897, 88903, 88919, 88937, 88951, 88969, 88993, 88997, 89003,
89009, 89017, 89021, 89041, 89051, 89057, 89069, 89071, 89083, 89087,
89101, 89107, 89113, 89119, 89123, 89137, 89153, 89189, 89203, 89209,
89213, 89227, 89231, 89237, 89261, 89269, 89273, 89293, 89303, 89317,
89329, 89363, 89371, 89381, 89387, 89393, 89399, 89413, 89417, 89431,
89443, 89449, 89459, 89477, 89491, 89501, 89513, 89519, 89521, 89527,
89533, 89561, 89563, 89567, 89591, 89597, 89599, 89603, 89611, 89627,
89633, 89653, 89657, 89659, 89669, 89671, 89681, 89689, 89753, 89759,
89767, 89779, 89783, 89797, 89809, 89819, 89821, 89833, 89839, 89849,
89867, 89891, 89897, 89899, 89909, 89917, 89923, 89939, 89959, 89963,
89977, 89983, 89989, 90001, 90007, 90011, 90017, 90019, 90023, 90031,
90053, 90059, 90067, 90071, 90073, 90089, 90107, 90121, 90127, 90149,
90163, 90173, 90187, 90191, 90197, 90199, 90203, 90217, 90227, 90239,
90247, 90263, 90271, 90281, 90289, 90313, 90353, 90359, 90371, 90373,
90379, 90397, 90401, 90403, 90407, 90437, 90439, 90469, 90473, 90481,
90499, 90511, 90523, 90527, 90529, 90533, 90547, 90583, 90599, 90617,
90619, 90631, 90641, 90647, 90659, 90677, 90679, 90697, 90703, 90709,
90731, 90749, 90787, 90793, 90803, 90821, 90823, 90833, 90841, 90847,
90863, 90887, 90901, 90907, 90911, 90917, 90931, 90947, 90971, 90977,
90989, 90997, 91009, 91019, 91033, 91079, 91081, 91097, 91099, 91121,
91127, 91129, 91139, 91141, 91151, 91153, 91159, 91163, 91183, 91193,
91199, 91229, 91237, 91243, 91249, 91253, 91283, 91291, 91297, 91303,
91309, 91331, 91367, 91369, 91373, 91381, 91387, 91393, 91397, 91411,
91423, 91433, 91453, 91457, 91459, 91463, 91493, 91499, 91513, 91529,
91541, 91571, 91573, 91577, 91583, 91591, 91621, 91631, 91639, 91673,
91691, 91703, 91711, 91733, 91753, 91757, 91771, 91781, 91801, 91807,
91811, 91813, 91823, 91837, 91841, 91867, 91873, 91909, 91921, 91939,
91943, 91951, 91957, 91961, 91967, 91969, 91997, 92003, 92009, 92033,
92041, 92051, 92077, 92083, 92107, 92111, 92119, 92143, 92153, 92173,
92177, 92179, 92189, 92203, 92219, 92221, 92227, 92233, 92237, 92243,
92251, 92269, 92297, 92311, 92317, 92333, 92347, 92353, 92357, 92363,
92369, 92377, 92381, 92383, 92387, 92399, 92401, 92413, 92419, 92431,
92459, 92461, 92467, 92479, 92489, 92503, 92507, 92551, 92557, 92567,
92569, 92581, 92593, 92623, 92627, 92639, 92641, 92647, 92657, 92669,
92671, 92681, 92683, 92693, 92699, 92707, 92717, 92723, 92737, 92753,
92761, 92767, 92779, 92789, 92791, 92801, 92809, 92821, 92831, 92849,
92857, 92861, 92863, 92867, 92893, 92899, 92921, 92927, 92941, 92951,
92957, 92959, 92987, 92993, 93001, 93047, 93053, 93059, 93077, 93083,
93089, 93097, 93103, 93113, 93131, 93133, 93139, 93151, 93169, 93179,
93187, 93199, 93229, 93239, 93241, 93251, 93253, 93257, 93263, 93281,
93283, 93287, 93307, 93319, 93323, 93329, 93337, 93371, 93377, 93383,
93407, 93419, 93427, 93463, 93479, 93481, 93487, 93491, 93493, 93497,
93503, 93523, 93529, 93553, 93557, 93559, 93563, 93581, 93601, 93607,
93629, 93637, 93683, 93701, 93703, 93719, 93739, 93761, 93763, 93787,
93809, 93811, 93827, 93851, 93871, 93887, 93889, 93893, 93901, 93911,
93913, 93923, 93937, 93941, 93949, 93967, 93971, 93979, 93983, 93997,
94007, 94009, 94033, 94049, 94057, 94063, 94079, 94099, 94109, 94111,
94117, 94121, 94151, 94153, 94169, 94201, 94207, 94219, 94229, 94253,
94261, 94273, 94291, 94307, 94309, 94321, 94327, 94331, 94343, 94349,
94351, 94379, 94397, 94399, 94421, 94427, 94433, 94439, 94441, 94447,
94463, 94477, 94483, 94513, 94529, 94531, 94541, 94543, 94547, 94559,
94561, 94573, 94583, 94597, 94603, 94613, 94621, 94649, 94651, 94687,
94693, 94709, 94723, 94727, 94747, 94771, 94777, 94781, 94789, 94793,
94811, 94819, 94823, 94837, 94841, 94847, 94849, 94873, 94889, 94903,
94907, 94933, 94949, 94951, 94961, 94993, 94999, 95003, 95009, 95021,
95027, 95063, 95071, 95083, 95087, 95089, 95093, 95101, 95107, 95111,
95131, 95143, 95153, 95177, 95189, 95191, 95203, 95213, 95219, 95231,
95233, 95239, 95257, 95261, 95267, 95273, 95279, 95287, 95311, 95317,
95327, 95339, 95369, 95383, 95393, 95401, 95413, 95419, 95429, 95441,
95443, 95461, 95467, 95471, 95479, 95483, 95507, 95527, 95531, 95539,
95549, 95561, 95569, 95581, 95597, 95603, 95617, 95621, 95629, 95633,
95651, 95701, 95707, 95713, 95717, 95723, 95731, 95737, 95747, 95773,
95783, 95789, 95791, 95801, 95803, 95813, 95819, 95857, 95869, 95873,
95881, 95891, 95911, 95917, 95923, 95929, 95947, 95957, 95959, 95971,
95987, 95989, 96001, 96013, 96017, 96043, 96053, 96059, 96079, 96097,
96137, 96149, 96157, 96167, 96179, 96181, 96199, 96211, 96221, 96223,
96233, 96259, 96263, 96269, 96281, 96289, 96293, 96323, 96329, 96331,
96337, 96353, 96377, 96401, 96419, 96431, 96443, 96451, 96457, 96461,
96469, 96479, 96487, 96493, 96497, 96517, 96527, 96553, 96557, 96581,
96587, 96589, 96601, 96643, 96661, 96667, 96671, 96697, 96703, 96731,
96737, 96739, 96749, 96757, 96763, 96769, 96779, 96787, 96797, 96799,
96821, 96823, 96827, 96847, 96851, 96857, 96893, 96907, 96911, 96931,
96953, 96959, 96973, 96979, 96989, 96997, 97001, 97003, 97007, 97021,
97039, 97073, 97081, 97103, 97117, 97127, 97151, 97157, 97159, 97169,
97171, 97177, 97187, 97213, 97231, 97241, 97259, 97283, 97301, 97303,
97327, 97367, 97369, 97373, 97379, 97381, 97387, 97397, 97423, 97429,
97441, 97453, 97459, 97463, 97499, 97501, 97511, 97523, 97547, 97549,
97553, 97561, 97571, 97577, 97579, 97583, 97607, 97609, 97613, 97649,
97651, 97673, 97687, 97711, 97729, 97771, 97777, 97787, 97789, 97813,
97829, 97841, 97843, 97847, 97849, 97859, 97861, 97871, 97879, 97883,
97919, 97927, 97931, 97943, 97961, 97967, 97973, 97987, 98009, 98011,
98017, 98041, 98047, 98057, 98081, 98101, 98123, 98129, 98143, 98179,
98207, 98213, 98221, 98227, 98251, 98257, 98269, 98297, 98299, 98317,
98321, 98323, 98327, 98347, 98369, 98377, 98387, 98389, 98407, 98411,
98419, 98429, 98443, 98453, 98459, 98467, 98473, 98479, 98491, 98507,
98519, 98533, 98543, 98561, 98563, 98573, 98597, 98621, 98627, 98639,
98641, 98663, 98669, 98689, 98711, 98713, 98717, 98729, 98731, 98737,
98773, 98779, 98801, 98807, 98809, 98837, 98849, 98867, 98869, 98873,
98887, 98893, 98897, 98899, 98909, 98911, 98927, 98929, 98939, 98947,
98953, 98963, 98981, 98993, 98999, 99013, 99017, 99023, 99041, 99053,
99079, 99083, 99089, 99103, 99109, 99119, 99131, 99133, 99137, 99139,
99149, 99173, 99181, 99191, 99223, 99233, 99241, 99251, 99257, 99259,
99277, 99289, 99317, 99347, 99349, 99367, 99371, 99377, 99391, 99397,
99401, 99409, 99431, 99439, 99469, 99487, 99497, 99523, 99527, 99529,
99551, 99559, 99563, 99571, 99577, 99581, 99607, 99611, 99623, 99643,
99661, 99667, 99679, 99689, 99707, 99709, 99713, 99719, 99721, 99733,
99761, 99767, 99787, 99793, 99809, 99817, 99823, 99829, 99833, 99839,
99859, 99871, 99877, 99881, 99901, 99907, 99923, 99929, 99961, 99971,
99989, 99991};
int num = prime.size();
for (int i = m / n + 3; i > 0; i--) {
if (i * n <= m) {
if (m % i == 0) {
cout << i << endl;
goto FINE;
}
}
}
cout << 1 << endl;
FINE:
return 0;
} | replace | 978 | 979 | 978 | 979 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max = 0;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (int i = 1; i <= m; i++)
if (m % i == 0 && m / i >= n && i > max)
max = i;
cout << max << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int max = 0;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (int i = 1; i <= m / 2; i++)
if (m % i == 0 && m / i >= n && i > max)
max = i;
cout << max << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 1; i <= 1000000000; i++) {
if (m % i == 0 && m / i >= n) {
ans = i;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
if (n == 1) {
cout << m << endl;
return 0;
}
for (int i = 1; i <= m / n; i++) {
if (m % i == 0 && m / i >= n) {
ans = i;
}
}
cout << ans << endl;
return 0;
} | replace | 27 | 28 | 27 | 32 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int ma = 1;
for (int i = 1; i <= m / n + 1; i++) {
if (m % i == 0 && m / i >= n && i > ma)
ma = i;
}
cout << ma << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n == 1) {
cout << m;
return 0;
}
int ma = 1;
for (int i = 1; i <= m / n + 1; i++) {
if (m % i == 0 && m / i >= n && i > ma)
ma = i;
}
cout << ma << endl;
return 0;
}
| insert | 5 | 5 | 5 | 9 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <string>
#include <type_traits>
#include <vector>
#define int long long
#define ll long long
#define mod 1000000007
#define inf 1e17
#define rep(i, j, n) for (int i = j; i < n; i++)
#define P pair<int, int>
#define ps push_back
double pi = 3.141592653589793;
using namespace std;
int z = 0;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
} // ใใใใๅงใใใ
signed main() {
int a, b;
cin >> a >> b;
for (int i = b; i > 0; i--) {
if (b % i == 0 && a * i <= b) {
cout << i << endl;
return 0;
}
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <string>
#include <type_traits>
#include <vector>
#define int long long
#define ll long long
#define mod 1000000007
#define inf 1e17
#define rep(i, j, n) for (int i = j; i < n; i++)
#define P pair<int, int>
#define ps push_back
double pi = 3.141592653589793;
using namespace std;
int z = 0;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
} // ใใใใๅงใใใ
signed main() {
int a, b;
cin >> a >> b;
vector<int> v;
for (int i = 1; i * i <= b; i++) {
if (b % i == 0) {
v.ps(i);
v.ps(b / i);
}
}
sort(v.begin(), v.end(), greater<int>());
for (auto x : v) {
if (a * x <= b) {
cout << x << endl;
return 0;
}
}
} | replace | 36 | 39 | 36 | 47 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
#define INF32 1'050'000'000
#define INF64 4'000'000'000'000'000'000
using ll = long long;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> T gcd(T x, T y) {
// ๆๅฐๅ
ฌๅๆฐใๆฑใใ
if (y == 0)
return x;
gcd(y, x % y);
}
template <class T> T lcm(T x, T y) {
// ๆๅคงๅ
ฌ็ดๆฐใๆฑใใ
T GCD = gcd(x, y);
T ans = x / GCD * y;
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int ans = 0;
REP(i, M / N) {
if (M % (i + 1) == 0) {
ans = i + 1;
}
}
std::cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start; end <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
#define INF32 1'050'000'000
#define INF64 4'000'000'000'000'000'000
using ll = long long;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> T gcd(T x, T y) {
// ๆๅฐๅ
ฌๅๆฐใๆฑใใ
if (y == 0)
return x;
gcd(y, x % y);
}
template <class T> T lcm(T x, T y) {
// ๆๅคงๅ
ฌ็ดๆฐใๆฑใใ
T GCD = gcd(x, y);
T ans = x / GCD * y;
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int ans = 0;
if (N == 1) {
std::cout << M << '\n';
return 0;
}
REP(i, M / N) {
if (M % (i + 1) == 0) {
ans = i + 1;
}
}
std::cout << ans << '\n';
return 0;
} | insert | 50 | 50 | 50 | 54 | TLE | |
p03241 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define sqrep(i, cc, n) for (long long i = cc; i * i <= n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
ll n, m;
cin >> n >> m;
vector<ll> p;
ll m2 = m;
for (ll i = 0; i * i <= m; i++) {
if (m % i == 0) {
p.push_back(i);
if (m != i * i)
p.push_back(m / i);
}
}
sort(p.begin(), p.end(), greater<ll>());
rep(i, 0, p.size()) {
if (p[i] * n <= m) {
cout << p[i] << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define sqrep(i, cc, n) for (long long i = cc; i * i <= n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
ll n, m;
cin >> n >> m;
vector<ll> p;
for (ll i = 1; i * i <= m; i++) {
if (m % i == 0) {
p.push_back(i);
if (m != i * i)
p.push_back(m / i);
}
}
sort(p.begin(), p.end(), greater<ll>());
rep(i, 0, p.size()) {
if (p[i] * n <= m) {
cout << p[i] << endl;
return 0;
}
}
} | replace | 38 | 40 | 38 | 39 | -8 | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
// priority_queue<llint> q;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n, m;
void solve() {
cin >> n >> m;
int ans;
if (n > m)
ans = 0;
else {
for (int i = 1; i <= m / n; i++) {
if (m % i == 0)
ans = i;
}
}
cout << ans << endl;
}
int main(int argc, char *argv[]) {
solve();
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
// priority_queue<llint> q;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int n, m;
void solve() {
cin >> n >> m;
int ans = 1;
for (int i = 1; i * i <= m; i++) {
if (m % i != 0)
continue;
if (i <= m / n)
ans = max(i, ans);
if (m / i <= m / n)
ans = max(m / i, ans);
}
cout << ans << endl;
}
int main(int argc, char *argv[]) {
solve();
return 0;
}
| replace | 32 | 40 | 32 | 40 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
int maxMOD = 1;
for (int mod = 2; mod <= m; mod++) {
int x = m - mod * (n - 1);
if (x >= mod) {
if (x % mod == 0)
maxMOD = mod;
} else
break;
}
printf("%d\n", maxMOD);
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
int maxMOD = 1;
if (n == 1) {
cout << m << endl;
return 0;
}
for (int mod = 2; mod <= m; mod++) {
int x = m - mod * (n - 1);
if (x >= mod) {
if (x % mod == 0)
maxMOD = mod;
} else
break;
}
printf("%d\n", maxMOD);
return 0;
}
| insert | 34 | 34 | 34 | 38 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define repi(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (int i = a - 1; i >= 0; i--)
ll llmax(ll a, ll b) { return a > b ? a : b; }
int main() {
ll N, M;
cin >> N >> M;
ll ans = 1;
ll n = 1;
while (n * n <= M) {
if (M % n == 0) {
if (n <= M / N)
ans = llmax(ans, n);
if (M / n <= M / N)
ans = llmax(ans, M / n);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define repi(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (int i = a - 1; i >= 0; i--)
ll llmax(ll a, ll b) { return a > b ? a : b; }
int main() {
ll N, M;
cin >> N >> M;
ll ans = 1;
ll n = 1;
while (n * n <= M) {
if (M % n == 0) {
if (n <= M / N)
ans = llmax(ans, n);
if (M / n <= M / N)
ans = llmax(ans, M / n);
}
n++;
}
cout << ans << endl;
return 0;
} | insert | 29 | 29 | 29 | 30 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int max;
for (int i = M; i > 0; i--) {
if (M % i == 0 && M / i >= N) {
max = i;
break;
}
}
cout << max << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int max;
for (int i = M / N + 1; i > 0; i--) {
if (M % i == 0 && M / i >= N) {
max = i;
break;
}
}
cout << max << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define pi pair<int, int>
#define pl pair<long long, long long>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define en cout << endl // ใปใใณใญใณใคใใ
// #define MM 1000000000
// #define MOD MM+7
typedef long long ll;
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
// 'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
template <typename T> T GCD(T u, T v) { return v ? GCD(v, u % v) : u; }
template <typename T> T LCM(T x, T y) {
T gc = GCD(x, y);
return x * y / gc;
}
struct edge {
ll to, cost;
};
/*
const int COM_MAX = 500500;
long long fac[COM_MAX],finv[COM_MAX],inv[COM_MAX];
void init(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < COM_MAX; i++){
fac[i] = fac[i-1]*i%MOD;
inv[i] = MOD - inv[MOD%i]*(MOD/i)%MOD;
finv[i] = finv[i-1]*inv[i]%MOD;
}
}
long long COM(int n,int k){
if(n < k || n < 0 || k < 0) return 0;
return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
*/
int main() {
ll N, M;
cin >> N >> M;
ll mx = 1;
for (ll i = 2; i * N <= M; i++) {
if ((M - i * N) % i == 0) {
mx = i;
}
}
cout << mx << endl;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define pi pair<int, int>
#define pl pair<long long, long long>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define en cout << endl // ใปใใณใญใณใคใใ
// #define MM 1000000000
// #define MOD MM+7
typedef long long ll;
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
// 'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
template <typename T> T GCD(T u, T v) { return v ? GCD(v, u % v) : u; }
template <typename T> T LCM(T x, T y) {
T gc = GCD(x, y);
return x * y / gc;
}
struct edge {
ll to, cost;
};
/*
const int COM_MAX = 500500;
long long fac[COM_MAX],finv[COM_MAX],inv[COM_MAX];
void init(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < COM_MAX; i++){
fac[i] = fac[i-1]*i%MOD;
inv[i] = MOD - inv[MOD%i]*(MOD/i)%MOD;
finv[i] = finv[i-1]*inv[i]%MOD;
}
}
long long COM(int n,int k){
if(n < k || n < 0 || k < 0) return 0;
return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
*/
int main() {
ll N, M;
cin >> N >> M;
if (N == 1) {
cout << M << endl;
return 0;
}
if (N == 2) {
if (M % 2 == 1) {
cout << 1 << endl;
} else {
cout << M / 2 << endl;
}
return 0;
}
ll mx = 1;
for (ll i = 2; i * N <= M; i++) {
if ((M - i * N) % i == 0) {
mx = i;
}
}
cout << mx << endl;
} | insert | 66 | 66 | 66 | 78 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(in) in.begin(), in.end()
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS 0.0000000001
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <typename Head, typename Value>
auto vectors(const Head &head, const Value &v) {
return vector<Value>(head, v);
}
template <typename Head, typename... Tail> auto vectors(Head x, Tail... tail) {
auto inner = vectors(tail...);
return vector<decltype(inner)>(x, inner);
}
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pii>;
int W, H;
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
bool valid(int x, int y) { return (0 <= x && x < W) && (0 <= y && y < H); }
void YN(bool f) { cout << (f ? "YES" : "NO"); }
void yn(bool f) { cout << (f ? "yes" : "no"); }
void YeNo(bool f) { cout << (f ? "Yes" : "No"); }
signed main() {
int n, m;
cin >> n >> m;
int ans = -1;
for (int i = 1; i * n <= m; ++i) {
int q = (m - i * n);
if (q % i == 0)
cmax(ans, i);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(in) in.begin(), in.end()
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS 0.0000000001
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <typename Head, typename Value>
auto vectors(const Head &head, const Value &v) {
return vector<Value>(head, v);
}
template <typename Head, typename... Tail> auto vectors(Head x, Tail... tail) {
auto inner = vectors(tail...);
return vector<decltype(inner)>(x, inner);
}
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pii>;
int W, H;
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
bool valid(int x, int y) { return (0 <= x && x < W) && (0 <= y && y < H); }
void YN(bool f) { cout << (f ? "YES" : "NO"); }
void yn(bool f) { cout << (f ? "yes" : "no"); }
void YeNo(bool f) { cout << (f ? "Yes" : "No"); }
signed main() {
int n, m;
cin >> n >> m;
int ans = 1;
if (m % n == 0) {
cout << m / n << endl;
return 0;
}
for (int i = 2; i * n <= m; ++i) {
if ((m - n * i) % i == 0)
ans = i;
}
cout << ans << endl;
}
| replace | 36 | 41 | 36 | 44 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(), a.end()
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*pi*/ const double pi = acos(-1);
/*็นฐใไธใ้ค็ฎ*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*ๆๅคงๅ
ฌ็ดๆฐ*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*ๆๅฐๅ
ฌๅๆฐ*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*nไน*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*้ไน*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
/*Fibonacciๆฐๅ*/ ll fib(ll x) {
ll i, fibo[x + 10];
fibo[0] = 1;
fibo[1] = 1;
fibo[2] = 1;
rep(i, 3, x + 1) fibo[i] = fibo[i - 1] + fibo[i - 2];
return fibo[x];
}
/*ๆกๆฐ*/ ll dig(ll n) {
ll d = 0, i = 0;
while (n / 10 > 0) {
i++;
d++;
}
return d;
}
/*่ฟท่ทฏ็งปๅ*/ const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
llfor; // ll ans=0;////////////////////////////////////////////////////////////
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1, tmp = m;
bool end = prime(m);
for (i = 2; i * n <= m; i++) {
if (m % i == 0 && m / i >= n) {
ans = max(ans, i);
}
}
pr(ans);
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(), a.end()
#define push(a, b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a, b) (a, vector<ll>(b))
#define llpvec vector<pair<ll, ll>>
/*pi*/ const double pi = acos(-1);
/*็นฐใไธใ้ค็ฎ*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*ๆๅคงๅ
ฌ็ดๆฐ*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*ๆๅฐๅ
ฌๅๆฐ*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*nไน*/ ll llpow(ll x, ll n) {
ll i, ans = 1;
rep(i, 0, n) ans *= x;
return ans;
}
/*้ไน*/ ll fact(ll x) {
ll i, ans = 1;
rep(i, 0, x) ans *= (x - i);
return ans;
}
/*nCr*/ ll ncr(ll n, ll r) { return fact(n) / fact(r) / fact(n - r); }
/*nPr*/ ll npr(ll n, ll r) { return fact(n) / fact(n - r); }
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll i;
for (i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
/*Fibonacciๆฐๅ*/ ll fib(ll x) {
ll i, fibo[x + 10];
fibo[0] = 1;
fibo[1] = 1;
fibo[2] = 1;
rep(i, 3, x + 1) fibo[i] = fibo[i - 1] + fibo[i - 2];
return fibo[x];
}
/*ๆกๆฐ*/ ll dig(ll n) {
ll d = 0, i = 0;
while (n / 10 > 0) {
i++;
d++;
}
return d;
}
/*่ฟท่ทฏ็งปๅ*/ const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
llfor; // ll ans=0;////////////////////////////////////////////////////////////
int main() {
ll n, m;
cin >> n >> m;
ll ans = 1, tmp = m;
bool end = prime(m);
if (m % n == 0) {
pr(m / n);
return 0;
}
for (i = 2; i * n <= m; i++) {
if (m % i == 0 && m / i >= n) {
ans = max(ans, i);
}
}
pr(ans);
return 0;
} | insert | 94 | 94 | 94 | 98 | TLE | |
p03241 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int N, M;
cin >> N >> M;
for (unsigned int i = N; i <= M; i++) {
if (M % i == 0) {
cout << M / i << endl;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int N, M;
cin >> N >> M;
if (M % 2 != 0) {
if (N % 2 == 0) {
N++;
}
for (unsigned int i = N; i <= M; i = i + 2) {
if (M % i == 0) {
cout << M / i << endl;
return 0;
}
}
} else {
for (unsigned int i = N; i <= M; i++) {
if (M % i == 0) {
cout << M / i << endl;
return 0;
}
}
}
}
| replace | 7 | 11 | 7 | 23 | TLE | |
p03242 | C++ | Runtime Error | /* Author - Ankur Kumar Singh
IDE :- Offine Linux
---------------------------------*/
#include <bits/stdc++.h>
using namespace std;
/* variable type :- */
/* variable type :- */
#define ll long long int
#define ld long double
#define I ll
#define mod 1000000007
/* map */
#define abc pair<ll, ll>
map<pair<abc, abc>, ll> pqr;
map<pair<ll, ll>, ll> xyz;
/* vector */
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define mp make_pair
#define ac accumulate
vector<pair<ll, string>> a1;
vector<pair<ll, string>> a2;
vector<pair<ll, string>> a3;
vector<pair<ll, string>> a4;
vector<pair<ll, string>> a5;
vector<pair<ll, string>> a6;
vector<pair<ll, string>> a7;
vector<pair<pair<ll, ll>, ll>> b;
ll cnt;
ll X[121], Y[121];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output2.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string n;
cin >> n;
for (ll i = 0; i < n.size(); i++) {
if (n[i] == '1')
n[i] = '9';
else
n[i] = '1';
}
cout << n;
} | /* Author - Ankur Kumar Singh
IDE :- Offine Linux
---------------------------------*/
#include <bits/stdc++.h>
using namespace std;
/* variable type :- */
/* variable type :- */
#define ll long long int
#define ld long double
#define I ll
#define mod 1000000007
/* map */
#define abc pair<ll, ll>
map<pair<abc, abc>, ll> pqr;
map<pair<ll, ll>, ll> xyz;
/* vector */
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define mp make_pair
#define ac accumulate
vector<pair<ll, string>> a1;
vector<pair<ll, string>> a2;
vector<pair<ll, string>> a3;
vector<pair<ll, string>> a4;
vector<pair<ll, string>> a5;
vector<pair<ll, string>> a6;
vector<pair<ll, string>> a7;
vector<pair<pair<ll, ll>, ll>> b;
ll cnt;
ll X[121], Y[121];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string n;
cin >> n;
for (ll i = 0; i < n.size(); i++) {
if (n[i] == '1')
n[i] = '9';
else
n[i] = '1';
}
cout << n;
} | replace | 34 | 38 | 34 | 35 | 0 | |
p03242 | Python | Runtime Error | n = input()
ans = ""
for i in range(n):
if n[i] == 1:
ans += "9"
else:
ans += "1"
print(int(ans))
| n = input()
ans = ""
for i in range(len(n)):
if n[i] == "1":
ans += "9"
else:
ans += "1"
print(int(ans))
| replace | 3 | 5 | 3 | 5 | TypeError: 'str' object cannot be interpreted as an integer | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03242/Python/s418217784.py", line 5, in <module>
for i in range(n):
TypeError: 'str' object cannot be interpreted as an integer
|
p03242 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
for (int i = 0; i < 3; i++) {
if (N.at(i) == '1')
cout << 9;
else
cout << 1;
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
for (int i = 0; i < 3; i++) {
if (N.at(i) == '1')
cout << 9;
else
cout << 1;
}
cout << endl;
}
| insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p03242 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
cout << 1110 - a;
return 1110 - a;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
cout << 1110 - a;
return 0;
} | replace | 7 | 8 | 7 | 8 | 223 | |
p03242 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
continue;
} else if (s.at(i) == '9') {
s.at(i) = '1';
continue;
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
continue;
} else if (s.at(i) == '9') {
s.at(i) = '1';
continue;
}
}
cout << s << endl;
}
| insert | 4 | 4 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p03242 | C++ | Time Limit Exceeded | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <iostream>
using namespace std;
int main() {
char c;
while (cin >> c, c != '\n') {
if (c == '1')
cout << '9';
else
cout << '1';
}
cout << endl;
return 0;
}
| /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <iostream>
using namespace std;
int main() {
char c;
while (cin >> c) {
if (c == '1')
cout << '9';
else
cout << '1';
}
cout << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | TLE | |
p03242 | C++ | Runtime Error | // Devarshi
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (i = 0; i < n; i++)
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define fora(it, x) for (auto it : x)
#define PI 3.14159265
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
const int maxn = 1000001;
int main() {
sync
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
string s;
cin >> s;
// cout<<s<<endl;
forn(i, s.size()) {
if (s[i] == '1')
s[i] = '9';
else
s[i] = '1';
}
cout << s;
return 0;
}
| // Devarshi
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (i = 0; i < n; i++)
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define ford(i, n) for (ll i = (ll)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define fora(it, x) for (auto it : x)
#define PI 3.14159265
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
const int maxn = 1000001;
int main() {
sync
string s;
cin >> s;
// cout<<s<<endl;
forn(i, s.size()) {
if (s[i] == '1')
s[i] = '9';
else
s[i] = '1';
}
cout << s;
return 0;
}
| replace | 44 | 52 | 44 | 45 | 0 | |
p03242 | Python | Runtime Error | n = int(input())
for i in n:
if i == 1:
i = 9
elif i == 9:
i = 1
print(n)
| n = int(input())
print(1110 - n)
| replace | 1 | 7 | 1 | 2 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03242/Python/s049531454.py", line 2, in <module>
for i in n:
TypeError: 'int' object is not iterable
|
p03242 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define re0(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
const int mod = 7 + 1e9;
const int inf = 1e9;
const int N = 0;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
#endif // ONLINE_JUDGE
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
re0(i, s.size()) cout << ((s[i] == '1') ? 9 : 1);
cout << endl;
}
| #include <bits/stdc++.h>
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define re0(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
const int mod = 7 + 1e9;
const int inf = 1e9;
const int N = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
re0(i, s.size()) cout << ((s[i] == '1') ? 9 : 1);
cout << endl;
}
| delete | 16 | 19 | 16 | 16 | 0 | |
p03242 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> a;
for (int i = 0; i < 3; i++) {
cin >> a.at(i);
}
for (int i = 0; i < 3; i++) {
if (a.at(i) == '1') {
cout << '9';
} else {
cout << '1';
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> a(3);
for (int i = 0; i < 3; i++) {
cin >> a.at(i);
}
for (int i = 0; i < 3; i++) {
if (a.at(i) == '1') {
cout << '9';
} else {
cout << '1';
}
}
cout << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03242 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
} else {
s.at(i) = '1';
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 1110 - n << endl;
} | replace | 3 | 11 | 3 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p03242 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vint;
const int INF = ((1LL << 30) + (1LL << 29));
const ll MOD = 1000000007;
/*
TITLE:
*/
//=================================================
int N;
//=================================================
void input() { cin >> N; }
//=================================================
void solve() {
int ans = 0;
for (int i = 0; N; ++i) {
int m = N % 10;
if (m == 1) {
m = 9;
} else if (m == 9) {
m = 1;
}
ans += 10 * i + m;
}
cout << ans << endl;
}
//=================================================
signed main() {
input();
solve();
return 0;
} | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vint;
const int INF = ((1LL << 30) + (1LL << 29));
const ll MOD = 1000000007;
/*
TITLE:
*/
//=================================================
int N;
//=================================================
void input() { cin >> N; }
//=================================================
void solve() {
int ans = 0;
for (int i = 0; N; ++i) {
int m = N % 10;
if (m == 1) {
m = 9;
} else if (m == 9) {
m = 1;
}
ans += pow(10, i) * m;
N /= 10;
}
cout << ans << endl;
}
//=================================================
signed main() {
input();
solve();
return 0;
} | replace | 31 | 32 | 31 | 33 | TLE | |
p03242 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i = 1, ans = 0;
cin >> n;
while (n) {
int a = n % 10;
if (a == 1)
ans += 9 * i;
if (a == 9)
ans += i;
i *= 10;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i = 1, ans = 0;
cin >> n;
while (n) {
int a = n % 10;
n /= 10;
if (a == 1)
ans += 9 * i;
if (a == 9)
ans += i;
i *= 10;
}
cout << ans << endl;
return 0;
} | insert | 8 | 8 | 8 | 9 | TLE | |
p03242 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int n;
scanf("%d", n);
printf("%d\n", 1110 - n);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", 1110 - n);
return 0;
}
| replace | 6 | 7 | 6 | 7 | -11 | |
p03242 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << endl
#define MOD 1000000007
#define loop(i, start, end) for (ull i = start; i < end; i++)
#define N 100001
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define ov(a) \
for (int i = 0; i < a.size(); i++) \
cout << a[i] << " "; \
nl
int main() {
fastio();
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
string s;
cin >> s;
loop(i, 0, s.size()) {
if (s[i] == '9')
s[i] = '1';
else if (s[i] == '1')
s[i] = '9';
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << endl
#define MOD 1000000007
#define loop(i, start, end) for (ull i = start; i < end; i++)
#define N 100001
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define ov(a) \
for (int i = 0; i < a.size(); i++) \
cout << a[i] << " "; \
nl
int main() {
fastio();
string s;
cin >> s;
loop(i, 0, s.size()) {
if (s[i] == '9')
s[i] = '1';
else if (s[i] == '1')
s[i] = '9';
}
cout << s << endl;
return 0;
} | delete | 28 | 33 | 28 | 28 | 0 | |
p03242 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> v;
while (n != 0) {
if (n % 10 == 1)
v.push_back(9);
else if (n % 10 == 9)
v.push_back(1);
else
v.push_back(n % 10);
}
int i, s = v.size();
for (i = s - 1; i >= 0; --i)
printf("%d", v[i]);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> v;
while (n != 0) {
if (n % 10 == 1)
v.push_back(9);
else if (n % 10 == 9)
v.push_back(1);
else
v.push_back(n % 10);
n /= 10;
}
int i, s = v.size();
for (i = s - 1; i >= 0; --i)
printf("%d", v[i]);
} | insert | 17 | 17 | 17 | 19 | TLE | |
p03242 | Python | Runtime Error | num = input()
x = [int(i) for i in num]
for i in range(len(x)):
if x[i] == 1:
x[i] = "9"
else:
x[i] = "1"
mojiretu = ",".join(x)
print(int(mojiretu))
| num = input()
x = [int(i) for i in num]
for i in range(len(x)):
if x[i] == 1:
x[i] = "9"
else:
x[i] = "1"
mojiretu = "".join(x)
print(int(mojiretu))
| replace | 7 | 8 | 7 | 8 | ValueError: invalid literal for int() with base 10: '9,9,1' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03242/Python/s586545205.py", line 9, in <module>
print(int(mojiretu))
ValueError: invalid literal for int() with base 10: '9,9,1'
|
p03242 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '9')
s.at(i) = '1';
else
s.at(i) = '9';
}
cout << s.at(0) << s.at(1) << s.at(2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '9')
s.at(i) = '1';
else
s.at(i) = '9';
}
cout << s.at(0) << s.at(1) << s.at(2) << endl;
}
| insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p03242 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
if (A.at(0) == '1') {
A.at(0) = '9';
} else {
A.at(0) = '1';
}
if (A.at(1) == '1') {
A.at(1) = '9';
} else {
A.at(1) = '1';
}
if (A.at(2) == '1') {
A.at(2) = '9';
} else {
A.at(2) = '1';
}
cout << A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if (A.at(0) == '1') {
A.at(0) = '9';
} else {
A.at(0) = '1';
}
if (A.at(1) == '1') {
A.at(1) = '9';
} else {
A.at(1) = '1';
}
if (A.at(2) == '1') {
A.at(2) = '9';
} else {
A.at(2) = '1';
}
cout << A << endl;
}
| insert | 4 | 4 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p03243 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod = 1000000007;
const ll inf = LONG_LONG_MAX;
ll dx4[4] = {1, 0, -1, 0};
ll dy4[4] = {0, -1, 0, 1};
ll dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
ll dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
bool ok(ll a) {
string s = to_string(a);
if (s[0] == s[1] && s[1] == s[2])
return 1;
else
0;
}
int main() {
ll n;
cin >> n;
while (!ok(n))
n++;
cout << n << endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod = 1000000007;
const ll inf = LONG_LONG_MAX;
ll dx4[4] = {1, 0, -1, 0};
ll dy4[4] = {0, -1, 0, 1};
ll dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
ll dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
bool ok(ll a) {
string s = to_string(a);
if (s[0] == s[1] && s[1] == s[2])
return 1;
else
return 0;
}
int main() {
ll n;
cin >> n;
while (!ok(n))
n++;
cout << n << endl;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p03243 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define long long long
int main() {
long a, b, c, n, x, y;
while (true) {
for (int i = 1; i <= 9; i++) {
if (n / i == 111 && n % 1 == 0) {
cout << n << endl;
return 0;
}
}
n++;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define long long long
int main() {
long a, b, c, n, x, y;
cin >> n;
if (n <= 111) {
cout << 111 << endl;
return 0;
} else if (n <= 222) {
cout << 222 << endl;
return 0;
} else if (n <= 333) {
cout << 333 << endl;
return 0;
} else if (n <= 444) {
cout << 444 << endl;
return 0;
} else if (n <= 555) {
cout << 555 << endl;
return 0;
} else if (n <= 666) {
cout << 666 << endl;
return 0;
} else if (n <= 777) {
cout << 777 << endl;
return 0;
} else if (n <= 888) {
cout << 888 << endl;
return 0;
} else if (n <= 999) {
cout << 999 << endl;
return 0;
}
return 0;
} | replace | 6 | 15 | 6 | 34 | TLE | |
p03243 | C++ | Runtime Error | /**
* Name: Ajay Subhash Jadhav
* Institute: International Institute of Technology Hyderabad
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
#define LL long long
#define inf 0x7fffffff
#define mod 1000000007
#define pb push_back
#define ppi pair<int, int>
#define vi vector<int>
#define vii vector<ppi>
#define vll vector<LL>
#define mp make_pair
using namespace std;
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void inputread() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
bool check(int n) {
int dig = n % 10;
n = n / 10;
while (n > 0) {
int temp = (n % 10);
n = n / 10;
if (temp == dig)
dig = temp;
else
return 0;
}
return 1;
}
int main() {
fastio();
inputread();
int n, m, i, j, t;
cin >> n;
while (true) {
if (check(n))
break;
n++;
}
cout << n;
return 0;
} | /**
* Name: Ajay Subhash Jadhav
* Institute: International Institute of Technology Hyderabad
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
#define LL long long
#define inf 0x7fffffff
#define mod 1000000007
#define pb push_back
#define ppi pair<int, int>
#define vi vector<int>
#define vii vector<ppi>
#define vll vector<LL>
#define mp make_pair
using namespace std;
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void inputread() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
bool check(int n) {
int dig = n % 10;
n = n / 10;
while (n > 0) {
int temp = (n % 10);
n = n / 10;
if (temp == dig)
dig = temp;
else
return 0;
}
return 1;
}
int main() {
fastio();
int n, m, i, j, t;
cin >> n;
while (true) {
if (check(n))
break;
n++;
}
cout << n;
return 0;
} | delete | 58 | 59 | 58 | 58 | 0 | |
p03243 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n = 1;
cin >> n;
for (int i = 111; i <= 999; i += 111) {
if (n <= i) {
cout << i << endl;
return i;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n = 1;
cin >> n;
for (int i = 111; i <= 999; i += 111) {
if (n <= i) {
cout << i << endl;
return 0;
}
}
return 0;
}
| replace | 12 | 13 | 12 | 13 | 111 | |
p03243 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x; i < n; ++i)
#define INF 1 << 29;
int main() {
int n;
cin >> n;
rep2(i, n, 1000) {
int d[3];
int tmp = i;
rep(j, 3) {
d[i] = tmp / pow(10, 2 - j);
tmp = tmp - d[i] * pow(10, 2 - j);
}
if (d[0] == d[1] && d[1] == d[2]) {
cout << i << endl;
break;
}
}
return 0;
} | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x; i < n; ++i)
#define INF 1 << 29;
int main() {
int n;
cin >> n;
rep2(i, n, 1000) {
int d[3];
int tmp = i;
rep(j, 3) {
d[j] = tmp / pow(10, 2 - j);
tmp = tmp - d[j] * pow(10, 2 - j);
}
if (d[0] == d[1] && d[1] == d[2]) {
cout << i << endl;
break;
}
}
return 0;
} | replace | 25 | 27 | 25 | 27 | 0 | |
p03243 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
for (scanf("%d", x); x < 1000; x++) {
char s[4];
sprintf(s, "%d", x);
if (s[0] == s[1] && s[1] == s[2])
return puts(s), 0;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
for (scanf("%d", &x); x < 1000; x++) {
char s[4];
sprintf(s, "%d", x);
if (s[0] == s[1] && s[1] == s[2])
return puts(s), 0;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | -11 | |
p03243 | Python | Runtime Error | N = int(input())
print(min([x for x in [int(str(i) * 3) - N for i in range(1, 10)] if x > 0]) + N)
| N = int(input())
print(min([x for x in [int(str(i) * 3) - N for i in range(1, 10)] if x >= 0]) + N)
| replace | 1 | 2 | 1 | 2 | 0 | |
p03243 | Python | Runtime Error | n = input()
for ans in range(111, 1000, 111):
if n <= ans:
break
print(ans)
| n = input()
for ans in range(111, 1000, 111):
if int(n) <= ans:
break
print(ans)
| replace | 2 | 3 | 2 | 3 | TypeError: '<=' not supported between instances of 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03243/Python/s479378402.py", line 3, in <module>
if n <= ans:
TypeError: '<=' not supported between instances of 'str' and 'int'
|
p03243 | Python | Runtime Error | n = input()
x = (n - 1) // 111 + 1
print(x * 111)
| n = int(input())
x = (n - 1) // 111 + 1
print(x * 111)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for -: 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03243/Python/s109763902.py", line 2, in <module>
x = (n - 1) // 111 + 1
TypeError: unsupported operand type(s) for -: 'str' and 'int'
|
p03243 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a;
b = (a - 1) / 111;
cout << 111 * (1 + b);
return 111 * (1 + b);
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a;
b = (a - 1) / 111;
cout << 111 * (b + 1);
return 0;
} | replace | 7 | 9 | 7 | 9 | 111 | |
p03244 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
typedef long long ll;
const int maxn = 40;
pii _1[100010];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif // LOCAL
ios::sync_with_stdio(0);
int n, tmp;
scanf("%d", &n);
map<int, int> cnt1, cnt2;
for (int i = 0; i < n; i++) {
scanf("%d", &tmp);
if (i & 1)
cnt1[tmp]++;
else
cnt2[tmp]++;
}
cnt1[-1000] = 0;
cnt2[-1000] = 0;
tmp = 0;
for (auto a : cnt1)
_1[tmp++] = make_pair(a.second, a.first);
sort(_1, _1 + tmp);
int maxn = 0;
for (auto a : cnt2) {
for (int i = tmp - 1; i >= 0; i--) {
if (_1[i].second != a.first) {
maxn = max(maxn, _1[i].first + a.second);
}
}
}
printf("%d", n - maxn);
return 0;
}
| #include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
typedef long long ll;
const int maxn = 40;
pii _1[100010];
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif // LOCAL
ios::sync_with_stdio(0);
int n, tmp;
scanf("%d", &n);
map<int, int> cnt1, cnt2;
for (int i = 0; i < n; i++) {
scanf("%d", &tmp);
if (i & 1)
cnt1[tmp]++;
else
cnt2[tmp]++;
}
cnt1[-1000] = 0;
cnt2[-1000] = 0;
tmp = 0;
for (auto a : cnt1)
_1[tmp++] = make_pair(a.second, a.first);
sort(_1, _1 + tmp);
int maxn = 0;
for (auto a : cnt2) {
for (int i = tmp - 1; i >= 0; i--) {
if (_1[i].second != a.first) {
maxn = max(maxn, _1[i].first + a.second);
break;
}
}
}
printf("%d", n - maxn);
return 0;
}
| insert | 32 | 32 | 32 | 33 | TLE | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mx 10005
using namespace std;
int main() {
int n, s, m[2][2], v[2][mx];
scanf("%d", &n);
for (int i = 0; i < mx; i++)
v[0][i] = v[1][i] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s);
v[i & 1][s]++;
}
for (int i = 0; i < 4; i++)
m[i & 1][i >> 1] = !(i >> 1);
for (int i = 2; i < mx; i++) {
for (int j = 0; j < 2; j++) {
if (v[j][m[j][0]] < v[j][i]) {
m[j][1] = m[j][0];
m[j][0] = i;
} else if (v[j][m[j][1]] < v[j][i])
m[j][1] = i;
}
}
int t = (m[0][0] == m[1][0] ? max(v[0][m[0][1]] + v[1][m[1][0]],
v[1][m[1][1]] + v[0][m[0][0]])
: v[0][m[0][0]] + v[1][m[1][0]]);
printf("%d\n", n - t);
}
| #include <bits/stdc++.h>
#define mx 100005
using namespace std;
int main() {
int n, s, m[2][2], v[2][mx];
scanf("%d", &n);
for (int i = 0; i < mx; i++)
v[0][i] = v[1][i] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &s);
v[i & 1][s]++;
}
for (int i = 0; i < 4; i++)
m[i & 1][i >> 1] = !(i >> 1);
for (int i = 2; i < mx; i++) {
for (int j = 0; j < 2; j++) {
if (v[j][m[j][0]] < v[j][i]) {
m[j][1] = m[j][0];
m[j][0] = i;
} else if (v[j][m[j][1]] < v[j][i])
m[j][1] = i;
}
}
int t = (m[0][0] == m[1][0] ? max(v[0][m[0][1]] + v[1][m[1][0]],
v[1][m[1][1]] + v[0][m[0][0]])
: v[0][m[0][0]] + v[1][m[1][0]]);
printf("%d\n", n - t);
}
| replace | 1 | 2 | 1 | 2 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define drep2(j, n) for (int j = (n)-1; j >= 0; --j)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define srep3(k, s, t) for (int k = s; j < t; ++k)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int main() {
int n;
cin >> n;
int vl[n / 2];
int vr[n / 2];
vi vlPool(10010, 0);
vi vrPool(10010, 0);
rep(i, n / 2) {
cin >> vl[i] >> vr[i];
vlPool[vl[i]]++;
vrPool[vr[i]]++;
}
int modeL = distance(vlPool.begin(), max_element(rng(vlPool)));
int modeR = distance(vrPool.begin(), max_element(rng(vrPool)));
int ans = 0;
sort(rng(vlPool));
sort(rng(vrPool));
reverse(rng(vlPool));
reverse(rng(vrPool));
if (modeL != modeR) {
ans += n / 2 - vlPool[0];
ans += n / 2 - vrPool[0];
cout << ans << endl;
} else {
if (vlPool[0] > vrPool[0]) {
ans = n - vlPool[0] - vrPool[1];
cout << ans << endl;
} else if (vlPool[0] < vrPool[0]) {
ans = n - vlPool[1] - vrPool[0];
cout << ans << endl;
} else {
ans = n - vlPool[0] - max(vlPool[1], vrPool[1]);
cout << ans << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define drep2(j, n) for (int j = (n)-1; j >= 0; --j)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define srep3(k, s, t) for (int k = s; j < t; ++k)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int main() {
int n;
cin >> n;
int vl[n / 2];
int vr[n / 2];
vi vlPool(100010, 0);
vi vrPool(100010, 0);
rep(i, n / 2) {
cin >> vl[i] >> vr[i];
vlPool[vl[i]]++;
vrPool[vr[i]]++;
}
int modeL = distance(vlPool.begin(), max_element(rng(vlPool)));
int modeR = distance(vrPool.begin(), max_element(rng(vrPool)));
int ans = 0;
sort(rng(vlPool));
sort(rng(vrPool));
reverse(rng(vlPool));
reverse(rng(vrPool));
if (modeL != modeR) {
ans += n / 2 - vlPool[0];
ans += n / 2 - vrPool[0];
cout << ans << endl;
} else {
if (vlPool[0] > vrPool[0]) {
ans = n - vlPool[0] - vrPool[1];
cout << ans << endl;
} else if (vlPool[0] < vrPool[0]) {
ans = n - vlPool[1] - vrPool[0];
cout << ans << endl;
} else {
ans = n - vlPool[0] - max(vlPool[1], vrPool[1]);
cout << ans << endl;
}
}
return 0;
} | replace | 64 | 66 | 64 | 66 | 0 | |
p03244 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
#define MAX_LEN (100000)
#define MAX_NUM (120)
int main(int argc, char *argv[]) {
int n, a[MAX_LEN];
int cnt_even[MAX_NUM + 1] = {}, cnt_odd[MAX_NUM + 1] = {};
int max1_cnt_even, max1_cnt_odd, max2_cnt_even, max2_cnt_odd;
int max1_num_even, max1_num_odd, max2_num_even, max2_num_odd;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i += 2)
cnt_even[a[i]]++;
for (int i = 1; i < n; i += 2)
cnt_odd[a[i]]++;
max1_cnt_even = -1;
max1_num_even = -1;
max2_cnt_even = -1;
max2_num_even = -1;
for (int i = 0; i <= MAX_NUM; i++) {
// printf("i = %d\n", i);
if (cnt_even[i] > 0) {
if (max1_cnt_even <= cnt_even[i]) {
max2_cnt_even = max1_cnt_even;
max2_num_even = max1_num_even;
max1_cnt_even = cnt_even[i];
max1_num_even = i;
} else if (max2_cnt_even <= cnt_even[i]) {
max2_cnt_even = cnt_even[i];
max2_num_even = i;
}
}
// printf("1cnte = %d, 1nume = %d, 2cnte = %d, 2nume = %d\n",
// max1_cnt_even, max1_num_even, max2_cnt_even, max2_num_even);
}
// printf("1cnte = %d, 1nume = %d, 2cnte = %d, 2nume = %d\n",
// max1_cnt_even, max1_num_even, max2_cnt_even, max2_num_even);
max1_cnt_odd = 0;
max1_num_odd = -1;
max2_cnt_odd = 0;
max2_num_odd = -1;
for (int i = 0; i <= MAX_NUM; i++) {
if (cnt_odd[i] > 0) {
if (max1_cnt_odd <= cnt_odd[i]) {
max2_cnt_odd = max1_cnt_odd;
max2_num_odd = max1_num_odd;
max1_cnt_odd = cnt_odd[i];
max1_num_odd = i;
} else if (max2_cnt_odd <= cnt_odd[i]) {
max2_cnt_odd = cnt_odd[i];
max2_num_odd = i;
}
}
}
// printf("1cnto = %d, 1numo = %d, 2cnto = %d, 2numo = %d\n",
// max1_cnt_odd, max1_num_odd, max2_cnt_odd, max2_num_odd);
if (max1_num_even != max1_num_odd) {
printf("%d\n", n - max1_cnt_odd - max1_cnt_even);
} else if (max1_cnt_odd + max2_cnt_even >= max2_cnt_odd + max1_cnt_even) {
printf("%d\n", n - max1_cnt_odd - max2_cnt_even);
} else {
printf("%d\n", n - max2_cnt_odd - max1_cnt_even);
}
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
#define MAX_LEN (100000)
#define MAX_NUM (100000)
int main(int argc, char *argv[]) {
int n, a[MAX_LEN];
int cnt_even[MAX_NUM + 1] = {}, cnt_odd[MAX_NUM + 1] = {};
int max1_cnt_even, max1_cnt_odd, max2_cnt_even, max2_cnt_odd;
int max1_num_even, max1_num_odd, max2_num_even, max2_num_odd;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i += 2)
cnt_even[a[i]]++;
for (int i = 1; i < n; i += 2)
cnt_odd[a[i]]++;
max1_cnt_even = -1;
max1_num_even = -1;
max2_cnt_even = -1;
max2_num_even = -1;
for (int i = 0; i <= MAX_NUM; i++) {
// printf("i = %d\n", i);
if (cnt_even[i] > 0) {
if (max1_cnt_even <= cnt_even[i]) {
max2_cnt_even = max1_cnt_even;
max2_num_even = max1_num_even;
max1_cnt_even = cnt_even[i];
max1_num_even = i;
} else if (max2_cnt_even <= cnt_even[i]) {
max2_cnt_even = cnt_even[i];
max2_num_even = i;
}
}
// printf("1cnte = %d, 1nume = %d, 2cnte = %d, 2nume = %d\n",
// max1_cnt_even, max1_num_even, max2_cnt_even, max2_num_even);
}
// printf("1cnte = %d, 1nume = %d, 2cnte = %d, 2nume = %d\n",
// max1_cnt_even, max1_num_even, max2_cnt_even, max2_num_even);
max1_cnt_odd = 0;
max1_num_odd = -1;
max2_cnt_odd = 0;
max2_num_odd = -1;
for (int i = 0; i <= MAX_NUM; i++) {
if (cnt_odd[i] > 0) {
if (max1_cnt_odd <= cnt_odd[i]) {
max2_cnt_odd = max1_cnt_odd;
max2_num_odd = max1_num_odd;
max1_cnt_odd = cnt_odd[i];
max1_num_odd = i;
} else if (max2_cnt_odd <= cnt_odd[i]) {
max2_cnt_odd = cnt_odd[i];
max2_num_odd = i;
}
}
}
// printf("1cnto = %d, 1numo = %d, 2cnto = %d, 2numo = %d\n",
// max1_cnt_odd, max1_num_odd, max2_cnt_odd, max2_num_odd);
if (max1_num_even != max1_num_odd) {
printf("%d\n", n - max1_cnt_odd - max1_cnt_even);
} else if (max1_cnt_odd + max2_cnt_even >= max2_cnt_odd + max1_cnt_even) {
printf("%d\n", n - max1_cnt_odd - max2_cnt_even);
} else {
printf("%d\n", n - max2_cnt_odd - max1_cnt_even);
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> ve(100000), vo(100000);
for (int i = 0; i < n; ++i) {
int k;
cin >> k;
if (i % 2) {
vo.at(k).first++;
vo.at(k).second = k;
} else {
ve.at(k).first++;
ve.at(k).second = k;
}
}
sort(vo.begin(), vo.end());
reverse(vo.begin(), vo.end());
sort(ve.begin(), ve.end());
reverse(ve.begin(), ve.end());
int sum = vo.at(0).first + ve.at(0).first;
if (vo.at(0).second == ve.at(0).second) {
int s = vo.at(0).first + ve.at(1).first;
int t = vo.at(1).first + ve.at(0).first;
if (s > t)
sum = s;
else
sum = t;
}
cout << n - sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> ve(1000000), vo(1000000);
for (int i = 0; i < n; ++i) {
int k;
cin >> k;
if (i % 2) {
vo.at(k).first++;
vo.at(k).second = k;
} else {
ve.at(k).first++;
ve.at(k).second = k;
}
}
sort(vo.begin(), vo.end());
reverse(vo.begin(), vo.end());
sort(ve.begin(), ve.end());
reverse(ve.begin(), ve.end());
int sum = vo.at(0).first + ve.at(0).first;
if (vo.at(0).second == ve.at(0).second) {
int s = vo.at(0).first + ve.at(1).first;
int t = vo.at(1).first + ve.at(0).first;
if (s > t)
sum = s;
else
sum = t;
}
cout << n - sum << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % m) * (b % m) % m;
b = (b % m) * (b % m) % m;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
s << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
s << ']';
return s;
}
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} fastio;
int amx, a1, bmx, b1;
int main() {
int n;
cin >> n;
vector<int> cnta(n + 1, 0), cntb(n + 1, 0);
rep(i, n) {
int v;
cin >> v;
if (i % 2 == 0) {
cnta[v]++;
if (cnta[v] > amx) {
amx = cnta[v];
a1 = v;
}
} else {
cntb[v]++;
if (cntb[v] > bmx) {
bmx = cntb[v];
b1 = v;
}
}
}
sort(cnta.rbegin(), cnta.rend());
sort(cntb.rbegin(), cntb.rend());
if (a1 != b1)
ppp(n - amx - bmx);
else
ppp(n - max(amx + cntb[1], bmx + cnta[1]));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % m) * (b % m) % m;
b = (b % m) * (b % m) % m;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
s << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
s << ']';
return s;
}
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
};
} fastio;
int amx, a1, bmx, b1;
int main() {
int n;
cin >> n;
vector<int> cnta(100001, 0), cntb(100001, 0);
rep(i, n) {
int v;
cin >> v;
if (i % 2 == 0) {
cnta[v]++;
if (cnta[v] > amx) {
amx = cnta[v];
a1 = v;
}
} else {
cntb[v]++;
if (cntb[v] > bmx) {
bmx = cntb[v];
b1 = v;
}
}
}
sort(cnta.rbegin(), cnta.rend());
sort(cntb.rbegin(), cntb.rend());
if (a1 != b1)
ppp(n - amx - bmx);
else
ppp(n - max(amx + cntb[1], bmx + cnta[1]));
return 0;
}
| replace | 89 | 90 | 89 | 91 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint N;
cin >> N;
vector<lint> a(N), num(10010), num1(100010);
for (lint i = 0; i < N; i++) {
cin >> a[i];
if (i % 2 == 0)
num[a[i]]++;
else
num1[a[i]]++;
}
lint p = max_element(num.begin(), num.end()) - num.begin();
lint q = max_element(num1.begin(), num1.end()) - num1.begin();
lint ans;
if (p != q) {
ans = N - num[p] - num1[q];
}
if (p == q) {
sort(num.begin(), num.end(), greater<lint>());
sort(num1.begin(), num1.end(), greater<lint>());
ans = min(N - num[0] - num1[1], N - num[1] - num1[0]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint N;
cin >> N;
vector<lint> a(N), num(100010), num1(100010);
for (lint i = 0; i < N; i++) {
cin >> a[i];
if (i % 2 == 0)
num[a[i]]++;
else
num1[a[i]]++;
}
lint p = max_element(num.begin(), num.end()) - num.begin();
lint q = max_element(num1.begin(), num1.end()) - num1.begin();
lint ans;
if (p != q) {
ans = N - num[p] - num1[q];
}
if (p == q) {
sort(num.begin(), num.end(), greater<lint>());
sort(num1.begin(), num1.end(), greater<lint>());
ans = min(N - num[0] - num1[1], N - num[1] - num1[0]);
}
cout << ans << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 1; i <= n; i++)
cin >> v[i];
const int N = 100010;
vector<int> o(N);
vector<int> e(N);
int o_maxNum_first = 0;
int o_maxNum_second = 0;
int o_maxValue;
int e_maxNum_first = 0;
int e_maxNum_second = 0;
int e_maxValue;
for (int i = 1; i <= n; i++) {
if (i % 2 == 0) {
e[v[i]]++;
} else {
o[v[i]]++;
}
}
for (int j = 0; j < N; j++) {
if (o_maxNum_first <= o[j]) {
o_maxNum_second = o_maxNum_first;
o_maxNum_first = o[j];
o_maxValue = j;
} else if (o_maxNum_second <= o[j]) {
o_maxNum_second = o[j];
}
if (e_maxNum_first <= e[j]) {
e_maxNum_second = e_maxNum_first;
e_maxNum_first = e[j];
e_maxValue = j;
} else if (e_maxNum_second <= e[j]) {
e_maxNum_second = e[j];
}
}
int ans;
if (o_maxValue != e_maxValue) {
ans = n - o_maxNum_first - e_maxNum_first;
} else { // o_maxValue == e_maxValue
ans = min(n - o_maxNum_first - e_maxNum_second,
n - e_maxNum_first - o_maxNum_second);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
const int N = 100010;
vector<int> o(N);
vector<int> e(N);
int o_maxNum_first = 0;
int o_maxNum_second = 0;
int o_maxValue;
int e_maxNum_first = 0;
int e_maxNum_second = 0;
int e_maxValue;
for (int i = 1; i <= n; i++) {
if (i % 2 == 0) {
e[v[i]]++;
} else {
o[v[i]]++;
}
}
for (int j = 0; j < N; j++) {
if (o_maxNum_first <= o[j]) {
o_maxNum_second = o_maxNum_first;
o_maxNum_first = o[j];
o_maxValue = j;
} else if (o_maxNum_second <= o[j]) {
o_maxNum_second = o[j];
}
if (e_maxNum_first <= e[j]) {
e_maxNum_second = e_maxNum_first;
e_maxNum_first = e[j];
e_maxValue = j;
} else if (e_maxNum_second <= e[j]) {
e_maxNum_second = e[j];
}
}
int ans;
if (o_maxValue != e_maxValue) {
ans = n - o_maxNum_first - e_maxNum_first;
} else { // o_maxValue == e_maxValue
ans = min(n - o_maxNum_first - e_maxNum_second,
n - e_maxNum_first - o_maxNum_second);
}
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03244 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define COUT(a) cout << a << endl;
using namespace std;
using Int = long long;
using P = pair<Int, Int>;
int main() {
Int N;
cin >> N;
vector<Int> cnt_o(10001), cnt_e(10001);
FOR(i, 0, N) {
Int v;
cin >> v;
if (i % 2 == 0) {
cnt_e[v]++;
} else {
cnt_o[v]++;
}
}
auto it_max_o = max_element(begin(cnt_o), end(cnt_o));
auto it_max_e = max_element(begin(cnt_e), end(cnt_e));
Int max_o = *it_max_o;
Int max_e = *it_max_e;
Int ans = 0;
if (it_max_o - begin(cnt_o) != it_max_e - begin(cnt_e)) {
Int sum_o = accumulate(begin(cnt_o), end(cnt_o), 0);
Int sum_e = accumulate(begin(cnt_e), end(cnt_e), 0);
ans = sum_o + sum_e - (max_o + max_e);
} else {
Int sum_o = accumulate(begin(cnt_o), end(cnt_o), 0);
Int sum_e = accumulate(begin(cnt_e), end(cnt_e), 0);
if (sum_o == max_o && sum_e != max_e) {
sort(begin(cnt_e), end(cnt_e), greater<Int>());
ans = sum_o + sum_e - (max_o + cnt_e[1]);
} else if (sum_o != max_o && sum_e == max_e) {
sort(begin(cnt_o), end(cnt_o), greater<Int>());
ans = sum_o + sum_e - (cnt_o[1] + max_e);
} else {
sort(begin(cnt_e), end(cnt_e), greater<Int>());
sort(begin(cnt_o), end(cnt_o), greater<Int>());
ans = sum_o + sum_e - (max(max_o, max_e) + max(cnt_e[1], cnt_o[1]));
}
}
COUT(ans);
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define COUT(a) cout << a << endl;
using namespace std;
using Int = long long;
using P = pair<Int, Int>;
int main() {
Int N;
cin >> N;
vector<Int> cnt_o(100010), cnt_e(100010);
FOR(i, 0, N) {
Int v;
cin >> v;
if (i % 2 == 0) {
cnt_e[v]++;
} else {
cnt_o[v]++;
}
}
auto it_max_o = max_element(begin(cnt_o), end(cnt_o));
auto it_max_e = max_element(begin(cnt_e), end(cnt_e));
Int max_o = *it_max_o;
Int max_e = *it_max_e;
Int ans = 0;
if (it_max_o - begin(cnt_o) != it_max_e - begin(cnt_e)) {
Int sum_o = accumulate(begin(cnt_o), end(cnt_o), 0);
Int sum_e = accumulate(begin(cnt_e), end(cnt_e), 0);
ans = sum_o + sum_e - (max_o + max_e);
} else {
Int sum_o = accumulate(begin(cnt_o), end(cnt_o), 0);
Int sum_e = accumulate(begin(cnt_e), end(cnt_e), 0);
if (sum_o == max_o && sum_e != max_e) {
sort(begin(cnt_e), end(cnt_e), greater<Int>());
ans = sum_o + sum_e - (max_o + cnt_e[1]);
} else if (sum_o != max_o && sum_e == max_e) {
sort(begin(cnt_o), end(cnt_o), greater<Int>());
ans = sum_o + sum_e - (cnt_o[1] + max_e);
} else {
sort(begin(cnt_e), end(cnt_e), greater<Int>());
sort(begin(cnt_o), end(cnt_o), greater<Int>());
ans = sum_o + sum_e - (max(max_o, max_e) + max(cnt_e[1], cnt_o[1]));
}
}
COUT(ans);
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int v_num = 10;
int main() {
int n, v;
cin >> n;
vector<int> even(v_num, 0), odd(v_num + 1, 0);
for (int i = 0; i < n; ++i) {
cin >> v;
if (i % 2 == 0)
even[v]++;
else
odd[v]++;
}
bool same = false;
vector<int>::iterator evenMaxIt = max_element(even.begin(), even.end());
vector<int>::iterator oddMaxIt = max_element(odd.begin(), odd.end());
if (distance(even.begin(), evenMaxIt) == distance(odd.begin(), oddMaxIt))
same = true;
sort(even.begin(), even.end(), greater<int>());
sort(odd.begin(), odd.end(), greater<int>());
if (same) {
if (even[0] == odd[0]) {
if (even[1] < odd[1]) {
cout << n - even[0] - odd[1] << endl;
} else {
cout << n - even[1] - odd[0] << endl;
}
} else if (even[0] > odd[0]) {
cout << n - even[0] - odd[1] << endl;
} else {
cout << n - even[1] - odd[0] << endl;
}
} else {
cout << n - even[0] - odd[0] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int v_num = pow(10, 5) + 1;
int main() {
int n, v;
cin >> n;
vector<int> even(v_num, 0), odd(v_num + 1, 0);
for (int i = 0; i < n; ++i) {
cin >> v;
if (i % 2 == 0)
even[v]++;
else
odd[v]++;
}
bool same = false;
vector<int>::iterator evenMaxIt = max_element(even.begin(), even.end());
vector<int>::iterator oddMaxIt = max_element(odd.begin(), odd.end());
if (distance(even.begin(), evenMaxIt) == distance(odd.begin(), oddMaxIt))
same = true;
sort(even.begin(), even.end(), greater<int>());
sort(odd.begin(), odd.end(), greater<int>());
if (same) {
if (even[0] == odd[0]) {
if (even[1] < odd[1]) {
cout << n - even[0] - odd[1] << endl;
} else {
cout << n - even[1] - odd[0] << endl;
}
} else if (even[0] > odd[0]) {
cout << n - even[0] - odd[1] << endl;
} else {
cout << n - even[1] - odd[0] << endl;
}
} else {
cout << n - even[0] - odd[0] << endl;
}
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03244 | Python | Runtime Error | # coding:utf-8
import collections
def main():
n = int(input())
v = list(map(int, input().split()))
va = []
vb = []
for i in range(0, n, 2):
va.append(v[i])
vb.append(v[i + 1])
c1mc = collections.Counter(va).most_common()
c2mc = collections.Counter(vb).most_common()
if c1mc[0][0] != c2mc[0][0]:
print(n - c1mc[0][1] - c2mc[0][1])
return
else:
a = n - c1mc[1][1] - c2mc[0][1]
b = n - c1mc[0][1] - c2mc[1][1]
if a < b:
print(a)
else:
print(b)
if __name__ == "__main__":
main()
| # coding:utf-8
import collections
def main():
n = int(input())
v = list(map(int, input().split()))
va = []
vb = []
for i in range(0, n, 2):
va.append(v[i])
vb.append(v[i + 1])
if va == vb and len(set(va)) == 1:
print(len(va))
return
c1mc = collections.Counter(va).most_common()
c2mc = collections.Counter(vb).most_common()
if c1mc[0][0] != c2mc[0][0]:
print(n - c1mc[0][1] - c2mc[0][1])
return
else:
a = n - c1mc[1][1] - c2mc[0][1]
b = n - c1mc[0][1] - c2mc[1][1]
if a < b:
print(a)
else:
print(b)
if __name__ == "__main__":
main()
| insert | 13 | 13 | 13 | 17 | 0 | |
p03244 | Python | Runtime Error | import numpy as np
even = np.zeros(100000, dtype=int)
odd = np.zeros(100000, dtype=int)
n = int(input())
v = list(map(int, input().split()))
for i in range(n):
if i % 2 == 0:
even[v[i]] += 1
else:
odd[v[i]] += 1
e1 = even.argmax()
e1n = even.max()
o1 = odd.argmax()
o1n = odd.max()
# print(e1, e1n, o1, o1n)
if e1 == o1:
e2n = np.sort(even)[-2]
o2n = np.sort(odd)[-2]
# print(e2n, o2n)
print(min(n - e1n - o2n, n - e2n - o1n))
else:
print(n - e1n - o1n)
| import numpy as np
even = np.zeros(100001, dtype=int)
odd = np.zeros(100001, dtype=int)
n = int(input())
v = list(map(int, input().split()))
for i in range(n):
if i % 2 == 0:
even[v[i]] += 1
else:
odd[v[i]] += 1
e1 = even.argmax()
e1n = even.max()
o1 = odd.argmax()
o1n = odd.max()
# print(e1, e1n, o1, o1n)
if e1 == o1:
e2n = np.sort(even)[-2]
o2n = np.sort(odd)[-2]
# print(e2n, o2n)
print(min(n - e1n - o2n, n - e2n - o1n))
else:
print(n - e1n - o1n)
| replace | 2 | 4 | 2 | 4 | TLE | |
p03244 | Python | Runtime Error | from collections import Counter
n = int(input())
v = list(map(int, input().split()))
if len(set(v)) != 1:
a = Counter(v[0::2]).most_common()
b = Counter(v[1::2]).most_common()
if a[0] != b[0]:
q = (len(v[0::2]) - a[0][1]) + (len(v[1::2]) - b[0][1])
w = (len(v[0::2]) - a[0][1]) + (len(v[1::2]) - b[1][1])
e = (len(v[0::2]) - a[1][1]) + (len(v[1::2]) - b[0][1])
print(min(q, w, e))
else:
print(len(v[1::2]))
| from collections import Counter
n = int(input())
v = list(map(int, input().split()))
if len(set(v)) != 1:
a = Counter(v[0::2]).most_common()
b = Counter(v[1::2]).most_common()
if a[0][0] != b[0][0]:
print((len(v[0::2]) - a[0][1]) + (len(v[1::2]) - b[0][1]))
else:
if a[0][1] < b[0][1]:
print((len(v[0::2]) - a[0][1]) + (len(v[1::2]) - b[1][1]))
elif a[0][1] > b[0][1]:
print((len(v[0::2]) - a[1][1]) + (len(v[1::2]) - b[0][1]))
elif a[0][1] == b[0][1]:
if len(a) != 1 and len(b) != 1:
if a[1][1] > b[1][1]:
print((len(v[0::2]) - a[1][1]) + (len(v[1::2]) - b[0][1]))
elif a[1][1] < b[1][1]:
print((len(v[0::2]) - a[0][1]) + (len(v[1::2]) - b[1][1]))
elif a[1][1] == b[1][1]:
print((len(v[0::2]) - a[0][1]) + (len(v[1::2]) - b[1][1]))
elif len(a) != 1:
print((len(v[0::2]) - a[1][1]) + (len(v[1::2]) - b[0][1]))
elif len(b) != 1:
print((len(v[0::2]) - a[0][1]) + (len(v[1::2]) - b[1][1]))
else:
print(len(v[1::2]))
| replace | 8 | 14 | 8 | 27 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03244/Python/s507429777.py", line 13, in <module>
e = ((len(v[0::2]) - a[1][1]) + (len(v[1::2]) - b[0][1]))
IndexError: list index out of range
|
p03244 | Python | Runtime Error | import collections
def solve(string):
n, *v = map(int, string.split())
if len(set(v)) == 1:
return str(n // 2)
else:
odds = v[1::2]
_o = collections.Counter(odds)
r_o = {str(v): k for k, v in _o.items()}
evens = v[::2]
_e = collections.Counter(evens)
r_e = {str(v): k for k, v in _e.items()}
ans1 = 0
tmp = max(_o.values())
ans1 += len(odds) - tmp
key = r_o[str(tmp)]
if key in _e.keys():
_e[key] = 0
ans1 += len(evens) - max(_e.values())
ans2 = 0
_o = collections.Counter(odds)
r_o = {str(v): k for k, v in _o.items()}
_e = collections.Counter(evens)
r_e = {str(v): k for k, v in _e.items()}
tmp = max(_e.values())
ans2 += len(evens) - tmp
key = r_e[str(tmp)]
if key in _o.keys():
_o[key] = 0
ans2 += len(evens) - max(_o.values())
return str(min(ans1, ans2))
if __name__ == "__main__":
print(solve(input()))
| import collections
def solve(string):
n, *v = map(int, string.split())
if len(set(v)) == 1:
return str(n // 2)
else:
odds = v[1::2]
_o = collections.Counter(odds)
r_o = {str(v): k for k, v in _o.items()}
evens = v[::2]
_e = collections.Counter(evens)
r_e = {str(v): k for k, v in _e.items()}
ans1 = 0
tmp = max(_o.values())
ans1 += len(odds) - tmp
key = r_o[str(tmp)]
if key in _e.keys():
_e[key] = 0
ans1 += len(evens) - max(_e.values())
ans2 = 0
_o = collections.Counter(odds)
r_o = {str(v): k for k, v in _o.items()}
_e = collections.Counter(evens)
r_e = {str(v): k for k, v in _e.items()}
tmp = max(_e.values())
ans2 += len(evens) - tmp
key = r_e[str(tmp)]
if key in _o.keys():
_o[key] = 0
ans2 += len(evens) - max(_o.values())
return str(min(ans1, ans2))
if __name__ == "__main__":
print(solve("\n".join([input(), input()])))
| replace | 38 | 39 | 38 | 39 | ValueError: max() arg is an empty sequence | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03244/Python/s969214937.py", line 39, in <module>
print(solve(input()))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03244/Python/s969214937.py", line 16, in solve
tmp = max(_o.values())
ValueError: max() arg is an empty sequence
|
p03244 | Python | Time Limit Exceeded | import collections
N = int(input())
even = collections.defaultdict(lambda: 0)
odd = collections.defaultdict(lambda: 0)
for i, a in enumerate(map(int, input().split())):
if i % 2 == 0:
even[a] += 1
else:
odd[a] += 1
if (
len(even.keys()) == 1
and len(odd.keys()) == 1
and list(even.keys())[0] == list(odd.keys())[0]
):
print(N // 2)
else:
m = 0
for e_k, e_v in even.items():
for o_k, o_v in odd.items():
if e_k == o_k:
continue
m = max(m, e_v + o_v)
print(N - m)
| import collections
N = int(input())
even = collections.defaultdict(lambda: 0)
odd = collections.defaultdict(lambda: 0)
for i, a in enumerate(map(int, input().split())):
if i % 2 == 0:
even[a] += 1
else:
odd[a] += 1
if (
len(even.keys()) == 1
and len(odd.keys()) == 1
and list(even.keys())[0] == list(odd.keys())[0]
):
print(N // 2)
else:
m = 0
for e_k, e_v in sorted(even.items(), key=lambda x: x[1], reverse=True)[:2]:
for o_k, o_v in sorted(odd.items(), key=lambda x: x[1], reverse=True)[:2]:
if e_k == o_k:
continue
m = max(m, e_v + o_v)
print(N - m)
| replace | 21 | 23 | 21 | 23 | TLE | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 10
int main(void) {
int n, i, buf;
cin >> n;
vector<int> vec1(MAX), vec2(MAX);
for (i = 0; i < MAX; i++) {
vec1.at(i) = 0;
vec2.at(i) = 0;
}
for (i = 0; i < n; i++) {
cin >> buf;
if (i % 2 == 0) {
vec1.at(buf - 1)++;
} else {
vec2.at(buf - 1)++;
}
}
int m1 = 0, m2 = 0;
for (i = 0; i < MAX; i++) {
if (vec1.at(i) > vec1.at(m1)) {
m1 = i;
}
if (vec2.at(i) > vec2.at(m2)) {
m2 = i;
}
}
sort(vec1.begin(), vec1.end());
sort(vec2.begin(), vec2.end());
reverse(vec1.begin(), vec1.end());
reverse(vec2.begin(), vec2.end());
int ans;
if (m1 != m2) {
ans = n - vec1.at(0) - vec2.at(0);
} else {
ans = min(n - vec1.at(1) - vec2.at(0), n - vec1.at(0) - vec2.at(1));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int main(void) {
int n, i, buf;
cin >> n;
vector<int> vec1(MAX), vec2(MAX);
for (i = 0; i < MAX; i++) {
vec1.at(i) = 0;
vec2.at(i) = 0;
}
for (i = 0; i < n; i++) {
cin >> buf;
if (i % 2 == 0) {
vec1.at(buf - 1)++;
} else {
vec2.at(buf - 1)++;
}
}
int m1 = 0, m2 = 0;
for (i = 0; i < MAX; i++) {
if (vec1.at(i) > vec1.at(m1)) {
m1 = i;
}
if (vec2.at(i) > vec2.at(m2)) {
m2 = i;
}
}
sort(vec1.begin(), vec1.end());
sort(vec2.begin(), vec2.end());
reverse(vec1.begin(), vec1.end());
reverse(vec2.begin(), vec2.end());
int ans;
if (m1 != m2) {
ans = n - vec1.at(0) - vec2.at(0);
} else {
ans = min(n - vec1.at(1) - vec2.at(0), n - vec1.at(0) - vec2.at(1));
}
cout << ans << endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p03244 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 100100100;
const double EPS = 1e-9;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int bitCount(long bits) {
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> odd(10001), even(10001);
int ans;
rep(i, n) {
int v;
cin >> v;
if (i % 2) {
odd[v]++;
} else {
even[v]++;
}
}
size_t maxo = distance(odd.begin(), max_element(odd.begin(), odd.end()));
size_t maxe = distance(even.begin(), max_element(even.begin(), even.end()));
sort(odd.begin(), odd.end(), greater<int>());
sort(even.begin(), even.end(), greater<int>());
if (maxo != maxe) {
ans = n - odd[0] - even[0];
} else {
ans = n - max(odd[0] + even[1], odd[1] + even[0]);
}
cout << ans << '\n';
return 0;
}
| #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
typedef long long ll;
const int Inf = 100100100;
const double EPS = 1e-9;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int bitCount(long bits) {
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> odd(100001), even(100001);
int ans;
rep(i, n) {
int v;
cin >> v;
if (i % 2) {
odd[v]++;
} else {
even[v]++;
}
}
size_t maxo = distance(odd.begin(), max_element(odd.begin(), odd.end()));
size_t maxe = distance(even.begin(), max_element(even.begin(), even.end()));
sort(odd.begin(), odd.end(), greater<int>());
sort(even.begin(), even.end(), greater<int>());
if (maxo != maxe) {
ans = n - odd[0] - even[0];
} else {
ans = n - max(odd[0] + even[1], odd[1] + even[0]);
}
cout << ans << '\n';
return 0;
}
| replace | 88 | 89 | 88 | 89 | 0 | |
p03244 | C++ | Runtime Error |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto &in = std::cin;
auto &out = std::cout;
#define all_range(C) std::begin(C), std::end(C)
const double PI =
3.141592653589793238462643383279502884197169399375105820974944;
int32_t n;
template <typename T, typename V> int indexOf(const T &c, const V &v) {
using std::begin;
using std::end;
return std::find(begin(c), end(c), v) - begin(c);
}
template <typename T, typename V> int lastIndexOf(const T &c, const V &v) {
using std::rbegin;
using std::rend;
return rend(c) - std::find(rbegin(c), rend(c), v);
}
int main() {
using std::endl;
in.sync_with_stdio(false);
out.sync_with_stdio(false);
in.tie(nullptr);
out.tie(nullptr);
in >> n;
std::vector<int> a(n / 2);
std::vector<int> b(n / 2);
for (size_t i = 0; i < n / 2; i++) {
in >> a[i] >> b[i];
}
std::sort(a.begin(), a.end());
std::sort(b.begin(), b.end());
int counta = 1;
int countb = 1;
std::vector<int> lista;
std::vector<int> listacount;
std::vector<int> listb;
std::vector<int> listbcount;
for (int i = 0; i < n / 2 - 1; i++) {
if (a[i] != a[i + 1]) {
lista.push_back(a[i]);
listacount.push_back(counta);
counta = 1;
} else {
counta++;
}
if (b[i] != b[i + 1]) {
listb.push_back(b[i]);
listbcount.push_back(countb);
countb = 1;
} else {
countb++;
}
}
lista.push_back(a[n / 2 - 1]);
listacount.push_back(counta);
listb.push_back(b[n / 2 - 1]);
listbcount.push_back(countb);
int maxa = 0;
for (int i = 0; i < listacount.size(); i++) {
maxa = std::max(listacount[i], maxa);
}
int maxb = 0;
for (int i = 0; i < listbcount.size(); i++) {
maxb = std::max(listbcount[i], maxb);
}
if (lista.at(indexOf(listacount, maxa)) !=
listb.at(indexOf(listbcount, maxb)) ||
lista.at(lastIndexOf(listacount, maxa)) !=
listb.at(indexOf(listbcount, maxb)) ||
lista.at(indexOf(listacount, maxa)) !=
listb.at(lastIndexOf(listbcount, maxb))) {
std::cout << (n - maxa - maxb) << endl;
} else {
// List<Integer> seta = new ArrayList<>();
// Collections.addAll(seta, maxa);
// listacount.removeAll(seta);
// List<Integer> setb = new ArrayList<>();
// Collections.addAll(setb, maxb);
// listbcount.removeAll(setb);
listacount.erase(std::remove(listacount.begin(), listacount.end(), maxa),
listacount.end());
listbcount.erase(std::remove(listbcount.begin(), listbcount.end(), maxa),
listbcount.end());
int maxas = 0;
for (int i = 0; i < listacount.size(); i++) {
maxas = std::max(listacount.at(i), maxas);
}
int maxbs = 0;
for (int i = 0; i < listbcount.size(); i++) {
maxbs = std::max(listbcount.at(i), maxbs);
}
std::cout << std::min(n - maxas - maxb, n - maxa - maxbs) << endl;
}
return 0;
}
#endif
|
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto &in = std::cin;
auto &out = std::cout;
#define all_range(C) std::begin(C), std::end(C)
const double PI =
3.141592653589793238462643383279502884197169399375105820974944;
int32_t n;
template <typename T, typename V> int indexOf(const T &c, const V &v) {
using std::begin;
using std::end;
return std::find(begin(c), end(c), v) - begin(c);
}
template <typename T, typename V> int lastIndexOf(const T &c, const V &v) {
using std::rbegin;
using std::rend;
return (rend(c) - std::find(rbegin(c), rend(c), v)) - 1;
}
int main() {
using std::endl;
in.sync_with_stdio(false);
out.sync_with_stdio(false);
in.tie(nullptr);
out.tie(nullptr);
in >> n;
std::vector<int> a(n / 2);
std::vector<int> b(n / 2);
for (size_t i = 0; i < n / 2; i++) {
in >> a[i] >> b[i];
}
std::sort(a.begin(), a.end());
std::sort(b.begin(), b.end());
int counta = 1;
int countb = 1;
std::vector<int> lista;
std::vector<int> listacount;
std::vector<int> listb;
std::vector<int> listbcount;
for (int i = 0; i < n / 2 - 1; i++) {
if (a[i] != a[i + 1]) {
lista.push_back(a[i]);
listacount.push_back(counta);
counta = 1;
} else {
counta++;
}
if (b[i] != b[i + 1]) {
listb.push_back(b[i]);
listbcount.push_back(countb);
countb = 1;
} else {
countb++;
}
}
lista.push_back(a[n / 2 - 1]);
listacount.push_back(counta);
listb.push_back(b[n / 2 - 1]);
listbcount.push_back(countb);
int maxa = 0;
for (int i = 0; i < listacount.size(); i++) {
maxa = std::max(listacount[i], maxa);
}
int maxb = 0;
for (int i = 0; i < listbcount.size(); i++) {
maxb = std::max(listbcount[i], maxb);
}
if (lista.at(indexOf(listacount, maxa)) !=
listb.at(indexOf(listbcount, maxb)) ||
lista.at(lastIndexOf(listacount, maxa)) !=
listb.at(indexOf(listbcount, maxb)) ||
lista.at(indexOf(listacount, maxa)) !=
listb.at(lastIndexOf(listbcount, maxb))) {
std::cout << (n - maxa - maxb) << endl;
} else {
// List<Integer> seta = new ArrayList<>();
// Collections.addAll(seta, maxa);
// listacount.removeAll(seta);
// List<Integer> setb = new ArrayList<>();
// Collections.addAll(setb, maxb);
// listbcount.removeAll(setb);
listacount.erase(std::remove(listacount.begin(), listacount.end(), maxa),
listacount.end());
listbcount.erase(std::remove(listbcount.begin(), listbcount.end(), maxa),
listbcount.end());
int maxas = 0;
for (int i = 0; i < listacount.size(); i++) {
maxas = std::max(listacount.at(i), maxas);
}
int maxbs = 0;
for (int i = 0; i < listbcount.size(); i++) {
maxbs = std::max(listbcount.at(i), maxbs);
}
std::cout << std::min(n - maxas - maxb, n - maxa - maxbs) << endl;
}
return 0;
}
#endif
| replace | 41 | 42 | 41 | 42 | 0 | |
p03244 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (i64 i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, s, t) for (i64 i = (s), i##_limit = (t); i <= i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#ifndef DBG
#define trace(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
return b > a && (a = b, true);
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;
template <class T> inline vector<T> make_v(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto make_v(const T &initValue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initValue, args...))>(
sz, make_v<T>(initValue, args...));
}
template <class T> inline istream &operator>>(istream &in, vector<T> &vec) {
for (auto &e : vec)
in >> e;
return in;
}
inline void read() {}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
cin >> head;
read(tail...);
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail))
cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream &operator<<(ostream &out, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e : vec)
out << e << delim[&e == &vec.back()];
return out;
}
// }}} End Header
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
read(N);
map<int, int> even, odd;
rep(i, N) {
int a;
read(a);
if (i & 1) {
odd[a] += 1;
} else {
even[a] += 1;
}
}
vector<pii> x, y;
int xcnt = 0;
int ycnt = 0;
for (const auto &e : even) {
x.emplace_back(e.second, e.first);
xcnt += e.second;
}
for (const auto &e : odd) {
y.emplace_back(e.second, e.first);
ycnt += e.second;
}
x.emplace_back(0, -1);
y.emplace_back(0, -1);
sort(all(x), greater<>());
sort(all(y), greater<>());
i64 ans = INF;
rep(i, x.size()) rep(j, y.size()) {
const int numx = x[i].second;
const int numy = y[j].second;
if (numx == numy)
continue;
trace(x[i], y[j]);
chmin(ans, (xcnt - x[i].first) + (ycnt - y[j].first));
}
print(ans);
return 0;
}
| #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (i64 i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, s, t) for (i64 i = (s), i##_limit = (t); i <= i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#ifndef DBG
#define trace(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
return b > a && (a = b, true);
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;
template <class T> inline vector<T> make_v(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto make_v(const T &initValue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initValue, args...))>(
sz, make_v<T>(initValue, args...));
}
template <class T> inline istream &operator>>(istream &in, vector<T> &vec) {
for (auto &e : vec)
in >> e;
return in;
}
inline void read() {}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
cin >> head;
read(tail...);
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail))
cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream &operator<<(ostream &out, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e : vec)
out << e << delim[&e == &vec.back()];
return out;
}
// }}} End Header
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
read(N);
map<int, int> even, odd;
rep(i, N) {
int a;
read(a);
if (i & 1) {
odd[a] += 1;
} else {
even[a] += 1;
}
}
vector<pii> x, y;
int xcnt = 0;
int ycnt = 0;
for (const auto &e : even) {
x.emplace_back(e.second, e.first);
xcnt += e.second;
}
for (const auto &e : odd) {
y.emplace_back(e.second, e.first);
ycnt += e.second;
}
x.emplace_back(0, -1);
y.emplace_back(0, -1);
sort(all(x), greater<>());
sort(all(y), greater<>());
i64 ans = INF;
rep(i, 2) rep(j, 2) {
const int numx = x[i].second;
const int numy = y[j].second;
if (numx == numy)
continue;
trace(x[i], y[j]);
chmin(ans, (xcnt - x[i].first) + (ycnt - y[j].first));
}
print(ans);
return 0;
}
| replace | 99 | 100 | 99 | 100 | TLE | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // ใใใไฝฟใใชใใฐใtieใจใใๆถใใฆ๏ผ๏ผ
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
class ScopedTime {
public:
ScopedTime(const std::string &msg = "") : msg_(msg) {
start_ = std::chrono::system_clock::now();
}
void lap(const std::string &msg) {
const auto duration_time = std::chrono::system_clock::now() - start_;
const auto duration_ms =
std::chrono::duration_cast<std::chrono::milliseconds>(duration_time);
std::cerr << "[" << duration_ms.count() << " ms] " << msg << std::endl;
}
virtual ~ScopedTime() { this->lap(msg_); }
private:
std::chrono::system_clock::time_point start_;
std::string msg_;
};
size_t g_random_seed;
struct init_ {
init_() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
srand(static_cast<unsigned int>(time(NULL)));
g_random_seed = RAND_MAX / 2 + rand() / 2;
}
} init__;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = g_random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int main(void) {
int N;
vector<int> v;
cin >> N;
v.resize(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
std::map<int, int> m0, m1;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
m0[v[i]] += 1;
} else {
m1[v[i]] += 1;
}
}
std::vector<std::pair<ll, ll>> ps0, ps1;
for (auto &&kv : m0) {
ps0.emplace_back(std::make_pair(kv.first, kv.second));
}
std::sort(ps0.begin(), ps0.end(),
[](const std::pair<ll, ll> &kv1, const std::pair<ll, ll> &kv2) {
return kv1.second > kv2.second;
});
ll sum0 = 0, sum0_0 = 0;
for (int i = 0; i < ps0.size(); i++) {
if (i != 0) {
// std::cerr << "++ " << ps0[i] << std::endl;
sum0 += ps0[i].second;
}
if (i != 1) {
sum0_0 += ps0[i].second;
}
}
for (auto &&kv : m1) {
ps1.emplace_back(std::make_pair(kv.first, kv.second));
}
std::sort(ps1.begin(), ps1.end(),
[](const std::pair<ll, ll> &kv1, const std::pair<ll, ll> &kv2) {
return kv1.second > kv2.second;
});
ll sum1 = 0, sum1_1 = 0;
for (int i = 0; i < ps1.size(); i++) {
if (i != 0) {
// std::cerr << "+++ " << ps1[i] << std::endl;
sum1 += ps1[i].second;
}
if (i != 1) {
sum1_1 += ps0[i].second;
}
}
if (ps0[0].first == ps1[0].first) {
std::cout << std::min(sum0 + sum1_1, sum1 + sum0_0) << std::endl;
} else {
std::cout << sum0 + sum1 << std::endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // ใใใไฝฟใใชใใฐใtieใจใใๆถใใฆ๏ผ๏ผ
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
class ScopedTime {
public:
ScopedTime(const std::string &msg = "") : msg_(msg) {
start_ = std::chrono::system_clock::now();
}
void lap(const std::string &msg) {
const auto duration_time = std::chrono::system_clock::now() - start_;
const auto duration_ms =
std::chrono::duration_cast<std::chrono::milliseconds>(duration_time);
std::cerr << "[" << duration_ms.count() << " ms] " << msg << std::endl;
}
virtual ~ScopedTime() { this->lap(msg_); }
private:
std::chrono::system_clock::time_point start_;
std::string msg_;
};
size_t g_random_seed;
struct init_ {
init_() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
srand(static_cast<unsigned int>(time(NULL)));
g_random_seed = RAND_MAX / 2 + rand() / 2;
}
} init__;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = g_random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int main(void) {
int N;
vector<int> v;
cin >> N;
v.resize(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
std::map<int, int> m0, m1;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
m0[v[i]] += 1;
} else {
m1[v[i]] += 1;
}
}
std::vector<std::pair<ll, ll>> ps0, ps1;
for (auto &&kv : m0) {
ps0.emplace_back(std::make_pair(kv.first, kv.second));
}
std::sort(ps0.begin(), ps0.end(),
[](const std::pair<ll, ll> &kv1, const std::pair<ll, ll> &kv2) {
return kv1.second > kv2.second;
});
ll sum0 = 0, sum0_0 = 0;
for (int i = 0; i < ps0.size(); i++) {
if (i != 0) {
// std::cerr << "++ " << ps0[i] << std::endl;
sum0 += ps0[i].second;
}
if (i != 1) {
sum0_0 += ps0[i].second;
}
}
for (auto &&kv : m1) {
ps1.emplace_back(std::make_pair(kv.first, kv.second));
}
std::sort(ps1.begin(), ps1.end(),
[](const std::pair<ll, ll> &kv1, const std::pair<ll, ll> &kv2) {
return kv1.second > kv2.second;
});
ll sum1 = 0, sum1_1 = 0;
for (int i = 0; i < ps1.size(); i++) {
if (i != 0) {
// std::cerr << "+++ " << ps1[i] << std::endl;
sum1 += ps1[i].second;
}
if (i != 1) {
sum1_1 += ps1[i].second;
}
}
if (ps0[0].first == ps1[0].first) {
std::cout << std::min(sum0 + sum1_1, sum1 + sum0_0) << std::endl;
} else {
std::cout << sum0 + sum1 << std::endl;
}
return 0;
}
| replace | 275 | 276 | 275 | 276 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int N = 5;
signed main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> odd(N), even(N);
int odd_max = 0, oddv = 0;
int even_max = 0, evenv = 0;
rep(i, n) {
cin >> a[i];
if (i % 2 == 0) {
even[a[i]]++;
if (even[a[i]] > even_max) {
even_max = even[a[i]];
evenv = a[i];
}
} else {
odd[a[i]]++;
if (odd[a[i]] > odd_max) {
odd_max = odd[a[i]];
oddv = a[i];
}
}
}
int answer = n + 1;
// SET EVEN
for (int i = 0; i < N; i++) {
if (i == evenv)
continue;
int tmp = n - even_max - odd[i];
answer = min(answer, tmp);
}
// SET ODD
for (int i = 0; i < N; i++) {
if (i == oddv)
continue;
int tmp = n - odd_max - even[i];
answer = min(answer, tmp);
}
cout << answer << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int N = 100010;
signed main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> odd(N), even(N);
int odd_max = 0, oddv = 0;
int even_max = 0, evenv = 0;
rep(i, n) {
cin >> a[i];
if (i % 2 == 0) {
even[a[i]]++;
if (even[a[i]] > even_max) {
even_max = even[a[i]];
evenv = a[i];
}
} else {
odd[a[i]]++;
if (odd[a[i]] > odd_max) {
odd_max = odd[a[i]];
oddv = a[i];
}
}
}
int answer = n + 1;
// SET EVEN
for (int i = 0; i < N; i++) {
if (i == evenv)
continue;
int tmp = n - even_max - odd[i];
answer = min(answer, tmp);
}
// SET ODD
for (int i = 0; i < N; i++) {
if (i == oddv)
continue;
int tmp = n - odd_max - even[i];
answer = min(answer, tmp);
}
cout << answer << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03244 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
const int LARGE = 10010;
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
int ans = 0;
vector<int> even(LARGE, 0);
vector<int> odd(LARGE, 0);
for (int i = 0; i < N; i++) {
if (i % 2 == 0)
even[v[i]]++;
else
odd[v[i]]++;
}
int even_max = 0, odd_max = 0, even_max2 = 0, odd_max2 = 0;
for (int i = 0; i < LARGE; i++) {
if (even[even_max] < even[i]) {
even_max2 = even_max;
even_max = i;
} else if (even[even_max2] < even[i]) {
even_max2 = i;
}
if (odd[odd_max] < odd[i]) {
odd_max2 = odd_max;
odd_max = i;
} else if (odd[odd_max2] < odd[i]) {
odd_max2 = i;
}
}
if (even_max == odd_max) {
cout << N - max(even[even_max] + odd[odd_max2],
even[even_max2] + odd[odd_max])
<< endl;
} else {
cout << N - even[even_max] - odd[odd_max] << endl;
}
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
const int LARGE = 100010;
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
int ans = 0;
vector<int> even(LARGE, 0);
vector<int> odd(LARGE, 0);
for (int i = 0; i < N; i++) {
if (i % 2 == 0)
even[v[i]]++;
else
odd[v[i]]++;
}
int even_max = 0, odd_max = 0, even_max2 = 0, odd_max2 = 0;
for (int i = 0; i < LARGE; i++) {
if (even[even_max] < even[i]) {
even_max2 = even_max;
even_max = i;
} else if (even[even_max2] < even[i]) {
even_max2 = i;
}
if (odd[odd_max] < odd[i]) {
odd_max2 = odd_max;
odd_max = i;
} else if (odd[odd_max2] < odd[i]) {
odd_max2 = i;
}
}
if (even_max == odd_max) {
cout << N - max(even[even_max] + odd[odd_max2],
even[even_max2] + odd[odd_max])
<< endl;
} else {
cout << N - even[even_max] - odd[odd_max] << endl;
}
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define loop(i, a, b) for (ll i = a; i < b; i++)
#define inf (long long int)1e18
#define eps 0.000001
#define vl vector<ll>
#define sl set<ll>
#define pll pair<ll, ll>
#define mll map<ll, ll>
#define mod 1000000007
#define MAXN 100001
ll spf[MAXN];
ll gcd(ll a, ll b);
ll palindrome(string s);
ll modexp(ll a, ll b, ll m);
void sieve();
vl getFactorization(ll x);
void getZarr(string str, ll Z[]);
bool sortinrev(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// cout<<"cjahl jaa"<<endl;
ll n;
cin >> n;
ll v[n];
loop(i, 0, n) { cin >> v[i]; }
// cout<<"kiki "<<endl;
pll e[100000 + 5];
pll o[100000 + 5];
loop(i, 0, 100005) {
e[i].fi = 0;
e[i].se = i;
}
loop(i, 0, 100005) {
o[i].fi = 0;
o[i].se = i;
}
// cout<<"kik "<<endl;
for (ll i = 0; i < n; i = i + 2) {
e[v[i]].fi++;
}
for (ll i = 1; i < n; i = i + 2) {
o[v[i]].fi++;
}
// cout<<"ju "<<endl;
sort(e, e + 100005, sortinrev);
sort(o, o + 100005, sortinrev);
// cout<<"hey "<<endl;
/*loop(i,0,10){
cout<<e[i].fi<<" "<<e[i].se<<endl;
}
loop(i,0,10){
cout<<o[i].fi<<" "<<o[i].se<<endl;
}*/
ll sum1 = 0, sum2 = 0;
loop(i, 0, 100005) {
sum1 += e[i].fi;
sum2 = sum2 + o[i].fi;
}
if (e[0].se != o[0].se) {
cout << sum1 + sum2 - e[0].fi - o[0].fi << endl;
} else {
cout << min(sum1 + sum2 - e[1].fi - o[0].fi,
sum1 + sum2 - e[0].fi - o[1].fi)
<< endl;
}
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a % b, b);
return gcd(a, b % a);
}
ll palindrome(string s) {
ll l = 0;
ll h = s.length() - 1;
while (h > l) {
if (s[l++] != s[h--]) {
return 0;
}
}
return 1;
}
ll modexp(ll a, ll b, ll m) {
if (b == 0)
return 1;
ll temp = modexp(a, b / 2, m);
temp = (temp * temp) % m;
if (b & 1)
return (temp * (a % m)) % m; // if b is odd a^b = a^(b/2)*a^(b/2)*a
return temp;
}
void sieve() {
spf[1] = 1;
for (ll i = 2; i < MAXN; i++)
spf[i] = i;
for (ll i = 4; i < MAXN; i += 2)
spf[i] = 2;
for (ll i = 3; i * i < MAXN; i++) {
if (spf[i] == i) {
for (ll j = i * i; j < MAXN; j += i)
if (spf[j] == j)
spf[j] = i;
}
}
}
vl getFactorization(ll x) {
vl ret;
while (x != 1) {
ret.push_back(spf[x]);
x = x / spf[x];
}
return ret;
}
void getZarr(string str, ll Z[]) {
ll n = str.length();
ll L, R, k;
L = R = 0;
for (ll i = 1; i < n; ++i) {
if (i > R) {
L = R = i;
while (R < n && str[R - L] == str[R])
R++;
Z[i] = R - L;
R--;
} else {
k = i - L;
if (Z[k] < R - i + 1)
Z[i] = Z[k];
else {
L = i;
while (R < n && str[R - L] == str[R])
R++;
Z[i] = R - L;
R--;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define loop(i, a, b) for (ll i = a; i < b; i++)
#define inf (long long int)1e18
#define eps 0.000001
#define vl vector<ll>
#define sl set<ll>
#define pll pair<ll, ll>
#define mll map<ll, ll>
#define mod 1000000007
#define MAXN 100001
ll spf[MAXN];
ll gcd(ll a, ll b);
ll palindrome(string s);
ll modexp(ll a, ll b, ll m);
void sieve();
vl getFactorization(ll x);
void getZarr(string str, ll Z[]);
bool sortinrev(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
// cout<<"cjahl jaa"<<endl;
ll n;
cin >> n;
ll v[n];
loop(i, 0, n) { cin >> v[i]; }
// cout<<"kiki "<<endl;
pll e[100000 + 5];
pll o[100000 + 5];
loop(i, 0, 100005) {
e[i].fi = 0;
e[i].se = i;
}
loop(i, 0, 100005) {
o[i].fi = 0;
o[i].se = i;
}
// cout<<"kik "<<endl;
for (ll i = 0; i < n; i = i + 2) {
e[v[i]].fi++;
}
for (ll i = 1; i < n; i = i + 2) {
o[v[i]].fi++;
}
// cout<<"ju "<<endl;
sort(e, e + 100005, sortinrev);
sort(o, o + 100005, sortinrev);
// cout<<"hey "<<endl;
/*loop(i,0,10){
cout<<e[i].fi<<" "<<e[i].se<<endl;
}
loop(i,0,10){
cout<<o[i].fi<<" "<<o[i].se<<endl;
}*/
ll sum1 = 0, sum2 = 0;
loop(i, 0, 100005) {
sum1 += e[i].fi;
sum2 = sum2 + o[i].fi;
}
if (e[0].se != o[0].se) {
cout << sum1 + sum2 - e[0].fi - o[0].fi << endl;
} else {
cout << min(sum1 + sum2 - e[1].fi - o[0].fi,
sum1 + sum2 - e[0].fi - o[1].fi)
<< endl;
}
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a % b, b);
return gcd(a, b % a);
}
ll palindrome(string s) {
ll l = 0;
ll h = s.length() - 1;
while (h > l) {
if (s[l++] != s[h--]) {
return 0;
}
}
return 1;
}
ll modexp(ll a, ll b, ll m) {
if (b == 0)
return 1;
ll temp = modexp(a, b / 2, m);
temp = (temp * temp) % m;
if (b & 1)
return (temp * (a % m)) % m; // if b is odd a^b = a^(b/2)*a^(b/2)*a
return temp;
}
void sieve() {
spf[1] = 1;
for (ll i = 2; i < MAXN; i++)
spf[i] = i;
for (ll i = 4; i < MAXN; i += 2)
spf[i] = 2;
for (ll i = 3; i * i < MAXN; i++) {
if (spf[i] == i) {
for (ll j = i * i; j < MAXN; j += i)
if (spf[j] == j)
spf[j] = i;
}
}
}
vl getFactorization(ll x) {
vl ret;
while (x != 1) {
ret.push_back(spf[x]);
x = x / spf[x];
}
return ret;
}
void getZarr(string str, ll Z[]) {
ll n = str.length();
ll L, R, k;
L = R = 0;
for (ll i = 1; i < n; ++i) {
if (i > R) {
L = R = i;
while (R < n && str[R - L] == str[R])
R++;
Z[i] = R - L;
R--;
} else {
k = i - L;
if (Z[k] < R - i + 1)
Z[i] = Z[k];
else {
L = i;
while (R < n && str[R - L] == str[R])
R++;
Z[i] = R - L;
R--;
}
}
}
}
| replace | 35 | 39 | 35 | 39 | 0 | |
p03244 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int odd[100001];
int even[100001];
int v[100001];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> v[i];
}
for (int i = 1; i < N; i += 2) {
odd[v[i]]++;
even[v[i + 1]]++;
}
int omax = 0, emax = 0, omax2 = 0, emax2 = 0;
for (int i = 0; i < 100001; i++) {
if (omax < odd[i]) {
omax = odd[i];
omax2 = i;
}
if (emax < even[i]) {
emax = even[i];
emax2 = i;
}
}
if (omax2 != emax2) {
cout << (N - omax - emax) << endl;
} else {
int osec = 0, esec = 0;
for (int i = 0; i < 100001; i++) {
// ใชใใปใฉใใปใใจใฎๆๅคงๅคใฏๅผใฃใใใใชใใใใซifๆใ่จญๅฎใใฆๆๅคงๅคใใใไธๅบฆๆฑใใใใจใงไบ็ช็ฎใฎๆๅคงๅคใๆฑใใใใจใใใใใ
if (osec <= odd[i] && i != omax2) {
osec = odd[i];
}
if (esec < even[i] && i != emax2) {
esec = even[i];
}
}
cout << min((N - omax - esec), (N - emax - osec));
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int odd[100001];
int even[100001];
int v[100001];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> v[i];
}
for (int i = 1; i < N; i += 2) {
odd[v[i]]++;
even[v[i ^ 1]]++;
}
int omax = 0, emax = 0, omax2 = 0, emax2 = 0;
for (int i = 0; i < 100001; i++) {
if (omax < odd[i]) {
omax = odd[i];
omax2 = i;
}
if (emax < even[i]) {
emax = even[i];
emax2 = i;
}
}
if (omax2 != emax2) {
cout << (N - omax - emax) << endl;
} else {
int osec = 0, esec = 0;
for (int i = 0; i < 100001; i++) {
// ใชใใปใฉใใปใใจใฎๆๅคงๅคใฏๅผใฃใใใใชใใใใซifๆใ่จญๅฎใใฆๆๅคงๅคใใใไธๅบฆๆฑใใใใจใงไบ็ช็ฎใฎๆๅคงๅคใๆฑใใใใจใใใใใ
if (osec <= odd[i] && i != omax2) {
osec = odd[i];
}
if (esec < even[i] && i != emax2) {
esec = even[i];
}
}
cout << min((N - omax - esec), (N - emax - osec));
}
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03244 | C++ | Runtime Error |
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
template <class Container> auto me(const Container &c) {
return std::max_element(std::begin(c), std::end(c));
}
auto exec2() {
int N{};
int tab1[10005]{}, tab2[10005]{};
std::cin >> N;
for (int i{0}; i < N / 2; i++) {
int tmp{};
std::cin >> tmp;
tab1[tmp] += 1;
std::cin >> tmp;
tab2[tmp] += 1;
}
auto it1 = me(tab1);
auto d1 = std::distance(std::cbegin(tab1), it1);
auto it2 = me(tab2);
auto d2 = std::distance(std::cbegin(tab2), it2);
auto valid = 0;
if (d1 == d2) {
valid = std::max(*it1, *it2);
tab1[d1] = tab2[d1] = 0;
auto it12 = me(tab1);
auto it22 = me(tab2);
valid += std::max(*it12, *it22);
} else {
valid = (*it1) + (*it2);
}
std::cout << N - valid << "\n";
}
int main() {
exec2();
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
template <class Container> auto me(const Container &c) {
return std::max_element(std::begin(c), std::end(c));
}
auto exec2() {
int N{};
int tab1[100005]{}, tab2[100005]{};
std::cin >> N;
for (int i{0}; i < N / 2; i++) {
int tmp{};
std::cin >> tmp;
tab1[tmp] += 1;
std::cin >> tmp;
tab2[tmp] += 1;
}
auto it1 = me(tab1);
auto d1 = std::distance(std::cbegin(tab1), it1);
auto it2 = me(tab2);
auto d2 = std::distance(std::cbegin(tab2), it2);
auto valid = 0;
if (d1 == d2) {
valid = std::max(*it1, *it2);
tab1[d1] = tab2[d1] = 0;
auto it12 = me(tab1);
auto it22 = me(tab2);
valid += std::max(*it12, *it22);
} else {
valid = (*it1) + (*it2);
}
std::cout << N - valid << "\n";
}
int main() {
exec2();
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p03244 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF * INF * 10;
bool comp(P x, P y) { return x.second < y.first; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi v(n);
bool same = true;
rep(i, n) {
cin >> v[i];
if (v[0] != v[i])
same = false;
}
if (same) {
cout << n / 2 << endl;
return 0;
}
map<int, int> od, ev;
rep(i, n) {
if (i & 1) {
od[v[i]]++;
} else {
ev[v[i]]++;
}
}
vector<P> odp, evp;
for (P x : od) {
odp.emplace_back(x);
}
for (P x : ev) {
evp.emplace_back(x);
}
sort(rall(odp), comp);
sort(rall(evp), comp);
int ans = INT_MAX;
rep(i, min((int)odp.size(), 2)) {
rep(j, min((int)evp.size(), 2)) {
if (odp[i].first == evp[j].first)
continue;
ans = min(ans, n - odp[i].second - evp[j].second);
}
}
cout << ans << endl;
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF * INF * 10;
bool comp(P x, P y) { return x.second < y.second; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi v(n);
bool same = true;
rep(i, n) {
cin >> v[i];
if (v[0] != v[i])
same = false;
}
if (same) {
cout << n / 2 << endl;
return 0;
}
map<int, int> od, ev;
rep(i, n) {
if (i & 1) {
od[v[i]]++;
} else {
ev[v[i]]++;
}
}
vector<P> odp, evp;
for (P x : od) {
odp.emplace_back(x);
}
for (P x : ev) {
evp.emplace_back(x);
}
sort(rall(odp), comp);
sort(rall(evp), comp);
int ans = INT_MAX;
rep(i, min((int)odp.size(), 2)) {
rep(j, min((int)evp.size(), 2)) {
if (odp[i].first == evp[j].first)
continue;
ans = min(ans, n - odp[i].second - evp[j].second);
}
}
cout << ans << endl;
} | replace | 15 | 16 | 15 | 16 | 0 |
Subsets and Splits