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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000 * 100 + 1
#define numberOfSetBits(S) \
__builtin_popcount(S) // __builtin_popcountl(S) __builtin_popcountll(S)
#define MSET(x, y) memset(x, y, sizeof(x))
#define gcd(a, b) __gcd(a, b)
#define all(x) x.begin(), x.end()
#define isOn(S, j) (S & (1 << j))
#define endl '\n'
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define print(x) \
for (auto it : x) \
cout << it << ' '; \
cout << endl;
#define printii(x) \
for (auto it : x) \
cout << it.F << ' ' << it.S << '\t'; \
cout << endl;
#define in(x, n) \
for (int e = 0; e < n; e++) { \
ll y; \
cin >> y; \
x.pb(y); \
}
#define vi vector<ll>
#define vvi vector<vi>
#define ii pair<ll, ll>
#define pll pair<ll, ll>
#define vii vector<ii>
#define vvii vector<vii>
#define viii vector<pair<ii, ll>>
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define mc(a, b, c) mp(mp(a, b), c)
vi a;
map<ll, ll> ma;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, x, t, m, y, z;
cin >> n;
in(a, n);
for (int i = 0; i < n; i++) {
ma[a[i]]++;
}
z = 0;
for (int i = 0; i < n; i++) {
bool ok = true;
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
x = j;
y = a[i] / j;
if (x == a[i]) {
if (ma[x] > 1)
ok = false;
} else {
if (ma[x])
ok = false;
}
if (y == a[i]) {
if (ma[y] > 1)
ok = false;
} else {
if (ma[y])
ok = false;
}
}
}
z += ok;
}
cout << z;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000 * 100 + 1
#define numberOfSetBits(S) \
__builtin_popcount(S) // __builtin_popcountl(S) __builtin_popcountll(S)
#define MSET(x, y) memset(x, y, sizeof(x))
#define gcd(a, b) __gcd(a, b)
#define all(x) x.begin(), x.end()
#define isOn(S, j) (S & (1 << j))
#define endl '\n'
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define print(x) \
for (auto it : x) \
cout << it << ' '; \
cout << endl;
#define printii(x) \
for (auto it : x) \
cout << it.F << ' ' << it.S << '\t'; \
cout << endl;
#define in(x, n) \
for (int e = 0; e < n; e++) { \
ll y; \
cin >> y; \
x.pb(y); \
}
#define vi vector<ll>
#define vvi vector<vi>
#define ii pair<ll, ll>
#define pll pair<ll, ll>
#define vii vector<ii>
#define vvii vector<vii>
#define viii vector<pair<ii, ll>>
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define mc(a, b, c) mp(mp(a, b), c)
vi a;
ll ma[1000004];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, x, t, m, y, z;
cin >> n;
in(a, n);
for (int i = 0; i < n; i++) {
ma[a[i]]++;
}
z = 0;
for (int i = 0; i < n; i++) {
bool ok = true;
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
x = j;
y = a[i] / j;
if (x == a[i]) {
if (ma[x] > 1)
ok = false;
} else {
if (ma[x])
ok = false;
}
if (y == a[i]) {
if (ma[y] > 1)
ok = false;
} else {
if (ma[y])
ok = false;
}
}
}
z += ok;
}
cout << z;
return 0;
} | replace | 47 | 48 | 47 | 48 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define forn(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define fore(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define rep(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define m_p make_pair
#define re return
#define pb push_back
#define si set<int>
#define ld long double
#define X first
#define Y second
#define st string
#define ull unsigned long long
#define mod 1000000007
#define INF 1000000007
#define x1 XZVJDFADSPFOE
#define y1 GASDIJSLDAEJF
#define x2 DFDAJKVOHKWIW
#define y2 PSFSAODSXVNMQ
#define LLINF 0x3f3f3f3f3f3f3f3fLL
using namespace std;
inline void read(int &x) {
short negative = 1;
x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
negative = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
x *= negative;
}
ll quickpower(ll n, ll k) {
ll ans = 1;
while (k) {
if (k % 2) {
ans *= n;
ans %= mod;
}
n *= n;
n %= mod;
k /= 2;
}
return ans;
}
string int_to_string(int n) {
string s = "";
while (n) {
int now = n % 10;
s += now + '0';
n /= 10;
}
reverse(s.begin(), s.end());
return s;
}
int string_to_int(string s) {
int n = 0;
rep(i, s.size()) {
n *= 10;
n += s[i] - '0';
}
return n;
}
int n;
int a[200100];
bool pp[1001000];
bool used[1001000];
int main() {
ios::sync_with_stdio(0);
// think twice,code once
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) {
if (used[a[i]] == 1) {
pp[a[i]] = 1;
}
used[a[i]] = 1;
for (int j = a[i] * 2; j <= 1000000; j += a[i])
pp[j] = 1;
}
int ans = 0;
rep(i, n) if (!pp[a[i]]) ans++;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define forn(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define fore(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define rep(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define m_p make_pair
#define re return
#define pb push_back
#define si set<int>
#define ld long double
#define X first
#define Y second
#define st string
#define ull unsigned long long
#define mod 1000000007
#define INF 1000000007
#define x1 XZVJDFADSPFOE
#define y1 GASDIJSLDAEJF
#define x2 DFDAJKVOHKWIW
#define y2 PSFSAODSXVNMQ
#define LLINF 0x3f3f3f3f3f3f3f3fLL
using namespace std;
inline void read(int &x) {
short negative = 1;
x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
negative = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
x *= negative;
}
ll quickpower(ll n, ll k) {
ll ans = 1;
while (k) {
if (k % 2) {
ans *= n;
ans %= mod;
}
n *= n;
n %= mod;
k /= 2;
}
return ans;
}
string int_to_string(int n) {
string s = "";
while (n) {
int now = n % 10;
s += now + '0';
n /= 10;
}
reverse(s.begin(), s.end());
return s;
}
int string_to_int(string s) {
int n = 0;
rep(i, s.size()) {
n *= 10;
n += s[i] - '0';
}
return n;
}
int n;
int a[200100];
bool pp[1001000];
bool used[1001000];
int main() {
ios::sync_with_stdio(0);
// think twice,code once
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) {
if (used[a[i]] == 1) {
pp[a[i]] = 1;
}
used[a[i]] = 1;
if (pp[a[i]] == 0)
for (int j = a[i] * 2; j <= 1000000; j += a[i])
pp[j] = 1;
}
int ans = 0;
rep(i, n) if (!pp[a[i]]) ans++;
cout << ans << endl;
return 0;
}
| replace | 100 | 102 | 100 | 103 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
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;
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
const LL mod = 998244353;
const LL LINF = 1LL << 62;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0, -1, 1, 1, -1};
int dy[] = {0, 1, 0, -1, -1, -1, 1, 1};
int main() {
LL n;
cin >> n;
vector<int> a(n);
map<int, int> ma;
for (int i = 0; i < n; i++) {
cin >> a[i];
ma[a[i]]++;
}
vector<bool> p(1000001, 0);
for (int i = 1; i <= 1000000; i++) {
if (ma[i]) {
for (int j = 2; j * a[i] <= 1000000; j++) {
p[a[i] * j] = true;
}
}
}
LL ans = 0;
for (int i = 0; i < n; i++) {
if (ma[a[i]] != 1 || p[a[i]])
continue;
else
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
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;
}
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
const LL mod = 998244353;
const LL LINF = 1LL << 62;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0, -1, 1, 1, -1};
int dy[] = {0, 1, 0, -1, -1, -1, 1, 1};
int main() {
LL n;
cin >> n;
vector<int> a(n);
map<int, int> ma;
for (int i = 0; i < n; i++) {
cin >> a[i];
ma[a[i]]++;
}
vector<bool> p(1000001, 0);
for (int i = 1; i <= 1000000; i++) {
if (ma[i]) {
for (int j = 2; j * i <= 1000000; j++) {
p[i * j] = true;
}
}
}
LL ans = 0;
for (int i = 0; i < n; i++) {
if (ma[a[i]] != 1 || p[a[i]])
continue;
else
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 44 | 46 | 44 | 46 | -11 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
map<int, int> mp;
rep(i, n) {
int x;
cin >> x;
mp[x]++;
}
vector<int> a;
set<int> se;
for (auto p : mp) {
if (p.second == 1)
a.push_back(p.first);
else {
int j = 1;
while (p.first * j <= 1001001) {
se.insert(p.first * j);
j++;
}
}
}
int ans = 0;
int sz = a.size();
rep(i, sz) {
if (!se.count(a[i])) {
ans++;
int j = 1;
while (a[i] * j <= 1001001) {
se.insert(a[i] * j);
j++;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
map<int, int> mp;
rep(i, n) {
int x;
cin >> x;
mp[x]++;
}
vector<int> a;
set<int> se;
for (auto p : mp) {
if (p.second == 1)
a.push_back(p.first);
else {
if (se.count(p.first))
continue;
int j = 1;
while (p.first * j <= 1001001) {
se.insert(p.first * j);
j++;
}
}
}
int ans = 0;
int sz = a.size();
rep(i, sz) {
if (!se.count(a[i])) {
ans++;
int j = 1;
while (a[i] * j <= 1001001) {
se.insert(a[i] * j);
j++;
}
}
}
cout << ans << endl;
return 0;
}
| insert | 22 | 22 | 22 | 24 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int *arr;
arr = new int[n];
int rep[1000001] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
rep[arr[i]]++;
}
int ans = 0;
sort(arr, arr + n);
int occ[1000001] = {0};
for (int i = 0; i < n; i++) {
if (occ[arr[i]] == 0) {
for (int j = arr[i] * 2; j < 1000001; j += arr[i])
occ[j]++;
if (rep[arr[i]] == 1) {
ans++;
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int *arr;
arr = new int[n];
int rep[1000001] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
rep[arr[i]]++;
}
int ans = 0;
sort(arr, arr + n);
int occ[1000001] = {0};
for (int i = 0; i < n; i++) {
if (occ[arr[i]] == 0) {
for (int j = arr[i]; j < 1000001; j += arr[i])
occ[j]++;
if (rep[arr[i]] == 1) {
ans++;
}
}
}
cout << ans << endl;
} | replace | 19 | 20 | 19 | 20 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
int ky[8] = {-1, 1, -2, 2, -2, 2, -1, 1};
int kx[8] = {-2, -2, -1, -1, 1, 1, 2, 2};
int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, 1, 0, -1};
int ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
typedef long long ll;
#define pi pair
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define INF 999999999999
const double PI = acos(-1.0);
ll n;
ll a[100000];
ll cnt[1000001];
ll ans;
bool ok[1000001];
ll mx;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> n;
mx = -INF;
rep1(i, 0, n) {
cin >> a[i];
cnt[a[i]]++;
mx = max(mx, a[i]);
}
rep2(i, 1, mx) {
if (cnt[i]) {
for (int j = i + i; j <= mx; j += i)
ok[j] = true;
}
}
rep1(i, 0, n) if (cnt[a[i]] == 1 && !ok[a[i]]) ans++;
cout << ans;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
int ky[8] = {-1, 1, -2, 2, -2, 2, -1, 1};
int kx[8] = {-2, -2, -1, -1, 1, 1, 2, 2};
int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, 1, 0, -1};
int ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
typedef long long ll;
#define pi pair
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define INF 999999999999
const double PI = acos(-1.0);
ll n;
ll a[200000];
ll cnt[1000001];
ll ans;
bool ok[1000001];
ll mx;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> n;
mx = -INF;
rep1(i, 0, n) {
cin >> a[i];
cnt[a[i]]++;
mx = max(mx, a[i]);
}
rep2(i, 1, mx) {
if (cnt[i]) {
for (int j = i + i; j <= mx; j += i)
ok[j] = true;
}
}
rep1(i, 0, n) if (cnt[a[i]] == 1 && !ok[a[i]]) ans++;
cout << ans;
return 0;
}
| replace | 30 | 31 | 30 | 31 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e14, cnt;
ll mark[200000];
int main() {
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
ll maxB = 0;
for (ll i = 0; i < n; i++)
if (a[i] > maxB)
maxB = a[i];
for (ll i = 0; i < n; i++)
for (ll x = a[i]; x <= maxB; x += a[i])
mark[x]++;
for (ll i = 0; i < n; i++) {
if (mark[a[i]] <= 1) {
ans++;
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e14, cnt;
ll mark[20000000];
int main() {
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
ll maxB = 0;
for (ll i = 0; i < n; i++)
if (a[i] > maxB)
maxB = a[i];
for (ll i = 0; i < n; i++)
for (ll x = a[i]; x <= maxB; x += a[i])
mark[x]++;
for (ll i = 0; i < n; i++) {
if (mark[a[i]] <= 1) {
ans++;
}
}
cout << ans << endl;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
// stoi(s) : string→int stoll(s) :string→longlong int→string to_string(i)
const double PI = acos(-1.0);
const int NMAX = 200020;
// 小数点の表し方 cout << fixed << setprecision(5);
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
res.push_back(N / i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
vector<int> ma(NMAX, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
ma[a[i]]++;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (ma[a[i]] > 1)
continue;
vector<ll> p = enum_divisors(a[i]);
bool ok = true;
for (auto x : p) {
if (x == a[i])
continue;
if (ma[x] != 0)
ok = false;
}
if (ok) {
cnt++;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
// stoi(s) : string→int stoll(s) :string→longlong int→string to_string(i)
const double PI = acos(-1.0);
const int NMAX = 3000200;
// 小数点の表し方 cout << fixed << setprecision(5);
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
res.push_back(N / i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
vector<int> ma(NMAX, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
ma[a[i]]++;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (ma[a[i]] > 1)
continue;
vector<ll> p = enum_divisors(a[i]);
bool ok = true;
for (auto x : p) {
if (x == a[i])
continue;
if (ma[x] != 0)
ok = false;
}
if (ok) {
cnt++;
}
}
cout << cnt << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> yakusu;
void dfs(vector<pair<int, int>> &p, int n, int x, int y) {
if (x == y)
yakusu.push_back(n);
else {
int po = 1;
for (int i = 0; i <= p[x].second; i++) {
dfs(p, n * po, x + 1, y);
po *= p[x].first;
}
}
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
vector<int> furui(1000001, 0);
for (int i = 2; i <= 1000001; i++) {
if (furui[i] == 0) {
for (int j = i; j <= 1000001; j += i)
if (furui[j] == 0)
furui[j] = i;
}
}
int x = n;
for (int i = 0; i < n; i++) {
yakusu.resize(0);
vector<int> v;
int I = a[i];
while (furui[I] != I) { // prime
v.push_back(furui[I]);
I /= furui[I];
}
v.push_back(I);
vector<pair<int, int>> p;
int s = 1, y = 1;
for (int j = 0; j < v.size() - 1; j++) {
if (v[j] == v[j + 1])
s++;
else {
p.push_back({v[j], s});
s = 1;
y++;
}
}
p.push_back({v.back(), s});
dfs(p, 1, 0, y);
for (int j = 0; j < yakusu.size(); j++) {
if (binary_search(a, a + i, yakusu[j]) ||
binary_search(a + i + 1, a + n, yakusu[j])) {
x--;
break;
}
}
}
cout << x << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> yakusu;
void dfs(vector<pair<int, int>> &p, int n, int x, int y) {
if (x == y)
yakusu.push_back(n);
else {
int po = 1;
for (int i = 0; i <= p[x].second; i++) {
dfs(p, n * po, x + 1, y);
po *= p[x].first;
}
}
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
vector<int> furui(1000001, 0);
furui[1] = 1;
for (int i = 2; i <= 1000001; i++) {
if (furui[i] == 0) {
for (int j = i; j <= 1000001; j += i)
if (furui[j] == 0)
furui[j] = i;
}
}
int x = n;
for (int i = 0; i < n; i++) {
yakusu.resize(0);
vector<int> v;
int I = a[i];
while (furui[I] != I) { // prime
v.push_back(furui[I]);
I /= furui[I];
}
v.push_back(I);
vector<pair<int, int>> p;
int s = 1, y = 1;
for (int j = 0; j < v.size() - 1; j++) {
if (v[j] == v[j + 1])
s++;
else {
p.push_back({v[j], s});
s = 1;
y++;
}
}
p.push_back({v.back(), s});
dfs(p, 1, 0, y);
for (int j = 0; j < yakusu.size(); j++) {
if (binary_search(a, a + i, yakusu[j]) ||
binary_search(a + i + 1, a + n, yakusu[j])) {
x--;
break;
}
}
}
cout << x << endl;
return 0;
}
| insert | 22 | 22 | 22 | 23 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
#define ll long long
#define intm INT_MAX
#define llm LLONG_MAX
using namespace std;
typedef pair<int, int> P;
const int MOD = 998244353;
const ll mod = 1e9 + 7;
const int mxN = 2e5 + 9;
bool tf[mxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
memset(tf, true, sizeof(tf));
int n, tmp;
cin >> n;
vector<int> v1;
map<int, int> m1;
for (int i = 0; i < n; i++) {
cin >> tmp;
m1[tmp] += 1;
v1.push_back(tmp);
}
int M = *max_element(v1.begin(), v1.end());
for (auto &c : v1) {
if (tf[c] == false)
continue;
for (int j = 2 * c; j <= M; j += c)
tf[j] = false;
}
ll ans = 0;
for (auto &c : v1) {
if (tf[c] && m1[c] == 1)
++ans;
}
cout << ans;
}
| #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
#define ll long long
#define intm INT_MAX
#define llm LLONG_MAX
using namespace std;
typedef pair<int, int> P;
const int MOD = 998244353;
const ll mod = 1e9 + 7;
const int mxN = 1e6 + 9;
bool tf[mxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
memset(tf, true, sizeof(tf));
int n, tmp;
cin >> n;
vector<int> v1;
map<int, int> m1;
for (int i = 0; i < n; i++) {
cin >> tmp;
m1[tmp] += 1;
v1.push_back(tmp);
}
int M = *max_element(v1.begin(), v1.end());
for (auto &c : v1) {
if (tf[c] == false)
continue;
for (int j = 2 * c; j <= M; j += c)
tf[j] = false;
}
ll ans = 0;
for (auto &c : v1) {
if (tf[c] && m1[c] == 1)
++ans;
}
cout << ans;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int mx6[] = {1, 0, -1, 1, -1, 0};
int my6[] = {1, 1, 1, 0, 0, -1};
const int N = 1000005;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int dp[N];
rep(i, N) dp[i] = 0;
rep(i, n) {
if (dp[a[i]] <= 1) {
int A = a[i];
for (int j = 0; j < 1000004 && j * a[i] < 1000004; j++) {
dp[A]++;
A += a[i];
}
}
}
int ans = 0;
rep(i, n) {
if (dp[a[i]] == 1)
ans++;
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int mx6[] = {1, 0, -1, 1, -1, 0};
int my6[] = {1, 1, 1, 0, 0, -1};
const int N = 1000005;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int dp[N];
rep(i, N) dp[i] = 0;
rep(i, n) {
if (dp[a[i]] <= 1) {
int A = a[i];
for (int j = 1; j < 1000004 && j * a[i] < 1000004; j++) {
dp[A * j]++;
}
}
}
int ans = 0;
rep(i, n) {
if (dp[a[i]] == 1)
ans++;
}
cout << ans << endl;
}
| replace | 38 | 41 | 38 | 40 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define forn(i, a, b) for (int i = a; i < (signed)(b); ++i)
#define pb push_back
// debug templates
#define debug(x) cerr << #x << " : " << x << endl;
#define debuga(A, N) \
cerr << #A << " : ["; \
for (int i = 0; i < N; i++) \
cerr << A[i] << " "; \
cerr << "]\n";
#define debuga2(A, N, M) \
cerr << #A << " : \n"; \
for (int i = 0; i < N; i++) { \
cerr << "["; \
for (int j = 0; j < M; ++j) \
cerr << A[i][j] << " "; \
cerr << "]\n"; \
}
#define debugp(p) \
cerr << #p << " : " \
<< "(" << (p).first << "," << (p).second << ")\n";
#define debugv(v) \
cerr << #v << " : " \
<< "["; \
for (int i = 0; i < (v).size(); i++) \
cerr << v[i] << " "; \
cerr << "]\n";
#define debugv2(v) \
cerr << #v << " : \n"; \
for (int i = 0; i < v.size(); i++) { \
cerr << "["; \
for (int j = 0; j < (v[0].size()); ++j) \
cerr << v[i][j] << " "; \
cerr << "]\n"; \
}
#define debugs(m) \
cerr << #m << " : [ "; \
for (auto itr = m.begin(); itr != m.end(); itr++) \
cerr << *itr << " "; \
cerr << "]\n";
#define debugm(m) \
cerr << #m << " : [ "; \
for (auto itr = m.begin(); itr != m.end(); itr++) \
cerr << "(" << itr->first << "," << itr->second << ") "; \
cerr << "]\n";
// 24 4 6 --> 2
// 24 4 6 2 --> 1
const int mxN = 1e6 + 2;
int mult[mxN];
void flag(int n) {
for (int i = n; i < mxN; i += n) {
mult[i] = 1;
}
}
void solve() {
int n;
cin >> n;
int a[n];
forn(i, 0, n) cin >> a[i];
sort(a, a + n);
// catch duplicates
forn(i, 1, n) {
if (a[i] == a[i - 1])
flag(a[i]);
}
int ans = 0;
forn(i, 0, n) {
int elm = a[i];
if (mult[elm])
continue;
++ans;
flag(elm);
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define forn(i, a, b) for (int i = a; i < (signed)(b); ++i)
#define pb push_back
// debug templates
#define debug(x) cerr << #x << " : " << x << endl;
#define debuga(A, N) \
cerr << #A << " : ["; \
for (int i = 0; i < N; i++) \
cerr << A[i] << " "; \
cerr << "]\n";
#define debuga2(A, N, M) \
cerr << #A << " : \n"; \
for (int i = 0; i < N; i++) { \
cerr << "["; \
for (int j = 0; j < M; ++j) \
cerr << A[i][j] << " "; \
cerr << "]\n"; \
}
#define debugp(p) \
cerr << #p << " : " \
<< "(" << (p).first << "," << (p).second << ")\n";
#define debugv(v) \
cerr << #v << " : " \
<< "["; \
for (int i = 0; i < (v).size(); i++) \
cerr << v[i] << " "; \
cerr << "]\n";
#define debugv2(v) \
cerr << #v << " : \n"; \
for (int i = 0; i < v.size(); i++) { \
cerr << "["; \
for (int j = 0; j < (v[0].size()); ++j) \
cerr << v[i][j] << " "; \
cerr << "]\n"; \
}
#define debugs(m) \
cerr << #m << " : [ "; \
for (auto itr = m.begin(); itr != m.end(); itr++) \
cerr << *itr << " "; \
cerr << "]\n";
#define debugm(m) \
cerr << #m << " : [ "; \
for (auto itr = m.begin(); itr != m.end(); itr++) \
cerr << "(" << itr->first << "," << itr->second << ") "; \
cerr << "]\n";
// 24 4 6 --> 2
// 24 4 6 2 --> 1
const int mxN = 1e6 + 2;
int mult[mxN];
void flag(int n) {
for (int i = n; i < mxN; i += n) {
mult[i] = 1;
}
}
void solve() {
int n;
cin >> n;
int a[n];
forn(i, 0, n) cin >> a[i];
sort(a, a + n);
// catch duplicates
forn(i, 1, n) {
if (a[i] == a[i - 1] && !mult[a[i]])
flag(a[i]);
}
int ans = 0;
forn(i, 0, n) {
int elm = a[i];
if (mult[elm])
continue;
++ans;
flag(elm);
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| replace | 73 | 74 | 73 | 74 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int num[100005];
int cnt[1000005];
bool hobena[1000005];
bool ase[1000005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> num[i], ase[num[i]] = 1, cnt[num[i]]++;
for (int i = 1; i <= 1000000; i++) {
if (!ase[i])
continue;
for (int j = 2 * i; j <= 1000000; j += i)
hobena[j] = 1;
}
int ans = 0;
for (int i = 1; i <= n; i++)
if (!hobena[num[i]] and cnt[num[i]] == 1)
ans++;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int num[200005];
int cnt[1000005];
bool hobena[1000005];
bool ase[1000005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> num[i], ase[num[i]] = 1, cnt[num[i]]++;
for (int i = 1; i <= 1000000; i++) {
if (!ase[i])
continue;
for (int j = 2 * i; j <= 1000000; j += i)
hobena[j] = 1;
}
int ans = 0;
for (int i = 1; i <= n; i++)
if (!hobena[num[i]] and cnt[num[i]] == 1)
ans++;
cout << ans << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) { // nの約数列挙
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
typedef pair<long long, long long> P;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
map<long long, long long> m;
sort(A.begin(), A.end());
vector<int> ju(N, 0);
for (int i = 1; i < N; i++) {
if (A[i] == A[i - 1]) {
ju[i] = -1;
ju[i - 1] = -1;
}
}
for (int i = 0; i < N; i++) {
if (m.count(A[i]))
continue;
long long t = A[i];
long long res = 2;
while (t * res <= 1000000) {
m[t * res]++;
res++;
}
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (m[A[i]] == 0 && ju[i] == 0)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) { // nの約数列挙
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
typedef pair<long long, long long> P;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
map<long long, long long> m;
sort(A.begin(), A.end());
vector<int> ju(N, 0);
for (int i = 1; i < N; i++) {
if (A[i] == A[i - 1]) {
ju[i] = -1;
ju[i - 1] = -1;
}
}
for (int i = 0; i < N; i++) {
if (m.count(A[i]))
continue;
long long t = A[i];
long long res = 2;
while (t * res <= A[N - 1]) {
m[t * res]++;
res++;
}
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (m[A[i]] == 0 && ju[i] == 0)
ans++;
}
cout << ans << endl;
} | replace | 37 | 38 | 37 | 38 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define MAX 200005
#define INF 1000005
#define endl "\n"
int arr[MAX];
int f[INF];
bool p[INF];
bool flag[MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 2; i <= INF; i++) {
if (!p[i]) {
for (lli j = i * i; j <= INF; j += i) {
p[j] = true;
}
}
}
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
f[arr[i]]++;
}
int c = 0;
bool flag = false;
for (int i = 0; i < n; i++) {
flag = false;
f[arr[i]]--;
if (!p[arr[i]]) {
if (f[1] || f[arr[i]]) {
} else {
c++;
}
f[arr[i]]++;
continue;
}
for (int j = 1; j * j <= arr[i]; j++) {
if (arr[i] % j == 0) {
if (f[j] || f[arr[i] / j]) {
flag = true;
break;
}
}
}
if (!flag) {
c++;
}
f[arr[i]]++;
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define MAX 200005
#define INF 1000005
#define endl "\n"
int arr[MAX];
int f[INF];
bool p[INF];
bool flag[MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (lli i = 2; i <= INF; i++) {
if (!p[i]) {
for (lli j = i * i; j <= INF; j += i) {
p[j] = true;
}
}
}
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
f[arr[i]]++;
}
int c = 0;
bool flag = false;
for (int i = 0; i < n; i++) {
flag = false;
f[arr[i]]--;
if (!p[arr[i]]) {
if (f[1] || f[arr[i]]) {
} else {
c++;
}
f[arr[i]]++;
continue;
}
for (int j = 1; j * j <= arr[i]; j++) {
if (arr[i] % j == 0) {
if (f[j] || f[arr[i] / j]) {
flag = true;
break;
}
}
}
if (!flag) {
c++;
}
f[arr[i]]++;
}
cout << c << endl;
} | replace | 13 | 14 | 13 | 14 | -11 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
int n, res, u, mx, y, t;
int main() {
cin >> n;
vector<int> vec(n, 0);
map<int, int> m;
map<int, bool> flag;
for (int i = 0; i < n; ++i) {
cin >> vec[i];
m[vec[i]]++;
mx = max(mx, vec[i]);
flag[vec[i]] = false;
}
res = 0;
for (auto x : m) {
if (x.second > 1)
flag[x.first] = true;
t = x.first;
while (t <= mx) {
t += x.first;
if (m.count(t)) {
flag[t] = true;
}
}
}
for (auto x : flag)
if (!x.second)
res++;
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
int n, res, u, mx, y, t;
int main() {
cin >> n;
vector<int> vec(n, 0);
map<int, int> m;
map<int, bool> flag;
for (int i = 0; i < n; ++i) {
cin >> vec[i];
m[vec[i]]++;
mx = max(mx, vec[i]);
flag[vec[i]] = false;
}
res = 0;
for (auto x : m) {
if (x.second > 1)
flag[x.first] = true;
t = x.first;
for (int r = 2; x.first * r <= mx; r += 4) {
t = x.first * r;
if (m.count(t)) {
flag[t] = true;
}
t = x.first * (r + 1);
if (m.count(t)) {
flag[t] = true;
}
t = x.first * (r + 2);
if (m.count(t)) {
flag[t] = true;
}
t = x.first * (r + 3);
if (m.count(t)) {
flag[t] = true;
}
}
}
for (auto x : flag)
if (!x.second)
res++;
cout << res << endl;
return 0;
}
| replace | 23 | 25 | 23 | 37 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
std::vector<int64_t> A(N);
multiset<int64_t> sets;
for (int i = 0; i < N; i++) {
cin >> A[i];
sets.insert(A[i]);
}
int64_t max = 200001;
vector<int64_t> nums(200001, 0);
for (int i = 0; i < N; i++) {
int64_t hit = A[i];
if (nums[hit] >= 1) {
nums[hit] += 1;
continue;
}
while (hit < max) {
nums[hit] += 1;
hit += A[i];
}
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (nums[A[i]] == 1)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
std::vector<int64_t> A(N);
multiset<int64_t> sets;
for (int i = 0; i < N; i++) {
cin >> A[i];
sets.insert(A[i]);
}
int64_t max = 10e6 + 1;
vector<int64_t> nums(max, 0);
for (int i = 0; i < N; i++) {
int64_t hit = A[i];
if (nums[hit] >= 1) {
nums[hit] += 1;
continue;
}
while (hit < max) {
nums[hit] += 1;
hit += A[i];
}
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (nums[A[i]] == 1)
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 13 | 15 | 13 | 15 | 0 | |
p02642 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int Amax;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
Amax = max(Amax, A[i]);
}
A.push_back(10000000);
sort(A.begin(), A.end());
vector<bool> not_divisible(Amax + 1, true);
int ans = 0;
for (int i = 0; i < N; i++) {
int x = A[i];
if (A[i] == A[i + 1]) {
if (not_divisible[x]) {
while (x <= Amax) {
not_divisible[x] = false;
x += A[i];
}
}
while (A[i] == A[i + 1]) {
i++;
}
} else {
if (not_divisible[x]) {
while (x <= Amax) {
not_divisible[x] = false;
x += A[i];
}
ans++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int Amax;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
Amax = max(Amax, A[i]);
}
A.push_back(10000000);
sort(A.begin(), A.end());
vector<bool> not_divisible(Amax + 1, true);
int ans = 0;
for (int i = 0; i < N; i++) {
int x = A[i];
if (A[i] == A[i + 1]) {
if (not_divisible[x]) {
while (x <= Amax) {
not_divisible[x] = false;
x += A[i];
}
}
while (A[i] == A[i + 1]) {
i++;
}
} else {
if (not_divisible[x]) {
while (x <= Amax) {
not_divisible[x] = false;
x += A[i];
}
ans++;
}
}
}
cout << ans << endl;
} | delete | 0 | 1 | 0 | 0 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
using P = pair<int, int>;
const int Max = 1000005;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> memo(Max);
rep(i, n) {
if (memo[a[i]] != 0) {
memo[a[i]] = 2;
} else {
for (int x = a[i]; x < Max; x + x)
memo[x]++;
}
}
int ans = 0;
rep(i, n) if (memo[a[i]] == 1) ans++;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
using P = pair<int, int>;
const int Max = 1000005;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> memo(Max);
rep(i, n) {
if (memo[a[i]] != 0) {
memo[a[i]] = 2;
} else {
for (int x = a[i]; x < Max; x += a[i])
memo[x]++;
}
}
int ans = 0;
rep(i, n) if (memo[a[i]] == 1) ans++;
cout << ans << endl;
} | replace | 19 | 20 | 19 | 20 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
// typedef vector<unsigned int>vec;
// typedef vector<ll>vec;
// typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const double PI = acos(-1.0);
const double EPS = 1e-10;
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;
}
// template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
void solve() {
int N;
cin >> N;
vector<int> A(N);
vector<int> mp(202020);
REP(i, N) {
cin >> A[i];
mp[A[i]]++;
}
int ans = 0;
REP(k, N) {
mp[A[k]]--;
bool ok = true;
for (ll i = 1; i * i <= A[k]; i++) {
if (A[k] % i == 0) {
if (mp[i] > 0) {
ok = false;
}
if (i != A[i] / i)
if (mp[A[k] / i] > 0) {
ok = false;
}
}
if (!ok)
break;
}
if (ok) {
// cout << k << endl;
ans++;
}
mp[A[k]]++;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
// int T; cin >> T; REP(t,T) solve();
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
// typedef vector<unsigned int>vec;
// typedef vector<ll>vec;
// typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const double PI = acos(-1.0);
const double EPS = 1e-10;
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;
}
// template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
void solve() {
int N;
cin >> N;
vector<int> A(N);
vector<int> mp(2020202);
REP(i, N) {
cin >> A[i];
mp[A[i]]++;
}
int ans = 0;
REP(k, N) {
mp[A[k]]--;
bool ok = true;
for (ll i = 1; i * i <= A[k]; i++) {
if (A[k] % i == 0) {
if (mp[i] > 0) {
ok = false;
}
if (i != A[i] / i)
if (mp[A[k] / i] > 0) {
ok = false;
}
}
if (!ok)
break;
}
if (ok) {
// cout << k << endl;
ans++;
}
mp[A[k]]++;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
// int T; cin >> T; REP(t,T) solve();
} | replace | 50 | 51 | 50 | 51 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
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;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> cnt(1100000);
rep(i, n) {
for (int j = a[i]; j <= 1100000; j += a[i]) {
cnt[j]++;
}
}
int sum = n;
rep(i, n) {
if (cnt[a[i]] >= 2)
sum--;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
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;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> cnt(1100000);
rep(i, n) {
if (cnt[a[i]] != 0) {
cnt[a[i]] = 2;
continue;
}
for (int j = a[i]; j <= 1100000; j += a[i]) {
cnt[j]++;
}
}
int sum = n;
rep(i, n) {
if (cnt[a[i]] >= 2)
sum--;
}
cout << sum << endl;
}
| insert | 27 | 27 | 27 | 31 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int i;
long long j;
long long k;
long long p;
cin >> n;
long long a[n + 1]; // n個の整数
int b[1000010]{0};
if (n == 1) {
cout << 1 << endl;
return 0;
}
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
p = a[i];
k = 1000010;
for (j = p; j < k; j += p)
b[j]++;
}
p = 0;
for (i = 0; i < n; i++) {
if (b[a[i]] == 1)
p++;
}
cout << p << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int i;
long long j;
long long k;
long long p;
cin >> n;
long long a[n + 1]; // n個の整数
int b[1000010]{0};
if (n == 1) {
cout << 1 << endl;
return 0;
}
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
p = a[i];
if (b[p] > 0) {
b[p]++;
continue;
}
k = 1000010;
for (j = p; j < k; j += p)
b[j]++;
}
p = 0;
for (i = 0; i < n; i++) {
if (b[a[i]] == 1)
p++;
}
cout << p << endl;
return 0;
}
| insert | 24 | 24 | 24 | 28 | TLE | |
p02642 | C++ | Time Limit Exceeded | /* Author: $%U%$
* Time: $%Y%$-$%M%$-$%D%$ $%h%$:$%m%$:$%s%$
**/
#include <bits/stdc++.h>
using namespace std;
#define fore(i, a, b) for (int i = a, to = b; i < to; i++)
#define foref(i, a, b) for (int i = b - 1, to = a; i >= to; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SZ(v) (int)v.size()
#define pb push_back
typedef long long Long;
typedef pair<int, int> Pair;
const int MX = (1e6);
Long vis[MX + 2];
void update(Long x) {
for (Long i = x; i <= MX; i += x) {
vis[i]++;
}
}
void solve() {
int n;
cin >> n;
vector<int> v(n);
fore(i, 0, n) cin >> v[i];
fore(i, 0, n) update(v[i]);
int ans = 0;
fore(i, 0, n) {
if (vis[v[i]] == 1) {
ans++;
}
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | /* Author: $%U%$
* Time: $%Y%$-$%M%$-$%D%$ $%h%$:$%m%$:$%s%$
**/
#include <bits/stdc++.h>
using namespace std;
#define fore(i, a, b) for (int i = a, to = b; i < to; i++)
#define foref(i, a, b) for (int i = b - 1, to = a; i >= to; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define SZ(v) (int)v.size()
#define pb push_back
typedef long long Long;
typedef pair<int, int> Pair;
const int MX = (1e6);
Long vis[MX + 2];
void update(Long x) {
if (vis[x] > 2)
return;
for (Long i = x; i <= MX; i += x) {
vis[i]++;
}
}
void solve() {
int n;
cin >> n;
vector<int> v(n);
fore(i, 0, n) cin >> v[i];
fore(i, 0, n) update(v[i]);
int ans = 0;
fore(i, 0, n) {
if (vis[v[i]] == 1) {
ans++;
}
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | insert | 16 | 16 | 16 | 18 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
#define MAX_N 200001
bool divisible[MAX_N];
bool visited[MAX_N];
void init() {
rep(i, MAX_N) {
divisible[i] = false;
visited[i] = false;
}
}
int A[MAX_N];
int main() {
init();
int n;
cin >> n;
rep(i, n) { cin >> A[i]; }
sort(A, A + n);
for (int i = 0; i < n; i++) {
if (divisible[A[i]] == false && visited[A[i]] == true) {
divisible[A[i]] = true;
} else if (divisible[A[i]] == false && visited[A[i]] == false) {
visited[A[i]] = true;
for (int j = 2; A[i] * j <= MAX_N; j++) {
divisible[A[i] * j] = true;
}
}
}
int ans = 0;
rep(i, n) {
if (divisible[A[i]] == false)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
#define MAX_N 1000001
bool divisible[MAX_N];
bool visited[MAX_N];
void init() {
rep(i, MAX_N) {
divisible[i] = false;
visited[i] = false;
}
}
int A[MAX_N];
int main() {
init();
int n;
cin >> n;
rep(i, n) { cin >> A[i]; }
sort(A, A + n);
for (int i = 0; i < n; i++) {
if (divisible[A[i]] == false && visited[A[i]] == true) {
divisible[A[i]] = true;
} else if (divisible[A[i]] == false && visited[A[i]] == false) {
visited[A[i]] = true;
for (int j = 2; A[i] * j <= MAX_N; j++) {
divisible[A[i] * j] = true;
}
}
}
int ans = 0;
rep(i, n) {
if (divisible[A[i]] == false)
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long long int n, x, i, j;
cin >> n;
map<long long int, long long int> mp;
vector<bool> b(1000100, 0);
for (i = 0; i < n; i++) {
cin >> x;
mp[x]++;
}
long long int cnt = n;
for (auto it = mp.begin(); it != mp.end(); it++) {
int p = it->first;
if (mp.find(p) != mp.end() && mp[p] > 1 && b[j] == 0) {
cnt = cnt - mp[p];
}
for (j = 2 * p; j <= 1000010; j += p) {
if (mp.find(j) != mp.end() && mp[j] > 0 && b[j] == 0) {
cnt = cnt - mp[j];
b[j] = 1;
}
}
}
cout << cnt << "\n";
} | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long long int n, x, i, j;
cin >> n;
map<long long int, long long int> mp;
vector<bool> b(1000100, 0);
for (i = 0; i < n; i++) {
cin >> x;
mp[x]++;
}
long long int cnt = n;
for (auto it = mp.begin(); it != mp.end(); it++) {
int p = it->first;
if (mp.find(p) != mp.end() && mp[p] > 1 && b[p] == 0) {
cnt = cnt - mp[p];
}
for (j = 2 * p; j <= 1000010; j += p) {
if (mp.find(j) != mp.end() && mp[j] > 0 && b[j] == 0) {
cnt = cnt - mp[j];
b[j] = 1;
}
}
}
cout << cnt << "\n";
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
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() {
ll n;
cin >> n;
vector<ll> a(n);
map<ll, ll> mp;
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (ll i = 0; i < n; i++)
mp[a[i]]++;
ll ans = 0;
for (ll i = 0; i < n; i++) {
bool flag = true;
mp[a[i]]--;
for (ll j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
if (mp[j])
flag = false;
if (j * j != a[i] && mp[a[i] / j])
flag = false;
}
}
if (flag)
ans++;
mp[a[i]]++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
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() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> mp(1e6 + 1);
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (ll i = 0; i < n; i++)
mp[a[i]]++;
ll ans = 0;
for (ll i = 0; i < n; i++) {
bool flag = true;
mp[a[i]]--;
for (ll j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
if (mp[j])
flag = false;
if (j * j != a[i] && mp[a[i] / j])
flag = false;
}
}
if (flag)
ans++;
mp[a[i]]++;
}
cout << ans << endl;
} | replace | 25 | 26 | 25 | 26 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int counter[1000006];
bool divided[1000005];
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
for (int i = 0; i < n; i++) {
counter[arr[i]]++;
if (!divided[arr[i]]) {
for (int j = 2 * arr[i]; j <= 1000000; j += arr[i])
divided[j] = true;
}
}
int ret = 0;
for (int i = 0; i < n; i++) {
if (arr[i] == 1) {
if (counter[1] == 1)
ret++;
} else {
if (counter[1])
continue;
if (divided[arr[i]] || counter[arr[i]] > 1)
continue;
ret++;
}
}
cout << ret;
} | #include <bits/stdc++.h>
using namespace std;
int counter[1000006];
bool divided[1000005];
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
for (int i = 0; i < n; i++) {
counter[arr[i]]++;
if (!divided[arr[i]] && counter[arr[i]] == 1) {
for (int j = 2 * arr[i]; j <= 1000000; j += arr[i])
divided[j] = true;
}
}
int ret = 0;
for (int i = 0; i < n; i++) {
if (arr[i] == 1) {
if (counter[1] == 1)
ret++;
} else {
if (counter[1])
continue;
if (divided[arr[i]] || counter[arr[i]] > 1)
continue;
ret++;
}
}
cout << ret;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXA = 1.01e6;
const int MAXN = 1.01e5;
int ar[MAXN], c[MAXA];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
memset(c, 0, sizeof c);
for (int i = 0; i < n; ++i) {
cin >> ar[i];
c[ar[i]]++;
}
int res = 0;
for (int i = 0; i < n; ++i) {
c[ar[i]]--;
bool ok = true;
for (int x = 1; x <= ar[i] / x; ++x) {
if (ar[i] % x)
continue;
if (c[x])
ok = false;
if (ar[i] / x != x && c[ar[i] / x])
ok = false;
}
res += int(ok);
c[ar[i]]++;
}
cout << res << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAXA = 1.01e6;
const int MAXN = 2.01e5;
int ar[MAXN], c[MAXA];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
memset(c, 0, sizeof c);
for (int i = 0; i < n; ++i) {
cin >> ar[i];
c[ar[i]]++;
}
int res = 0;
for (int i = 0; i < n; ++i) {
c[ar[i]]--;
bool ok = true;
for (int x = 1; x <= ar[i] / x; ++x) {
if (ar[i] % x)
continue;
if (c[x])
ok = false;
if (ar[i] / x != x && c[ar[i] / x])
ok = false;
}
res += int(ok);
c[ar[i]]++;
}
cout << res << '\n';
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 約数列挙(√N)
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
// 素因数分解(√N)
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
// 素数テーブル(NloglogN)
vector<bool> prime_table(int n) {
vector<bool> prime(n + 1, true);
if (n >= 0)
prime[0] = false;
if (n >= 1)
prime[1] = false;
for (int i = 2; i * i <= n; i++) {
if (!prime[i])
continue;
for (int j = i + i; j <= n; j += i) {
prime[j] = false;
}
}
return prime;
}
// 二項係数(K)
template <typename T> T binomial(int64_t N, int64_t K) {
if (K < 0 || N < K)
return 0;
T ret = 1;
for (T i = 1; i <= K; ++i) {
ret *= N--;
ret /= i;
}
return ret;
}
// 二項係数テーブル(N^2)
template <typename T> vector<vector<T>> binomial_table(int N) {
vector<vector<T>> mat(N + 1, vector<T>(N + 1));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
mat[i][j] = 1;
else
mat[i][j] = mat[i - 1][j - 1] + mat[i - 1][j];
}
}
return mat;
}
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
if (n == 1) {
cout << 1 << endl;
return 0;
}
rep(i, n) cin >> a.at(i);
sort(all(a));
int ans = 0;
vector<int> b(1000000);
rep(i, n) {
if (b.at(a.at(i) - 1) != 0)
continue;
if (a.at(i) != a.at(i + 1))
ans++;
int j = 1;
while (a.at(i) * j <= 1000000) {
b.at(a.at(i) * j - 1) = 1;
j++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 約数列挙(√N)
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
// 素因数分解(√N)
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
// 素数テーブル(NloglogN)
vector<bool> prime_table(int n) {
vector<bool> prime(n + 1, true);
if (n >= 0)
prime[0] = false;
if (n >= 1)
prime[1] = false;
for (int i = 2; i * i <= n; i++) {
if (!prime[i])
continue;
for (int j = i + i; j <= n; j += i) {
prime[j] = false;
}
}
return prime;
}
// 二項係数(K)
template <typename T> T binomial(int64_t N, int64_t K) {
if (K < 0 || N < K)
return 0;
T ret = 1;
for (T i = 1; i <= K; ++i) {
ret *= N--;
ret /= i;
}
return ret;
}
// 二項係数テーブル(N^2)
template <typename T> vector<vector<T>> binomial_table(int N) {
vector<vector<T>> mat(N + 1, vector<T>(N + 1));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
mat[i][j] = 1;
else
mat[i][j] = mat[i - 1][j - 1] + mat[i - 1][j];
}
}
return mat;
}
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
if (n == 1) {
cout << 1 << endl;
return 0;
}
rep(i, n) cin >> a.at(i);
sort(all(a));
int ans = 0;
vector<int> b(1000000);
rep(i, n) {
if (b.at(a.at(i) - 1) != 0)
continue;
if (i == n - 1 || a.at(i) != a.at(i + 1))
ans++;
int j = 1;
while (a.at(i) * j <= 1000000) {
b.at(a.at(i) * j - 1) = 1;
j++;
}
}
cout << ans << endl;
}
| replace | 101 | 102 | 101 | 102 | 0 | |
p02642 | C++ | Runtime Error | #ifdef _MSC_VER
#include "stdc++.h"
#endif
#ifdef __GNUC__
#include <bits/stdc++.h>
#endif
using namespace std;
using ll = long long;
// vector
using vi = vector<int>;
using vii = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
// constant
const double EPS = 1e-10;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, s, e) for (ll i = s; i < e; i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
// debug
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl;
// vector
// template<typename T> vector<vector<T>> vv(ll H, ll W, T v) { return
// vector<vector<T>> vec(H, vector<T>(W, v)); }
// view vector
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
// DP
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;
}
// ***************************************
int main() {
int N;
cin >> N;
vll A(N);
ll mx = 0;
ll cnt1 = 0;
REP(i, N) {
cin >> A[i];
if (A[i] == 1)
cnt1++;
chmax(mx, A[i]);
}
if (cnt1 == 1) {
cout << 1 << endl;
return 1;
} else if (cnt1 > 1) {
cout << 0 << endl;
return 0;
}
vll B(mx + 1, 0);
for (ll a : A) {
ll i = a;
while (i <= mx) {
B[i]++;
i += a;
}
}
ll ans = 0;
for (ll a : A) {
if (B[a] == 1)
ans++;
}
cout << ans << endl;
return 0;
}
| #ifdef _MSC_VER
#include "stdc++.h"
#endif
#ifdef __GNUC__
#include <bits/stdc++.h>
#endif
using namespace std;
using ll = long long;
// vector
using vi = vector<int>;
using vii = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
// constant
const double EPS = 1e-10;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, s, e) for (ll i = s; i < e; i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
// debug
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl;
// vector
// template<typename T> vector<vector<T>> vv(ll H, ll W, T v) { return
// vector<vector<T>> vec(H, vector<T>(W, v)); }
// view vector
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v) {
cout << e << " ";
}
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
// DP
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;
}
// ***************************************
int main() {
int N;
cin >> N;
vll A(N);
ll mx = 0;
ll cnt1 = 0;
REP(i, N) {
cin >> A[i];
if (A[i] == 1)
cnt1++;
chmax(mx, A[i]);
}
if (cnt1 == 1) {
cout << 1 << endl;
return 0;
} else if (cnt1 > 1) {
cout << 0 << endl;
return 0;
}
vll B(mx + 1, 0);
for (ll a : A) {
ll i = a;
while (i <= mx) {
B[i]++;
i += a;
}
}
ll ans = 0;
for (ll a : A) {
if (B[a] == 1)
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 80 | 81 | 80 | 81 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fill fill_n
#define pf push_front
#define pb push_back
#define FOR(i, l, r) for (int i = l; i < r; i++)
#define ROF(i, r, l) for (int i = r; i >= l; i--)
#define comp(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define infile \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
typedef vector<int> vi;
typedef vector<ll> vli;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvli;
const int M = 1e9 + 7;
const int N = 1e6;
ll po(int, int);
bool dp[N + 5] = {0};
void solve() {
int n;
cin >> n;
int a[n];
map<int, int> m;
FOR(i, 0, n) {
cin >> a[i];
m[a[i]]++;
}
sort(a, a + n);
FOR(i, 0, n) {
for (int j = (m[a[i]] == 1) ? 2 * a[i] : a[i]; j <= N; j += a[i]) {
dp[j] = 1;
}
}
int ans = 0;
FOR(i, 0, n) {
if (!dp[a[i]])
ans++;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
ll po(int a, int b) {
if (b == 0)
return 1;
ll ans = 1;
if (b % 2 == 0) {
ans = po(a, b / 2) % M;
ans = (ans % M * ans % M) % M;
} else {
ans = po(a, (b - 1) / 2) % M;
ans = (ans % M * ans % M * a) % M;
}
return ans % M;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fill fill_n
#define pf push_front
#define pb push_back
#define FOR(i, l, r) for (int i = l; i < r; i++)
#define ROF(i, r, l) for (int i = r; i >= l; i--)
#define comp(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define infile \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
typedef vector<int> vi;
typedef vector<ll> vli;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvli;
const int M = 1e9 + 7;
const int N = 1e6;
ll po(int, int);
bool dp[N + 5] = {0};
void solve() {
int n;
cin >> n;
int a[n];
map<int, int> m;
FOR(i, 0, n) {
cin >> a[i];
m[a[i]]++;
}
sort(a, a + n);
FOR(i, 0, n) {
for (int j = (m[a[i]] == 1) ? 2 * a[i] : a[i]; j <= a[n - 1]; j += a[i]) {
dp[j] = 1;
}
}
int ans = 0;
FOR(i, 0, n) {
if (!dp[a[i]])
ans++;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
ll po(int a, int b) {
if (b == 0)
return 1;
ll ans = 1;
if (b % 2 == 0) {
ans = po(a, b / 2) % M;
ans = (ans % M * ans % M) % M;
} else {
ans = po(a, (b - 1) / 2) % M;
ans = (ans % M * ans % M * a) % M;
}
return ans % M;
}
| replace | 33 | 34 | 33 | 34 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 1000000000
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> m;
vector<int> a(n);
int flag[1000010] = {0};
vector<int> ans;
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = 0; i < n; i++) {
if (flag[a[i]] == 0 && m[a[i]] == 1)
sum++;
for (int j = 1; j * a[i] < 1000010; j++) {
flag[j * a[i]] = 1;
}
}
cout << sum << endl;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 1000000000
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> m;
vector<int> a(n);
int flag[1000010] = {0};
vector<int> ans;
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = 0; i < n; i++) {
if (flag[a[i]] == 0 && m[a[i]] == 1)
sum++;
if (flag[a[i]] == 0) {
for (int j = 1; j * a[i] < 1000010; j++) {
flag[j * a[i]] = 1;
}
}
}
cout << sum << endl;
}
| replace | 37 | 39 | 37 | 41 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int M = a[n - 1];
int d[20000] = {0};
for (int i = 0; i < n; i++) {
for (int j = 1; j * a[i] <= M; j++) {
d[a[i] * j]++;
}
}
/*
for(int i = 1;i <= M;i++){
cout << d[i] << " ";
}
cout << endl;
*/
int ans = 0;
for (int i = 0; i < n; i++) {
if (d[a[i]] == 1) {
ans += 1;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int M = a[n - 1];
int d[1000001] = {0};
for (int i = 0; i < n; i++) {
for (int j = 1; j * a[i] <= M; j++) {
d[a[i] * j]++;
}
}
/*
for(int i = 1;i <= M;i++){
cout << d[i] << " ";
}
cout << endl;
*/
int ans = 0;
for (int i = 0; i < n; i++) {
if (d[a[i]] == 1) {
ans += 1;
}
}
cout << ans << endl;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02642 | C++ | Runtime Error | /******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java,
PHP, Ruby, Perl, C#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly,
HTML, CSS, JS, SQLite, Prolog. Code, Compile, Run and Debug online from anywhere
in world.
*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
const int maxn2 = 1e5 + 5;
int a[maxn2], b[maxn], vis[maxn];
int main() {
int n;
cin >> n;
memset(b, 0, sizeof b);
memset(vis, 0, sizeof vis);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (vis[a[i]]) {
b[a[i]] = 1;
continue;
}
for (int j = 2; j * a[i] <= 1000000; j++) {
b[j * a[i]] = 1;
}
vis[a[i]] = 1;
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += b[a[i]] == 0;
}
cout << ans << endl;
return 0;
}
| /******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java,
PHP, Ruby, Perl, C#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly,
HTML, CSS, JS, SQLite, Prolog. Code, Compile, Run and Debug online from anywhere
in world.
*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
const int maxn2 = 1e5 + 5;
int a[maxn], b[maxn], vis[maxn];
int main() {
int n;
cin >> n;
memset(b, 0, sizeof b);
memset(vis, 0, sizeof vis);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (vis[a[i]]) {
b[a[i]] = 1;
continue;
}
for (int j = 2; j * a[i] <= 1000000; j++) {
b[j * a[i]] = 1;
}
vis[a[i]] = 1;
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += b[a[i]] == 0;
}
cout << ans << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = a; i > b; i--)
#define hahashad ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
#define VL vector<ll>
#define IN(inp) \
ll inp; \
cin >> inp;
#define pb push_back
#define what(A) cout << #A << " is " << A << endl;
ll isprime[1000005];
ll ans;
int divisors() {
FOR(i, 1, 1e6 + 1) {
if (isprime[i] == 0)
continue;
if (isprime[i] == 1) {
ans++;
}
for (ll j = 2 * i; j <= 1e6; j += i) {
isprime[j] = 0;
}
}
}
int main() {
ll n;
cin >> n;
FOR(i, 0, n) {
IN(inp)
isprime[inp]++;
}
divisors();
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = a; i > b; i--)
#define hahashad ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
#define VL vector<ll>
#define IN(inp) \
ll inp; \
cin >> inp;
#define pb push_back
#define what(A) cout << #A << " is " << A << endl;
ll isprime[1000005];
ll ans;
void divisors() {
FOR(i, 1, 1e6 + 1) {
if (isprime[i] == 0)
continue;
if (isprime[i] == 1) {
ans++;
}
for (ll j = 2 * i; j <= 1e6; j += i) {
isprime[j] = 0;
}
}
}
int main() {
ll n;
cin >> n;
FOR(i, 0, n) {
IN(inp)
isprime[inp]++;
}
divisors();
cout << ans;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
const int MAX = 1000000;
ll m[MAX + 10];
int main() {
ll n;
cin >> n;
ll a[n + 2];
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (ll i = 0; i < n; i++) {
for (ll j = a[i]; j <= MAX; j += a[i]) {
m[j]++;
}
}
ll cnt = 0;
for (ll i = 0; i < n; i++) {
if (m[a[i]] == 1)
cnt++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
const int MAX = 1000000;
ll m[MAX + 10];
int main() {
ll n;
cin >> n;
ll a[n + 2];
for (ll i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (ll i = 0; i < n; i++) {
if (i > 0 && a[i] == a[i - 1]) {
m[a[i]]++;
continue;
}
for (ll j = a[i]; j <= MAX; j += a[i]) {
m[j]++;
}
}
ll cnt = 0;
for (ll i = 0; i < n; i++) {
if (m[a[i]] == 1)
cnt++;
}
cout << cnt << endl;
}
| insert | 21 | 21 | 21 | 26 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
// #include <unistd.h>
// #include <stdio.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
using graph = vector<vector<ll>>;
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;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
// 素数判定O(sqrt(N))
bool isp(ll n) {
bool res = true;
if (n == 1)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
}
ll fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 510000; 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 nCk(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;
}
// nのm乗をMODで割ったあまりO(logN)
ll modpow(ll n, ll m, ll MOD) {
ll res = 1;
while (m) {
if (m & 1)
res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
// printf("%.10f\n", N);
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
// cout << fixed << setprecision(15);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
// clock_t st,en;
vector<ll> num(N);
rep(i, N) cin >> num[i];
// st = clock();
sort(all(num));
vector<ll> ok(1000005);
rep(i, N) {
if (ok[num[i]] == 1) {
ok[num[i]]++;
continue;
}
for (ll j = num[i]; j <= 1000000; j += num[i]) {
ok[j]++;
}
}
ll ans = 0;
rep(i, N) {
if (ok[num[i]] == 1)
ans++;
}
// en = clock();
cout << ans << endl;
// printf("time:%.10lf\n",(dou)(en - st) / CLOCKS_PER_SEC);
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
// #include <unistd.h>
// #include <stdio.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
using graph = vector<vector<ll>>;
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;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
// 素数判定O(sqrt(N))
bool isp(ll n) {
bool res = true;
if (n == 1)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = false;
break;
}
}
return res;
}
}
ll fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 510000; 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 nCk(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;
}
// nのm乗をMODで割ったあまりO(logN)
ll modpow(ll n, ll m, ll MOD) {
ll res = 1;
while (m) {
if (m & 1)
res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
// printf("%.10f\n", N);
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
// cout << fixed << setprecision(15);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
// clock_t st,en;
vector<ll> num(N);
rep(i, N) cin >> num[i];
// st = clock();
sort(all(num));
vector<ll> ok(1000005);
rep(i, N) {
if (ok[num[i]] >= 1) {
ok[num[i]]++;
continue;
}
for (ll j = num[i]; j <= 1000000; j += num[i]) {
ok[j]++;
}
}
ll ans = 0;
rep(i, N) {
if (ok[num[i]] == 1)
ans++;
}
// en = clock();
cout << ans << endl;
// printf("time:%.10lf\n",(dou)(en - st) / CLOCKS_PER_SEC);
} | replace | 112 | 113 | 112 | 113 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array) / sizeof(array[0]))
#define DEBUG 0
#define LIMIT (LONG_MAX / 10)
#define POSITIVE_LAST_D (LONG_MAX % 10)
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(1000005);
rep(i, n) cin >> a[i];
rep(i, n) {
ll k = 1;
ll j = k * a[i];
while (j <= 1000000) {
++b[j];
++k;
j = k * a[i];
}
}
ll ans = 0;
rep(i, n) {
if (b[a[i]] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array) / sizeof(array[0]))
#define DEBUG 0
#define LIMIT (LONG_MAX / 10)
#define POSITIVE_LAST_D (LONG_MAX % 10)
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(1000005);
rep(i, n) cin >> a[i];
rep(i, n) {
ll k = 1;
ll j = k * a[i];
if (b[j] != 0) {
b[j] = 2;
continue;
}
while (j <= 1000000) {
++b[j];
++k;
j = k * a[i];
}
}
ll ans = 0;
rep(i, n) {
if (b[a[i]] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | insert | 18 | 18 | 18 | 22 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define in(v) \
v; \
cin >> v;
void ins() {}
template <class T, class... Rest> void ins(T &v, Rest &...rest) {
cin >> v;
ins(rest...);
}
#define rep(i, n) for (int i = 0, _i = (n); i < _i; ++i)
#define rrep(i, n) for (long long i = (n); i >= 0; --i)
#define all(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(begin(cccc), end(cccc), ##__VA_ARGS__); \
})(c))
// ========== debug ==========
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (size_t i = 0; i < vec.size(); ++i)
os << (i ? ", " : "") << vec[i];
os << "}";
return os;
}
ostream &operator<<(ostream &os, const vector<char> &v) {
for (size_t i = 0; i < v.size(); ++i)
os << v[i];
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
#ifdef LOCAL
void debug() { cerr << "\n"; }
template <class First> void debug(const First &first) { cerr << first << "\n"; }
template <class First, class... Rest>
void debug(const First &first, const Rest &...rest) {
cerr << first << ",";
debug(rest...);
}
void debug2() { cerr << "\n"; }
template <class First> void debug2(const First &first) { cerr << first << " "; }
template <class First, class... Rest>
void debug2(const First &first, const Rest &...rest) {
cerr << first << " ";
debug2(rest...);
}
#else
#define debug(...) 42
#define debug2(...) 42
#endif
// ===========================
int main() {
int N;
ins(N);
vi A(N);
rep(i, N) { cin >> A[i]; }
all(sort, A);
vector<bool> ok(1e6 + 1, true);
int ans = 0;
rep(i, N) {
if (all(upper_bound, A, A[i]) - all(lower_bound, A, A[i]) > 1) {
ok[A[i]] = false;
for (int x = 2 * A[i]; x <= 1e6; x += A[i]) {
ok[x] = false;
}
continue;
}
if (!ok[A[i]])
continue;
++ans;
for (int x = 2 * A[i]; x <= 1e6; x += A[i]) {
ok[x] = false;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define in(v) \
v; \
cin >> v;
void ins() {}
template <class T, class... Rest> void ins(T &v, Rest &...rest) {
cin >> v;
ins(rest...);
}
#define rep(i, n) for (int i = 0, _i = (n); i < _i; ++i)
#define rrep(i, n) for (long long i = (n); i >= 0; --i)
#define all(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(begin(cccc), end(cccc), ##__VA_ARGS__); \
})(c))
// ========== debug ==========
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (size_t i = 0; i < vec.size(); ++i)
os << (i ? ", " : "") << vec[i];
os << "}";
return os;
}
ostream &operator<<(ostream &os, const vector<char> &v) {
for (size_t i = 0; i < v.size(); ++i)
os << v[i];
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
#ifdef LOCAL
void debug() { cerr << "\n"; }
template <class First> void debug(const First &first) { cerr << first << "\n"; }
template <class First, class... Rest>
void debug(const First &first, const Rest &...rest) {
cerr << first << ",";
debug(rest...);
}
void debug2() { cerr << "\n"; }
template <class First> void debug2(const First &first) { cerr << first << " "; }
template <class First, class... Rest>
void debug2(const First &first, const Rest &...rest) {
cerr << first << " ";
debug2(rest...);
}
#else
#define debug(...) 42
#define debug2(...) 42
#endif
// ===========================
int main() {
int N;
ins(N);
vi A(N);
rep(i, N) { cin >> A[i]; }
all(sort, A);
vector<bool> ok(1e6 + 1, true);
int ans = 0;
rep(i, N) {
if (all(upper_bound, A, A[i]) - all(lower_bound, A, A[i]) > 1) {
if (ok[A[i]]) {
ok[A[i]] = false;
for (int x = 2 * A[i]; x <= 1e6; x += A[i]) {
ok[x] = false;
}
}
continue;
}
if (!ok[A[i]])
continue;
++ans;
for (int x = 2 * A[i]; x <= 1e6; x += A[i]) {
ok[x] = false;
}
}
cout << ans << endl;
return 0;
}
| replace | 82 | 85 | 82 | 87 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = long long;
vector<ll> printDivisors(ll n) {
vector<ll> k;
// Note that this loop runs till square root
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
// If divisors are equal, print only one
if (n / i == i)
k.push_back(i);
else // Otherwise print both
{
k.push_back(i);
k.push_back(n / i);
}
}
}
return k;
}
int main() {
ll n;
cin >> n;
vector<ll> a;
map<ll, ll> m;
for (ll i = 0; i < n; i++) {
ll temp;
cin >> temp;
a.push_back(temp);
if (!m.count(temp))
m[temp] = 1;
else
m[temp]++;
}
ll cnt = n;
for (auto x : m) {
ll p = x.first;
ll q = x.second;
if (q > 1)
cnt -= q;
else {
vector<ll> k = printDivisors(p);
for (auto y : k) {
if (m.count(y) && y != p) {
cnt--;
break;
}
}
}
}
cout << cnt;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = long long;
vector<ll> printDivisors(ll n) {
vector<ll> k;
// Note that this loop runs till square root
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
// If divisors are equal, print only one
if (n / i == i)
k.push_back(i);
else // Otherwise print both
{
k.push_back(i);
k.push_back(n / i);
}
}
}
return k;
}
int main() {
ll n;
cin >> n;
vector<ll> a;
map<ll, ll> m;
for (ll i = 0; i < n; i++) {
ll temp;
cin >> temp;
a.push_back(temp);
if (!m.count(temp))
m[temp] = 1;
else
m[temp]++;
}
ll cnt = n;
for (auto x : m) {
ll p = x.first;
ll q = x.second;
if (q > 1)
cnt -= q;
else if (q == 1) {
vector<ll> k = printDivisors(p);
for (auto y : k) {
if (m.count(y) && y != p) {
cnt--;
break;
}
}
}
}
cout << cnt;
return 0;
}
| replace | 46 | 47 | 46 | 47 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
int main() {
ll n;
cin >> n;
vl a(n, 0);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
ll amax = a[n - 1];
vector<ll> dp(amax, 0);
rep(i, n) {
if (dp[a[i]] != 0) {
dp[a[i]] = 2;
continue;
}
for (ll j = 1; a[i] * j <= amax; j++) {
dp[a[i] * j]++;
}
}
ll ans = 0;
rep(i, n) {
if (dp[a[i]] == 1) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
int main() {
ll n;
cin >> n;
vl a(n, 0);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
ll amax = a[n - 1] + 1;
vector<ll> dp(amax, 0);
rep(i, n) {
if (dp[a[i]] != 0) {
dp[a[i]] = 2;
continue;
}
for (ll j = 1; a[i] * j <= amax; j++) {
dp[a[i] * j]++;
}
}
ll ans = 0;
rep(i, n) {
if (dp[a[i]] == 1) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
typedef double db;
// mt19937 mrand(random_device{}());
const ll mod = 1000000007;
// int rnd(int x) { return mrand() % x;}
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// head
const int maxx = 1e6 + 10;
int num[maxx];
int fl[maxx];
int main() {
int n;
scanf("%d", &n);
rep(i, 0, n) { scanf("%d", &num[i]); }
sort(num, num + n);
int cnt = 0;
memset(fl, 1, sizeof(fl));
rep(i, 0, n) {
if (fl[num[i]]) {
if (num[i] != num[i + 1])
cnt++;
}
for (int j = 1; j * num[i] < maxx; j++) {
fl[j * num[i]] = 0;
}
}
cout << cnt;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
typedef double db;
// mt19937 mrand(random_device{}());
const ll mod = 1000000007;
// int rnd(int x) { return mrand() % x;}
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// head
const int maxx = 1e6 + 10;
int num[maxx];
int fl[maxx];
int main() {
int n;
scanf("%d", &n);
rep(i, 0, n) { scanf("%d", &num[i]); }
sort(num, num + n);
int cnt = 0;
memset(fl, 1, sizeof(fl));
rep(i, 0, n) {
if (fl[num[i]]) {
if (num[i] != num[i + 1])
cnt++;
for (int j = 1; j * num[i] < maxx; j++) {
fl[j * num[i]] = 0;
}
}
}
cout << cnt;
} | replace | 44 | 47 | 44 | 47 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
// Some constants don't work
#ifndef INT_MAX
#define INT_MAX 2147483647
#endif
#ifndef INT_MIN
#define INT_MIN -2147483648
#endif
// short hand tricks
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> v(N);
// keep track of all numbers
vector<int> freq(1e5 + 1, 0);
for (int i = 0; i < N; i++) {
cin >> v[i];
freq[v[i]]++;
}
int res = N;
// see if number has any divisor that's another number excluding itself
for (int i = 0; i < N; i++) {
// check every divisor
int num = v[i];
freq[num]--;
// O(sqrt(n))
for (int i = 1; i * i <= num; i++) {
if (num % i == 0) {
if (freq[i] > 0 || freq[num / i] > 0) {
// divisor is another number
res--;
break;
}
}
}
freq[num]++;
}
cout << res << "\n";
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
// Some constants don't work
#ifndef INT_MAX
#define INT_MAX 2147483647
#endif
#ifndef INT_MIN
#define INT_MIN -2147483648
#endif
// short hand tricks
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> v(N);
// keep track of all numbers
vector<int> freq(1e6 + 1, 0);
for (int i = 0; i < N; i++) {
cin >> v[i];
freq[v[i]]++;
}
int res = N;
// see if number has any divisor that's another number excluding itself
for (int i = 0; i < N; i++) {
// check every divisor
int num = v[i];
freq[num]--;
// O(sqrt(n))
for (int i = 1; i * i <= num; i++) {
if (num % i == 0) {
if (freq[i] > 0 || freq[num / i] > 0) {
// divisor is another number
res--;
break;
}
}
}
freq[num]++;
}
cout << res << "\n";
return 0;
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9 + 7;
bool print_space_enable = false;
void print() {
cout << endl;
print_space_enable = false;
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
if (print_space_enable)
cout << " ";
cout << fixed << setprecision(15) << head;
print_space_enable = true;
print(std::forward<Tail>(tail)...);
}
template <typename T> void print(vector<T> v) {
for (size_t i = 0; i < v.size(); i++) {
if (i > 0)
std::cout << " ";
std::cout << v[i];
}
std::cout << std::endl;
}
int main() {
Int n;
cin >> n;
vector<Int> a(n);
for (Int i = 0; i < (Int)n; i++) {
cin >> a[i];
}
sort(all(a));
vector<bool> b(1000001, true);
for (Int i = 0; i < (Int)n; i++) {
if (b[a[i]]) {
for (Int j = 2; a[i] * j < (Int)1000001; j++) {
b[a[i] * j] = false;
}
}
}
Int res = 0;
for (Int i = 0; i < (Int)n; i++) {
if (0 < i and a[i - 1] == a[i])
continue;
if (i < n - 1 and a[i] == a[i + 1])
continue;
if (b[a[i]]) {
res++;
}
}
print(res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9 + 7;
bool print_space_enable = false;
void print() {
cout << endl;
print_space_enable = false;
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
if (print_space_enable)
cout << " ";
cout << fixed << setprecision(15) << head;
print_space_enable = true;
print(std::forward<Tail>(tail)...);
}
template <typename T> void print(vector<T> v) {
for (size_t i = 0; i < v.size(); i++) {
if (i > 0)
std::cout << " ";
std::cout << v[i];
}
std::cout << std::endl;
}
int main() {
Int n;
cin >> n;
vector<Int> a(n);
for (Int i = 0; i < (Int)n; i++) {
cin >> a[i];
}
sort(all(a));
vector<bool> b(1000001, true);
for (Int i = 0; i < (Int)n; i++) {
if (0 < i and a[i - 1] == a[i])
continue;
if (b[a[i]]) {
for (Int j = 2; a[i] * j < (Int)1000001; j++) {
b[a[i] * j] = false;
}
}
}
Int res = 0;
for (Int i = 0; i < (Int)n; i++) {
if (0 < i and a[i - 1] == a[i])
continue;
if (i < n - 1 and a[i] == a[i + 1])
continue;
if (b[a[i]]) {
res++;
}
}
print(res);
return 0;
} | insert | 44 | 44 | 44 | 46 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// #define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
int upb = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
upb = max(upb, a[i]);
}
sort(a.begin(), a.end());
vector<int> chk(upb, 0);
for (int i = 0; i < n; i++) {
if (a[i] == a[i + 1] && i < n - 1)
chk[a[i]]++;
int cg = 2 * a[i];
while (cg <= upb) {
chk[cg]++;
cg += a[i];
}
}
int cnt = 0;
for (int i = 0; i < n; i++) {
// cout << a[i] << " " << chk[a[i]] << "\n";
if (chk[a[i]] == 0)
cnt++;
}
cout << cnt << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// #define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
int upb = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
upb = max(upb, a[i]);
}
sort(a.begin(), a.end());
vector<int> chk(upb + 5, 0);
for (int i = 0; i < n; i++) {
if (a[i] == a[i + 1] && i < n - 1)
chk[a[i]]++;
int cg = 2 * a[i];
while (cg <= upb) {
chk[cg]++;
cg += a[i];
}
}
int cnt = 0;
for (int i = 0; i < n; i++) {
// cout << a[i] << " " << chk[a[i]] << "\n";
if (chk[a[i]] == 0)
cnt++;
}
cout << cnt << "\n";
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
bool b[200020] = {false};
int main() {
int n;
cin >> n;
int a[200020];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int co = 0;
for (int i = 0; i < n; i++) {
bool bo = true;
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
if (b[j] == true) {
bo = false;
}
if (b[a[i] / j] == true) {
bo = false;
}
}
}
b[a[i]] = true;
if (i != n - 1) {
if (a[i] == a[i + 1]) {
bo = false;
}
}
if (bo == true) {
co++;
}
}
cout << co << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
bool b[1000110] = {false};
int main() {
int n;
cin >> n;
int a[200020];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int co = 0;
for (int i = 0; i < n; i++) {
bool bo = true;
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
if (b[j] == true) {
bo = false;
}
if (b[a[i] / j] == true) {
bo = false;
}
}
}
b[a[i]] = true;
if (i != n - 1) {
if (a[i] == a[i + 1]) {
bo = false;
}
}
if (bo == true) {
co++;
}
}
cout << co << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int N;
int A[100005];
int table[1000005];
int main() {
for (int i = 1; i <= 1000000; i++) {
table[i] = 0;
}
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
table[A[i]]++;
}
if (table[1] > 0) {
if (table[1] == 1) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (table[A[i]] > 1)
continue;
bool FLG = true;
for (int k = 2; k * k <= A[i]; k++) {
if (A[i] % k != 0)
continue;
if (table[k] > 0 || table[A[i] / k] > 0) {
FLG = false;
break;
}
}
if (FLG) {
ans++;
}
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int N;
int A[200005];
int table[1000005];
int main() {
for (int i = 1; i <= 1000000; i++) {
table[i] = 0;
}
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
table[A[i]]++;
}
if (table[1] > 0) {
if (table[1] == 1) {
printf("1\n");
} else {
printf("0\n");
}
return 0;
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (table[A[i]] > 1)
continue;
bool FLG = true;
for (int k = 2; k * k <= A[i]; k++) {
if (A[i] % k != 0)
continue;
if (table[k] > 0 || table[A[i] / k] > 0) {
FLG = false;
break;
}
}
if (FLG) {
ans++;
}
}
printf("%d\n", ans);
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02642 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> v;
map<long long, long long> mp3;
map<long long, long long> mp;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
v.push_back(x);
mp[x]++;
mp3[x]++;
}
sort(v.rbegin(), v.rend());
long long ans = 0;
for (int iii = 0; iii < n; ++iii) {
long long value = v[iii];
mp[value]--;
int ok = 1;
if (mp3[value] == 1) {
for (int64_t i = 1; i * i <= value; i++) {
if (value % i == 0) {
if (mp[i] > 0) {
ok = 0;
break;
}
if (i * i != value) {
long long vv = value / i;
if (mp[vv] > 0) {
ok = 0;
break;
}
}
}
}
} else {
ok = 0;
}
if (ok == 1)
++ans;
}
cout << ans << endl;
return 0;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> v;
unordered_map<long long, long long> mp3;
unordered_map<long long, long long> mp;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
v.push_back(x);
mp[x]++;
mp3[x]++;
}
sort(v.rbegin(), v.rend());
long long ans = 0;
for (int iii = 0; iii < n; ++iii) {
long long value = v[iii];
mp[value]--;
int ok = 1;
if (mp3[value] == 1) {
for (int64_t i = 1; i * i <= value; i++) {
if (value % i == 0) {
if (mp[i] > 0) {
ok = 0;
break;
}
if (i * i != value) {
long long vv = value / i;
if (mp[vv] > 0) {
ok = 0;
break;
}
}
}
}
} else {
ok = 0;
}
if (ok == 1)
++ans;
}
cout << ans << endl;
return 0;
}
| replace | 22 | 24 | 22 | 24 | TLE | |
p02642 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define int long long
#define ll long long
void solve() {
int n;
cin >> n;
int a[n];
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
int ans = 0;
for (int i = 0; i < n; i++) {
mp[a[i]]--;
bool flag = true;
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
if (mp[j] || mp[a[i] / j]) {
flag = false;
break;
}
}
}
ans += flag;
mp[a[i]]++;
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define int long long
#define ll long long
void solve() {
int n;
cin >> n;
int a[n];
int mp[1000005] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
int ans = 0;
for (int i = 0; i < n; i++) {
mp[a[i]]--;
bool flag = true;
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
if (mp[j] || mp[a[i] / j]) {
flag = false;
break;
}
}
}
ans += flag;
mp[a[i]]++;
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | replace | 17 | 18 | 17 | 18 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 200007
int a[MAXN];
bool cnt[1000007];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
memset(cnt, 0, sizeof cnt);
long long ans = 0;
for (int i = 0; i < n; i++) {
int now = a[i];
// ans+=cnt[now];
if (cnt[now] == 0 && (i + 1 >= n || a[i] != a[i + 1]))
ans++;
for (int j = now; j <= 1000000; j += now) {
cnt[j] = 1;
}
}
cout << ans << '\n';
}
| #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 200007
int a[MAXN];
bool cnt[1000007];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
memset(cnt, 0, sizeof cnt);
long long ans = 0;
for (int i = 0; i < n; i++) {
int now = a[i];
// ans+=cnt[now];
if (cnt[now] == 0 && (i + 1 >= n || a[i] != a[i + 1]))
ans++;
if (i == 0 || a[i] != a[i - 1])
for (int j = now; j <= 1000000; j += now) {
cnt[j] = 1;
}
}
cout << ans << '\n';
}
| replace | 22 | 25 | 22 | 26 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
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;
}
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long int ll;
typedef long double ld;
const ll INF = (1LL << 62);
const ld pi = acosl((ld)-1);
const ll mod = 1000000007;
// const ll mod = 1234567;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
#define endn "\n"
#define TO_STRING(VariableName) #VariableName
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
rep(i, (int)v.size() - 1) cout << v[i] << " ";
cout << v[(int)v.size() - 1];
return out;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const map<T1, T2> &p) {
out << "(" << p.first << ", " << p.second << ")";
return out;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "(" << p.first << ", " << p.second << ")";
return out;
}
template <class T> void debag(const T &obj) { cout << obj << endl; }
bool solve() {
int n;
cin >> n;
ll ma = pow(10, 6) + 10;
vector<ll> cnt(ma, 0);
vector<ll> p(n);
rep(i, n) {
cin >> p[i];
cnt[p[i]]++;
}
sort(all(p));
int ans = 0;
rep(i, n) {
if (cnt[p[i]] == 1)
ans++;
if (cnt[p[i]] == 0)
continue;
for (ll j = p[i] + p[i]; j < ma; j += p[i]) {
cnt[j] = 0;
}
}
cout << ans << endl;
/*multiset<ll>a;
rep(i,n){
int x;a.insert(x);
}
int ans=0;
while(!a.empty()){
ll p=*a.begin();
//cout<<1<<endl;
a.erase(a.begin());
int is=1;
while(a.size()!=0 and *a.begin()==p){
is=0;
//cout<<2<<endl;
a.erase(a.begin());
}
ans+=is;
ll x=p+p;
while(x<pow(10,6)){
//cout<<3<<endl;
if(a.find(x)!=a.end())a.erase(x);
x+=p;
}
}
cout<<ans<<endl;*/
return false;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
solve();
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
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;
}
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long int ll;
typedef long double ld;
const ll INF = (1LL << 62);
const ld pi = acosl((ld)-1);
const ll mod = 1000000007;
// const ll mod = 1234567;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
#define endn "\n"
#define TO_STRING(VariableName) #VariableName
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
rep(i, (int)v.size() - 1) cout << v[i] << " ";
cout << v[(int)v.size() - 1];
return out;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const map<T1, T2> &p) {
out << "(" << p.first << ", " << p.second << ")";
return out;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "(" << p.first << ", " << p.second << ")";
return out;
}
template <class T> void debag(const T &obj) { cout << obj << endl; }
bool solve() {
int n;
cin >> n;
ll ma = pow(10, 6) + 10;
vector<ll> cnt(ma, 0);
vector<ll> p(n);
rep(i, n) {
cin >> p[i];
cnt[p[i]]++;
}
sort(all(p));
int ans = 0;
rep(i, n) {
if (cnt[p[i]] == 1)
ans++;
if (cnt[p[i]] == 0)
continue;
cnt[p[i]] = 0;
for (ll j = p[i] + p[i]; j < ma; j += p[i]) {
cnt[j] = 0;
}
}
cout << ans << endl;
/*multiset<ll>a;
rep(i,n){
int x;a.insert(x);
}
int ans=0;
while(!a.empty()){
ll p=*a.begin();
//cout<<1<<endl;
a.erase(a.begin());
int is=1;
while(a.size()!=0 and *a.begin()==p){
is=0;
//cout<<2<<endl;
a.erase(a.begin());
}
ans+=is;
ll x=p+p;
while(x<pow(10,6)){
//cout<<3<<endl;
if(a.find(x)!=a.end())a.erase(x);
x+=p;
}
}
cout<<ans<<endl;*/
return false;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
solve();
}
| insert | 67 | 67 | 67 | 68 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
// https://stackoverflow.com/questions/10150468/how-to-redirect-cin-and-cout-to-files
long long not_divisible(long long n, vector<long long> a) {
sort(a.begin(), a.end());
const long long a_max = 1000001;
bool div[a_max];
memset(div, false, sizeof div);
long long count = 0;
if (a.size() == 1) {
return 1;
}
/*
for(auto aa = a.begin();aa != a.end();aa++) {
cout << *aa << endl;
}
cout << "=========" << endl;
*/
for (long long i = 0; i < n; i++) {
if (i == 0) {
if (a[i] != a[i + 1]) {
// cout << a[i]<< "!!" << endl;
count++;
}
long long aa = a[i];
while (aa < a_max) {
div[aa] = true;
aa += a[i];
}
continue;
}
if (i < n - 1) {
if (a[i] != a[i - 1] && a[i + 1] != a[i] && !div[a[i]]) {
// cout << a[i]<< "!!" << div[a[i]] << endl;
count++;
}
long long aa = a[i];
while (aa < a_max) {
/*
if(div[aa]) {
break;
}
*/
div[aa] = true;
aa += a[i];
}
continue;
}
// i == n-1
if (a[i - 1] != a[i] && !div[a[i]]) {
// cout << a[i]<< "!!" << endl;
count++;
}
}
return count;
}
int main() {
long long n;
cin >> n;
vector<long long> a;
for (long long i = 0; i < n; i++) {
long long aa;
cin >> aa;
a.push_back(aa);
}
cout << not_divisible(n, a);
}
| #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
// https://stackoverflow.com/questions/10150468/how-to-redirect-cin-and-cout-to-files
long long not_divisible(long long n, vector<long long> a) {
sort(a.begin(), a.end());
const long long a_max = 1000001;
bool div[a_max];
memset(div, false, sizeof div);
long long count = 0;
if (a.size() == 1) {
return 1;
}
/*
for(auto aa = a.begin();aa != a.end();aa++) {
cout << *aa << endl;
}
cout << "=========" << endl;
*/
for (long long i = 0; i < n; i++) {
if (i == 0) {
if (a[i] != a[i + 1]) {
// cout << a[i]<< "!!" << endl;
count++;
}
long long aa = a[i];
while (aa < a_max) {
div[aa] = true;
aa += a[i];
}
continue;
}
if (i < n - 1) {
if (a[i] != a[i - 1] && a[i + 1] != a[i] && !div[a[i]]) {
// cout << a[i]<< "!!" << div[a[i]] << endl;
count++;
}
if (a[i] == a[i - 1]) {
continue;
}
long long aa = a[i];
while (aa < a_max) {
/*
if(div[aa]) {
break;
}
*/
div[aa] = true;
aa += a[i];
}
continue;
}
// i == n-1
if (a[i - 1] != a[i] && !div[a[i]]) {
// cout << a[i]<< "!!" << endl;
count++;
}
}
return count;
}
int main() {
long long n;
cin >> n;
vector<long long> a;
for (long long i = 0; i < n; i++) {
long long aa;
cin >> aa;
a.push_back(aa);
}
cout << not_divisible(n, a);
}
| insert | 41 | 41 | 41 | 44 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
vector<int> d(1000005);
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
for (int x : a) {
for (int j = x; j <= 1000000; j += x) {
d[j]++;
}
}
for (int x : a) {
if (d[x] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
vector<int> d(1000005);
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
for (int x : a) {
if (d[x] != 0) {
d[x]++;
continue;
}
for (int j = x; j <= 1000000; j += x) {
d[j]++;
}
}
for (int x : a) {
if (d[x] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | insert | 20 | 20 | 20 | 24 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define int long long
template <typename T> using vv = vector<vector<T>>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
using ll = long long;
constexpr ll INF = 1LL << 60;
class Prime {
public:
int n;
vector<int> factor, primes;
// エラストテネスの篩
Prime(int n = 100000) : n(n), factor(n + 1) {
factor[0] = factor[1] = -1;
for (int i = 2; i <= n; ++i) {
if (factor[i]) {
continue;
}
primes.push_back(i);
factor[i] = i;
for (int j = i * i; j <= n; j += i) {
if (!factor[j]) {
factor[j] = i;
}
}
}
}
// 素数判定
bool is_prime(int x) { return factor[x] == x; }
// 約数列挙
bool factorList(vi &dic, int x) {
if (dic[x] > 1) {
return true;
}
for (int i = 2; i * i <= x; ++i) {
if (x % i == 0) {
if (dic[i] || dic[x / i]) {
return true;
}
}
}
return false;
}
};
signed main() {
int n;
cin >> n;
vector<int> a(n);
vi dic(1e6 + 1);
rep(i, n) {
cin >> a[i];
dic[a[i]]++;
}
sort(all(a));
int ans = 0;
vi arr(1e6 + 1);
rep(i, n) {
int x = a[i];
if (dic[x] == 1 && !arr[x]) {
ans++;
}
for (int i = x; i <= 1e6; i += x) {
arr[i] = 1;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define int long long
template <typename T> using vv = vector<vector<T>>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
using ll = long long;
constexpr ll INF = 1LL << 60;
class Prime {
public:
int n;
vector<int> factor, primes;
// エラストテネスの篩
Prime(int n = 100000) : n(n), factor(n + 1) {
factor[0] = factor[1] = -1;
for (int i = 2; i <= n; ++i) {
if (factor[i]) {
continue;
}
primes.push_back(i);
factor[i] = i;
for (int j = i * i; j <= n; j += i) {
if (!factor[j]) {
factor[j] = i;
}
}
}
}
// 素数判定
bool is_prime(int x) { return factor[x] == x; }
// 約数列挙
bool factorList(vi &dic, int x) {
if (dic[x] > 1) {
return true;
}
for (int i = 2; i * i <= x; ++i) {
if (x % i == 0) {
if (dic[i] || dic[x / i]) {
return true;
}
}
}
return false;
}
};
signed main() {
int n;
cin >> n;
vector<int> a(n);
vi dic(1e6 + 1);
rep(i, n) {
cin >> a[i];
dic[a[i]]++;
}
sort(all(a));
int ans = 0;
vi arr(1e6 + 1);
rep(i, n) {
int x = a[i];
if (dic[x] == 1 && !arr[x]) {
ans++;
}
if (arr[x]) {
continue;
}
for (int i = x; i <= 1e6; i += x) {
arr[i] = 1;
}
}
cout << ans << endl;
return 0;
}
| insert | 71 | 71 | 71 | 74 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
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;
}
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<bool> b(1000001);
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
int x = 2;
while (a[i] * x <= 1000000) {
b[a[i] * x] = 1;
x++;
}
}
vector<int> d(1000001);
rep(i, n) d[a[i]]++;
rep(i, 1000001) if (d[i] > 1) b[i] = 1;
int ans = 0;
rep(i, n) if (!b[a[i]]) ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
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;
}
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<bool> b(1000001);
vector<int> a(n);
rep(i, n) cin >> a[i];
int cnt = 0;
rep(i, n) if (a[i] == 1) cnt++;
if (cnt == 1) {
cout << 1 << endl;
return 0;
}
if (cnt > 1) {
cout << 0 << endl;
return 0;
}
rep(i, n) {
int x = 2;
while (a[i] * x <= 1000000) {
b[a[i] * x] = 1;
x++;
}
}
vector<int> d(1000001);
rep(i, n) d[a[i]]++;
rep(i, 1000001) if (d[i] > 1) b[i] = 1;
int ans = 0;
rep(i, n) if (!b[a[i]]) ans++;
cout << ans << endl;
}
| insert | 31 | 31 | 31 | 41 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> cnt(1000001);
for (int i = 0; i < n; i++) {
for (int j = a[i]; j < cnt.size(); j += a[i]) {
cnt[j]++;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (cnt[a[i]] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
vector<int> cnt(a[n - 1] + 1);
for (int i = 0; i < n; i++) {
for (int j = a[i]; j < cnt.size(); j += a[i]) {
cnt[j]++;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (cnt[a[i]] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 8 | 9 | 8 | 10 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int, int>
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n + 1), vis(1000009);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.begin() + n);
int ans = 0;
for (int i = 0; i < n; i++) {
if (vis[v[i]])
continue;
if (v[i + 1] != v[i])
ans++;
for (int j = i; j <= 1000000; j += i)
vis[j] = 1;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int, int>
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n + 1), vis(1000009);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.begin() + n);
int ans = 0;
for (int i = 0; i < n; i++) {
if (vis[v[i]])
continue;
if (v[i + 1] != v[i])
ans++;
for (int j = v[i]; j <= 1000000; j += v[i])
vis[j] = 1;
}
cout << ans;
} | replace | 25 | 26 | 25 | 26 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) \
if (flagdebug) { \
cout << "debug (" #a "):" << endl << (a) << endl; \
}
using namespace std;
typedef uint64_t ulint;
typedef int64_t lint;
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
ulint gcd(lint a, lint b);
ulint lcm(lint a, lint b);
ulint digit(lint n, lint base);
ulint digit(lint n);
vector<lint> digitbreak(lint n, lint base);
vector<lint> digitbreak(lint n);
bool flagdebug = false;
const int MAX = 1000000;
const int MOD = 1000000007; // 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1; // 累乗
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int 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;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
//////////////////////////////////////////////////////
// flagdebug = true; ///本番時削除！！！！！
// 入力
lint n;
cin >> n;
vector<pair<lint, lint>> a(n);
map<int64_t, int> primes;
vector<lint> cans(100010, 0);
// 2次元配列
// vector<vector<lint>> mat(row, vector<lint>(column, 初期値));
rep0(i, n) {
cin >> a[i].second;
a[i].first = i + 1;
}
sort(all(a), [](const pair<lint, lint> &a, const pair<lint, lint> &b) {
return a.second < b.second;
});
// vector<lint> ans;
lint ans = 0;
rep0(i, n) {
// auto res = prime_factor(a[i].second);
// debug(a[i].second);
auto res = divisor(a[i].second);
bool okflag = true;
for (auto p : res) {
// 素数を順に見ていく，
// やること1: 約数に登録されてる数があるか→あったらゲームオーバー，
// やること2: なかったら数を登録
if (cans[p] != 0) {
// debug(p);
// ゲームオーバー
okflag = false;
break;
}
}
if (okflag == true) {
cans[a[i].second] = 1;
// ans.push_back(a[i].first);
// 次も同じ数だったら無かったことに
if (i < n - 1 && a[i + 1].second == a[i].second) {
} else {
ans++;
}
}
// debug(cans);
}
cout << ans << endl;
// 2次元配列
// vector<vector<lint>> mat(row, vector<lint>(column, 初期値));
// ペア
// pair<lint,lint> p = make_pair(1,2);
// vector<pair<lint,lint>> c(100010, pair<lint,lint>(0,0));
// タプル
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
// 昇順ソート
// sort(all(a));
// 降順ソート
// sort(all(a),greater<lint>());
// 特殊なソート（ラムダ式）
// sort(all(mat), [&i](const vector<lint> &a, const vector<lint> &b){return
// a[i] < b[i];}); 特殊なソート（pair） sort(all(a), [](const pair<lint,lint>
// &a, const pair<lint,lint> &b){return a.first < b.first;});
// //[&i]は参照する変数，いらなければからの大括弧でよし．
// ソート済集合（順序付き集合）
// set<lint> st;
// itr.insert(0);
// auto itrmin = st.begin(); //最小値の次へアクセス
// auto itrmax = st.end();
// //最大値の次へアクセス（かならずデクリメントが必要） itrmax --;
// //最大値はst.end()の1つ前 st.erase(0); st.find;
//////////////////////////////////////////////////////
// キュー
// queue<lint> que;
// que.push(value);
// que.front();
// //トップを参照（消されないので消したい場合は直後にpop()を使う） que.pop();
// //追い出す que.empty(); //空なら1，あれば0 優先度付きキュー
// priority_queue<lint> que;
// キューにque.push()で入れると最大値順に並べられる．que.pop()で取り出すときは常に最大値が前にくる．
// 最小値から取り出したい時はpriority_queue< lint, std::vector<lint>,
// std::greater<lint> >
//////////////////////////////////////////////////////
// スタック
// stack<lint> stk;
// stk.push(value);
// stk.top(); //先頭を参照（消されないので消したい場合は直後にpop()を使う）
// stk.pop(); //トップを削除
// stk.empty(); //空なら1,あれば0
// stk.size(); //数
//
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
s << "[\t";
for (auto i = v.begin(); i < v.end() - 1; i++) {
s << *i << "\t";
}
s << *(v.end() - 1) << "\t]\n";
return s;
}
// 最大公約数
ulint gcd(lint a, lint b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
// 最小公倍数
ulint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
// 桁数を求める
ulint digit(lint n, lint base) {
if (n == 0)
return 0;
if (n < 0)
n = -n;
return log10(n) / log10(base) + 1;
}
// 桁数を求める
ulint digit(lint n) {
if (n == 0)
return 0;
if (n < 0)
n = -n;
return log10(n) + 1;
}
// 桁分解, base進数の桁ごとの数値に分解
vector<lint> digitbreak(lint n, lint base) {
vector<lint> a(base, 0);
while (n >= base) {
a[n % base]++;
n /= base;
}
a[n]++;
return a;
}
// 桁分解, 10進数の桁ごとの数値に分解
vector<lint> digitbreak(lint n) { return digitbreak(n, 10); } | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) \
if (flagdebug) { \
cout << "debug (" #a "):" << endl << (a) << endl; \
}
using namespace std;
typedef uint64_t ulint;
typedef int64_t lint;
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
ulint gcd(lint a, lint b);
ulint lcm(lint a, lint b);
ulint digit(lint n, lint base);
ulint digit(lint n);
vector<lint> digitbreak(lint n, lint base);
vector<lint> digitbreak(lint n);
bool flagdebug = false;
const int MAX = 1000000;
const int MOD = 1000000007; // 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1; // 累乗
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int 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;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
//////////////////////////////////////////////////////
// flagdebug = true; ///本番時削除！！！！！
// 入力
lint n;
cin >> n;
vector<pair<lint, lint>> a(n);
map<int64_t, int> primes;
vector<lint> cans(2000010, 0);
// 2次元配列
// vector<vector<lint>> mat(row, vector<lint>(column, 初期値));
rep0(i, n) {
cin >> a[i].second;
a[i].first = i + 1;
}
sort(all(a), [](const pair<lint, lint> &a, const pair<lint, lint> &b) {
return a.second < b.second;
});
// vector<lint> ans;
lint ans = 0;
rep0(i, n) {
// auto res = prime_factor(a[i].second);
// debug(a[i].second);
auto res = divisor(a[i].second);
bool okflag = true;
for (auto p : res) {
// 素数を順に見ていく，
// やること1: 約数に登録されてる数があるか→あったらゲームオーバー，
// やること2: なかったら数を登録
if (cans[p] != 0) {
// debug(p);
// ゲームオーバー
okflag = false;
break;
}
}
if (okflag == true) {
cans[a[i].second] = 1;
// ans.push_back(a[i].first);
// 次も同じ数だったら無かったことに
if (i < n - 1 && a[i + 1].second == a[i].second) {
} else {
ans++;
}
}
// debug(cans);
}
cout << ans << endl;
// 2次元配列
// vector<vector<lint>> mat(row, vector<lint>(column, 初期値));
// ペア
// pair<lint,lint> p = make_pair(1,2);
// vector<pair<lint,lint>> c(100010, pair<lint,lint>(0,0));
// タプル
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
// 昇順ソート
// sort(all(a));
// 降順ソート
// sort(all(a),greater<lint>());
// 特殊なソート（ラムダ式）
// sort(all(mat), [&i](const vector<lint> &a, const vector<lint> &b){return
// a[i] < b[i];}); 特殊なソート（pair） sort(all(a), [](const pair<lint,lint>
// &a, const pair<lint,lint> &b){return a.first < b.first;});
// //[&i]は参照する変数，いらなければからの大括弧でよし．
// ソート済集合（順序付き集合）
// set<lint> st;
// itr.insert(0);
// auto itrmin = st.begin(); //最小値の次へアクセス
// auto itrmax = st.end();
// //最大値の次へアクセス（かならずデクリメントが必要） itrmax --;
// //最大値はst.end()の1つ前 st.erase(0); st.find;
//////////////////////////////////////////////////////
// キュー
// queue<lint> que;
// que.push(value);
// que.front();
// //トップを参照（消されないので消したい場合は直後にpop()を使う） que.pop();
// //追い出す que.empty(); //空なら1，あれば0 優先度付きキュー
// priority_queue<lint> que;
// キューにque.push()で入れると最大値順に並べられる．que.pop()で取り出すときは常に最大値が前にくる．
// 最小値から取り出したい時はpriority_queue< lint, std::vector<lint>,
// std::greater<lint> >
//////////////////////////////////////////////////////
// スタック
// stack<lint> stk;
// stk.push(value);
// stk.top(); //先頭を参照（消されないので消したい場合は直後にpop()を使う）
// stk.pop(); //トップを削除
// stk.empty(); //空なら1,あれば0
// stk.size(); //数
//
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
s << "[\t";
for (auto i = v.begin(); i < v.end() - 1; i++) {
s << *i << "\t";
}
s << *(v.end() - 1) << "\t]\n";
return s;
}
// 最大公約数
ulint gcd(lint a, lint b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
// 最小公倍数
ulint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
// 桁数を求める
ulint digit(lint n, lint base) {
if (n == 0)
return 0;
if (n < 0)
n = -n;
return log10(n) / log10(base) + 1;
}
// 桁数を求める
ulint digit(lint n) {
if (n == 0)
return 0;
if (n < 0)
n = -n;
return log10(n) + 1;
}
// 桁分解, base進数の桁ごとの数値に分解
vector<lint> digitbreak(lint n, lint base) {
vector<lint> a(base, 0);
while (n >= base) {
a[n % base]++;
n /= base;
}
a[n]++;
return a;
}
// 桁分解, 10進数の桁ごとの数値に分解
vector<lint> digitbreak(lint n) { return digitbreak(n, 10); } | replace | 94 | 95 | 94 | 95 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
int t = 1;
cin >> t;
while (t--) {
ll n;
cin >> n;
vector<ll> arr(n);
map<ll, bool> ch;
for (ll i = 0; i < n; i++)
cin >> arr[i], ch[arr[i]] = 0;
sort(arr.begin(), arr.end());
for (ll i = 0; i < n; i++) {
if (ch[arr[i]])
continue;
for (ll j = 2; arr[i] * j <= arr[n - 1]; j++)
ch[arr[i] * j] = 1;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if (ch[arr[i]])
continue;
if (i > 0 && arr[i - 1] == arr[i])
continue;
if (i < n - 1 && arr[i + 1] == arr[i])
continue;
ans++;
}
cout << ans;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
int t = 1;
// cin>>t;
while (t--) {
ll n;
cin >> n;
vector<ll> arr(n);
map<ll, bool> ch;
for (ll i = 0; i < n; i++)
cin >> arr[i], ch[arr[i]] = 0;
sort(arr.begin(), arr.end());
for (ll i = 0; i < n; i++) {
if (ch[arr[i]])
continue;
for (ll j = 2; arr[i] * j <= arr[n - 1]; j++)
ch[arr[i] * j] = 1;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if (ch[arr[i]])
continue;
if (i > 0 && arr[i - 1] == arr[i])
continue;
if (i < n - 1 && arr[i + 1] == arr[i])
continue;
ans++;
}
cout << ans;
}
return 0;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
long long b[200001] = {0};
long long i, j, jmax, p;
vector<long long> a;
for (i = 0; i < n; i++) {
scanf(" %lld", &p);
b[p]++;
a.push_back(p);
}
sort(a.begin(), a.end());
long long ans = 0, max = a[n - 1];
for (i = 0; i <= max; i++) {
if (b[i] == 1)
ans++;
if (i != 0)
jmax = max / i;
if (i == 0)
jmax = 1;
if (b[i] != 0) {
for (j = 0; j <= jmax; j++)
b[i * j] = 0;
}
}
printf("%lld\n", ans);
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
long long b[20000001] = {0};
long long i, j, jmax, p;
vector<long long> a;
for (i = 0; i < n; i++) {
scanf(" %lld", &p);
b[p]++;
a.push_back(p);
}
sort(a.begin(), a.end());
long long ans = 0, max = a[n - 1];
for (i = 0; i <= max; i++) {
if (b[i] == 1)
ans++;
if (i != 0)
jmax = max / i;
if (i == 0)
jmax = 1;
if (b[i] != 0) {
for (j = 0; j <= jmax; j++)
b[i * j] = 0;
}
}
printf("%lld\n", ans);
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02642 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using pss = pair<string, string>;
using pcc = pair<char, char>;
using pbb = pair<bool, bool>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using td3 = tuple<double, double, double>;
using ts3 = tuple<string, string, string>;
using tc3 = tuple<char, char, char>;
using tb3 = tuple<bool, bool, bool>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using td4 = tuple<double, double, double, double>;
using ts4 = tuple<string, string, string, string>;
using tc4 = tuple<char, char, char, char>;
using tb4 = tuple<bool, bool, bool, bool>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using vvs = vector<vs>;
using vvc = vector<vc>;
using vvb = vector<vb>;
using vvvi = vector<vvi>;
using vvvl = vector<vvl>;
using vvvd = vector<vvd>;
using vvvs = vector<vvs>;
using vvvc = vector<vvc>;
using vvvb = vector<vvb>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
using vpss = vector<pss>;
using vpcc = vector<pcc>;
using vpbb = vector<pbb>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vti3 = vector<ti3>;
using vtl3 = vector<tl3>;
using vtd3 = vector<td3>;
using vts3 = vector<ts3>;
using vtc3 = vector<tc3>;
using vtb3 = vector<tb3>;
using vti4 = vector<ti4>;
using vtl4 = vector<tl4>;
using vtd4 = vector<td4>;
using vts4 = vector<ts4>;
using vtc4 = vector<tc4>;
using vtb4 = vector<tb4>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using msi = map<string, int>;
using mci = map<char, int>;
using mil = map<int, ll>;
using mli = map<ll, int>;
using si = set<int>;
using sl = set<ll>;
using sd = set<double>;
using ss = set<string>;
using sc = set<char>;
using sb = set<bool>;
using spii = set<pii>;
using spll = set<pll>;
using spdd = set<pdd>;
using spss = set<pss>;
using spcc = set<pcc>;
using spbb = set<pbb>;
using spil = set<pil>;
using spli = set<pli>;
using sti3 = set<ti3>;
using stl3 = set<tl3>;
using std3 = set<td3>;
using sts3 = set<ts3>;
using stc3 = set<tc3>;
using stb3 = set<tb3>;
#define rep0(TMS) for (int CNT = 0; CNT < (int)(TMS); CNT++)
#define rep(CNT, GOAL) for (int CNT = 0; CNT < (int)(GOAL); CNT++)
#define rep2(CNT, START, GOAL) \
for (int CNT = (int)(START); CNT < (int)(GOAL); CNT++)
#define rep3(CNT, START, GOAL) \
for (int CNT = (int)(START); CNT > (int)(GOAL); CNT--)
#define all(CONT) begin(CONT), end(CONT)
#define fr1(CONT) next(begin(CONT)), end(CONT)
#define itrep(ITR, CONT) for (auto ITR = begin(CONT); ITR != end(CONT); ITR++)
#define itrep1(ITR, CONT) \
for (auto ITR = next(begin(CONT)); ITR != end(CONT); ITR++)
#define maxel(CONT) *max_element(all(CONT))
#define minel(CONT) *min_element(all(CONT))
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> T sum(const vector<T> &VEC) {
return accumulate(all(VEC), 0.0);
}
template <typename T> vector<T> acm(const vector<T> &VEC) {
vector<T> RES(VEC.size() + 1);
rep(CNT, VEC.size()) RES[CNT + 1] = RES[CNT] + VEC[CNT];
return RES;
}
template <typename T> void fil(vector<T> &VEC, const int NUM, const T &VAL) {
VEC.assign(NUM, VAL);
}
template <typename T> void fil(vector<T> &VEC, const int NUM) {
VEC.assign(NUM, 0.0);
}
template <typename T>
void fil(vector<vector<T>> &VV, const int RNUM, const int CNUM, const T &VAL) {
fil(VV, RNUM, vector<T>());
rep(CNT, RNUM) fil(VV[CNT], CNUM, VAL);
}
template <typename T>
void fil(vector<vector<T>> &VV, const int RNUM, const int CNUM) {
fil(VV, RNUM, vector<T>());
rep(CNT, RNUM) fil(VV[CNT], CNUM);
}
template <typename T> void fil(vector<vector<T>> &VV, const int RNUM) {
fil(VV, RNUM, vector<T>());
}
void prec(const int &DIG) {
cerr << fixed << setprecision(DIG);
cout << fixed << setprecision(DIG);
}
template <typename T> void COUT(const T &ELEM) { cout << ELEM; }
template <typename T> void pout(const T &ELEM) {
COUT(ELEM);
cout << " ";
}
template <typename T, typename... Ts>
void pout(const T &FIRST, const Ts &...REST) {
pout(FIRST);
pout(REST...);
}
template <typename T> void print(T ELEM) {
COUT(ELEM);
cout << "\n";
}
template <typename T, typename... Ts>
void print(const T &FIRST, const Ts &...REST) {
print(FIRST);
print(REST...);
}
void CERR() { cerr << "\n"; }
template <typename T> void CERR(const T &ELEM) { cerr << ELEM; }
template <typename T, typename... Ts>
void CERR(const T &FIRST, const Ts &...REST) {
CERR(FIRST);
cerr << ", ";
CERR(REST...);
}
template <typename T1, typename T2> void CERR(const pair<T1, T2> &PAIR) {
cerr << "(";
CERR(PAIR.first);
cerr << ", ";
CERR(PAIR.second);
cerr << ")";
}
template <typename T1, typename T2, typename T3>
void CERR(const tuple<T1, T2, T3> &TUP3) {
cerr << "(";
CERR(get<0>(TUP3));
cerr << ", ";
CERR(get<1>(TUP3));
cerr << ", ";
CERR(get<2>(TUP3));
cerr << ")";
}
template <typename T1, typename T2, typename T3, typename T4>
void CERR(const tuple<T1, T2, T3, T4> &TUP4) {
cerr << "(";
CERR(get<0>(TUP4));
cerr << ", ";
CERR(get<1>(TUP4));
cerr << ", ";
CERR(get<2>(TUP4));
cerr << ", ";
CERR(get<3>(TUP4));
cerr << ")";
}
template <typename T> void CERR(const vector<T> &VEC) {
cerr << "{ ";
itrep(ITR, VEC) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T> void CERR1(const vector<T> &VEC) {
cerr << "{ ";
itrep1(ITR, VEC) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T> void CERR(const set<T> &SET) {
cerr << "{ ";
itrep(ITR, SET) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T1, typename T2> void CERR(const map<T1, T2> &MAP) {
cerr << "{ ";
itrep(ITR, MAP) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
#define db(OBJ) \
cerr << #OBJ << ": "; \
CERR(OBJ); \
cerr << ", "
#define dbl(OBJ) \
cerr << #OBJ << ": "; \
CERR(OBJ); \
cerr << "\n"
#define db1(OBJ) \
cerr << #OBJ << ": "; \
CERR1(OBJ); \
cerr << "\n"
#define dbs(...) \
cerr << "(" << #__VA_ARGS__ << "): ("; \
CERR(__VA_ARGS__); \
cerr << ")\n"
#define dbvv(VV) \
cerr << #VV << ": {\n"; \
rep(CNT, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db01(VV) \
cerr << #VV << ": {\n"; \
rep(CNT, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR1(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db10(VV) \
cerr << #VV << ": {\n"; \
rep2(CNT, 1, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db11(VV) \
cerr << #VV << ": {\n"; \
rep2(CNT, 1, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR1(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define YN(FLG) cout << (FLG ? "YES" : "NO") << "\n"
#define Yn(FLG) cout << (FLG ? "Yes" : "No") << "\n"
#define yn(FLG) cout << (FLG ? "yes" : "no") << "\n"
#define pcase(NUM) \
cout << "Case #" << NUM << ":" \
<< " "
#define pcasel(NUM) \
cout << "Case #" << NUM << ":" \
<< "\n"
// const ll INF = 1'000'000'000'000'000'007;
const int INF = 1'000'000'007;
const ll MOD = 1'000'000'007; // 998'244'353;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) cin >> A[i];
sort(all(A));
map<int, int> m;
rep(i, N) m[A[i]]++;
vb b(A[N - 1] + 1);
rep(i, N) {
if (b[i])
continue;
for (int k = 2; k * A[i] <= A[N - 1]; k++) {
b[k * A[i]] = true;
}
// dbl(b);
}
// dbl(b);
rep(i, A.size()) if (m[A[i]] > 1) b[A[i]] = true;
// dbl(b);
int ans = 0;
rep(i, N) if (!b[A[i]]) ans++;
cout << ans << endl;
} | // #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using pss = pair<string, string>;
using pcc = pair<char, char>;
using pbb = pair<bool, bool>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using td3 = tuple<double, double, double>;
using ts3 = tuple<string, string, string>;
using tc3 = tuple<char, char, char>;
using tb3 = tuple<bool, bool, bool>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using td4 = tuple<double, double, double, double>;
using ts4 = tuple<string, string, string, string>;
using tc4 = tuple<char, char, char, char>;
using tb4 = tuple<bool, bool, bool, bool>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using vvs = vector<vs>;
using vvc = vector<vc>;
using vvb = vector<vb>;
using vvvi = vector<vvi>;
using vvvl = vector<vvl>;
using vvvd = vector<vvd>;
using vvvs = vector<vvs>;
using vvvc = vector<vvc>;
using vvvb = vector<vvb>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
using vpss = vector<pss>;
using vpcc = vector<pcc>;
using vpbb = vector<pbb>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vti3 = vector<ti3>;
using vtl3 = vector<tl3>;
using vtd3 = vector<td3>;
using vts3 = vector<ts3>;
using vtc3 = vector<tc3>;
using vtb3 = vector<tb3>;
using vti4 = vector<ti4>;
using vtl4 = vector<tl4>;
using vtd4 = vector<td4>;
using vts4 = vector<ts4>;
using vtc4 = vector<tc4>;
using vtb4 = vector<tb4>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using msi = map<string, int>;
using mci = map<char, int>;
using mil = map<int, ll>;
using mli = map<ll, int>;
using si = set<int>;
using sl = set<ll>;
using sd = set<double>;
using ss = set<string>;
using sc = set<char>;
using sb = set<bool>;
using spii = set<pii>;
using spll = set<pll>;
using spdd = set<pdd>;
using spss = set<pss>;
using spcc = set<pcc>;
using spbb = set<pbb>;
using spil = set<pil>;
using spli = set<pli>;
using sti3 = set<ti3>;
using stl3 = set<tl3>;
using std3 = set<td3>;
using sts3 = set<ts3>;
using stc3 = set<tc3>;
using stb3 = set<tb3>;
#define rep0(TMS) for (int CNT = 0; CNT < (int)(TMS); CNT++)
#define rep(CNT, GOAL) for (int CNT = 0; CNT < (int)(GOAL); CNT++)
#define rep2(CNT, START, GOAL) \
for (int CNT = (int)(START); CNT < (int)(GOAL); CNT++)
#define rep3(CNT, START, GOAL) \
for (int CNT = (int)(START); CNT > (int)(GOAL); CNT--)
#define all(CONT) begin(CONT), end(CONT)
#define fr1(CONT) next(begin(CONT)), end(CONT)
#define itrep(ITR, CONT) for (auto ITR = begin(CONT); ITR != end(CONT); ITR++)
#define itrep1(ITR, CONT) \
for (auto ITR = next(begin(CONT)); ITR != end(CONT); ITR++)
#define maxel(CONT) *max_element(all(CONT))
#define minel(CONT) *min_element(all(CONT))
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> T sum(const vector<T> &VEC) {
return accumulate(all(VEC), 0.0);
}
template <typename T> vector<T> acm(const vector<T> &VEC) {
vector<T> RES(VEC.size() + 1);
rep(CNT, VEC.size()) RES[CNT + 1] = RES[CNT] + VEC[CNT];
return RES;
}
template <typename T> void fil(vector<T> &VEC, const int NUM, const T &VAL) {
VEC.assign(NUM, VAL);
}
template <typename T> void fil(vector<T> &VEC, const int NUM) {
VEC.assign(NUM, 0.0);
}
template <typename T>
void fil(vector<vector<T>> &VV, const int RNUM, const int CNUM, const T &VAL) {
fil(VV, RNUM, vector<T>());
rep(CNT, RNUM) fil(VV[CNT], CNUM, VAL);
}
template <typename T>
void fil(vector<vector<T>> &VV, const int RNUM, const int CNUM) {
fil(VV, RNUM, vector<T>());
rep(CNT, RNUM) fil(VV[CNT], CNUM);
}
template <typename T> void fil(vector<vector<T>> &VV, const int RNUM) {
fil(VV, RNUM, vector<T>());
}
void prec(const int &DIG) {
cerr << fixed << setprecision(DIG);
cout << fixed << setprecision(DIG);
}
template <typename T> void COUT(const T &ELEM) { cout << ELEM; }
template <typename T> void pout(const T &ELEM) {
COUT(ELEM);
cout << " ";
}
template <typename T, typename... Ts>
void pout(const T &FIRST, const Ts &...REST) {
pout(FIRST);
pout(REST...);
}
template <typename T> void print(T ELEM) {
COUT(ELEM);
cout << "\n";
}
template <typename T, typename... Ts>
void print(const T &FIRST, const Ts &...REST) {
print(FIRST);
print(REST...);
}
void CERR() { cerr << "\n"; }
template <typename T> void CERR(const T &ELEM) { cerr << ELEM; }
template <typename T, typename... Ts>
void CERR(const T &FIRST, const Ts &...REST) {
CERR(FIRST);
cerr << ", ";
CERR(REST...);
}
template <typename T1, typename T2> void CERR(const pair<T1, T2> &PAIR) {
cerr << "(";
CERR(PAIR.first);
cerr << ", ";
CERR(PAIR.second);
cerr << ")";
}
template <typename T1, typename T2, typename T3>
void CERR(const tuple<T1, T2, T3> &TUP3) {
cerr << "(";
CERR(get<0>(TUP3));
cerr << ", ";
CERR(get<1>(TUP3));
cerr << ", ";
CERR(get<2>(TUP3));
cerr << ")";
}
template <typename T1, typename T2, typename T3, typename T4>
void CERR(const tuple<T1, T2, T3, T4> &TUP4) {
cerr << "(";
CERR(get<0>(TUP4));
cerr << ", ";
CERR(get<1>(TUP4));
cerr << ", ";
CERR(get<2>(TUP4));
cerr << ", ";
CERR(get<3>(TUP4));
cerr << ")";
}
template <typename T> void CERR(const vector<T> &VEC) {
cerr << "{ ";
itrep(ITR, VEC) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T> void CERR1(const vector<T> &VEC) {
cerr << "{ ";
itrep1(ITR, VEC) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T> void CERR(const set<T> &SET) {
cerr << "{ ";
itrep(ITR, SET) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
template <typename T1, typename T2> void CERR(const map<T1, T2> &MAP) {
cerr << "{ ";
itrep(ITR, MAP) {
CERR(*ITR);
cerr << ", ";
}
cerr << "}";
}
#define db(OBJ) \
cerr << #OBJ << ": "; \
CERR(OBJ); \
cerr << ", "
#define dbl(OBJ) \
cerr << #OBJ << ": "; \
CERR(OBJ); \
cerr << "\n"
#define db1(OBJ) \
cerr << #OBJ << ": "; \
CERR1(OBJ); \
cerr << "\n"
#define dbs(...) \
cerr << "(" << #__VA_ARGS__ << "): ("; \
CERR(__VA_ARGS__); \
cerr << ")\n"
#define dbvv(VV) \
cerr << #VV << ": {\n"; \
rep(CNT, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db01(VV) \
cerr << #VV << ": {\n"; \
rep(CNT, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR1(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db10(VV) \
cerr << #VV << ": {\n"; \
rep2(CNT, 1, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define db11(VV) \
cerr << #VV << ": {\n"; \
rep2(CNT, 1, VV.size()) { \
cerr << #VV << "[" << CNT << "]: "; \
CERR1(VV[CNT]); \
cerr << ",\n"; \
} \
cerr << "}\n"
#define YN(FLG) cout << (FLG ? "YES" : "NO") << "\n"
#define Yn(FLG) cout << (FLG ? "Yes" : "No") << "\n"
#define yn(FLG) cout << (FLG ? "yes" : "no") << "\n"
#define pcase(NUM) \
cout << "Case #" << NUM << ":" \
<< " "
#define pcasel(NUM) \
cout << "Case #" << NUM << ":" \
<< "\n"
// const ll INF = 1'000'000'000'000'000'007;
const int INF = 1'000'000'007;
const ll MOD = 1'000'000'007; // 998'244'353;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) cin >> A[i];
sort(all(A));
map<int, int> m;
rep(i, N) m[A[i]]++;
vb b(A[N - 1] + 1);
rep(i, N) {
if (b[A[i]])
continue;
for (int k = 2; k * A[i] <= A[N - 1]; k++) {
b[k * A[i]] = true;
}
// dbl(b);
}
// dbl(b);
rep(i, A.size()) if (m[A[i]] > 1) b[A[i]] = true;
// dbl(b);
int ans = 0;
rep(i, N) if (!b[A[i]]) ans++;
cout << ans << endl;
} | replace | 307 | 308 | 307 | 308 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll arr[n];
int cnt[1000002] = {0};
bool vis[1000002] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
cnt[arr[i]]++;
if (vis[arr[i]] == 0) {
for (int j = 2 * arr[i]; j <= 1000000; j += arr[i]) {
vis[j] = 1;
}
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if (vis[arr[i]] == 0 && cnt[arr[i]] == 1) {
ans++;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll arr[n];
int cnt[1000002] = {0};
bool vis[1000002] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
cnt[arr[i]]++;
if (vis[arr[i]] == 0 && cnt[arr[i]] == 1) {
for (int j = 2 * arr[i]; j <= 1000000; j += arr[i]) {
vis[j] = 1;
}
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if (vis[arr[i]] == 0 && cnt[arr[i]] == 1) {
ans++;
}
}
cout << ans;
return 0;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int mx = 2e5 + 777;
int flag[mx];
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int N, A;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A, flag[A]++;
int ret = 0;
for (int i = 1; i < mx; i++) {
if (flag[i]) {
if (flag[i] == 1)
ret++;
for (int j = 2 * i; j < mx; j += i)
flag[j] = false;
}
}
cout << ret << "\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int mx = 1e6 + 777;
int flag[mx];
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int N, A;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A, flag[A]++;
int ret = 0;
for (int i = 1; i < mx; i++) {
if (flag[i]) {
if (flag[i] == 1)
ret++;
for (int j = 2 * i; j < mx; j += i)
flag[j] = false;
}
}
cout << ret << "\n";
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02642 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define inf 1000000000000000000
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
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;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(15) << fixed;
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
map<ll, ll> Counter;
vector<bool> ans(1000001, true);
for (auto i : A) {
Counter[i]++;
for (ll j = 2 * i; j < 1000001; j += i) {
ans[j] = false;
}
}
ll cnt = 0;
for (auto i : A) {
if (ans[i] && Counter[i] == 1)
cnt++;
}
cout << cnt << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define inf 1000000000000000000
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
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;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << setprecision(15) << fixed;
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
map<ll, ll> Counter;
vector<bool> ans(1000001, true);
for (auto i : A) {
Counter[i]++;
if (Counter[i] > 1)
continue;
for (ll j = 2 * i; j < 1000001; j += i) {
ans[j] = false;
}
}
ll cnt = 0;
for (auto i : A) {
if (ans[i] && Counter[i] == 1)
cnt++;
}
cout << cnt << endl;
}
| insert | 39 | 39 | 39 | 41 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int n, a[200010], ans = 0;
bool f[200010] = {};
int main() {
ios::sync_with_stdio(false);
cin >> n;
int i, j;
for (i = 1; i <= n; ++i)
cin >> a[i];
sort(a + 1, a + 1 + n);
for (i = 1; i <= n; ++i) {
if (!f[a[i]]) {
++ans;
for (j = 1; j * a[i] <= a[n]; ++j)
f[a[i] * j] = 1;
if (a[i] == a[i + 1])
--ans;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int n, a[200010], ans = 0;
bool f[2000010] = {};
int main() {
ios::sync_with_stdio(false);
cin >> n;
int i, j;
for (i = 1; i <= n; ++i)
cin >> a[i];
sort(a + 1, a + 1 + n);
for (i = 1; i <= n; ++i) {
if (!f[a[i]]) {
++ans;
for (j = 1; j * a[i] <= a[n]; ++j)
f[a[i] * j] = 1;
if (a[i] == a[i + 1])
--ans;
}
}
cout << ans;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
int32_t main() {
IOS;
int n;
cin >> n;
vector<bool> pos(1000005, false);
vector<int> tot(1000005, 0);
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
int cur = arr[i];
tot[cur]++;
if (pos[cur] == false) {
for (int j = 2 * cur; j < pos.size(); j += cur)
pos[j] = true;
}
}
int cnt = 0;
for (int i = 0; i < n; i++)
if (pos[arr[i]] == false && tot[arr[i]] == 1)
cnt++;
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
int32_t main() {
IOS;
int n;
cin >> n;
vector<bool> pos(1000005, false);
vector<int> tot(1000005, 0);
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
int cur = arr[i];
tot[cur]++;
if (pos[cur] == false && tot[cur] == 1) {
for (int j = 2 * cur; j < pos.size(); j += cur)
pos[j] = true;
}
}
int cnt = 0;
for (int i = 0; i < n; i++)
if (pos[arr[i]] == false && tot[arr[i]] == 1)
cnt++;
cout << cnt << endl;
return 0;
} | replace | 23 | 24 | 23 | 24 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 1000005;
int main() {
int N;
cin >> N;
vector<int> cnt(MAX);
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
int x = 0;
while (x + A[i] < MAX) {
x += A[i];
cnt[x]++;
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (cnt[A[i]] == 1) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 1000005;
int main() {
int N;
cin >> N;
vector<int> cnt(MAX);
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
int x = 0;
if (cnt[A[i]] != 0) {
cnt[A[i]]++;
continue;
}
while (x + A[i] < MAX) {
x += A[i];
cnt[x]++;
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (cnt[A[i]] == 1) {
ans++;
}
}
cout << ans << endl;
return 0;
} | insert | 16 | 16 | 16 | 20 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<int>;
using vec2 = vector<vector<int>>;
int main() {
int n;
cin >> n;
int g = pow(10, 6);
vec d(g);
vec a(n);
rep(i, n) { cin >> a[i]; }
for (int x : a) {
for (int i = x; i <= g; i += x) {
d[i]++;
}
}
int sum = 0;
for (int x : a) {
if (d[x] == 1) {
sum++;
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<int>;
using vec2 = vector<vector<int>>;
int main() {
int n;
cin >> n;
int g = pow(10, 6);
vec d(g);
vec a(n);
rep(i, n) { cin >> a[i]; }
for (int x : a) {
if (d[x] != 0) {
d[x] = 2;
continue;
}
for (int i = x; i <= g; i += x) {
d[i]++;
}
}
int sum = 0;
for (int x : a) {
if (d[x] == 1) {
sum++;
}
}
cout << sum << endl;
}
| replace | 17 | 18 | 17 | 21 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> dp(1000000 + 1);
rep(i, N) { cin >> A.at(i); }
rep(i, N) {
int tmp = A.at(i);
while (tmp <= 1000000) {
dp.at(tmp)++;
tmp += A.at(i);
}
}
int count = 0;
rep(i, N) {
// cout << A.at(i) << ' ' << dp.at(A.at(i)) << endl;
if (dp.at(A.at(i)) == 1) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> dp(1000000 + 1);
rep(i, N) { cin >> A.at(i); }
rep(i, N) {
if (dp.at(A.at(i)) > 1) {
continue;
}
int tmp = A.at(i);
while (tmp <= 1000000) {
dp.at(tmp)++;
tmp += A.at(i);
}
}
int count = 0;
rep(i, N) {
// cout << A.at(i) << ' ' << dp.at(A.at(i)) << endl;
if (dp.at(A.at(i)) == 1) {
count++;
}
}
cout << count << endl;
} | insert | 14 | 14 | 14 | 18 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
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 <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), v(1000010);
rep(i, N) { cin >> A[i]; }
ll ans = 0;
rep(i, N) {
ll t = A[i];
while (t < 1000010) {
v[t]++;
t += A[i];
}
}
rep(i, N) {
if (v[A[i]] == 1)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
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 <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), v(1000010);
rep(i, N) { cin >> A[i]; }
ll ans = 0;
rep(i, N) {
ll t = A[i];
if (v[t] != 0) {
v[t]++;
continue;
}
while (t < 1000010) {
v[t]++;
t += A[i];
}
}
rep(i, N) {
if (v[A[i]] == 1)
ans++;
}
cout << ans << endl;
} | insert | 37 | 37 | 37 | 41 | TLE | |
p02642 | C++ | Time Limit Exceeded | // Author rahuliitkgp
/*A thing of beauty is a joy forever,
Its loveliness increases,
it will never pass into nothingness.*/
// Men at Work :)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
#define setbits(x) __builtin_popcountll(x)
#define mod 1000000007
#define ps(x, y) fixed << setprecision(y) << x
#define w(x) \
int x; \
cin >> x; \
while (x--)
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
void cpp() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
cpp();
ll n;
cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> num(1000020);
sort(v.begin(), v.end());
for (ll i = 0; i < n - 1; i++) {
if (v[i] == v[i + 1]) {
num[v[i]] = 1;
}
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
if (!num[v[i]]) {
ans++;
}
for (ll j = 2 * v[i]; j <= 1000000; j += v[i]) {
num[j] = 1;
}
}
cout << ans << endl;
return 0;
}
| // Author rahuliitkgp
/*A thing of beauty is a joy forever,
Its loveliness increases,
it will never pass into nothingness.*/
// Men at Work :)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
#define setbits(x) __builtin_popcountll(x)
#define mod 1000000007
#define ps(x, y) fixed << setprecision(y) << x
#define w(x) \
int x; \
cin >> x; \
while (x--)
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
void cpp() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
cpp();
ll n;
cin >> n;
vector<ll> v(n);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> num(1000020);
sort(v.begin(), v.end());
for (ll i = 0; i < n - 1; i++) {
if (v[i] == v[i + 1]) {
num[v[i]] = 1;
}
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
if (!num[v[i]]) {
ans++;
}
if (v[i] != v[i - 1]) {
for (ll j = 2 * v[i]; j <= 1000000; j += v[i]) {
num[j] = 1;
}
}
}
cout << ans << endl;
return 0;
}
| replace | 52 | 54 | 52 | 56 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
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 (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> num(1e6 + 1, 0);
rep(i, n) {
scanf("%d", &a[i]);
num[a[i]]++;
}
sort(all(a));
int ans = 0;
vector<vector<int>> each_divs;
rep(i, n) {
vector<int> tmp_div;
for (int j = 1; j * j <= a[i]; ++j) {
if (a[i] % j == 0) {
tmp_div.push_back(j);
if (j * j != a[i]) {
tmp_div.push_back(a[i] / j);
}
}
}
if (num[a[i]] >= 2) {
continue;
}
bool flag = true;
for (auto e : tmp_div) {
if (e == a[i]) {
continue;
}
if (find(all(a), e) != a.end()) {
flag = false;
break;
}
}
if (flag) {
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
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 (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> num(1e6 + 1, 0);
rep(i, n) {
scanf("%d", &a[i]);
num[a[i]]++;
}
sort(all(a));
int ans = 0;
vector<vector<int>> each_divs;
rep(i, n) {
vector<int> tmp_div;
for (int j = 1; j * j <= a[i]; ++j) {
if (a[i] % j == 0) {
tmp_div.push_back(j);
if (j * j != a[i]) {
tmp_div.push_back(a[i] / j);
}
}
}
if (num[a[i]] >= 2) {
continue;
}
bool flag = true;
for (auto e : tmp_div) {
if (e == a[i]) {
continue;
}
if (num[e]) {
flag = false;
break;
}
}
if (flag) {
ans++;
}
}
cout << ans << endl;
}
| replace | 56 | 57 | 56 | 57 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) v.begin(), v.end()
#define ff first
#define ss second
#define out(x) cerr << #x << " is : " << x << endl
#define endl "\n"
#define mem(f, v) memset(f, v, sizeof f)
const int N = 1e5 + 10;
void up() {
int n;
cin >> n;
int f[N], a[n];
mem(f, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
f[a[i]]++;
}
bool cond = false;
int cnt = 0;
for (int i = 0; i < n; i++) {
f[a[i]]--;
cond = true;
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
if (f[j] or f[a[i] / j]) {
cond = false;
break;
}
}
}
f[a[i]]++;
if (cond)
cnt++;
}
cout << cnt << endl;
return;
}
int32_t main() {
fast();
up();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) v.begin(), v.end()
#define ff first
#define ss second
#define out(x) cerr << #x << " is : " << x << endl
#define endl "\n"
#define mem(f, v) memset(f, v, sizeof f)
const int N = 1e6 + 10;
void up() {
int n;
cin >> n;
int f[N], a[n];
mem(f, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
f[a[i]]++;
}
bool cond = false;
int cnt = 0;
for (int i = 0; i < n; i++) {
f[a[i]]--;
cond = true;
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
if (f[j] or f[a[i] / j]) {
cond = false;
break;
}
}
}
f[a[i]]++;
if (cond)
cnt++;
}
cout << cnt << endl;
return;
}
int32_t main() {
fast();
up();
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define rp(i, N) for (ll i = 0; i < (ll)N; i++)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
template <class T> bool chmax(T &former, const T &b) {
if (former < b) {
former = b;
return true;
}
return false;
}
template <class T> bool chmin(T &former, const T &b) {
if (b < former) {
former = b;
return true;
}
return false;
}
template <class T> T sqar(T x) { return x * x; } // sqrt(x)は平方根;
#define Sort(v) \
std::sort(v.begin(), v.end(), \
std::greater<decltype(v[0])>()) // 降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v>>
template <class T> inline void princ(T x) { cout << x << " "; };
template <class T> inline void print(T x) { cout << x << "\n"; };
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
///////////////////////////////////////////////////////////////////////////////////
void solve() {
ll n;
cin >> n;
Vi a(n);
rp(i, n) cin >> a.at(i);
sort(all(a));
vi div(1000030, 0);
rp(i, n - 1) {
if (a[i] == a[i + 1]) {
div[a[i]] = 1;
for (ll j = a[i]; j <= 1000002; j += a[i]) {
div[j] = 1;
}
}
}
int ctr = 0;
rp(i, n) {
if (div[a[i]] == 0) {
ctr++;
for (ll j = a[i]; j <= 1000002; j += a[i]) {
div[j] = 1;
}
}
}
print(ctr);
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(30);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define rp(i, N) for (ll i = 0; i < (ll)N; i++)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
template <class T> bool chmax(T &former, const T &b) {
if (former < b) {
former = b;
return true;
}
return false;
}
template <class T> bool chmin(T &former, const T &b) {
if (b < former) {
former = b;
return true;
}
return false;
}
template <class T> T sqar(T x) { return x * x; } // sqrt(x)は平方根;
#define Sort(v) \
std::sort(v.begin(), v.end(), \
std::greater<decltype(v[0])>()) // 降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v>>
template <class T> inline void princ(T x) { cout << x << " "; };
template <class T> inline void print(T x) { cout << x << "\n"; };
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
///////////////////////////////////////////////////////////////////////////////////
void solve() {
ll n;
cin >> n;
Vi a(n);
rp(i, n) cin >> a.at(i);
sort(all(a));
vi div(1000030, 0);
rp(i, n - 1) {
if (a[i] == a[i + 1]) {
if (div[a[i]] == 0) {
div[a[i]] = 1;
for (ll j = a[i]; j <= 1000002; j += a[i]) {
div[j] = 1;
}
}
}
}
int ctr = 0;
rp(i, n) {
if (div[a[i]] == 0) {
ctr++;
for (ll j = a[i]; j <= 1000002; j += a[i]) {
div[j] = 1;
}
}
}
print(ctr);
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(30);
solve();
return 0;
} | replace | 61 | 64 | 61 | 66 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
// #include <random>
#include <map>
// #include <unordered_map>
#include <cstdlib>
#include <functional>
#include <time.h>
// #include <chrono>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
// #include <type_traits>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define INF 1000000001
#define MOD 1000000007
#define SORT(s) sort(s.begin(), s.end());
#define REVERSE(s) reverse(s.begin(), s.end());
#define SUM(s) accumulate(s.begin(), s.end(), 0LL);
#define P pair<int, int>
#define mp make_pair
#define valid(x, y, h, w) (0 <= x && x < h && 0 <= y && y < w)
// #define int ll
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int ndx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int ndy[8] = {1, 0, -1, 0, 1, -1, -1, 1};
double pi = 3.141592653589793;
using namespace std;
int POW(int x, int y) { return int(pow(double(x), double(y))); }
double log(double a, double b) { return log(b) / log(a); }
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> x(200004);
int c1 = 0;
rep(i, n) {
x[a[i]]++;
if (a[i] == 1) {
c1++;
}
}
if (c1 > 1) {
cout << 0 << endl;
return 0;
}
if (c1 == 1) {
cout << 1 << endl;
return 0;
}
int ans = 0;
rep(i, n) {
int t = a[i];
vector<int> s;
for (int k = 2; k * k <= a[i]; k++) {
if (t % k == 0) {
s.push_back(k);
if (k * k != t) {
s.push_back(t / k);
}
}
}
int flg = 1;
rep(j, s.size()) {
if (x[s[j]]) {
flg = 0;
break;
}
}
if (x[a[i]] > 1) {
flg = 0;
}
if (flg) {
ans++;
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
// #include <random>
#include <map>
// #include <unordered_map>
#include <cstdlib>
#include <functional>
#include <time.h>
// #include <chrono>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
// #include <type_traits>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define INF 1000000001
#define MOD 1000000007
#define SORT(s) sort(s.begin(), s.end());
#define REVERSE(s) reverse(s.begin(), s.end());
#define SUM(s) accumulate(s.begin(), s.end(), 0LL);
#define P pair<int, int>
#define mp make_pair
#define valid(x, y, h, w) (0 <= x && x < h && 0 <= y && y < w)
// #define int ll
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int ndx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int ndy[8] = {1, 0, -1, 0, 1, -1, -1, 1};
double pi = 3.141592653589793;
using namespace std;
int POW(int x, int y) { return int(pow(double(x), double(y))); }
double log(double a, double b) { return log(b) / log(a); }
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<int> x(1000005);
int c1 = 0;
rep(i, n) {
x[a[i]]++;
if (a[i] == 1) {
c1++;
}
}
if (c1 > 1) {
cout << 0 << endl;
return 0;
}
if (c1 == 1) {
cout << 1 << endl;
return 0;
}
int ans = 0;
rep(i, n) {
int t = a[i];
vector<int> s;
for (int k = 2; k * k <= a[i]; k++) {
if (t % k == 0) {
s.push_back(k);
if (k * k != t) {
s.push_back(t / k);
}
}
}
int flg = 1;
rep(j, s.size()) {
if (x[s[j]]) {
flg = 0;
break;
}
}
if (x[a[i]] > 1) {
flg = 0;
}
if (flg) {
ans++;
}
}
cout << ans << endl;
}
| replace | 55 | 56 | 55 | 56 | 0 | |
p02642 | C++ | Runtime Error | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
vector<int> B(1000000);
for (int i = 1; i <= N; i++) {
int x = A.at(i);
for (int j = 1; j <= A.back() / A.at(i); j++) {
B.at(x * j)++;
}
}
int ans = 0;
for (auto i = 1; i <= N; i++) {
if (B.at(A.at(i)) == 1)
ans++;
}
cout << ans << endl;
}
| #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
vector<int> B(10000000);
for (int i = 1; i <= N; i++) {
int x = A.at(i);
for (int j = 1; j <= A.back() / A.at(i); j++) {
B.at(x * j)++;
}
}
int ans = 0;
for (auto i = 1; i <= N; i++) {
if (B.at(A.at(i)) == 1)
ans++;
}
cout << ans << endl;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end());
vector<int> S(1000010);
int ans = 0;
for (int i = 0; i < N; i++) {
int num = A[i];
for (int j = num; j < 1000010; j += num)
S[j]++;
}
for (int i = 0; i < N; i++) {
if (S[A[i]] == 1)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end());
vector<int> S(1000010);
int ans = 0;
for (int i = 0; i < N; i++) {
int num = A[i];
if (S[num] != 0) {
S[num] = 2;
continue;
}
for (int j = num; j < 1000010; j += num)
S[j]++;
}
for (int i = 0; i < N; i++) {
if (S[A[i]] == 1)
ans++;
}
cout << ans << endl;
}
| insert | 19 | 19 | 19 | 23 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto &e : a)
#ifdef LOCAL
#define logv(a) \
{ \
cerr << #a << " = "; \
fore(e, a) { cerr << e << " "; } \
cerr << "\n"; \
}
#define logvp(a) \
{ \
cerr << #a << " = "; \
fore(e, a) { cerr << "(" << e.first << ", " << e.second << ") "; } \
cerr << "\n"; \
}
#define logvv(a) \
{ \
cerr << #a << " = \n"; \
fore(r, a) { \
fore(e, r) { cerr << e << " "; } \
cerr << "\n"; \
} \
}
#define logvf(a, field) \
{ \
cerr << #a "." #field << " = \n"; \
fore(e, a) { cerr << e.field << " "; } \
cerr << "\n"; \
}
#define logvff(a, f1, f2) \
{ \
cerr << #a ".{" #f1 << ", " #f2 << "} = \n"; \
fore(e, a) { cerr << "(" << e.f1 << ", " << e.f2 << ") "; } \
cerr << "\n"; \
}
#define logs(a) cerr << #a << " = " << (a) << "\n";
#define logss(a, b) \
cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << "\n";
#define logp(a) \
cerr << #a << " = " \
<< "(" << a.first << ", " << a.second << ")" \
<< "\n";
#define cond(pred, stmt) \
if (pred) { \
stmt \
}
#else
#define logv(a)
#define logvp(a)
#define logvv(a)
#define logvf(a, field)
#define logvff(a, f1, f2)
#define logs(a)
#define logss(a, b)
#define logp(a)
#define cond(pred, stmt)
#endif
using iip = pair<int, int>;
using llp = pair<i64, i64>;
using ivec = vector<int>;
using llvec = vector<i64>;
using svec = vector<string>;
template <typename T> using vec = vector<T>;
template <typename T, typename Dim> auto make_vec(T value, Dim dim) {
return vector<T>(dim, value);
}
template <typename T, typename Dim1, typename... Dim>
auto make_vec(T value, Dim1 dim1, Dim... dims) {
return make_vec(make_vec(value, dims...), dim1);
}
template <typename T> bool uax(T &v, const T &newv) {
if (v < newv) {
v = newv;
return true;
} else
return false;
}
template <typename T> bool uin(T &v, const T &newv) {
if (v > newv) {
v = newv;
return true;
} else
return false;
}
template <typename T> istream &operator>>(istream &is, vector<T> &c) {
for (auto &e : c)
is >> e;
return is;
}
template <typename T, size_t N>
istream &operator>>(istream &is, array<T, N> &c) {
for (auto &e : c)
is >> e;
return is;
}
template <typename... T> istream &read(T &...args) {
return (cin >> ... >> args);
}
static mt19937 rande(123123);
template <typename T> T rand_int(T from, T to) {
uniform_int_distribution<T> distr(from, to);
return distr(rande);
}
constexpr int INF = 1e9;
constexpr int MXB = 20;
using bin = bitset<MXB>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
rande.seed(chrono::steady_clock::now().time_since_epoch().count());
int n;
while (read(n)) {
ivec a(n);
read(a);
ivec fail(n);
map<int, ivec> divs;
forn(i, n) {
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
divs[j].push_back(i);
divs[a[i] / j].push_back(i);
}
}
}
forn(i, n) {
fore(d, divs[a[i]]) if (d != i) { fail[d] = true; }
}
int cc = 0;
forn(i, n) { cc += !fail[i]; }
cout << cc << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto &e : a)
#ifdef LOCAL
#define logv(a) \
{ \
cerr << #a << " = "; \
fore(e, a) { cerr << e << " "; } \
cerr << "\n"; \
}
#define logvp(a) \
{ \
cerr << #a << " = "; \
fore(e, a) { cerr << "(" << e.first << ", " << e.second << ") "; } \
cerr << "\n"; \
}
#define logvv(a) \
{ \
cerr << #a << " = \n"; \
fore(r, a) { \
fore(e, r) { cerr << e << " "; } \
cerr << "\n"; \
} \
}
#define logvf(a, field) \
{ \
cerr << #a "." #field << " = \n"; \
fore(e, a) { cerr << e.field << " "; } \
cerr << "\n"; \
}
#define logvff(a, f1, f2) \
{ \
cerr << #a ".{" #f1 << ", " #f2 << "} = \n"; \
fore(e, a) { cerr << "(" << e.f1 << ", " << e.f2 << ") "; } \
cerr << "\n"; \
}
#define logs(a) cerr << #a << " = " << (a) << "\n";
#define logss(a, b) \
cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << "\n";
#define logp(a) \
cerr << #a << " = " \
<< "(" << a.first << ", " << a.second << ")" \
<< "\n";
#define cond(pred, stmt) \
if (pred) { \
stmt \
}
#else
#define logv(a)
#define logvp(a)
#define logvv(a)
#define logvf(a, field)
#define logvff(a, f1, f2)
#define logs(a)
#define logss(a, b)
#define logp(a)
#define cond(pred, stmt)
#endif
using iip = pair<int, int>;
using llp = pair<i64, i64>;
using ivec = vector<int>;
using llvec = vector<i64>;
using svec = vector<string>;
template <typename T> using vec = vector<T>;
template <typename T, typename Dim> auto make_vec(T value, Dim dim) {
return vector<T>(dim, value);
}
template <typename T, typename Dim1, typename... Dim>
auto make_vec(T value, Dim1 dim1, Dim... dims) {
return make_vec(make_vec(value, dims...), dim1);
}
template <typename T> bool uax(T &v, const T &newv) {
if (v < newv) {
v = newv;
return true;
} else
return false;
}
template <typename T> bool uin(T &v, const T &newv) {
if (v > newv) {
v = newv;
return true;
} else
return false;
}
template <typename T> istream &operator>>(istream &is, vector<T> &c) {
for (auto &e : c)
is >> e;
return is;
}
template <typename T, size_t N>
istream &operator>>(istream &is, array<T, N> &c) {
for (auto &e : c)
is >> e;
return is;
}
template <typename... T> istream &read(T &...args) {
return (cin >> ... >> args);
}
static mt19937 rande(123123);
template <typename T> T rand_int(T from, T to) {
uniform_int_distribution<T> distr(from, to);
return distr(rande);
}
constexpr int INF = 1e9;
constexpr int MXB = 20;
using bin = bitset<MXB>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
rande.seed(chrono::steady_clock::now().time_since_epoch().count());
int n;
while (read(n)) {
ivec a(n);
read(a);
ivec fail(n);
map<int, ivec> divs;
forn(i, n) {
for (int j = 1; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
divs[j].push_back(i);
divs[a[i] / j].push_back(i);
}
}
}
forn(i, n) {
fore(d, divs[a[i]]) if (d != i) { fail[d] = true; }
divs[a[i]] = {int(i)};
}
int cc = 0;
forn(i, n) { cc += !fail[i]; }
cout << cc << endl;
}
} | insert | 145 | 145 | 145 | 146 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define AMAX 1000005
int main() {
int n;
cin >> n;
int value;
int cnt[1000001];
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> value;
a[i] = value;
if (cnt[value] != 0) {
cnt[value] = 2;
continue;
}
for (int j = value; j < AMAX; j += value) {
cnt[j]++;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (cnt[a[i]] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define AMAX 1000005
int main() {
int n;
cin >> n;
int value;
int cnt[AMAX];
for (int i = 0; i < AMAX; i++)
cnt[i] = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> value;
a[i] = value;
if (cnt[value] != 0) {
cnt[value] = 2;
continue;
}
for (int j = value; j < AMAX; j += value) {
cnt[j]++;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (cnt[a[i]] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 9 | 10 | 9 | 12 | -6 | *** stack smashing detected ***: terminated
|
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
using ll = long long int;
const ll MOD = 1e9 + 7;
int main() {
int N;
std::cin >> N;
std::vector<int> A(N);
std::map<int, int> cnt;
rep(i, N) {
std::cin >> A[i];
++cnt[A[i]];
}
std::sort(A.begin(), A.end());
std::vector<bool> dp(1000001, true);
int ans = 0;
rep(i, N) {
if (!dp[A[i]])
continue;
if (cnt[A[i]] == 1) {
++ans;
}
int sub = 2 * A[i];
while (sub <= 1000000) {
dp[sub] = false;
sub += A[i];
}
}
std::cout << ans << '\n';
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
using ll = long long int;
const ll MOD = 1e9 + 7;
int main() {
int N;
std::cin >> N;
std::vector<int> A(N);
std::map<int, int> cnt;
rep(i, N) {
std::cin >> A[i];
++cnt[A[i]];
}
std::sort(A.begin(), A.end());
std::vector<bool> dp(1000001, true);
int ans = 0;
rep(i, N) {
if (!dp[A[i]])
continue;
if (cnt[A[i]] == 1) {
++ans;
}
int sub = A[i];
while (sub <= 1000000) {
dp[sub] = false;
sub += A[i];
}
}
std::cout << ans << '\n';
}
| replace | 27 | 28 | 27 | 28 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define db(a) cout << a << endl
#define db2(a, b) cout << a << " " << b << endl
#define dbd(a) cout << #a << ": " << a << endl
#define dbd2(a, b) cout << #a << ": " << a << ", " << #b << ": " << b << endl
#define dbp(a) cout << a.first << " " << a.second << endl
#define adb(a) \
for (auto _i : a) \
cout << _i << " "; \
cout << endl
#define adbp(a) \
for (auto _i : a) \
cout << _i.first << " " << _i.second << endl;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define mod 998244353
#define N 1000010
#define M 100010
using namespace std;
int main() {
fastIO;
long long n;
cin >> n;
long long a[n], i;
map<long long, long long> mp;
for (i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
sort(a, a + n);
long long ans = 0;
bool chk[N] = {false};
for (i = 0; i < n; i++) {
if (!chk[a[i]] && mp[a[i]] == 1)
ans++;
for (int j = a[i]; j < N; j += a[i])
chk[j] = true;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define db(a) cout << a << endl
#define db2(a, b) cout << a << " " << b << endl
#define dbd(a) cout << #a << ": " << a << endl
#define dbd2(a, b) cout << #a << ": " << a << ", " << #b << ": " << b << endl
#define dbp(a) cout << a.first << " " << a.second << endl
#define adb(a) \
for (auto _i : a) \
cout << _i << " "; \
cout << endl
#define adbp(a) \
for (auto _i : a) \
cout << _i.first << " " << _i.second << endl;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define mod 998244353
#define N 1000010
#define M 100010
using namespace std;
int main() {
fastIO;
long long n;
cin >> n;
long long a[n], i;
map<long long, long long> mp;
for (i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
sort(a, a + n);
long long ans = 0;
bool chk[N] = {false};
for (i = 0; i < n; i++) {
if (!chk[a[i]] && mp[a[i]] == 1)
ans++;
if (a[i] == 1)
break;
if (!chk[a[i]])
for (int j = a[i]; j < N; j += a[i])
chk[j] = true;
}
cout << ans << endl;
return 0;
} | replace | 40 | 42 | 40 | 45 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// TEMPLATE
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define F first
#define S second
#define newline printf("\n")
#define minusone printf("-1\n")
#define zeroo printf("0\n")
#define scl1(a) scanf("%lld", &a)
#define scl2(a, b) scanf("%lld %lld", &a, &b)
#define scl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define prl1(a) printf("%lld\n", a)
#define prl2(a, b) printf("%lld %lld\n", a, b)
#define ssl1(s) scanf(" %[^\n]", s)
#define scd1(a) scanf("%lf", &a)
#define scd2(a, b) scanf("%lf %lf", &a, &b)
#define prd(a) printf("%lf\n", a)
#define prld(a) printf("%Lf\n", a)
#define prcase(tc) printf("Case %lld: ", tc)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cot1(a) cout << a << "\n"
#define cot2(a, b) cout << a << " " << b << "\n"
#define cot3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define cot4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define cotline cout << "\n"
#define cotminus cout << "-1\n"
#define cot0 cout << "0\n"
#define cotyes cout << "YES\n"
#define cotno cout << "NO\n"
#define cotcase(tc) cout << "Case " << tc << ": "
#define reversed(s) reverse(s.begin(), s.end())
#define asort(s) sort(s.begin(), s.end())
#define dsort(s) sort(s.rbegin(), s.rend())
#define all(s) s.begin(), s.end()
#define uniq(s) s.resize(distance(s.begin(), unique(s.begin(), s.end())))
#define found(s, x) s.find(x) != s.end()
#define for0(i, n) for (i = 0; i < n; i++)
#define for1(i, n) for (i = 1; i <= n; i++)
#define fora(i, a, b) for (i = a; i <= b; i++)
#define forb(i, b, a) for (i = b; i >= a; i--)
#define fori(it, s) for (auto it = s.begin(); it != s.end(); it++)
#define FR \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ms(a, x) memset(a, x, sizeof a)
#define bitcount(n) __builtin_popcountll(n)
// #define pi 3.1415926536
#define pi acos(-1)
const ll INF = LLONG_MAX;
const ll SZ = 4e5 + 5;
const ll mod = 1e9 + 7;
ll n;
ll a[SZ];
ll f[SZ];
int main() {
FR;
ll tc = 0, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0, t = 0;
// ll a, b, d;
string s, s1, s2;
cin1(n);
for1(i, n) {
cin1(a[i]);
f[a[i]]++;
}
for1(i, n) {
p = a[i];
if (p == 1) {
if (f[1] == 1)
c++;
continue;
}
if (f[p] > 1 || f[1])
continue;
bool ok = 1;
for (x = 2; x * x <= p; x++) {
if (p % x == 0) {
y = p / x;
if ((f[x] || f[y]))
ok = 0;
}
}
c += (ok == 1);
}
cot1(c);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// TEMPLATE
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define F first
#define S second
#define newline printf("\n")
#define minusone printf("-1\n")
#define zeroo printf("0\n")
#define scl1(a) scanf("%lld", &a)
#define scl2(a, b) scanf("%lld %lld", &a, &b)
#define scl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define prl1(a) printf("%lld\n", a)
#define prl2(a, b) printf("%lld %lld\n", a, b)
#define ssl1(s) scanf(" %[^\n]", s)
#define scd1(a) scanf("%lf", &a)
#define scd2(a, b) scanf("%lf %lf", &a, &b)
#define prd(a) printf("%lf\n", a)
#define prld(a) printf("%Lf\n", a)
#define prcase(tc) printf("Case %lld: ", tc)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cot1(a) cout << a << "\n"
#define cot2(a, b) cout << a << " " << b << "\n"
#define cot3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define cot4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define cotline cout << "\n"
#define cotminus cout << "-1\n"
#define cot0 cout << "0\n"
#define cotyes cout << "YES\n"
#define cotno cout << "NO\n"
#define cotcase(tc) cout << "Case " << tc << ": "
#define reversed(s) reverse(s.begin(), s.end())
#define asort(s) sort(s.begin(), s.end())
#define dsort(s) sort(s.rbegin(), s.rend())
#define all(s) s.begin(), s.end()
#define uniq(s) s.resize(distance(s.begin(), unique(s.begin(), s.end())))
#define found(s, x) s.find(x) != s.end()
#define for0(i, n) for (i = 0; i < n; i++)
#define for1(i, n) for (i = 1; i <= n; i++)
#define fora(i, a, b) for (i = a; i <= b; i++)
#define forb(i, b, a) for (i = b; i >= a; i--)
#define fori(it, s) for (auto it = s.begin(); it != s.end(); it++)
#define FR \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ms(a, x) memset(a, x, sizeof a)
#define bitcount(n) __builtin_popcountll(n)
// #define pi 3.1415926536
#define pi acos(-1)
const ll INF = LLONG_MAX;
const ll SZ = 1e6 + 5;
const ll mod = 1e9 + 7;
ll n;
ll a[SZ];
ll f[SZ];
int main() {
FR;
ll tc = 0, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0, t = 0;
// ll a, b, d;
string s, s1, s2;
cin1(n);
for1(i, n) {
cin1(a[i]);
f[a[i]]++;
}
for1(i, n) {
p = a[i];
if (p == 1) {
if (f[1] == 1)
c++;
continue;
}
if (f[p] > 1 || f[1])
continue;
bool ok = 1;
for (x = 2; x * x <= p; x++) {
if (p % x == 0) {
y = p / x;
if ((f[x] || f[y]))
ok = 0;
}
}
c += (ok == 1);
}
cot1(c);
return 0;
}
| replace | 65 | 66 | 65 | 66 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define F first
#define S second
#define C continue
#define G goto done
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define sz size()
#define pi acos(-1.0)
#define mod 1000000007
#define maxe *max_element
#define mine *min_element
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define mem(a, b) memset(a, b, sizeof(a))
#define all(a) (a).begin(), (a).end()
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define case(a) cout << "Case " << (a) << ": "
#define point(a) fixed << setprecision(a)
#define get(a) \
for (auto &x : a) \
cin >> x;
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl;
#define uniq(a) \
sort(all(a)); \
(a).erase(unique((a).begin(), (a).end()), (a).end())
#define big(a) transform((a).begin(), (a).end(), (a).begin(), ::toupper)
#define small(a) transform((a).begin(), (a).end(), (a).begin(), ::tolower)
#define ischar(a) (('a' <= a && a <= 'z')('A' <= a && a <= 'Z'))
#define isvowel(a) \
(a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u' || a == 'A' || \
a == 'E' || a == 'I' || a == 'O' || a == 'U')
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define tc \
int test; \
cin >> test; \
while (test--)
using namespace std;
int main() {
map<ll, ll> keep, mp;
ll n;
cin >> n;
vector<ll> inp(n);
get(inp);
for (ll i = 0; i < n; i++)
keep[inp[i]]++;
if (n == 1) {
cout << "1";
return 0;
}
vector<ll> v;
for (auto i : keep) {
if (i.S == 1)
v.pb(i.F);
else
mp[i.F]++;
}
if (v.sz == 0) {
cout << "0";
return 0;
}
ll c = 0;
vector<ll> vec(10000000);
for (ll i = 0; i < v.sz; i++) {
ll k = v[i];
for (ll j = 1; j * j <= k; j++) {
if (k % j == 0) {
ll x = k / j;
ll y = j;
if (vec[x] == 1 || vec[y] == 1 || mp[x] >= 1 || mp[y] >= 1)
G;
}
}
c++;
done:
1;
vec[k] = 1;
}
cout << c;
}
| #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define F first
#define S second
#define C continue
#define G goto done
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define sz size()
#define pi acos(-1.0)
#define mod 1000000007
#define maxe *max_element
#define mine *min_element
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define mem(a, b) memset(a, b, sizeof(a))
#define all(a) (a).begin(), (a).end()
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define case(a) cout << "Case " << (a) << ": "
#define point(a) fixed << setprecision(a)
#define get(a) \
for (auto &x : a) \
cin >> x;
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl;
#define uniq(a) \
sort(all(a)); \
(a).erase(unique((a).begin(), (a).end()), (a).end())
#define big(a) transform((a).begin(), (a).end(), (a).begin(), ::toupper)
#define small(a) transform((a).begin(), (a).end(), (a).begin(), ::tolower)
#define ischar(a) (('a' <= a && a <= 'z')('A' <= a && a <= 'Z'))
#define isvowel(a) \
(a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u' || a == 'A' || \
a == 'E' || a == 'I' || a == 'O' || a == 'U')
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define tc \
int test; \
cin >> test; \
while (test--)
using namespace std;
int main() {
unordered_map<ll, ll> mp;
map<ll, ll> keep;
ll n;
cin >> n;
vector<ll> inp(n);
get(inp);
for (ll i = 0; i < n; i++)
keep[inp[i]]++;
if (n == 1) {
cout << "1";
return 0;
}
vector<ll> v;
for (auto i : keep) {
if (i.S == 1)
v.pb(i.F);
else
mp[i.F]++;
}
if (v.sz == 0) {
cout << "0";
return 0;
}
ll c = 0;
vector<ll> vec(10000000);
for (ll i = 0; i < v.sz; i++) {
ll k = v[i];
for (ll j = 1; j * j <= k; j++) {
if (k % j == 0) {
ll x = k / j;
ll y = j;
if (vec[x] == 1 || vec[y] == 1 || mp[x] >= 1 || mp[y] >= 1)
G;
}
}
c++;
done:
1;
vec[k] = 1;
}
cout << c;
}
| replace | 52 | 53 | 52 | 54 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
int n;
cin >> n;
vector<bool> m(1000005);
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i <= 1000000; i++) {
m[i] = true;
}
sort(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1] && a[i]) {
m[a[i]] = false;
for (int j = 1; j * a[i] <= 1000000; j++) {
m[j * a[i]] = false;
}
}
}
for (int i = 0; i < n; i++) {
if (m[a[i]]) {
ans++;
for (int j = 1; j * a[i] <= 1000000; j++) {
m[j * a[i]] = false;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
int n;
cin >> n;
vector<bool> m(1000005);
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i <= 1000000; i++) {
m[i] = true;
}
sort(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1] && m[a[i]]) {
m[a[i]] = false;
for (int j = 1; j * a[i] <= 1000000; j++) {
m[j * a[i]] = false;
}
}
}
for (int i = 0; i < n; i++) {
if (m[a[i]]) {
ans++;
for (int j = 1; j * a[i] <= 1000000; j++) {
m[j * a[i]] = false;
}
}
}
cout << ans << endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define INF 1e9
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
}
int main() {
int N = 1000000;
init();
int n;
cin >> n;
vector<int> data(N, 0);
vector<int> d(n);
rep(i, n) {
cin >> d[i];
for (int j = d[i]; j <= N; j += d[i]) {
data[j]++;
}
}
int ans = 0;
rep(i, n) {
if (data[d[i]] == 1)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define INF 1e9
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
}
int main() {
int N = 1000000;
init();
int n;
cin >> n;
vector<int> data(N, 0);
vector<int> d(n);
rep(i, n) {
cin >> d[i];
if (data[d[i]] != 0) {
data[d[i]] = 2;
continue;
}
for (int j = d[i]; j <= N; j += d[i]) {
data[j]++;
}
}
int ans = 0;
rep(i, n) {
if (data[d[i]] == 1)
ans++;
}
cout << ans << endl;
}
| insert | 23 | 23 | 23 | 27 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll n, tmp, cnt = 0;
cin >> n;
vector<ll> a(1000000 + 1), tv(n);
for (int i = 0; i < n; i++) {
cin >> tv[i];
}
sort(tv.begin(), tv.end());
for (int i = 0; i < n; i++) {
bool mushi =
((i != 0 && tv[i] == tv[i - 1]) || (i != n - 1 && tv[i] == tv[i + 1]));
if (a[tv[i]] == 0 && !mushi) {
cnt++;
}
ll kake = 1;
while (tv[i] * kake <= 1000000) {
a[tv[i] * kake] = 1;
kake++;
}
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll n, tmp, cnt = 0;
cin >> n;
vector<ll> a(1000000 + 1), tv(n);
for (int i = 0; i < n; i++) {
cin >> tv[i];
}
sort(tv.begin(), tv.end());
for (int i = 0; i < n; i++) {
bool mushi =
((i != 0 && tv[i] == tv[i - 1]) || (i != n - 1 && tv[i] == tv[i + 1]));
if (a[tv[i]] == 0) {
if (!mushi) {
cnt++;
}
ll kake = 1;
while (tv[i] * kake <= 1000000) {
a[tv[i] * kake] = 1;
kake++;
}
}
}
cout << cnt << endl;
return 0;
} | replace | 20 | 28 | 20 | 29 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INFTY 1 << 20
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long int ll;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> ans(1000005, 0), b(n);
rep(i, n) {
cin >> b[i];
ll l = 1;
while (b[i] * l < 1000005) {
ans[b[i] * l]++;
l++;
}
}
ll cnt = 0;
rep(i, n) {
if (ans[b[i]] == 1)
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INFTY 1 << 20
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long int ll;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> ans(1000005, 0), b(n);
rep(i, n) {
cin >> b[i];
ll l = 1;
if (ans[b[i]] != 0)
ans[b[i]] = 2;
else {
while (b[i] * l < 1000005) {
ans[b[i] * l]++;
l++;
}
}
}
ll cnt = 0;
rep(i, n) {
if (ans[b[i]] == 1)
cnt++;
}
cout << cnt << endl;
return 0;
} | replace | 14 | 17 | 14 | 21 | TLE | |
p02642 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> cnt(n);
for (int x : a) {
if (cnt[x] != 0) {
cnt[x] = 2;
continue;
}
for (int i = x; i < 1000005; i += x)
cnt[i]++;
}
int ans = 0;
for (int x : a) {
if (cnt[x] == 1)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> cnt(1000005);
for (int x : a) {
if (cnt[x] != 0) {
cnt[x] = 2;
continue;
}
for (int i = x; i < 1000005; i += x)
cnt[i]++;
}
int ans = 0;
for (int x : a) {
if (cnt[x] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | -11 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for (ll i = n; i < (ll)m; ++i)
#define IREP(i, n, m) for (ll i = n - 1; i >= m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) \
for (auto e : v) { \
cout << e << " "; \
}; \
cout << endl;
#define vvprint(vv) \
for (auto v : vv) \
vprint(v);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll N;
cin >> N;
vll A(N);
rep(i, N) cin >> A[i];
sort(all(A));
unordered_set<ll> s;
ll count = 0;
rep(i, N) {
if (i < N - 1 && A[i] == A[i + 1]) {
for (ll n = A[i]; n <= 1000000; n += A[i]) {
s.insert(n);
}
} else {
if (s.find(A[i]) == s.end())
++count;
for (ll n = A[i]; n <= 1000000; n += A[i]) {
s.insert(n);
}
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for (ll i = n; i < (ll)m; ++i)
#define IREP(i, n, m) for (ll i = n - 1; i >= m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) \
for (auto e : v) { \
cout << e << " "; \
}; \
cout << endl;
#define vvprint(vv) \
for (auto v : vv) \
vprint(v);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll N;
cin >> N;
vll A(N);
rep(i, N) cin >> A[i];
sort(all(A));
unordered_set<ll> s;
ll count = 0;
rep(i, N) {
if (i > 0 && A[i - 1] == A[i])
continue;
if (i < N - 1 && A[i] == A[i + 1]) {
for (ll n = A[i]; n <= 1000000; n += A[i]) {
s.insert(n);
}
} else {
if (s.find(A[i]) == s.end())
++count;
for (ll n = A[i]; n <= 1000000; n += A[i]) {
s.insert(n);
}
}
}
cout << count << endl;
}
| insert | 36 | 36 | 36 | 38 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 998244353;
int main(void) {
int n;
cin >> n;
vector<int> A(n);
rep(i, n) cin >> A[i];
sort(A.begin(), A.end());
int ans = 0;
vector<int> done(1000009, 0);
rep(i, n) {
if (done[A[i]] == 0) {
if (i != n - 1) {
if (A[i] != A[i + 1])
ans++;
} else
ans++;
}
rep(j, 1000000) {
if (A[i] * j > 1000000)
break;
done[A[i] * j] = 1;
}
}
// rep(i,1000000) cout<<i<<" "<<done[i]<<endl;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 998244353;
int main(void) {
int n;
cin >> n;
vector<int> A(n);
rep(i, n) cin >> A[i];
sort(A.begin(), A.end());
int ans = 0;
vector<int> done(1000009, 0);
rep(i, n) {
if (done[A[i]] == 0) {
if (i != n - 1) {
if (A[i] != A[i + 1])
ans++;
} else
ans++;
rep(j, 1000000) {
if (A[i] * j > 1000000)
break;
done[A[i] * j] = 1;
}
}
}
// rep(i,1000000) cout<<i<<" "<<done[i]<<endl;
cout << ans << endl;
return 0;
} | replace | 21 | 26 | 21 | 26 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, ans = 0;
cin >> N;
map<ll, ll> M;
vector<ll> used(200010, 0);
vector<ll> Z(N, 0);
for (ll i = 0; i < N; i++) {
ll A;
cin >> A;
Z[i] = A;
used[A]++;
}
for (ll i = 0; i < N; i++) {
// 約数
ll n = Z[i];
vector<ll> B(0, 0);
for (ll j = 1; j * j <= n; j++) {
if (n % j == 0) {
B.emplace_back(j);
if (n / j == j)
continue;
B.emplace_back(n / j);
}
}
ll bsz = B.size();
for (ll j = 0; j < bsz; j++) {
if (B[j] < n && used[B[j]] > 0)
break;
if (B[j] == n && used[B[j]] > 1)
break;
if (j == bsz - 1)
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> used(1000010, 0);
vector<ll> Z(N, 0);
for (ll i = 0; i < N; i++) {
ll A;
cin >> A;
Z[i] = A;
used[A]++;
}
for (ll i = 0; i < N; i++) {
// 約数
ll n = Z[i];
vector<ll> B(0, 0);
for (ll j = 1; j * j <= n; j++) {
if (n % j == 0) {
B.emplace_back(j);
if (n / j == j)
continue;
B.emplace_back(n / j);
}
}
ll bsz = B.size();
for (ll j = 0; j < bsz; j++) {
if (B[j] < n && used[B[j]] > 0)
break;
if (B[j] == n && used[B[j]] > 1)
break;
if (j == bsz - 1)
ans++;
}
}
cout << ans << endl;
} | replace | 6 | 8 | 6 | 7 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e18
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;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << "\n";
}
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
// vector<int> prime(1e6 + 1,0);
map<int, int> mp;
multiset<int> st;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
int x = a[i];
mp[a[i]]--;
bool ok = true;
vector<int> p;
for (int j = 1; j * j <= x; j++) {
if (x % j == 0) {
if (mp[j] > 0) {
ok = false;
break;
}
if (j * j != x) {
if (mp[x / j] > 0) {
ok = false;
break;
}
}
}
}
if (ok) {
cnt++;
}
mp[a[i]]++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e18
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;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << "\n";
}
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
// vector<int> prime(1e6 + 1,0);
vector<int> mp(1e6 + 1, 0);
multiset<int> st;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
int x = a[i];
mp[a[i]]--;
bool ok = true;
vector<int> p;
for (int j = 1; j * j <= x; j++) {
if (x % j == 0) {
if (mp[j] > 0) {
ok = false;
break;
}
if (j * j != x) {
if (mp[x / j] > 0) {
ok = false;
break;
}
}
}
}
if (ok) {
cnt++;
}
mp[a[i]]++;
}
cout << cnt << endl;
return 0;
} | replace | 66 | 67 | 66 | 67 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define ll long long
#define ull unsigned long long
#define dd double
#define oo 1001007000
#define ff float
#define ooo 4223352036854775007
#define iii pair<ll, ll>
#define vii vector<ll>
#define viii vector<iii>
#define sss pair<str, str>
#define str string
#define sii set<ll>
#define siii set<iii>
#define r0 return 0
#define pb push_back
#define sz size
using namespace std;
const char E = '\n';
const int N = 200005;
const int NN = 2005;
const ll md = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, n, t, tmp;
cin >> n;
vii v, v1(N, 0);
for (int i = 0; i < n; i++) {
cin >> a;
v.pb(a);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
tmp = v[i];
for (int j = tmp; j <= v[n - 1]; j += tmp)
v1[j]++;
}
ll cnt = 0;
for (int i = 0; i < n; i++) {
if (v1[v[i]] == 1)
cnt++;
}
cout << cnt << E;
r0;
}
/*
*/
| #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define ll long long
#define ull unsigned long long
#define dd double
#define oo 1001007000
#define ff float
#define ooo 4223352036854775007
#define iii pair<ll, ll>
#define vii vector<ll>
#define viii vector<iii>
#define sss pair<str, str>
#define str string
#define sii set<ll>
#define siii set<iii>
#define r0 return 0
#define pb push_back
#define sz size
using namespace std;
const char E = '\n';
const int N = 2000005;
const int NN = 2005;
const ll md = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, n, t, tmp;
cin >> n;
vii v, v1(N, 0);
for (int i = 0; i < n; i++) {
cin >> a;
v.pb(a);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
tmp = v[i];
for (int j = tmp; j <= v[n - 1]; j += tmp)
v1[j]++;
}
ll cnt = 0;
for (int i = 0; i < n; i++) {
if (v1[v[i]] == 1)
cnt++;
}
cout << cnt << E;
r0;
}
/*
*/
| replace | 21 | 22 | 21 | 22 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
map<ll, int> mp;
for (int i = 0; i < n; ++i) {
cin >> a[i];
mp[a[i]]++;
}
sort(all(a));
vector<bool> ch(n, true);
for (int i = 0; i < n; ++i) {
if (mp[1] > 0) {
if (a[i] != 1) {
ch[i] = false;
}
}
for (ll j = 2; j * j <= a[i]; ++j) {
if (a[i] % j == 0) {
if (mp[j] > 0 || mp[a[i] / j] > 0) {
ch[i] = false;
}
}
}
}
ll ans = 0;
for (int i = 0; i < n - 1; ++i) {
if (a[i] == a[i + 1]) {
ch[i] = ch[i + 1] = false;
}
}
for (int i = 0; i < n; ++i) {
if (ch[i])
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
unordered_map<ll, int> mp;
for (int i = 0; i < n; ++i) {
cin >> a[i];
mp[a[i]]++;
}
sort(all(a));
vector<bool> ch(n, true);
for (int i = 0; i < n; ++i) {
if (mp[1] > 0) {
if (a[i] != 1) {
ch[i] = false;
}
}
for (ll j = 2; j * j <= a[i]; ++j) {
if (a[i] % j == 0) {
if (mp[j] > 0 || mp[a[i] / j] > 0) {
ch[i] = false;
}
}
}
}
ll ans = 0;
for (int i = 0; i < n - 1; ++i) {
if (a[i] == a[i + 1]) {
ch[i] = ch[i + 1] = false;
}
}
for (int i = 0; i < n; ++i) {
if (ch[i])
ans++;
}
cout << ans << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int inf = 1e6;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
vector<int> v(inf + 1);
rep(i, n) v[a[i]]++;
vector<bool> p(inf + 1);
rep(i, n) {
if (v[a[i]] > 1)
p[a[i]] = true;
for (int d = 2 * a[i]; d <= inf; d += a[i]) {
p[d] = true;
}
}
int ans = 0;
rep(i, n) if (!p[a[i]])++ ans;
cout << ans << endl;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int inf = 1e6;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
vector<int> v(inf + 1);
rep(i, n) v[a[i]]++;
vector<bool> p(inf + 1);
rep(i, inf + 1) {
if (v[i] == 0)
continue;
if (v[i] > 1)
p[i] = true;
for (int d = 2 * i; d <= inf; d += i) {
p[d] = true;
}
}
int ans = 0;
rep(i, n) if (!p[a[i]])++ ans;
cout << ans << endl;
} | replace | 26 | 30 | 26 | 32 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define MAX_N 1002
#define i197 1000000007
#define Vi vector<int>
#define Vl vector<long long>
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<int, int> Pi;
typedef pair<double, Pi> Pdi;
typedef pair<ll, int> Pli;
typedef pair<P1, ll> P2;
const ll INF = 10000000000000000001;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
double cost;
int a, b;
};
struct edge {
int to, cost;
};
struct pos {
int x, y, cost;
};
int f[1000001] = {};
ll a[200002] = {};
ll r = 1000000;
int main() {
ll n;
cin >> n;
rep(i, n) cin >> a[i];
sort(a, a + n);
ll ans = 0;
rep(i, n) {
if (f[a[i]] == 1)
continue;
if (a[i] == a[i + 1])
ans--;
ll t = 0;
while (t < r) {
t += a[i];
f[t] = 1;
}
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define MAX_N 1002
#define i197 1000000007
#define Vi vector<int>
#define Vl vector<long long>
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<int, int> Pi;
typedef pair<double, Pi> Pdi;
typedef pair<ll, int> Pli;
typedef pair<P1, ll> P2;
const ll INF = 10000000000000000001;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
double cost;
int a, b;
};
struct edge {
int to, cost;
};
struct pos {
int x, y, cost;
};
int f[1000001] = {};
ll a[200002] = {};
ll r = 1000000;
int main() {
ll n;
cin >> n;
rep(i, n) cin >> a[i];
sort(a, a + n);
ll ans = 0;
rep(i, n) {
if (f[a[i]] == 1)
continue;
if (a[i] == a[i + 1])
ans--;
ll t = 0;
while (t < r) {
t += a[i];
if (t <= r)
f[t] = 1;
}
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 58 | 59 | 58 | 60 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
/**** Const List ****/
const ll INF = 1LL << 60;
const ll mod = 998244353;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const ll NCK_MAX = 510000;
/**** General Functions ****/
ll ketawa(ll n) {
ll a = 0;
while (n != 0) {
a += n % 10;
n /= 10;
}
return a;
}
ll RepeatSquaring(ll N, ll P, ll M) { // pow->double
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return (t % M) * (t % M) % M;
}
return (N * RepeatSquaring(N, P - 1, M)) % M;
}
ll RS(ll N, ll P) { // modがだるいときにつかう
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RS(N, P / 2);
return t * t;
}
return (N * RS(N, P - 1));
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
bool IsPrime(ll a) { // order root a
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0 && a != i) {
return false;
}
}
return true;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_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 nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll lmin(ll a, ll b) { return a > b ? b : a; };
ll lmax(ll a, ll b) { return a > b ? a : b; };
ll lsum(ll a, ll b) { return a + b; };
/*
void warshall_floyd(int n) {
for (int k = 0; k < n; k++){ // 経由する頂点
for (int i = 0; i < n; i++) { // 始点
for (int j = 0; j < n; j++) { // 終点
//d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
*/
// 汎用的な二分探索のテンプレ
/*
int binary_search(int key) {
ll ng = -1; //絶対falseの値、なければ最小値-1
ll ok = (int)a.size(); // 絶対trueの値 なければ最大値+1
// ok と ng のどちらが大きいかわからないことを考慮
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (isOK(mid, key)) ok = mid;
else ng = mid;
}
return ok;
}
*/
/**** Zip ****/
template <typename T> class Zip {
vector<T> d;
bool flag;
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) { // T need to have operator < !!
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return (ll)d.size();
}
};
/**** Union Find ****/
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
void init(ll n) {
par.resize(n, 1);
rank.resize(n, 0);
}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
/**** Segment Tree ****/
class SegmentTree {
public:
vector<pair<double, double>> node; // node[0]は使用しない
ll n; // データの個数(nodeの最下層には何個並んでいるか)
pair<double, double> initial_value; // 初期値
public:
void Init(ll n_, pair<double, double> initial_value_) {
n = 1;
while (n < n_)
n *= 2;
node.resize(2 * n);
for (ll i = 0; i < 2 * n; i++) {
node[i] = initial_value_;
}
initial_value = initial_value_;
}
void Update(ll k, pair<double, double> a) {
// node[k]をaにする
// それに従って先祖も変わっていく
k += n;
node[k] = a;
while (k > 1) {
k = k / 2;
node[k] = pair<double, double>(
node[k * 2].first * node[k * 2 + 1].first,
node[k * 2].second * node[k * 2 + 1].first + node[k * 2 + 1].second);
}
}
/*void Watch(){
for(ll i=0;i<2*n;i++){
cout<<node[i]<<endl;
}
}*/
double Query() { //[a,b)
return node[1].first + node[1].second;
}
};
/**** LIS(Longest Increasing Subsequence) ****/
ll lis(ll *a, ll n, ll *dp) {
// a:数列 n:要素数 dp:dpテーブル 配列
fill(dp, dp + n, INF); // INFを代入
for (ll i = 0; i < n; i++)
*lower_bound(dp, dp + n, a[i]) = a[i];
return (ll)(lower_bound(dp, dp + n, INF) - dp);
}
/**** main function ****/
ll n, x, y;
ll ans;
string s, t;
map<ll, ll> mp;
vector<ll> a;
ll oklist[1000001];
ll kosu[1000001];
int main() {
cin >> n;
for (ll i = 0; i < n; i++) {
ll aa;
cin >> aa;
a.push_back(aa);
kosu[aa]++;
}
for (ll i = 0; i < 1000001; i++) {
oklist[i] = 1;
}
sort(a.begin(), a.end());
for (ll i = 0; i < n; i++) {
if (oklist[a[i]] == 1) {
if (kosu[a[i]] == 1)
ans++;
for (ll j = 2; a[i] * j <= 1000001; j++) {
oklist[a[i] * j] = 0;
}
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
/**** Const List ****/
const ll INF = 1LL << 60;
const ll mod = 998244353;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const ll NCK_MAX = 510000;
/**** General Functions ****/
ll ketawa(ll n) {
ll a = 0;
while (n != 0) {
a += n % 10;
n /= 10;
}
return a;
}
ll RepeatSquaring(ll N, ll P, ll M) { // pow->double
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return (t % M) * (t % M) % M;
}
return (N * RepeatSquaring(N, P - 1, M)) % M;
}
ll RS(ll N, ll P) { // modがだるいときにつかう
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RS(N, P / 2);
return t * t;
}
return (N * RS(N, P - 1));
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
bool IsPrime(ll a) { // order root a
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0 && a != i) {
return false;
}
}
return true;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_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 nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll lmin(ll a, ll b) { return a > b ? b : a; };
ll lmax(ll a, ll b) { return a > b ? a : b; };
ll lsum(ll a, ll b) { return a + b; };
/*
void warshall_floyd(int n) {
for (int k = 0; k < n; k++){ // 経由する頂点
for (int i = 0; i < n; i++) { // 始点
for (int j = 0; j < n; j++) { // 終点
//d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
*/
// 汎用的な二分探索のテンプレ
/*
int binary_search(int key) {
ll ng = -1; //絶対falseの値、なければ最小値-1
ll ok = (int)a.size(); // 絶対trueの値 なければ最大値+1
// ok と ng のどちらが大きいかわからないことを考慮
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (isOK(mid, key)) ok = mid;
else ng = mid;
}
return ok;
}
*/
/**** Zip ****/
template <typename T> class Zip {
vector<T> d;
bool flag;
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) { // T need to have operator < !!
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return (ll)d.size();
}
};
/**** Union Find ****/
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
void init(ll n) {
par.resize(n, 1);
rank.resize(n, 0);
}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
/**** Segment Tree ****/
class SegmentTree {
public:
vector<pair<double, double>> node; // node[0]は使用しない
ll n; // データの個数(nodeの最下層には何個並んでいるか)
pair<double, double> initial_value; // 初期値
public:
void Init(ll n_, pair<double, double> initial_value_) {
n = 1;
while (n < n_)
n *= 2;
node.resize(2 * n);
for (ll i = 0; i < 2 * n; i++) {
node[i] = initial_value_;
}
initial_value = initial_value_;
}
void Update(ll k, pair<double, double> a) {
// node[k]をaにする
// それに従って先祖も変わっていく
k += n;
node[k] = a;
while (k > 1) {
k = k / 2;
node[k] = pair<double, double>(
node[k * 2].first * node[k * 2 + 1].first,
node[k * 2].second * node[k * 2 + 1].first + node[k * 2 + 1].second);
}
}
/*void Watch(){
for(ll i=0;i<2*n;i++){
cout<<node[i]<<endl;
}
}*/
double Query() { //[a,b)
return node[1].first + node[1].second;
}
};
/**** LIS(Longest Increasing Subsequence) ****/
ll lis(ll *a, ll n, ll *dp) {
// a:数列 n:要素数 dp:dpテーブル 配列
fill(dp, dp + n, INF); // INFを代入
for (ll i = 0; i < n; i++)
*lower_bound(dp, dp + n, a[i]) = a[i];
return (ll)(lower_bound(dp, dp + n, INF) - dp);
}
/**** main function ****/
ll n, x, y;
ll ans;
string s, t;
map<ll, ll> mp;
vector<ll> a;
ll oklist[1000001];
ll kosu[1000001];
int main() {
cin >> n;
for (ll i = 0; i < n; i++) {
ll aa;
cin >> aa;
a.push_back(aa);
kosu[aa]++;
}
for (ll i = 0; i < 1000001; i++) {
oklist[i] = 1;
}
sort(a.begin(), a.end());
for (ll i = 0; i < n; i++) {
if (oklist[a[i]] == 1) {
if (kosu[a[i]] == 1)
ans++;
for (ll j = 1; a[i] * j <= 1000001; j++) {
oklist[a[i] * j] = 0;
}
}
}
cout << ans << endl;
}
| replace | 301 | 302 | 301 | 302 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
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;
}
vector<int> as;
int ns[200001];
vector<int> calc_divs(int n) {
vector<int> ans;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans.push_back(i);
if (i * i != n) {
ans.push_back(n / i);
}
}
}
sort(ans.begin(), ans.end());
return ans;
}
int main(void) {
int N;
cin >> N;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
ns[as[i]]++;
}
int ans = 0;
for (int i = 0; i < N; i++) {
vector<int> ds = calc_divs(as[i]);
// cout << "divs: " << endl;
// for (auto d : ds) {
// cout << d << " ";
// }
// cout << endl;
bool ok = true;
for (auto d : ds) {
if (ns[d] > 0) {
if (ns[d] > 1 || d != as[i]) {
ok = false;
break;
}
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
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;
}
vector<int> as;
int ns[1000001];
vector<int> calc_divs(int n) {
vector<int> ans;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans.push_back(i);
if (i * i != n) {
ans.push_back(n / i);
}
}
}
sort(ans.begin(), ans.end());
return ans;
}
int main(void) {
int N;
cin >> N;
as.resize(N);
for (int i = 0; i < N; i++) {
cin >> as[i];
ns[as[i]]++;
}
int ans = 0;
for (int i = 0; i < N; i++) {
vector<int> ds = calc_divs(as[i]);
// cout << "divs: " << endl;
// for (auto d : ds) {
// cout << d << " ";
// }
// cout << endl;
bool ok = true;
for (auto d : ds) {
if (ns[d] > 0) {
if (ns[d] > 1 || d != as[i]) {
ok = false;
break;
}
}
}
if (ok) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define I_MAX 2147483647
#define LL_MAX 9223372036854775807
#define ll long long
#define ld long double
struct XX {
int t;
int p;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
// 第2条件
if ((riLeft.t) == (riRight.t)) {
return riLeft.p <
riRight.p; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
// プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
// 第1条件
return (riLeft.t) < (riRight.t);
}
};
// map<long long,long long> prime_f(long long n){
// map<long long,long long>res;
// for(int i=2;i*i<=n;i++){
// while(n%i==0){
// ++res[i];
// n/=i;
// }
// }
// if(n!=1)res[n]=1;
// return res;
// }
// int n;
////int dat[2*10000000];
////int dat2[2*10000000];
// int dat[10];
// int dat2[10];
//
// void init(int n_){
// n=1;
// while(n<n_)n*=2;
// for(int i=0;i<2*n-1;i++){
// dat[i]=0;
// dat2[i]=0;
// }
// }
//
// void initset(int k,int a){
// k+=n-1;
// dat[k]=a;
// while(k>0){
// k=(k-1)/2;
// dat[k]=dat[k*2+1]+dat[k*2+2];
// }
// }
//
////[a,b)の間を[l,r]区間で比較しアップデート
////引数のindexに注意
////nは固定。initで計算すみ
////update2(L[i],R[i]+1,0,0,n,D[i]);
// void update2(int a,int b,int k,int l,int r,int v){//v更新値、区間は0-index
// if(r<=a || b<=l)return;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=v*(r-l);
// return;
// }else{
// update2(a,b,k*2+1,l,(l+r)/2,v);
// update2(a,b,k*2+2,(l+r)/2,r,v);
// return;
// }
// }
//
// int query(int a,int b,int k,int l,int r){
// if(r<=a || b<=l)return 0;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=0;
// return dat[k];
// }
// else{
// int vl=query(a,b,k*2+1,l,(l+r)/2);
// int vr=query(a,b,k*2+2,(l+r)/2,r);
// return vl+vr;
// }
// }
// void printb(unsigned int v) {
// unsigned int mask = (int)1 << (sizeof(v) * CHAR_BIT - 1);
// do putchar(mask & v ? '1' : '0');
// while (mask >>= 1);
// }
#ifdef DEBUG
ll a[200];
int cnt[1000001];
#else
ll a[200000];
int cnt[1000001];
#endif
int main(int argc, const char *argv[]) {
// scanf("%s",S);
// scanf("%d",&N);
// scanf("%lld %lld",&target1,&target2);
// sscanf(tmp.c_str(),"%dd%d%d",&time[i], &dice[i], &z[i]);
// getline(cin, target);
// ifstream ifs("01");//テスト用
// ifs >> a;
// ここから
// 入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt[a[i]]++;
}
for (int i = 0; i < n; i++) {
if (cnt[a[i]] != 1) {
cnt[a[i]] = 0;
}
ll ind = 2;
ll tmp = a[i] * ind;
while (tmp <= 1000000) {
cnt[tmp] = 0;
ind++;
tmp = a[i] * ind;
}
}
int ans = 0;
for (int i = 0; i <= 1000000; i++) {
ans += cnt[i];
}
cout << ans << endl;
// ここまで
// cout << "ans" << endl;
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define I_MAX 2147483647
#define LL_MAX 9223372036854775807
#define ll long long
#define ld long double
struct XX {
int t;
int p;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
// 第2条件
if ((riLeft.t) == (riRight.t)) {
return riLeft.p <
riRight.p; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
// プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
// 第1条件
return (riLeft.t) < (riRight.t);
}
};
// map<long long,long long> prime_f(long long n){
// map<long long,long long>res;
// for(int i=2;i*i<=n;i++){
// while(n%i==0){
// ++res[i];
// n/=i;
// }
// }
// if(n!=1)res[n]=1;
// return res;
// }
// int n;
////int dat[2*10000000];
////int dat2[2*10000000];
// int dat[10];
// int dat2[10];
//
// void init(int n_){
// n=1;
// while(n<n_)n*=2;
// for(int i=0;i<2*n-1;i++){
// dat[i]=0;
// dat2[i]=0;
// }
// }
//
// void initset(int k,int a){
// k+=n-1;
// dat[k]=a;
// while(k>0){
// k=(k-1)/2;
// dat[k]=dat[k*2+1]+dat[k*2+2];
// }
// }
//
////[a,b)の間を[l,r]区間で比較しアップデート
////引数のindexに注意
////nは固定。initで計算すみ
////update2(L[i],R[i]+1,0,0,n,D[i]);
// void update2(int a,int b,int k,int l,int r,int v){//v更新値、区間は0-index
// if(r<=a || b<=l)return;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=v*(r-l);
// return;
// }else{
// update2(a,b,k*2+1,l,(l+r)/2,v);
// update2(a,b,k*2+2,(l+r)/2,r,v);
// return;
// }
// }
//
// int query(int a,int b,int k,int l,int r){
// if(r<=a || b<=l)return 0;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=0;
// return dat[k];
// }
// else{
// int vl=query(a,b,k*2+1,l,(l+r)/2);
// int vr=query(a,b,k*2+2,(l+r)/2,r);
// return vl+vr;
// }
// }
// void printb(unsigned int v) {
// unsigned int mask = (int)1 << (sizeof(v) * CHAR_BIT - 1);
// do putchar(mask & v ? '1' : '0');
// while (mask >>= 1);
// }
#ifdef DEBUG
ll a[200];
int cnt[1000001];
#else
ll a[200000];
int cnt[1000001];
#endif
int main(int argc, const char *argv[]) {
// scanf("%s",S);
// scanf("%d",&N);
// scanf("%lld %lld",&target1,&target2);
// sscanf(tmp.c_str(),"%dd%d%d",&time[i], &dice[i], &z[i]);
// getline(cin, target);
// ifstream ifs("01");//テスト用
// ifs >> a;
// ここから
// 入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt[a[i]]++;
}
for (int i = 0; i < n; i++) {
if (cnt[a[i]] == 0) {
continue;
}
if (cnt[a[i]] != 1) {
cnt[a[i]] = 0;
}
ll ind = 2;
ll tmp = a[i] * ind;
while (tmp <= 1000000) {
cnt[tmp] = 0;
ind++;
tmp = a[i] * ind;
}
}
int ans = 0;
for (int i = 0; i <= 1000000; i++) {
ans += cnt[i];
}
cout << ans << endl;
// ここまで
// cout << "ans" << endl;
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
| insert | 153 | 153 | 153 | 156 | TLE | |
p02642 | C++ | Runtime Error | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
set<int> s;
vector<int> v;
int sieve[100001] = {0};
int max = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (s.find(x) == s.end()) {
s.insert(x);
v.push_back(x);
if (x > max)
max = x;
} else {
sieve[x] = 1;
}
}
for (int i = 0; i < v.size(); i++) {
int j = 2;
while ((v[i] * j) <= max) {
sieve[v[i] * j] = 1;
j++;
}
}
int count = 0;
for (int i = 0; i < v.size(); i++) {
if (sieve[v[i]] == 0)
count++;
}
cout << count;
} | #include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
set<int> s;
vector<int> v;
int sieve[1000001] = {0};
int max = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (s.find(x) == s.end()) {
s.insert(x);
v.push_back(x);
if (x > max)
max = x;
} else {
sieve[x] = 1;
}
}
for (int i = 0; i < v.size(); i++) {
int j = 2;
while ((v[i] * j) <= max) {
sieve[v[i] * j] = 1;
j++;
}
}
int count = 0;
for (int i = 0; i < v.size(); i++) {
if (sieve[v[i]] == 0)
count++;
}
cout << count;
}
| replace | 9 | 10 | 9 | 10 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.