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>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = mod(r... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = mod(r... | insert | 45 | 45 | 45 | 47 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INFINITO... | #include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INFINITO... | replace | 29 | 30 | 29 | 31 | TLE | |
p02642 | C++ | Runtime Error | // #include<bits/stdc++.h>
// #define IOS ios::sync_with_stdio(0);cin.tie(0);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
bo... | // #include<bits/stdc++.h>
// #define IOS ios::sync_with_stdio(0);cin.tie(0);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
bo... | replace | 13 | 15 | 13 | 15 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pii pair<int, int>
int N;
int A[200010];
int mem[1000010];
int num[1000010];
signed main() {
cin >> N;
rep(i, N) {
cin >> A[i];
num[A[i]]++;
}
sort(A, A + N);
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pii pair<int, int>
int N;
int A[200010];
int mem[1000010];
int num[1000010];
signed main() {
cin >> N;
rep(i, N) {
cin >> A[i];
num[A[i]]++;
}
sort(A, A + N);
int ans = 0;
... | replace | 25 | 27 | 25 | 28 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int64_t INF = 1LL << 60;
int main... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int64_t INF = 1LL << 60;
int main... | replace | 29 | 30 | 29 | 30 | 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++)
int main() {
int n;
cin >> n;
int m = 100000001;
vector<int> ans(m, 0), a(n, 0);
int maxidx = 0;
rep(i, n) {
cin >> a[i];
maxidx = max(a[i], maxidx);
}
set<int> nums;
for (auto i : a) {
if (a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
int n;
cin >> n;
int m = 1000005;
vector<int> ans(m, 0), a(n, 0);
int maxidx = 0;
rep(i, n) {
cin >> a[i];
maxidx = max(a[i], maxidx);
}
set<int> nums;
for (auto i : a) {
if (ans... | replace | 7 | 8 | 7 | 8 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 2e5 + 555;
const int MOD = 1e9 + 7;
int mp[maxn];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
vector<int> V(n);
for (int &i : V) {
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 2e6 + 555;
const int MOD = 1e9 + 7;
int mp[maxn];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
vector<int> V(n);
for (int &i : V) {
cin... | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Runtime Error | #define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cout << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define d... | #define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cout << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define d... | replace | 57 | 58 | 57 | 58 | 0 | |
p02642 | C++ | Time Limit Exceeded | // インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... | // インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> ... | insert | 99 | 99 | 99 | 102 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
... | replace | 89 | 90 | 89 | 90 | TLE | |
p02642 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod = 1e+9 + 7;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0,... | // #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod = 1e+9 + 7;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0,... | replace | 21 | 25 | 21 | 26 | TLE | |
p02642 | C++ | Runtime Error | /*
Created by Ezio112
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
ll inf(1e18);
#define mod ll(1e9 + 7)
// #define mod ll(998244353)
#define ff first
#define ss second
ll power(ll a, ll b) {
if (!b)
return 1;
ll dp = power(a, b / 2) % mod;
if (b & 1)
... | /*
Created by Ezio112
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
ll inf(1e18);
#define mod ll(1e9 + 7)
// #define mod ll(998244353)
#define ff first
#define ss second
ll power(ll a, ll b) {
if (!b)
return 1;
ll dp = power(a, b / 2) % mod;
if (b & 1)
... | replace | 38 | 39 | 38 | 39 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | replace | 57 | 58 | 57 | 58 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp make_pair
#define sz(x) ((int)(x).size())
#define endl "\n"
#define fastio \
ios_base::sync_with_stdio(false); \
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp make_pair
#define sz(x) ((int)(x).size())
#define endl "\n"
#define fastio \
ios_base::sync_with_stdio(false); \
... | replace | 29 | 30 | 29 | 30 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
for (in... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE> void print_vec(const vector<TYPE> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE> void print_vec2(const vector<vector<TYPE>> &v) {
cout << endl;
for (in... | replace | 37 | 38 | 37 | 38 | TLE | |
p02642 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int M = 1000005;
int cnt[M];
for (int i = 0; i < M; i++) {
cnt[i] = 0;
}
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
if (cnt[A[i]] > 1) {
break;
} else {
for (... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int M = 1000005;
int cnt[M];
for (int i = 0; i < M; i++) {
cnt[i] = 0;
}
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
if (cnt[A[i]] > 1) {
continue;
} else {
fo... | replace | 18 | 19 | 18 | 19 | 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++)
int64_t MOD = 1000000007;
int main() {
int N, ans = 0;
cin >> N;
vector<int64_t> A(N);
vector<bool> div(1000050, true);
rep(i, N) cin >> A.at(i);
sort(A.begin(), A.end());
rep(i, N) {
int64_t k = A.at(i)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD = 1000000007;
int main() {
int N, ans = 0;
cin >> N;
vector<int64_t> A(N);
vector<bool> div(1000050, true);
rep(i, N) cin >> A.at(i);
sort(A.begin(), A.end());
rep(i, N) {
int64_t k = A.at(i)... | replace | 19 | 23 | 19 | 21 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T> &v, bool is_reverse = false, ll num = 0) {
if (num == 0)
num = (ll)v.size();
cout << endl;
cout << "i= ";
for (ll i = 0; i < num; i++)
cout << i << " ";
cout << endl;
cout << ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T> &v, bool is_reverse = false, ll num = 0) {
if (num == 0)
num = (ll)v.size();
cout << endl;
cout << "i= ";
for (ll i = 0; i < num; i++)
cout << i << " ";
cout << endl;
cout << ... | replace | 106 | 107 | 106 | 108 | 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>;
const int M = 1000005;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> cnt(M);
for (int x : a) {
// if (cnt[x] != 0) {
//... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int M = 1000005;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> cnt(M);
for (int x : a) {
if (cnt[x] != 0) {
cnt... | replace | 15 | 19 | 15 | 19 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int memo[1000010];
int all[1000010... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int memo[1000010];
int all[1000010... | replace | 26 | 27 | 26 | 27 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<do... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<do... | replace | 48 | 50 | 48 | 52 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | replace | 431 | 432 | 431 | 432 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cmath> //sqrt
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define MAX 100... | #include <algorithm>
#include <cmath> //sqrt
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define MAX 100... | replace | 12 | 13 | 12 | 13 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int cnt[N];
int n, a[N / 10];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", a + i), cnt[a[i]]++;
for (int i = 1; i < N; i++)
if (cnt[i]) {
for (int j = i + i; j < N; j += i) {
cnt[j] += cnt[i];
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int cnt[N];
int n, a[N / 5];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", a + i), cnt[a[i]]++;
for (int i = 1; i < N; i++)
if (cnt[i]) {
for (int j = i + i; j < N; j += i) {
cnt[j] += cnt[i];
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[233333], vis[233333], ans;
int main() {
ios::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i], vis[a[i]]++;
for (int i = 1; i <= n; i++) {
int flg = 1;
for (int j = 1; j * j <= a[i]; j++)
if (a[i] % j == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int n, a[2333333], vis[2333333], ans;
int main() {
ios::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i], vis[a[i]]++;
for (int i = 1; i <= n; i++) {
int flg = 1;
for (int j = 1; j * j <= a[i]; j++)
if (a[i] % j == 0) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXI = 1001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
vector<int> inc(MAXI, 0);
for (int i = 0; i < n; ++i) {
cin >> a[i];
++inc[a[i]];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXI = 1000001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
vector<int> inc(MAXI, 0);
for (int i = 0; i < n; ++i) {
cin >> a[i];
++inc[a[i]... | replace | 6 | 7 | 6 | 7 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
int a[100009], cnt[1000009];
int main() {
int n, i, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++) {
if (cnt[a[i]] != 0) {
cnt[a[i]] = 2;
continue;
}
fo... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
int a[200009], cnt[1000009];
int main() {
int n, i, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i < n; i++) {
if (cnt[a[i]] != 0) {
cnt[a[i]] = 2;
continue;
}
fo... | replace | 5 | 6 | 5 | 6 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
void solveBruteForce() {}
void solveOptimized() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
void solveBruteForce() {}
void solveOptimized() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n... | replace | 29 | 33 | 29 | 34 | TLE | |
p02642 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, ... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, ... | replace | 47 | 48 | 47 | 50 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { cin >> A.at(i); }
sort(A.begin(), A.end());
ll res = 0;
vector<bool> B(N, false);
for (int i = 0; i < N; i... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) { cin >> A.at(i); }
sort(A.begin(), A.end());
ll res = 0;
vector<bool> B(N, false);
for (int i = 0; i < N; i... | replace | 28 | 33 | 28 | 30 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
const int M = 1000005;
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> C(M);
rep(i, M) C[i] = 0;
for (int x : A) {
for (int j = x; j < M; j += x) {
... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
const int M = 1000005;
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> C(M);
rep(i, M) C[i] = 0;
for (int x : A) {
if (C[x] == 1) {
C[x] = 2;
... | insert | 14 | 14 | 14 | 20 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define CIN \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define TES... | #include <bits/stdc++.h>
using namespace std;
#define CIN \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define TES... | replace | 12 | 13 | 12 | 13 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
vector<bool> ng(1000001, false);
rep(i, n) {
if (i == 0)
continue;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
vector<bool> ng(1000001, false);
rep(i, n) {
if (i == 0)
continue;... | replace | 26 | 27 | 26 | 29 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
co... | replace | 16 | 17 | 16 | 17 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl "\n";
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl "\n";
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);... | insert | 39 | 39 | 39 | 40 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(a) cout << #a ": " << a << endl
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
const int M = 1e6 + 7;
int a[N], b[M];
int main(void) {
IOS;
int n;
cin >> n;
int mx = 0;
for (int i = 1; i <= n; ++i) {
... | #include <bits/stdc++.h>
#define debug(a) cout << #a ": " << a << endl
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int N = 2e5 + 7;
const int M = 1e6 + 7;
int a[N], b[M];
int main(void) {
IOS;
int n;
cin >> n;
int mx = 0;
for (int i = 1; i <= n; ++i) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int c[1000006];
vector<int> V;
set<int> S;
multiset<int> T;
int N, A[200005];
int dp[200005];
int main(void) {
cin >> N;
int Am = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
V.push_back(... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int c[1000006];
vector<int> V;
set<int> S;
multiset<int> T;
int N, A[200005];
int dp[200005];
int main(void) {
cin >> N;
int Am = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
V.push_back(... | replace | 43 | 46 | 43 | 44 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int c[1000006];
vector<int> V;
set<int> S;
multiset<int> T;
int N, A[200005];
int dp[200005];
int num[1000006];
int main(void) {
cin >> N;
int Am = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int c[1000006];
vector<int> V;
set<int> S;
multiset<int> T;
int N, A[200005];
int dp[200005];
int num[1000006];
int main(void) {
cin >> N;
int Am = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i... | replace | 47 | 49 | 47 | 48 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void fast() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
fast();
int n, a[200005], b[200005], j, i, ans = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i <= a[n - 1]; i++)
b[i] = 1;
... | #include <bits/stdc++.h>
using namespace std;
void fast() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
fast();
int n, a[200005], b[1000005], j, i, ans = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i <= a[n - 1]; i++)
b[i] = 1;
... | replace | 9 | 10 | 9 | 10 | 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 rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
long n;
cin >> n;
vector<long> a(n);
map<long, long> b;
vector<long> c[1001001];
rep(i, n) {
cin >> a.at(i);
b[a.at(i)]++;
f... | #include <bits/stdc++.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++)
int main() {
long n;
cin >> n;
vector<long> a(n);
vector<long> b(1001001);
vector<long> c[1001001];
rep(i, n) {
cin >> a.at(i);
b[a.at(i)]++;... | replace | 9 | 10 | 9 | 10 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int max_a = 202020;
vector<int> s(max_a * 2, 0);
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
rep(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int max_a = 2020202;
vector<int> s(max_a * 2, 0);
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
rep... | replace | 10 | 11 | 10 | 11 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int MAX_A = 202020;
vector<int> a(MAX_A + 1, 0);
rep(i, n) {
int t;
cin >> t;
a[t]++;
}
for (int i = 1; i <= MAX... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int MAX_A = 2020202;
vector<int> a(MAX_A + 1, 0);
rep(i, n) {
int t;
cin >> t;
a[t]++;
}
for (int i = 1; i <= MA... | replace | 9 | 10 | 9 | 10 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define join(a, d) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define join(a, d) ... | replace | 31 | 32 | 31 | 34 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ... | replace | 414 | 416 | 414 | 416 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
#define fast() ios::sync_with_stdio(false), cin.tie(nullptr)
#define digit(N) cout << fixed << setprecision((N))
#pragma GCC target("avx2")
#pragma GCC optimiz... | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
#define fast() ios::sync_with_stdio(false), cin.tie(nullptr)
#define digit(N) cout << fixed << setprecision((N))
#pragma GCC target("avx2")
#pragma GCC optimiz... | replace | 18 | 19 | 18 | 19 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define EPS (1e-9)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
bool LT(double a, double b) { retur... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define EPS (1e-9)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
bool LT(double a, double b) { retur... | insert | 40 | 40 | 40 | 41 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int n;
int A[200002];
bool B[1000002] = {
0,
};
bool check[1000002] = {
0,
};
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A[i];
if (check[A[i]] == false)
check[A[i]] = true;
else
B[A[i]] = true;
for ... | #include <iostream>
using namespace std;
int main(void) {
int n;
int A[200002];
bool B[1000002] = {
0,
};
bool check[1000002] = {
0,
};
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A[i];
if (check[A[i]] == false)
check[A[i]] = true;
else
B[A[i]] = true;
if (... | replace | 21 | 23 | 21 | 24 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | insert | 53 | 53 | 53 | 54 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | replace | 134 | 135 | 134 | 135 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX = 200100;
int main() {
ll N;
cin >> N;
vector<int> A(N);
for (ll i = 0; i < N; i++)
cin >> A[i];
vector<int> M(MAX, 0);
for (auto a : A) {
if (M[a] != 0) {
M[a] = 2;
continue;
}
for (ll i = a; i <= M... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX = 2001000;
int main() {
ll N;
cin >> N;
vector<int> A(N);
for (ll i = 0; i < N; i++)
cin >> A[i];
vector<int> M(MAX, 0);
for (auto a : A) {
if (M[a] != 0) {
M[a] = 2;
continue;
}
for (ll i = a; i <= ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
typedef long long ll;
int main() {
ll N;
std::cin >> N;
std::vector<ll> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
std::vector<ll> B(1000010);
for (auto r : A) {
for (int x = r; x < 1000010; x += r) {
B[x]++;
}
}
ll resa = 0;
for... | #include <iostream>
#include <vector>
typedef long long ll;
int main() {
ll N;
std::cin >> N;
std::vector<ll> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
std::vector<ll> B(1000010);
for (auto r : A) {
if (B[r] != 0) {
B[r] = 2;
continue;
}
for (int x = r; x < 1000... | insert | 14 | 14 | 14 | 18 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | replace | 24 | 25 | 24 | 25 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrepi(i, a, b) for (int i = ((int)(b)-1); i >= (a); --i)
#define rep(i, n) repi(i, 0, n)
#define rrep(i, n) rrepi(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(x) memset(x, 0, s... | #include <bits/stdc++.h>
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrepi(i, a, b) for (int i = ((int)(b)-1); i >= (a); --i)
#define rep(i, n) repi(i, 0, n)
#define rrep(i, n) rrepi(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(x) memset(x, 0, s... | replace | 87 | 89 | 87 | 91 | TLE | |
p02642 | C++ | Time Limit Exceeded | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | replace | 95 | 96 | 95 | 96 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | insert | 62 | 62 | 62 | 66 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int vis[maxn];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 1; j * a[i] < maxn; j++) {
vis[a[i] * j]++;
}
}
int res = 0... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int vis[maxn];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (vis[a[i]]) {
vis[a[i]]++;
continue;
}
for (int j = 1; j * a[i] ... | insert | 14 | 14 | 14 | 18 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <time.h>
#define F(i, a, b) for (long long i = a; i <= (b); ++i)
#define dF(i, a, b) for (long long i = a; i >= (b); --i)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define maxnkp make_pair
#define fi first
#define se second
#define eps 1e-10
#define P... | #include <bits/stdc++.h>
#include <time.h>
#define F(i, a, b) for (long long i = a; i <= (b); ++i)
#define dF(i, a, b) for (long long i = a; i >= (b); --i)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define maxnkp make_pair
#define fi first
#define se second
#define eps 1e-10
#define P... | replace | 15 | 16 | 15 | 16 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
// int mx = (int)1e6 + 1;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int mx = *max_element(a.begin(), a.end());
vector<int> cnt(mx + 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
// int mx = (int)1e6 + 1;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int mx = *max_element(a.begin(), a.end());
vector<int> cnt(mx + 1... | replace | 21 | 22 | 21 | 22 | 0 | |
p02642 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.en... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.en... | delete | 141 | 143 | 141 | 141 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 998244353;
vector<ll> ans;
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll multiply(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll power(ll a, ll b) {
if (b == 0)
return 1;
ll temp = power(a, b / ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 998244353;
vector<ll> ans;
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll multiply(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll power(ll a, ll b) {
if (b == 0)
return 1;
ll temp = power(a, b / ... | replace | 26 | 27 | 26 | 27 | TLE | |
p02642 | C++ | Time Limit Exceeded | /*
* D.cpp
*
* Created on: 2020/06/14
* Author: admin
*/
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
long long N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++... | /*
* D.cpp
*
* Created on: 2020/06/14
* Author: admin
*/
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
int main() {
long long N;
cin >> N;
long long A[N];
for (int i = 0; i < N; i++... | replace | 30 | 34 | 30 | 36 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define endl "\n"
#define p pair<int, int>
#define arrinp(i, a, start, end) \
; \
for (ll i = start; i <=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define endl "\n"
#define p pair<int, int>
#define arrinp(i, a, start, end) \
; \
for (ll i = start; i <=... | delete | 52 | 54 | 52 | 52 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
int main() {
int N;
scanf("%d", &N);
std::vector<int... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
int main() {
int N;
scanf("%d", &N);
std::vector<int... | insert | 27 | 27 | 27 | 31 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[111111], b[1111111];
int main() {
int n, c = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (b[a[i]] > 1)
c--, b[a[i]]--;
if (b[a[i]])
continue;
for (int j = a[i]; j < 11111... | #include <bits/stdc++.h>
using namespace std;
int a[222222], b[1111111];
int main() {
int n, c = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (b[a[i]] > 1)
c--, b[a[i]]--;
if (b[a[i]])
continue;
for (int j = a[i]; j < 11111... | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <vector>
#define MAX_N 90
using namespace std;
bool criba[MAX_N + 1];
int ocurrences[MAX_N + 1];
int main() {
int N, i, A, j, counter;
scanf("%d", &N);
memset(ocurrences, 0, sizeof ocurrences);
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <vector>
#define MAX_N 1000000
using namespace std;
bool criba[MAX_N + 1];
int ocurrences[MAX_N + 1];
int main() {
int N, i, A, j, counter;
scanf("%d", &N);
memset(ocurrences, 0, sizeof ocurrence... | replace | 8 | 9 | 8 | 9 | 0 | |
p02642 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, tmp;
cin >> n;
int count_a[11] = {0};
int a_max = -1;
vector<int> b;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
count_a[tmp]++;
if (a_max < tmp) {
a_max = tmp;
}
}
if... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, tmp;
cin >> n;
int count_a[1000001] = {0};
int a_max = -1;
vector<int> b;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
count_a[tmp]++;
if (a_max < tmp) {
a_max = tmp;
}
}
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
UL C[1000001] = {};
UL N;
UL A[200000];
int main() {
scanf("%u", &N);
rep(i, N) scanf("%u", A + i);
sort(A, A + N);
UL ans = 0;
rep(i, N... | #include <bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
UL C[1000001] = {};
UL N;
UL A[200000];
int main() {
scanf("%u", &N);
rep(i, N) scanf("%u", A + i);
sort(A, A + N);
UL ans = 0;
rep(i, N... | replace | 18 | 19 | 18 | 19 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define lol long long
#define gcd(x, y) __gcd(x, y)
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define fixed fixed << setprecision(14)
using namespace std;
using pii = pair<int, int>;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return ... | #include <bits/stdc++.h>
#define lol long long
#define gcd(x, y) __gcd(x, y)
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define fixed fixed << setprecision(14)
using namespace std;
using pii = pair<int, int>;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return ... | replace | 33 | 34 | 33 | 34 | -11 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
bool exist[1000004];
bool duplicate[1000004];
bool dfs(st... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
bool exist[1000004];
bool duplicate[1000004];
bool dfs(st... | replace | 18 | 19 | 18 | 19 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | replace | 35 | 36 | 35 | 36 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define A_MAX 2000100
bool dp[A_MAX];
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());
fill(dp, dp + A_MAX, true);
for (int i = N - 1; i >= 0; i--) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define A_MAX 2000100
bool dp[A_MAX];
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());
fill(dp, dp + A_MAX, true);
for (int i = 0; i < N; i++) {
if (!... | replace | 16 | 18 | 16 | 20 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print_vector(vector<T> &vec) {
cout << "print_vector -> ";
for (int i = 0; i < vec.size(); i++) {
if (i == vec.size() - 1) {
cout << vec[i] << endl;
} else {
cout << vec[i] << " ";
}
}
return;
}
vector<int> v;
vo... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print_vector(vector<T> &vec) {
cout << "print_vector -> ";
for (int i = 0; i < vec.size(); i++) {
if (i == vec.size() - 1) {
cout << vec[i] << endl;
} else {
cout << vec[i] << " ";
}
}
return;
}
vector<int> v;
vo... | replace | 43 | 44 | 43 | 44 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define _rep(n, a, b) for (ll n = (a); n <= (b); ++n)
#define _rev(n, a, b) for (ll n = (a); n >= (b); --n)
#define _for(n, a, b) for (ll n = (a); n < (b); ++n)
#define _rof(n, a, b) for (ll n = (a); n > (b); --n)
#define oo 0x3f3f3f3f3f3f
#define l... | #include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
#define _rep(n, a, b) for (ll n = (a); n <= (b); ++n)
#define _rev(n, a, b) for (ll n = (a); n >= (b); --n)
#define _for(n, a, b) for (ll n = (a); n < (b); ++n)
#define _rof(n, a, b) for (ll n = (a); n > (b); --n)
#define oo 0x3f3f3f3f3f3f
#define l... | replace | 37 | 39 | 37 | 41 | TLE | |
p02642 | C++ | Time Limit Exceeded | #pragma GCC target("avx2")
#pragma GCC optimize "trapv"
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define si(a) scanf("%d", &a)
#define si2(a, b) scanf("%d%d", &a, &b)
#define sl(a) scanf("%lld", &a)
#defi... | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define si(a) scanf("%d", &a)
#define si2(a, b) scanf("%d%d", &a, &b)
#define sl(a) scanf("%lld", &a)
#define sl2(a, b) scanf("%lld%lld"... | delete | 1 | 2 | 1 | 1 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define lld long long
#define pb push_back
#define mk make_pair
#define MAX (lld)1e5 + 7
#define lim (lld)1e9 + 7
#define MAX2 (int)1e6 + 9
#define ff first
#define ss second
#define fastio \
ios::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define lld long long
#define pb push_back
#define mk make_pair
#define MAX (lld)1e5 + 7
#define lim (lld)1e9 + 7
#define MAX2 (int)1e6 + 9
#define ff first
#define ss second
#define fastio \
ios::sync_with_stdio(0); ... | replace | 62 | 63 | 62 | 63 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep0(i, n) for (i = 0; i < n; i++)
#define rep(s, i, n) for (i = s; i < n; i++)
using namespace std;
int ans, N, A[200001];
int a[200001];
bool f[200001];
int main() {
int b, i, j, m;
cin >> N;
rep(1, i, N ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define rep0(i, n) for (i = 0; i < n; i++)
#define rep(s, i, n) for (i = s; i < n; i++)
using namespace std;
int ans, N, A[200001];
int a[1000001];
bool f[1000001];
int main() {
int b, i, j, m;
cin >> N;
rep(1, i, ... | replace | 11 | 13 | 11 | 13 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep_ll(i, x, n) for (ll i = x; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[... | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep_ll(i, x, n) for (ll i = x; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[... | replace | 30 | 31 | 30 | 31 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <unordered_set>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> d(n);
ll sz = 1000000;
vector<bool> arr(sz, true);
unordered_set<ll> st;
for (int i = 0; i <... | #include <algorithm>
#include <bits/stdc++.h>
#include <unordered_set>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> d(n);
ll sz = 1000001;
vector<bool> arr(sz, true);
unordered_set<ll> st;
for (int i = 0; i <... | replace | 18 | 19 | 18 | 19 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#defin... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#defin... | replace | 74 | 81 | 74 | 82 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mpr make_pair
#define pr pair<lli, lli>
#define pb push_back
#define vl vector<lli>
#define mp map<lli, lli>
#define all(x) x.begin(), x.end()
#define FOR(i, n) for (lli i = 0; i < (lli)n; i++)
#define FOR1(i, j, n) for (lli i = j; i < (ll... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mpr make_pair
#define pr pair<lli, lli>
#define pb push_back
#define vl vector<lli>
#define mp map<lli, lli>
#define all(x) x.begin(), x.end()
#define FOR(i, n) for (lli i = 0; i < (lli)n; i++)
#define FOR1(i, j, n) for (lli i = j; i < (ll... | replace | 51 | 53 | 51 | 53 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
for (int T = 0; T < t; T++) {
ll n, ans = 0;
cin >> n;
ll a[n];
int b[1000001] = {0};
for (int i = 0; i < n; i++) {
cin >> a... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
for (int T = 0; T < t; T++) {
ll n, ans = 0;
cin >> n;
ll a[n];
int b[1000001] = {0};
for (int i = 0; i < n; i++) {
cin >> a... | replace | 25 | 28 | 25 | 30 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 100005;
int a[MAX_N], cnt[1000005];
int main() {
int n;
cin >> n;
rep(i, n) {
cin >> a[i];
cnt[a[i]]++;
}
if (cnt[1] == 1) {
cout << "1" <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 200005;
int a[MAX_N], cnt[1000005];
int main() {
int n;
cin >> n;
rep(i, n) {
cin >> a[i];
cnt[a[i]]++;
}
if (cnt[1] == 1) {
cout << "1" <<... | replace | 5 | 6 | 5 | 6 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef pair<ll, ll> lli;
typedef vector<ii> vii;
typedef vector<il> vil... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef pair<ll, ll> lli;
typedef vector<ii> vii;
typedef vector<il> vil... | replace | 41 | 42 | 41 | 42 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, m, n) for (long long i = m; i < n; i++)
#define REP(i, m, n, p) for (long long i = m; i < n; i += p)
#define all(v) v.begin(), v.end()
#define pq priority_queue
#define bcnt(n) __builtin_popcountll(n)
using... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, m, n) for (long long i = m; i < n; i++)
#define REP(i, m, n, p) for (long long i = m; i < n; i += p)
#define all(v) v.begin(), v.end()
#define pq priority_queue
#define bcnt(n) __builtin_popcountll(n)
using... | replace | 791 | 793 | 791 | 793 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | replace | 9 | 10 | 9 | 10 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <vector>
typedef long long ll;
int N;
ll A[200005], mark[200005];
std::map<ll, std::vector<int>> occ;
int main() {
std::cin >> N;
ll mA = 0;
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
mA = std::max(mA, A[i]);
mark[i] = 1;
occ[A[i]].push_back(i);
... | #include <iostream>
#include <map>
#include <vector>
typedef long long ll;
int N;
ll A[200005], mark[200005];
std::map<ll, std::vector<int>> occ;
int main() {
std::cin >> N;
ll mA = 0;
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
mA = std::max(mA, A[i]);
mark[i] = 1;
occ[A[i]].push_back(i);
... | insert | 22 | 22 | 22 | 28 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAX int(2 * 10e5)
#define ll long long int
using namespace std;
int main() {
vector<ll> sieve(MAX + 1, true);
int n;
cin >> n;
vector<ll> arr(n + 1, 0);
vector<ll> freq(MAX + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
freq[arr[i]] += 1;
}
sort(arr.beg... | #include <bits/stdc++.h>
#define MAX int(2 * 10e5)
#define ll long long int
using namespace std;
int main() {
vector<ll> sieve(MAX + 1, true);
int n;
cin >> n;
vector<ll> arr(n + 1, 0);
vector<ll> freq(MAX + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
freq[arr[i]] += 1;
}
sort(arr.beg... | replace | 25 | 26 | 25 | 26 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x)... | replace | 84 | 85 | 84 | 85 | -11 | |
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(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
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 (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
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 (... | replace | 29 | 30 | 29 | 30 | 0 | |
p02642 | C++ | Time Limit Exceeded | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <se... | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <se... | insert | 77 | 77 | 77 | 79 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define watch(... | #include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define watch(... | replace | 85 | 86 | 85 | 87 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define optimizar_io \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define fore(i, a, b) for (int i = a; i < b; i++)
#define fori(i, a, b) for (int i = a; i <= b; i+... | #include <bits/stdc++.h>
using namespace std;
#define optimizar_io \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define fore(i, a, b) for (int i = a; i < b; i++)
#define fori(i, a, b) for (int i = a; i <= b; i+... | replace | 20 | 21 | 20 | 21 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL << 30;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
vector<bool> ok(n, fa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL << 30;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
vector<bool> ok(10000... | replace | 15 | 16 | 15 | 16 | 0 | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <vector>
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
// freopen("input.txt","r",stdin);
/... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <vector>
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
// freopen("input.txt","r",stdin);
/... | replace | 29 | 30 | 29 | 30 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
int main() {
int n, x;
cin >> n;
map<int, int> arr;
vector<int> v;
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
mp[x]++;
}
sort(v.begin(), v.end());
int ans = 0;
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
int main() {
int n, x;
cin >> n;
map<int, int> arr;
vector<int> v;
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
mp[x]++;
}
sort(v.begin(), v.end());
int ans = 0;
for (int i = 0; i < n; i++)... | replace | 19 | 20 | 19 | 20 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <vector>
using namespace std;
#define FOR(it, A) for (auto it = A.begin(); it != A.end(); it++)
int main() {
int N;
cin >> N;
map<int, int> A;
map<int, int>::iterator it1, it2;
vector<int> overlapped;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
it... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
#define FOR(it, A) for (auto it = A.begin(); it != A.end(); it++)
int main() {
int N;
cin >> N;
map<int, int> A;
map<int, int>::iterator it1, it2;
vector<int> overlapped;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
it... | replace | 29 | 42 | 29 | 38 | TLE | |
p02642 | C++ | Time Limit Exceeded |
// Problem : D - Not Divisible
// Contest : AtCoder - AtCoder Beginner Contest 170
// URL : https://atcoder.jp/contests/abc170/tasks/abc170_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
int main() {
i... |
// Problem : D - Not Divisible
// Contest : AtCoder - AtCoder Beginner Contest 170
// URL : https://atcoder.jp/contests/abc170/tasks/abc170_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
int main() {
i... | replace | 27 | 31 | 27 | 33 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define llint long ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define llint long ... | replace | 28 | 29 | 28 | 29 | TLE | |
p02642 | C++ | Runtime Error | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int lon... | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int lon... | replace | 75 | 76 | 75 | 76 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <iostream>
int A[200001] = {};
int n_divisor[1000001] = {};
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; i++) {
std::cin >> A[i];
}
for (int i = 1; i <= N; i++) {
int a = A[i];
for (int j = 1; a * j <= 1000000; j++) {
n_divisor[a * j]++;
}
}
int count = 0;
... | #include <iostream>
int A[200001] = {};
int n_divisor[1000001] = {};
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; i++) {
std::cin >> A[i];
}
for (int i = 1; i <= N; i++) {
n_divisor[A[i]]++;
if (n_divisor[A[i]] == 1) {
for (int j = 2; A[i] * j <= 1000000; j++) {
n_di... | replace | 13 | 16 | 13 | 18 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.