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_po... | #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_po... | 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>
#includ... | #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>
#includ... | 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 (... | #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 (... | 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 (... | #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 (... | 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 ... | #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 ... | 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};
i... | #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};
i... | 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 ... | #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];
in... | 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 << set... | #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 << se... | 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... | #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... | 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);
ci... | #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);
ci... | 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>
#defi... | #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>
#defi... | 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;
#defin... | #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;
#defin... | 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;
fo... | #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;
fo... | 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 ... | #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 ... | 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 ... | #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 ... | 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]] =... | #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]] =... | 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... | #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 ... | 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_divisi... | #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);
... | 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... | #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... | 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] = {... | #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] = {... | 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 =... | #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 =... | 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++... | #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++... | 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... | /* 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... | 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;
#defi... | #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;
#defi... | 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 = ... | #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 = ... | 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 ... | #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 ... | 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... | #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[a... | 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 ... | #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 ... | 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 (... | #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 (... | 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 <... | #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 <... | 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 ... | #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 ... | 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
... | #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
... | 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]++;... | #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]+... | 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 Debu... | /******************************************************************************
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 Debu... | 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) ... | #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) ... | 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... | #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 && ... | 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 = 1... | #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 = 1... | 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... | #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... | 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; ... | #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; ... | 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)
... | #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)
... | 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]; }
so... | #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]; }
so... | 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;
... | #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;
... | 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 *... | #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 *... | 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,... | #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,... | 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 = ma... | #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 = ma... | 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;
... | #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;
... | 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++) {
... | #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++) {
... | 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));
re... | #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));
re... | 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++) {
... |
#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++) ... | 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);
... | #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);
... | 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(), ... | #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(), ... | 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... | #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... | 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;
c... | #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;
c... | 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> usin... | #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> usin... | 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... | #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... | 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 ... | #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]++;
}
}
... | 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 >... | #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 >... | 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) { ... | #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) { ... | 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());... | #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())... | 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;
... | #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;... | 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<i... | // #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<i... | 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]... | #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 <= ... | 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]... | #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]... | 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 ... | #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 ... | 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) {
... | #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) {
... | 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 "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | 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;
... | #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] < M... | 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 ... | #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 ... | 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 <= 1000... | #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;... | 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 ... | #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 ... | 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_popc... | // 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_popc... | 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;
}... | #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;
}... | 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.... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast() \
ios_base ::sync_with_stdio(0); \
cin.tie(0); \
cout.... | 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... | #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... | 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 <cst... | #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 <cst... | 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 (in... | #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 (i... | 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 = n... | #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] != ... | 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) \
{ ... | #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) \
{ ... | 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;... | #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]... | 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::vec... | #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::vec... | 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) ... | #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) ... | 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")
... | #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")
... | 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
... | #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
... | 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++) {... | #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++) {... | 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... | #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... | 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++) {
... | #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++) {
... | 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) {
... | #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[... | 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]++... | #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)
cn... | 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)
#d... | #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)
#d... | 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... | #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... | 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... | #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<... | 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()... | #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()... | 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 ... | #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 ... | 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 =... | #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;
fo... | 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() ... | #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() ... | 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; ... | #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; ... | 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;
... | #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;
... | 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 <cl... | #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 <cl... | 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;
#defi... | #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;
#defi... | 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 ... | #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... | 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.