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 sync \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, n... | #include <bits/stdc++.h>
using namespace std;
#define sync \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define rep(i, n... | replace | 66 | 68 | 66 | 70 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long... | #include <bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long... | replace | 16 | 17 | 16 | 17 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long... | #include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long... | replace | 15 | 16 | 15 | 16 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> A;
std::vector<int> Done;
int maxa = 0;
for (int i = 0; i < n; i++) {
int a;
std::cin >> a;
maxa = std::max(maxa, a);
A.push_back(a);
}
std::sort(A.begin(), A.end());
bool no... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> A;
std::vector<int> Done;
int maxa = 0;
for (int i = 0; i < n; i++) {
int a;
std::cin >> a;
maxa = std::max(maxa, a);
A.push_back(a);
}
std::sort(A.begin(), A.end());
bool no... | delete | 31 | 33 | 31 | 31 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
constexpr char ln = ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
constexpr char ln = ... | replace | 42 | 44 | 42 | 44 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void seive(vector<int> &fact, int n, vector<int> a, int r) {
int i = 0;
while (i < n) {
int k = a[i];
for (int j = k; j <= r; j += k) {
// cout<<j<<endl;
fact[j]++;
}
i++;
}
}
int main() {
std::ios::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void seive(vector<int> &fact, int n, vector<int> a, int r) {
int i = 0;
while (i < n) {
int k = a[i];
for (int j = k; j <= r; j += k) {
// cout<<j<<endl;
fact[j]++;
}
i++;
}
}
int main() {
std::ios::sync_with_stdi... | insert | 27 | 27 | 27 | 28 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(100001, 0);
vector<int> has(1000001, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.begin() + N);
/*for(int i = 0; i < N; i++){
cout << A[i] << ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(2 * 100001, 0);
vector<int> has(1000001, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.begin() + N);
/*for(int i = 0; i < N; i++){
cout << A[i]... | replace | 12 | 13 | 12 | 13 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | replace | 59 | 60 | 59 | 60 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define INF = 1000000100;
#define rep(i, n) for (int i = 0; i < n; i++)
const int M =... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define INF = 1000000100;
#define rep(i, n) for (int i = 0; i < n; i++)
const int M =... | replace | 21 | 22 | 21 | 22 | -11 | |
p02642 | Python | Time Limit Exceeded | N = int(input())
X = list(map(int, input().split()))
MAX = 10**6 + 1
prime = [True] * MAX
counted = set()
for v in X:
if v in counted:
prime[v] = False
for j in range(2 * v, MAX, v):
prime[j] = False
counted.add(v)
ans = 0
for v in X:
ans += int(prime[v])
print(ans)
| N = int(input())
X = list(map(int, input().split()))
MAX = 10**6 + 1
prime = [True] * MAX
counted = set()
for v in X:
if v in counted:
prime[v] = False
continue
for j in range(2 * v, MAX, v):
prime[j] = False
counted.add(v)
ans = 0
for v in X:
ans += int(prime[v])
print(ans)
| insert | 9 | 9 | 9 | 10 | TLE | |
p02642 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
a.sort()
flag = False
b = [False] * 1000010
for i in range(n - 1):
if a[i] == a[i + 1]:
for j in range(a[i], 1000010, a[i]):
b[j] = True
ans = 0
for i in range(n):
if not b[a[i]]:
ans += 1
for j in range(a[i], 1000010, a[i... | n = int(input())
a = list(map(int, input().split()))
a.sort()
flag = False
b = [False] * 1000010
for i in range(n - 1):
if a[i] == a[i + 1]:
if b[a[i]]:
continue
for j in range(a[i], 1000010, a[i]):
b[j] = True
ans = 0
for i in range(n):
if not b[a[i]]:
ans += 1
... | insert | 7 | 7 | 7 | 9 | TLE | |
p02642 | Python | Runtime Error | n = int(input())
a = list(map(int, input().split()))
xs = [0] * (2 * (10**5) + 1)
for v in a:
if xs[v] == 0:
for j in range(v, len(xs), v):
xs[j] += 1
else:
xs[v] += 1
print(len(list(filter(lambda v: xs[v] == 1, a))))
| n = int(input())
a = list(map(int, input().split()))
xs = [0] * (max(a) + 1)
for v in a:
if xs[v] == 0:
for j in range(v, len(xs), v):
xs[j] += 1
else:
xs[v] += 1
print(len(list(filter(lambda v: xs[v] == 1, a))))
| replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
bool divide[200005] = {};
vector<int> a;
int n;
int main(void) {
ios::sync_with_stdio(false)... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
bool divide[1000005] = {};
vector<int> a;
int n;
int main(void) {
ios::sync_with_stdio(false... | replace | 14 | 15 | 14 | 15 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 200000
#define M 100001
int n;
vector<int> u(M, 0);
vector<int> a(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 ... | #include <bits/stdc++.h>
using namespace std;
#define N 200000
#define M 1001001
int n;
vector<int> u(M, 0);
vector<int> a(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... | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Runtime Error | #include <iostream>
using namespace std;
int a[200005], vis[200005], flag[1000005];
void slove(int x) {
for (int i = 2;; i++) {
int t = x * i;
if (t > 1e6)
return;
flag[t] = 1;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
... | #include <iostream>
using namespace std;
int a[200005], vis[1000005], flag[1000005];
void slove(int x) {
for (int i = 2;; i++) {
int t = x * i;
if (t > 1e6)
return;
flag[t] = 1;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int SetInput(vector<int> &vec) {
int size;
cin >> size;
for (int i = 0; i < size; ++i) {
int value;
cin >> value;
vec.at(i) = value;
}
vec.resize(size);
return size;
}
int Calc(vector<int> &input) {
// ふるい
con... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int SetInput(vector<int> &vec) {
int size;
cin >> size;
for (int i = 0; i < size; ++i) {
int value;
cin >> value;
vec.at(i) = value;
}
vec.resize(size);
return size;
}
int Calc(vector<int> &input) {
// ふるい
con... | replace | 40 | 41 | 40 | 41 | TLE | |
p02642 | C++ | Time Limit Exceeded | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using ll = long long;
using P = pair<ll, ll>;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
l... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using ll = long long;
using P = pair<ll, ll>;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
l... | replace | 16 | 17 | 16 | 17 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define se second
#define fi first
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define ppll pair<pll, pll>
#define pii pair<int, int>
#define piii pair<pii, int>
#define pb push_back
const ll llinf = 2e... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define se second
#define fi first
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define plll pair<pll, ll>
#define ppll pair<pll, pll>
#define pii pair<int, int>
#define piii pair<pii, int>
#define pb push_back
const ll llinf = 2e... | replace | 34 | 35 | 34 | 35 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007... | replace | 35 | 36 | 35 | 36 | 0 | |
p02642 | C++ | Time Limit Exceeded | // author rhythmicankur
// god_is_almighty
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ll int
#define ld long double
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define vi vector<int>
#define pii pair... | // author rhythmicankur
// god_is_almighty
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define ll int
#define ld long double
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define vi vector<int>
#define pii pair... | insert | 83 | 83 | 83 | 86 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) \
for (auto elementPrintVec : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) \
for (auto elementPrintVec : x) { ... | replace | 31 | 32 | 31 | 32 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> arr[i];
mp[arr[i]]++;
}
sort(arr, arr + n);
int maxi = mp.rbegin()->first;
// cout<<maxi<<endl;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> arr[i];
mp[arr[i]]++;
}
sort(arr, arr + n);
int maxi = mp.rbegin()->first;
// cout<<maxi<<endl;
for (int i = 0; i < n; i++) {
... | replace | 22 | 23 | 22 | 24 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n = 0;
cin >> n;
vector<int> v(n, 0);
vector<int> cnt(1e6 +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n = 0;
cin >> n;
vector<int> v(n, 0);
vector<int> cnt(1e6 +... | replace | 33 | 34 | 33 | 34 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | replace | 356 | 357 | 356 | 357 | -11 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 1 + (int)2e5;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
int ans = 0;
int AA[NMAX] = {};
for (int i = 0; i < N; i++) {
bool flag = true;
if (i > 0) {
AA[A[i - ... | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 1 + (int)1e6;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
int ans = 0;
int AA[NMAX] = {};
for (int i = 0; i < N; i++) {
bool flag = true;
if (i > 0) {
AA[A[i - ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const static in... | #include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const static in... | replace | 31 | 32 | 31 | 32 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int f[maxn];
int nope[maxn];
int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = 1; i <= n; i++) {
int k = a[i];
f[k]++;
for (int j = k + k; j < maxn; j += k)
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int f[maxn];
int nope[maxn];
int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
for (int i = 1; i <= n; i++) {
int k = a[i];
f[k]++;
if (f[k] == 1)
for (int j = k + ... | replace | 19 | 21 | 19 | 22 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
vector<ll> load[100005];
typedef pair<ll, ll> Pair;
int main() {
l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
vector<ll> load[100005];
typedef pair<ll, ll> Pair;
int main() {
l... | replace | 31 | 32 | 31 | 32 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
ret.push_back(1);
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
ret.push_back(1);
for (int64_t i = 2; i * i <= n; i++) {
if (n % i == 0) {
... | insert | 36 | 36 | 36 | 43 | TLE | |
p02642 | C++ | Runtime Error | // Apparat : drobucs, aleonov, vit_72
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
// #pragma warning(disable : 4996)
// #pragma GCC optimize("O3")
using names... | // Apparat : drobucs, aleonov, vit_72
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
// #pragma warning(disable : 4996)
// #pragma GCC optimize("O3")
using names... | replace | 31 | 32 | 31 | 32 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll lo... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll lo... | replace | 15 | 17 | 15 | 17 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using pll = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, l, r) for (ll i = (l); i <= (ll)(r); i++)
#define rep3(i, l, r) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using pll = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, l, r) for (ll i = (l); i <= (ll)(r); i++)
#define rep3(i, l, r) for... | insert | 448 | 448 | 448 | 452 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> V;
vector<int> resposta;
int vis[100100];
int crivo(int limite, int ind) {
int cont = 0;
for (int i = 0; i < ind; i++) {
if (vis[V[i]] == 0) {
vis[V[i]] = 2;
cont++;
for (int j = 2 * V[i]; j <= limite... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> V;
vector<int> resposta;
int vis[1001000];
int crivo(int limite, int ind) {
int cont = 0;
for (int i = 0; i < ind; i++) {
if (vis[V[i]] == 0) {
vis[V[i]] = 2;
cont++;
for (int j = 2 * V[i]; j <= limit... | replace | 7 | 8 | 7 | 8 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define show(x) ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define show(x) ... | replace | 35 | 45 | 35 | 39 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
/*
// AUTHOR wiley_codechef
// TASK : Atcoder
//--------------------------------HEADERS-------------------------------------------------------------//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#incl... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
/*
// AUTHOR wiley_codechef
// TASK : Atcoder
//--------------------------------HEADERS-------------------------------------------------------------//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#incl... | replace | 33 | 203 | 33 | 34 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int M = 1000005;
int main(void) {
int N;
cin >> N;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans(0);
vector<int> dp(M, 0);
int p;
for (auto e : A) {
if (dp[p]... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int M = 1000005;
int main(void) {
int N;
cin >> N;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans(0);
vector<int> dp(M, 0);
int p;
for (auto e : A) {
if (dp[e]... | replace | 22 | 24 | 22 | 24 | 0 | |
p02642 | Python | Runtime Error | from collections import Counter
n = int(input())
alist = [int(v) for v in input().split()]
dup_set = {k for k, v in Counter(alist).items() if v >= 2}
alist = sorted(set(alist))
adict = {a: False for a in alist}
a_max = alist[-1]
max_ind = -1
count = 0
if 1 in adict:
count = 0 if 1 in dup_set else 1
else:
for ... | from collections import Counter
n = int(input())
alist = [int(v) for v in input().split()]
dup_set = {k for k, v in Counter(alist).items() if v >= 2}
alist = sorted(set(alist))
adict = {a: False for a in alist}
a_max = alist[-1]
max_ind = -1
count = 0
if 1 in adict:
count = 0 if 1 in dup_set else 1
else:
for ... | replace | 24 | 25 | 24 | 26 | 0 | |
p02642 | Python | Runtime Error | from numba import njit
@njit(cache=True)
def fact(x):
i = 1
while i * i <= x:
if x % i == 0:
yield i
yield x // i
i += 1
def main():
n = int(input())
a = tuple(map(int, input().split()))
c = [0] * (max(a) + 1)
for e in a:
c[e] += 1
ans =... | from numba import njit
@njit(fastmath=True)
def fact(x):
i = 1
while i * i <= x:
if x % i == 0:
yield i
yield x // i
i += 1
def main():
n = int(input())
a = tuple(map(int, input().split()))
c = [0] * (max(a) + 1)
for e in a:
c[e] += 1
an... | replace | 3 | 4 | 3 | 4 | ModuleNotFoundError: No module named 'numba' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02642/Python/s936960783.py", line 1, in <module>
from numba import njit
ModuleNotFoundError: No module named 'numba'
|
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, ... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, ... | replace | 91 | 92 | 91 | 92 | TLE | |
p02642 | C++ | Runtime Error | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#... | /**Function Template**/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for (ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(), (a).end()
#... | replace | 197 | 198 | 197 | 198 | 0 | |
p02642 | C++ | Time Limit Exceeded | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef ... | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef ... | replace | 58 | 64 | 58 | 66 | TLE | |
p02642 | C++ | Runtime Error | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | replace | 185 | 186 | 185 | 186 | 0 | |
p02642 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
cand = set(a)
exist = set()
dup = set()
for item in a:
if item in exist:
dup.add(item)
else:
exist.add(item)
dame_set = set()
a.sort()
ret = 0
for val in a:
if val in dup:
i = 1
cnt = 10**6 // val
while i <= cn... | n = int(input())
a = list(map(int, input().split()))
cand = set(a)
exist = set()
dup = set()
for item in a:
if item in exist:
dup.add(item)
else:
exist.add(item)
dame_set = set()
a.sort()
ret = 0
for val in a:
if val in dup:
if val in dame_set:
continue
else:... | replace | 20 | 27 | 20 | 30 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | replace | 84 | 85 | 84 | 85 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
vector<long long> divisor(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
vector<long long> divisor(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == ... | replace | 22 | 23 | 22 | 23 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | replace | 27 | 30 | 27 | 30 | 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 ll long long
#define pp pair<ll, ll>
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll MOD = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
ll mod = INF;
int main() {
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<ll, ll>
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll MOD = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
ll mod = INF;
int main() {
int... | insert | 24 | 24 | 24 | 26 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#i... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#i... | replace | 170 | 171 | 170 | 171 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <se... | insert | 49 | 49 | 49 | 51 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const ll mod = 1e9;
const int inf = 0x3f3f3f3f;
int a[200005];
int isp[1000005];
int boom[1000005];
vector<int> v;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
boom[a[i]]++;
}
int ans = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const ll mod = 1e9;
const int inf = 0x3f3f3f3f;
int a[200005];
int isp[1000005];
int boom[1000005];
vector<int> v;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
boom[a[i]]++;
}
int ans = 0;
for (... | replace | 24 | 25 | 24 | 25 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ ... | insert | 76 | 76 | 76 | 78 | TLE | |
p02642 | C++ | Time Limit Exceeded | /* [Template].cpp
Example code to use when starting new code. This particular problem was problem
977A_Wrong_Subtraction from CodeForces
Compile: g++ -o D.exe D.cpp
Execute: ./D
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
... | /* [Template].cpp
Example code to use when starting new code. This particular problem was problem
977A_Wrong_Subtraction from CodeForces
Compile: g++ -o D.exe D.cpp
Execute: ./D
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
... | insert | 34 | 34 | 34 | 48 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (ll i = 0; i < (ll)n; ++i)
#define REPN(i, m, n) for (ll i = m; i < (ll)n; ++i)
#define REVREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define VL vector<ll>
#defin... | #include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (ll i = 0; i < (ll)n; ++i)
#define REPN(i, m, n) for (ll i = m; i < (ll)n; ++i)
#define REVREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define VL vector<ll>
#defin... | replace | 55 | 56 | 55 | 56 | TLE | |
p02642 | C++ | Time Limit Exceeded | // Rishabh Agarwal
#include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
const ll INF = 1e18;
long double PI = 3.1415926;
map<ll, ll> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL... | // Rishabh Agarwal
#include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
const ll INF = 1e18;
long double PI = 3.1415926;
map<ll, ll> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL... | replace | 33 | 34 | 33 | 34 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(... | replace | 59 | 61 | 59 | 64 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
typedef vector<ll> vl;
#define rp(i, f, t) for (long long int i = f; i < t; i++)
#define pr(i, f, t) for (long long int i = t - 1; i >= f; i--)
#define ca(n, a) \... | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
typedef vector<ll> vl;
#define rp(i, f, t) for (long long int i = f; i < t; i++)
#define pr(i, f, t) for (long long int i = t - 1; i >= f; i--)
#define ca(n, a) \... | replace | 30 | 31 | 30 | 32 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
sort(a.begin(), a.end());
vector<int> yakusuu(1000005, 0);
rep(i, n) {
int x = a.at... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
sort(a.begin(), a.end());
vector<int> yakusuu(1000005, 0);
rep(i, n) {
int x = a.at... | insert | 19 | 19 | 19 | 23 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> xs(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
xs[i] = x;
mp[x]++;
}
int bound = 1000010;
vector<bool> table(bound);
sort(xs.begin(), xs.end());
int... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> xs(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
xs[i] = x;
mp[x]++;
}
int bound = 1000010;
vector<bool> table(bound);
sort(xs.begin(), xs.end());
int... | replace | 25 | 27 | 25 | 29 | TLE | |
p02642 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc170/tasks/abc170_d
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i... | // https://atcoder.jp/contests/abc170/tasks/abc170_d
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i... | insert | 94 | 94 | 94 | 95 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#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##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__,... | #include <bits/stdc++.h>
#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##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__,... | replace | 37 | 42 | 37 | 50 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
bool good[1000005];
int a[200005], rep[1000005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v;
memset(rep, 0, sizeof rep);
for (int i = 1; i <= n; i++) {
cin >> a[i];
rep[a[i]]++;
v.... | #include <bits/stdc++.h>
using namespace std;
bool good[1000005];
int a[200005], rep[1000005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> v;
memset(rep, 0, sizeof rep);
for (int i = 1; i <= n; i++) {
cin >> a[i];
rep[a[i]]++;
v.... | insert | 17 | 17 | 17 | 18 | TLE | |
p02642 | C++ | Time Limit Exceeded | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | insert | 76 | 76 | 76 | 79 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio \
ios_base::sync_with_stdio(0); ... | replace | 58 | 59 | 58 | 59 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int mai... | #include <bits/stdc++.h>
using namespace std;
vector<int> divisor(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main() {
int N;
cin >> ... | replace | 3 | 6 | 3 | 6 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#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>;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
re... | #include <algorithm>
#include <cmath>
#include <iostream>
#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>;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
re... | replace | 21 | 22 | 21 | 22 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[200001], v[100001];
bool b[1000001];
int main() {
int n, maxn;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
v[a[i]]++;
maxn = max(maxn, a[i]);
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
for (int now = 1; now <= n; now... | #include <bits/stdc++.h>
using namespace std;
int a[200001], v[1000001];
bool b[1000001];
int main() {
int n, maxn;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
v[a[i]]++;
maxn = max(maxn, a[i]);
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
for (int now = 1; now <= n; no... | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Time Limit Exceeded | // bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statist... | // bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statist... | insert | 55 | 55 | 55 | 57 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long ... | replace | 62 | 63 | 62 | 63 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A.at(i);
}
vector<int> X(100001);
for (int a : A) {
X[a] += 1;
}
int c = 0;
for (int a : A) {
X[a] -= 1;
int q,... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A.at(i);
}
vector<int> X(1000001);
for (int a : A) {
X[a] += 1;
}
int c = 0;
for (int a : A) {
X[a] -= 1;
int q... | replace | 11 | 12 | 11 | 12 | 0 | |
p02642 | C++ | Time Limit Exceeded | /// in the name of Allah the most beneficent the most merciful.
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
// #define mod2 20071027
// #define MOD 998244353
#define base 139
// #define mod 1000074259
#define base2 31
#define memz(a) memse... | /// in the name of Allah the most beneficent the most merciful.
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
// #define mod2 20071027
// #define MOD 998244353
#define base 139
// #define mod 1000074259
#define base2 31
#define memz(a) memse... | replace | 35 | 37 | 35 | 39 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 5;
int f[N], dp[N];
void compute() {
for (int i = 1; i < N; ++i) {
if (f[i] > 0) {
if (f[i] > 1)
dp[i] = 1;
for (int j = 2; i * j < N; ++j)
dp[i * j] = 1;
}
}
return;
}
int32_t main()... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
int f[N], dp[N];
void compute() {
for (int i = 1; i < N; ++i) {
if (f[i] > 0) {
if (f[i] > 1)
dp[i] = 1;
for (int j = 2; i * j < N; ++j)
dp[i * j] = 1;
}
}
return;
}
int32_t main()... | replace | 5 | 6 | 5 | 6 | 0 | |
p02642 | C++ | Runtime Error | // Author: pankaj_m05
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define f_in(file) freopen(file, "r", stdin)
#define f_out(file) freopen(file, "w", stdout)
#... | // Author: pankaj_m05
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define f_in(file) freopen(file, "r", stdin)
#define f_out(file) freopen(file, "w", stdout)
#... | replace | 57 | 62 | 57 | 58 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int, bool> m;
set<int> s;
rep(i, n) {
cin >> a[i];
if (s.count(a[i])) {
m[a[i]] = true;
} else {
s.insert(a[i]);
}
}
vector<bool> b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int, bool> m;
set<int> s;
rep(i, n) {
cin >> a[i];
if (s.count(a[i])) {
m[a[i]] = true;
} else {
s.insert(a[i]);
}
}
vector<bool> b... | replace | 19 | 20 | 19 | 20 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | insert | 53 | 53 | 53 | 57 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define REP(i, j, n) for (int i = j; i < n; i++)
#define rep(i, n) REP(i, 0, 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) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define REP(i, j, n) for (int i = j; i < n; i++)
#define rep(i, n) REP(i, 0, 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) {
... | replace | 17 | 18 | 17 | 18 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <... | #include <algorithm>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <... | replace | 268 | 269 | 268 | 269 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long LL;
int n, a[N], ans, vis[N];
int main() {
cin >> n;
ans = n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
vis[a[i]]++;
}
for (int i = 1; i <= n; i++) {
int ok = 0;
for (int j = 2; j <= sqrt(a[i]); j++)
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
typedef long long LL;
int n, a[N], ans, vis[N];
int main() {
cin >> n;
ans = n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
vis[a[i]]++;
}
for (int i = 1; i <= n; i++) {
int ok = 0;
for (int j = 2; j <= sqrt(a[i]); j++)
... | replace | 3 | 4 | 3 | 4 | 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 rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<Int, Int> P;
int main() {
int N;
cin >> N;
set<int> A;
vector<int> kosuu(100010, 0);
rep(i, N) {
int a;
cin >> a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<Int, Int> P;
int main() {
int N;
cin >> N;
set<int> A;
vector<int> kosuu(1000010, 0);
rep(i, N) {
int a;
cin >> ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i-- > 0;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define ... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i-- > 0;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define ... | replace | 692 | 693 | 692 | 693 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main() {
int n;
cin >> n;
vector<bool> era(200001, false);
vector<int> a(n);
vector<int> check;
rep(i, n) {
cin >> a[i];
if (era[a[i]])
check.emp... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main() {
int n;
cin >> n;
vector<bool> era(1000001, false);
vector<int> a(n);
vector<int> check;
rep(i, n) {
cin >> a[i];
if (era[a[i]])
check.em... | replace | 10 | 11 | 10 | 11 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
#define pb push_back
#define sc(n) scanf("%d", &n)
#define lsc(n) scanf("%lld", &n)
#define all(x) x.begin(), x.end()
#define rep(i, n) for (i = 0; i < n; i++)
#define rep1(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
#define pb push_back
#define sc(n) scanf("%d", &n)
#define lsc(n) scanf("%lld", &n)
#define all(x) x.begin(), x.end()
#define rep(i, n) for (i = 0; i < n; i++)
#define rep1(... | replace | 49 | 50 | 49 | 50 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define FOR(i, b, n) for (ll i = b; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve(ll N, vector<ll> A) {
sort(A.begin(), A.end());
vector<bool> prime(A.back(), false);
REP(i, N)
prime[A[i]] = tr... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define FOR(i, b, n) for (ll i = b; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve(ll N, vector<ll> A) {
sort(A.begin(), A.end());
vector<bool> prime(A.back() + 1, false);
REP(i, N)
prime[A[i]] ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02642 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#in... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#in... | insert | 127 | 127 | 127 | 131 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define ll long long
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define f first
#define s second
using namespace std;
const int N = 1e3 + 2;
const int M = 1e8;
int cnt[N];
int a[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cou... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define ll long long
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define f first
#define s second
using namespace std;
const int N = 1e6 + 2;
const int M = 1e8;
int cnt[N];
int a[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cou... | replace | 8 | 9 | 8 | 9 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR \
if (DEBUG) \
cerr
#define MACRO(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, NAME, ...) NAME
#define pr(...) ... | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR \
if (DEBUG) \
cerr
#define MACRO(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, NAME, ...) NAME
#define pr(...) ... | insert | 84 | 84 | 84 | 86 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vect... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vect... | replace | 67 | 69 | 67 | 73 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pa... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pa... | replace | 23 | 24 | 23 | 24 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) ... | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) ... | insert | 210 | 210 | 210 | 218 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define foi(i, n) for (int i = 0; i < n; i++)
#define Foi(i, k, n) \
for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define fol(i, n) for (ll i = 0; i < n; i++)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define foi(i, n) for (int i = 0; i < n; i++)
#define Foi(i, k, n) \
for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define fol(i, n) for (ll i = 0; i < n; i++)
#defin... | replace | 83 | 84 | 83 | 84 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | replace | 24 | 25 | 24 | 25 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
sort(v.beg... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
sort(v.beg... | insert | 18 | 18 | 18 | 21 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | replace | 280 | 282 | 280 | 283 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define debug(...) __VA_ARGS__
#else
#define endl '\n'
#define debug(...)
#endif
#define debugf(...) debug(printf(__VA_ARGS__))
const int N = 2e5 + 5;
int a[N];
int f[N], F[N];
int(((((main)))))() <%
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.... | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define debug(...) __VA_ARGS__
#else
#define endl '\n'
#define debug(...)
#endif
#define debugf(...) debug(printf(__VA_ARGS__))
const int N = 1e6 + 5;
int a[N];
int f[N], F[N];
int(((((main)))))() <%
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.... | replace | 11 | 12 | 11 | 12 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(con... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(con... | replace | 23 | 24 | 23 | 24 | 0 | |
p02642 | C++ | Time Limit Exceeded |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... | replace | 685 | 687 | 685 | 689 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
for (int a = 0; a < N; a++)
cin >> V.at(a);
vector<int> W(1000000, 0);
for (int i = 0; i < N; i++) {
for (int i2 = 1; i2 * V.at(i) <= 1000000; i2++)
W.at(i2 * V.at(i) - 1)++;
}
int ans = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
for (int a = 0; a < N; a++)
cin >> V.at(a);
vector<int> W(1000000, 0);
for (int i = 0; i < N; i++) {
if (W.at(V.at(i) - 1) >= 1)
W.at(V.at(i) - 1)++;
else {
for (int i2 = 1; i2 * V.at(i) ... | replace | 12 | 14 | 12 | 19 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optim... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optim... | replace | 87 | 88 | 87 | 89 | -8 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <strin... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <strin... | replace | 43 | 45 | 43 | 47 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | replace | 23 | 24 | 23 | 24 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define endl "\n"
#define ll long long
#define int long long
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define endl "\n"
#define ll long long
#define int long long
#define fast \
ios_base::sync_with_stdio(false); ... | replace | 35 | 36 | 35 | 36 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.