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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
using namespace std;
int div2count(int x) {
int coun = 0;
while (!(x % 2)) {
x /= 2;
coun++;
}
return coun;
}
long long gcd(long lo... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
using namespace std;
int div2count(int x) {
int coun = 0;
while (!(x % 2)) {
x /= 2;
coun++;
}
return coun;
}
long long gcd(long lo... | insert | 53 | 53 | 53 | 57 | TLE | |
p02814 | C++ | Time Limit Exceeded | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <algorithm>
#include <cstdint>
#include <experimental/optional>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | /*
URL https://
SCORE 0
AC false
WA false
TLE false
MLE false
TASK_TYPE
FAILURE_TYPE
NOTES
*/
#include <algorithm>
#include <cstdint>
#include <experimental/optional>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include... | replace | 966 | 967 | 966 | 971 | TLE | |
p02814 | C++ | Runtime Error | #include <stdio.h>
typedef long long ll;
ll a[111111];
ll gcd(ll x, ll y) { return !y ? x : gcd(y, x % y); }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main(void) {
ll n, m, i, LCM = 1;
scanf("%lld %lld", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
a[i] /= 2;
LCM = lcm(LCM... | #include <stdio.h>
typedef long long ll;
ll a[111111];
ll gcd(ll x, ll y) { return !y ? x : gcd(y, x % y); }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main(void) {
ll n, m, i, LCM = 1;
scanf("%lld %lld", &n, &m);
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
a[i] /= 2;
LCM = lcm(LCM,... | replace | 13 | 14 | 13 | 14 | -8 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
#define range(i, l, r) for (long long int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int... | #include <bits/stdc++.h>
#define range(i, l, r) for (long long int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int... | replace | 118 | 120 | 118 | 120 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll gcd(ll a, ll b) {
if (a < b) {
ll x;
x = a;
a = b;
b = x;
}
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
template <typename T> T lcm(T x, T y) {
return x / gcd(max(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
int main() {
ll n, m, i, j, k;
cin >> n >> m;
vector<ll> a(n);
ll l = 1;
for (auto &x : a)... | replace | 8 | 23 | 8 | 11 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
const int inf = 1e9 + 7;
const ll INF = 1LL << 61;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
const int inf = 1e9 + 7;
const ll INF = 1LL << 61;
c... | replace | 55 | 56 | 55 | 60 | TLE | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n)... | replace | 92 | 93 | 92 | 93 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define int long long
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (a == 0) {
return b;
} else {
return gcd(b % a, a);
}
}
int ord2(int n) {
int ret = 0;
while (n % 2 == 0) {
n /= 2;
ret++;
}
retu... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define int long long
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (a == 0) {
return b;
} else {
return gcd(b % a, a);
}
}
int ord2(int n) {
int ret = 0;
while (n % 2 == 0) {
n /= 2;
ret++;
}
retu... | replace | 40 | 41 | 40 | 47 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
l... | replace | 39 | 41 | 39 | 41 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(s... | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(s... | insert | 73 | 73 | 73 | 77 | TLE | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | replace | 140 | 141 | 140 | 141 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using ll = long long;
using pll = pair<ll, ll>;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
// constexpr ll MOD = (998244353);
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using ll = long long;
using pll = pair<ll, ll>;
constexpr ll INF = (1LL << 60);
constexpr ll MOD = (1e9 + 7);
// constexpr ll MOD = (998244353);
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
r... | delete | 74 | 76 | 74 | 74 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
ll a[maxn];
ll lcm(int n, int m) { return n / __gcd(n, m) * m; }
ll nlcm(ll *a, int n) {
if (n == 1)
return *a;
return lcm(a[n - 1], nlcm(a, n - 1));
}
int main() {
int n;
ll m;
scanf("%d%lld", &n, &m);
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
ll a[maxn];
ll lcm(int n, int m) { return n / __gcd(n, m) * m; }
ll nlcm(ll *a, int n) {
if (n == 1)
return *a;
return lcm(a[n - 1], nlcm(a, n - 1));
}
int main() {
int n;
ll m;
scanf("%d%lld", &n, &m);
for (in... | replace | 20 | 22 | 20 | 22 | -8 | |
p02814 | C++ | Time Limit Exceeded | #define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
const long long INF = 1LL << ... | #define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
const long long INF = 1LL << ... | replace | 40 | 41 | 40 | 47 | TLE | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
// 插入此處
namespace Number {
typedef long long int LL;
// 求取 a, b 的最大公因數
LL gcd(LL a, LL b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
// 求取 a, b 的最大公因數 gcd
// 以及 x, y 使得 a*x + b*y = gcd
LL ... | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
// 插入此處
namespace Number {
typedef long long int LL;
// 求取 a, b 的最大公因數
LL gcd(LL a, LL b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
// 求取 a, b 的最大公因數 gcd
// 以及 x, y 使得 a*x + b*y = gcd
LL ... | replace | 87 | 88 | 87 | 88 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i, k, n) for (ll i = k; i < (ll)(n); ++i)
#define MAX 50000001
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans, cnt;
ll l;
// 最大公約数のll版
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ?... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i, k, n) for (ll i = k; i < (ll)(n); ++i)
#define MAX 50000001
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans, cnt;
ll l;
int gcd(int a, int b) { return (b > 0) ? gcd(b, a % b) : a; }
int lcm(int a, int... | replace | 12 | 21 | 12 | 14 | TLE | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end()... | replace | 66 | 67 | 66 | 67 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll gcd(ll a, ll b) {
if (a < b) {
ll x;
x = a;
a = b;
b = x;
}
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
template <typename T> T lcm(T x, T y) {
return x / gcd(max(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll gcd(ll a, ll b) {
if (a < b) {
ll x;
x = a;
a = b;
}
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
template <typename T> T lcm(T x, T y) {
return x / gcd(max(x, y), min(... | delete | 13 | 14 | 13 | 13 | TLE | |
p02814 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int f(int x) {
int res = 0;
while (x % 2 == 0) {
x /= 2;
res++;
}
retur... | #include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int f(int x) {
int res = 0;
while (x % 2 == 0) {
x /= 2;
res++;
}
retur... | replace | 39 | 40 | 39 | 40 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
constexpr lint INF = 1'010'000'000'000'000'017LL;
constexpr lint MOD = 1'000'000'007LL;
constexpr double EPS = 1e-12;
constexpr double PI = 3.14159265358979323846;
#define FOR(i, start, ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
constexpr lint INF = 1'010'000'000'000'000'017LL;
constexpr lint MOD = 1'000'000'007LL;
constexpr double EPS = 1e-12;
constexpr double PI = 3.14159265358979323846;
#define FOR(i, start, ... | replace | 72 | 79 | 72 | 79 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <vector>
#define ll long long int
#define ld long double
#define rep(i, n) for (ll i = 0; i < n; i++)
#defi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <vector>
#define ll long long int
#define ld long double
#define rep(i, n) for (ll i = 0; i < n; i++)
#defi... | insert | 88 | 88 | 88 | 92 | TLE | |
p02814 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int f(int x) {
int res = 0;
while (x % 2 == 0) {
x /= 2;
res++;
}
return res;
}
int main(void)... | #include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int f(int x) {
int res = 0;
while (x % 2 == 0) {
x /= 2;
res++;
}
return res;
}
int main(void)... | replace | 43 | 44 | 43 | 44 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
#define ALL(x) (x).begin(), (x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; // 10^18
const int inINF = 1000000000; // 10^9
const ll MOD = 100... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
#define ALL(x) (x).begin(), (x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; // 10^18
const int inINF = 1000000000; // 10^9
const ll MOD = 100... | insert | 28 | 28 | 28 | 33 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
... | replace | 51 | 55 | 51 | 55 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
if (b == 0)
return a;
... | insert | 51 | 51 | 51 | 55 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm> // for next_permutation
#include <bits/stl_numeric.h>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
static const ll MOD = 100000... | #include <algorithm> // for next_permutation
#include <bits/stl_numeric.h>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
static const ll MOD = 100000... | replace | 65 | 66 | 65 | 66 | TLE | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
int gcd(int a, int b) {
if (!a)
return b;
return gcd(b % a, a);
}
int lcm(int x, int y) {
if (x == 0 || y == 0)
return 0;
return x / gcd(x, y) * y;
}... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
int gcd(int a, int b) {
if (!a)
return b;
return gcd(b % a, a);
}
int lcm(int x, int y) {
if (x == 0 || y == 0)
return 0;
return x / gcd(x, y) * y;
}... | replace | 49 | 50 | 49 | 55 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
// #define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
// #define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
r... | replace | 67 | 68 | 67 | 73 | TLE | |
p02814 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define MEMSET... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define MEMSET... | replace | 15 | 16 | 15 | 16 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long maxn = 10;
long long n, m;
long long a[maxn];
long long b[maxn];
long long ans;
void in();
void solve();
void out();
int main() {
in();
solve();
out();
}
void in() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cin >> n >> m;
fo... | #include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 10;
long long n, m;
long long a[maxn];
long long b[maxn];
long long ans;
void in();
void solve();
void out();
int main() {
in();
solve();
out();
}
void in() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cin >> n >> m... | replace | 3 | 4 | 3 | 4 | 0 | |
p02814 | C++ | Runtime Error | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template <class T> bool chmax(T &a, const T &b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T ... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template <class T> bool chmax(T &a, const T &b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T ... | replace | 70 | 71 | 70 | 72 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | replace | 44 | 45 | 44 | 45 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, (n)-1, 0)
#define all(v) v.begin(), v.end()
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, (n)-1, 0)
#define all(v) v.begin(), v.end()
... | replace | 60 | 62 | 60 | 68 | TLE | |
p02814 | Python | Runtime Error | # from fractions import gcd
from math import gcd
from functools import reduce
N, M = map(int, input().split())
nums = set([num // 2 for num in list(map(int, input().split()))])
# 1<=X<=Mの範囲で、半公倍数の数を求める。
# 但し、Xは、num*(p+0.5)でなければならない
# Mが10**9なので、全部やるのは無理。
# n.5倍なので、numsのあたいは全て偶数になっている。
# nums一つ一つ、答えになりうるXの配列を作って、重複したも... | from fractions import gcd
# from math import gcd
from functools import reduce
N, M = map(int, input().split())
nums = set([num // 2 for num in list(map(int, input().split()))])
# 1<=X<=Mの範囲で、半公倍数の数を求める。
# 但し、Xは、num*(p+0.5)でなければならない
# Mが10**9なので、全部やるのは無理。
# n.5倍なので、numsのあたいは全て偶数になっている。
# nums一つ一つ、答えになりうるXの配列を作って、重複した... | replace | 0 | 2 | 0 | 3 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main() {
long long n, m;
cin >> n >> m;
long long a[n];
long long ans = 1;
long long ok = 1;
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main() {
long long n, m;
cin >> n >> m;
long long a[n];
long long ans = 1;
long long ok = 1;
for (int i = 0; i < n; i++) {... | replace | 20 | 21 | 20 | 21 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) fo... | replace | 55 | 56 | 55 | 62 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.... | replace | 33 | 34 | 33 | 40 | TLE | |
p02814 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a < b)
return gcd(b, a);
return gcd(b, a % b);
}
ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(fal... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
if (a < b)
return gcd(b, a);
return gcd(b, a % b);
}
ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(fal... | insert | 55 | 55 | 55 | 59 | TLE | |
p02814 | Python | Runtime Error | def main():
from functools import reduce
from math import gcd
def lcm(a, b):
return (a // gcd(a, b)) * b
N, M = map(int, input().split())
(*a,) = map(int, input().split())
p = -1
b = []
for x in a:
cnt = 0
while x % 2 == 0:
x //= 2
cnt +... | def main():
from functools import reduce
def gcd(a, b):
return a if b == 0 else gcd(b, a % b)
def lcm(a, b):
return (a // gcd(a, b)) * b
N, M = map(int, input().split())
(*a,) = map(int, input().split())
p = -1
b = []
for x in a:
cnt = 0
while x % 2 ==... | replace | 2 | 3 | 2 | 5 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
lli gcd(lli ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
lli gcd(lli ... | replace | 29 | 30 | 29 | 36 | TLE | |
p02814 | Python | Runtime Error | def main():
from math import gcd, ceil
n, m, *a = map(int, open(0).read().split())
b = [0 for _ in range(n)]
a.sort()
for i, j in enumerate(a):
c = 0
while j % 2 == 0:
c += 1
j = j // 2
a[i] = j
b[i] = c
if len(set(b)) > 1:
print... | def main():
from fractions import gcd
from math import ceil
n, m, *a = map(int, open(0).read().split())
b = [0 for _ in range(n)]
a.sort()
for i, j in enumerate(a):
c = 0
while j % 2 == 0:
c += 1
j = j // 2
a[i] = j
b[i] = c
if len(s... | replace | 1 | 2 | 1 | 3 | 0 | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n)... | replace | 93 | 94 | 93 | 94 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | replace | 54 | 55 | 54 | 61 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define testcase() \
int t; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define testcase() \
int t; ... | insert | 68 | 68 | 68 | 72 | TLE | |
p02814 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | insert | 69 | 69 | 69 | 71 | TLE | |
p02814 | C++ | Runtime Error | // In The Name Of Allah
#include <bits/stdc++.h>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ret(n) return cout << n, 0
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
#define ll long long
#define ld lon... | // In The Name Of Allah
#include <bits/stdc++.h>
#define ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ret(n) return cout << n, 0
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
#define int long long
#define ld lo... | replace | 8 | 9 | 8 | 9 | 0 | |
p02814 | 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;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int f(int x) {
int res = 0;
while (x % 2 == 0) {
x /= 2;
res++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int f(int x) {
int res = 0;
while (x % 2 == 0) {
x /= 2;
res++;
... | replace | 37 | 38 | 37 | 38 | 0 | |
p02814 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int Max = 1000000;
long gcd(long a, long b) {
if (a == 0)
return b;
else
return gcd(b % a, a);
}
long lcm(int c, int d) { return c * d / gcd(c, ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int Max = 1000000;
long gcd(long a, long b) {
if (a == 0)
return b;
else
return gcd(b % a, a);
}
long lcm(long c, long d) { return c * d / gcd(c... | replace | 16 | 17 | 16 | 17 | 0 | |
p02814 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const str... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const str... | replace | 112 | 113 | 112 | 113 | TLE | |
p02814 | Python | Time Limit Exceeded | from sys import stdin
import fractions
N, M = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(x) // 2 for x in stdin.readline().rstrip().split()]
ans = 0
g = 1
for i in range(len(A)):
g = g * A[i] // fractions.gcd(g % A[i], A[i])
for i in range(len(A)):
if (g // A[i]) % 2 == 0:
print(0)
... | from sys import stdin
import fractions
N, M = [int(x) for x in stdin.readline().rstrip().split()]
A = [int(x) // 2 for x in stdin.readline().rstrip().split()]
ans = 0
g = 1
for i in range(len(A)):
g = g * A[i] // fractions.gcd(g % A[i], A[i])
if g > M:
print(0)
exit()
for i in range(len(A)):
... | insert | 10 | 10 | 10 | 13 | TLE | |
p02814 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | replace | 34 | 35 | 34 | 43 | 0 | |
p02814 | Python | Runtime Error | import sys
from math import gcd
from functools import reduce
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def lcm(x, y):
return x * y // gcd(x, y)
def main():
N, M, *A = map(int, read().split())
A = [a // 2 for a in A]
... | import sys
from fractions import gcd
from functools import reduce
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def lcm(x, y):
return x * y // gcd(x, y)
def main():
N, M, *A = map(int, read().split())
A = [a // 2 for a in ... | replace | 1 | 2 | 1 | 2 | 0 | |
p02814 | 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 | 59 | 60 | 59 | 60 | TLE | |
p02815 | 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 | 651 | 656 | 651 | 660 | TLE | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
constexpr int64_t mod = 1'000'000'007; //'
template <uint32_t mod> class modint {
uint64_t value;
public:
constexpr modint(const int64_t x = 0) noexcept
: value(x % mod + (x < 0 ? mod : 0)) {}
constexpr explicit operator uint64_t() const noexcept { return valu... | #include <bits/stdc++.h>
using namespace std;
constexpr int64_t mod = 1'000'000'007; //'
template <uint32_t mod> class modint {
uint64_t value;
public:
constexpr modint(const int64_t x = 0) noexcept
: value(x % mod + (x < 0 ? mod : 0)) {}
constexpr explicit operator uint64_t() const noexcept { return valu... | replace | 89 | 90 | 89 | 90 | 0 | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a, b) memset(a, b, sizeof(a))... | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a, b) memset(a, b, sizeof(a))... | replace | 14 | 15 | 14 | 15 | 0 | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 100010, P = 1e9 + 7;
int n, qp, ans, c[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &c[i]);
}
sort(c + 1, c + n + 1);
qp = 1;
for (int i = 1; i <= 2 * n - 2; i++) {
qp = (qp + qp) %... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 200010, P = 1e9 + 7;
int n, qp, ans, c[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &c[i]);
}
sort(c + 1, c + n + 1);
qp = 1;
for (int i = 1; i <= 2 * n - 2; i++) {
qp = (qp + qp) %... | replace | 3 | 4 | 3 | 4 | 0 | |
p02815 | Python | Runtime Error | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
n0 = int(input())
c0 = list(map(int, readline().split()))
c0.sort(reverse=True)
ans = 0
mul = pow(2, n0 - 1, MOD)
add = pow(2, n0 - 2, MOD)
for i, cc in enumerate(c0, 1):... | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
n0 = int(input())
c0 = list(map(int, readline().split()))
c0.sort(reverse=True)
ans = 0
mul = pow(2, n0 - 1, MOD)
add = pow(2, max(0, n0 - 2), MOD)
for i, cc in enumerate... | replace | 15 | 16 | 15 | 16 | 0 | |
p02815 | Python | Time Limit Exceeded | n = int(input())
c = sorted([int(_) for _ in input().split()])
mod = 10**9 + 7
ans = 0
for i in range(n):
ans += c[i] * 2 ** (2 * n - 2) * (n - i + 1)
ans %= mod
print(ans)
| n = int(input())
c = sorted([int(_) for _ in input().split()])
mod = 10**9 + 7
ans = 0
for i in range(n):
ans += c[i] * pow(2, 2 * n - 2, mod) * (n - i + 1)
ans %= mod
print(ans)
| replace | 5 | 6 | 5 | 6 | TLE | |
p02815 | C++ | Runtime Error |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
// const ll MOD = 1000000007;
long long in... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
// const ll MOD = 1000000007;
long long in... | replace | 71 | 72 | 71 | 72 | 0 | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define SIZE 200005
#define M 1000000007
ll power(ll a, ll b) {
if (b == 0)
return 1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define SIZE 200005
#define M 1000000007
ll power(ll a, ll b) {
if (b == 0)
return 1;... | replace | 49 | 53 | 49 | 53 | TLE | |
p02815 | C++ | Time Limit Exceeded | /*temp*/
//
//
//
//
// #undef _DEBUG
// #pragma GCC optimize("Ofast")
// 不動小数点の計算高速化
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #include <boost/multiprecision/cpp_int.hpp>
#ifdef _DEBUG
#include "template.h"
#else
#if __cplusplus >= 201703L
/*Atcoderでしか使えない(c++17 && このテンプレートが使... | /*temp*/
//
//
//
//
// #undef _DEBUG
// #pragma GCC optimize("Ofast")
// 不動小数点の計算高速化
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #include <boost/multiprecision/cpp_int.hpp>
#ifdef _DEBUG
#include "template.h"
#else
#if __cplusplus >= 201703L
/*Atcoderでしか使えない(c++17 && このテンプレートが使... | replace | 7,971 | 7,972 | 7,971 | 7,975 | TLE | |
p02815 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
// このnamespace内のMODという値を、問題の要求に応じて変更すること
namespace Mint {
// このMODという値を、問題の要求に応じて変更すること
const ll MOD = 1000000007;
template <ll Mod> struct Modint {
ll val = 0;
// コンストラクタ long long, 空, Modintを受け取れる
Modint() = default;
Mod... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
// このnamespace内のMODという値を、問題の要求に応じて変更すること
namespace Mint {
// このMODという値を、問題の要求に応じて変更すること
const ll MOD = 1000000007;
template <ll Mod> struct Modint {
ll val = 0;
// コンストラクタ long long, 空, Modintを受け取れる
Modint() = default;
Mod... | replace | 224 | 225 | 224 | 225 | 0 | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long a[100005], mod = 1e9 + 7;
long long qpow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b /= 2;
}
return res % mod;
}
int main() {
long long n;
cin >> n;
for (long long i ... | #include <bits/stdc++.h>
using namespace std;
long long a[200005], mod = 1e9 + 7;
long long qpow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b /= 2;
}
return res % mod;
}
int main() {
long long n;
cin >> n;
for (long long i ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | replace | 80 | 81 | 80 | 81 | 0 | |
p02815 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define mod 1000000007
using name... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#define mod 1000000007
using name... | replace | 21 | 22 | 21 | 22 | 0 | |
p02815 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | #include <bits/stdc++.h>
#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | replace | 69 | 74 | 69 | 72 | TLE | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define LAR(a, b) ((a) = max((a), (b)))
#define SML(a, b) ((a) = min((a), (b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... | replace | 22 | 23 | 22 | 23 | 0 | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 7;
const int MOD = 1e9 + 7;
typedef pair<int, int> pii;
template <int _MOD> struct Mint {
int v = 0;
Mint() {}
Mint(int _v) : v((_v % _MOD + _MOD) % _MOD) {}
Mint(long long _v) : v(static_cast<int>((_v % _MOD + _MOD) % _MOD)) {}
Mint operato... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
const int MOD = 1e9 + 7;
typedef pair<int, int> pii;
template <int _MOD> struct Mint {
int v = 0;
Mint() {}
Mint(int _v) : v((_v % _MOD + _MOD) % _MOD) {}
Mint(long long _v) : v(static_cast<int>((_v % _MOD + _MOD) % _MOD)) {}
Mint operato... | replace | 4 | 5 | 4 | 5 | 0 | |
p02815 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
c... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
c... | insert | 119 | 119 | 119 | 124 | TLE | |
p02815 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | replace | 103 | 106 | 103 | 109 | TLE | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
constexpr int MX = 100005, MOD = 1e9 + 7;
int n;
ll c[MX], ans;
ll exp(ll ret, ll n) {
for (ll b = 2; n; n /= 2, (b *= b) %= MOD)
if (n % 2)
(ret *= b) %= MOD;
return ret;
}
int main() {
s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
constexpr int MX = 200005, MOD = 1e9 + 7;
int n;
ll c[MX], ans;
ll exp(ll ret, ll n) {
for (ll b = 2; n; n /= 2, (b *= b) %= MOD)
if (n % 2)
(ret *= b) %= MOD;
return ret;
}
int main() {
s... | replace | 4 | 5 | 4 | 5 | 0 | |
p02815 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
... | replace | 530 | 532 | 530 | 535 | TLE | |
p02815 | C++ | Runtime Error | // È¥°É£¡Æ¤¿¨Çð! °ÑAC´ø»ØÀ´£¡
// ¤Ø¡¡¡¡¡¡¡¡¡¡£¯|
// ¡¡¡¡/£Ü7¡¡¡¡¡¡ ¡Ï£ß/
// ¡¡ /¡¡©¦¡¡¡¡ £¯¡¡£¯ AC AC
// AC AC
// ©¦¡¡Z £ß,£¼¡¡£¯¡¡¡¡ /`©c AC AC AC
// AC ©¦¡¡¡¡¡¡¡¡¡¡©c¡¡¡¡ /¡¡¡¡¡µ AC
// AC AC AC
// ¡¡Y¡¡¡¡¡¡¡¡¡¡`¡¡ /¡¡¡¡/ / AC AC
// AC AC
// ¡¡Øé¡ñ¡¡.¡¡¡ñ¡¡¡¡¡´¡¡/¡¡/ AC... | // È¥°É£¡Æ¤¿¨Çð! °ÑAC´ø»ØÀ´£¡
// ¤Ø¡¡¡¡¡¡¡¡¡¡£¯|
// ¡¡¡¡/£Ü7¡¡¡¡¡¡ ¡Ï£ß/
// ¡¡ /¡¡©¦¡¡¡¡ £¯¡¡£¯ AC AC
// AC AC
// ©¦¡¡Z £ß,£¼¡¡£¯¡¡¡¡ /`©c AC AC AC
// AC ©¦¡¡¡¡¡¡¡¡¡¡©c¡¡¡¡ /¡¡¡¡¡µ AC
// AC AC AC
// ¡¡Y¡¡¡¡¡¡¡¡¡¡`¡¡ /¡¡¡¡/ / AC AC
// AC AC
// ¡¡Øé¡ñ¡¡.¡¡¡ñ¡¡¡¡¡´¡¡/¡¡/ AC... | replace | 133 | 134 | 133 | 134 | 0 | |
p02815 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
template <cl... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
template <cl... | replace | 59 | 60 | 59 | 60 | 0 | |
p02815 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | replace | 99 | 100 | 99 | 105 | -8 | |
p02815 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define pi acos(-1)
#define p 1000000007
using namespace std;
int N, c[101010];
long long f2[303030], ans, F[101010];
int n, m;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
sort(c + 1, c + n + 1);
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define pi acos(-1)
#define p 1000000007
using namespace std;
int N, c[201010];
long long f2[303030], ans, F[201010];
int n, m;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
sort(c + 1, c + n + 1);
... | replace | 7 | 9 | 7 | 9 | 0 | |
p02815 | C++ | Runtime Error | // besmellah
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 5, mod = 1e9 + 7;
int P2[maxn], P3[maxn], C[maxn];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
P2[0] = P3[0] = 1;
for (int i = 1; i < maxn; i++) {
P2[i] = P2[i - 1] * 2 % mod;
P3[i] =... | // besmellah
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2e5 + 5, mod = 1e9 + 7;
int P2[maxn], P3[maxn], C[maxn];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
P2[0] = P3[0] = 1;
for (int i = 1; i < maxn; i++) {
P2[i] = P2[i - 1] * 2 % mod;
P3[i] =... | replace | 6 | 7 | 6 | 7 | 0 | |
p02816 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <... | delete | 119 | 124 | 119 | 119 | TLE | |
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = v... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = v... | replace | 151 | 153 | 151 | 152 | 0 | |
p02816 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typ... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typ... | replace | 25 | 27 | 25 | 27 | 0 | |
p02816 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define Endl endl
#define mp make_pair
#define ll long long
#defi... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define Endl endl
#define mp make_pair
#define ll long long
#defi... | replace | 86 | 87 | 86 | 87 | 0 | |
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, M = 2e6;
const int NB = 30;
typedef long long ll;
const ll mod = (1e9 + 7);
int n, a[N], b[N], cnt = 1, g[M][2], fail[M], val[N], track[N][NB];
void newtrie() {
cnt = 0;
g[0][0] = g[0][1] = val[0] = -1;
}
int newnode() {
++cnt;
g[cnt][0] = g[... | #include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10, M = 2e6;
const int NB = 31;
typedef long long ll;
const ll mod = (1e9 + 7);
int n, a[N], b[N], cnt = 1, g[M][2], fail[M], val[N], track[N][NB];
void newtrie() {
cnt = 0;
g[0][0] = g[0][1] = val[0] = -1;
}
int newnode() {
++cnt;
g[cnt][0] = g[... | replace | 2 | 4 | 2 | 4 | 0 | |
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
template <typename T> using uset = unordered_set<T>;
template <typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
template <typename T> using uset = unordered_set<T>;
template <typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 ... | replace | 62 | 63 | 62 | 63 | 0 | |
p02816 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | replace | 197 | 203 | 197 | 206 | TLE | |
p02816 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T> using Vvec = vector<vector<T>>;
... | replace | 24 | 25 | 24 | 25 | 0 | |
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
// typedef tuple <int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
type... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
// typedef tuple <int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
type... | replace | 83 | 87 | 83 | 87 | 0 |
Time elapsed: 27ms
|
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define ... | replace | 158 | 159 | 158 | 159 | 0 | |
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int h = 126257;
const int mod = 1e9 + 7;
int a[200001], b[400001];
LL p[400001];
int A[30][400001];
int B[2][30][200001];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int h = 126257;
const int mod = 1e9 + 7;
int a[400001], b[200001];
LL p[400001];
int A[30][400001];
int B[2][30][200001];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i+... | replace | 5 | 6 | 5 | 6 | 127 | /tmp/2b443849-766a-4a6d-8ba6-7df974683448.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
template <class T> inline void checkmin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> inline void checkmax(T... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
template <class T> inline void checkmin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> inline void checkmax(T... | replace | 21 | 22 | 21 | 22 | 0 | |
p02816 | C++ | Time Limit Exceeded | /*
AuThOr GaRyMr
*/
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO freopen("check.out", "w", stdout... | /*
AuThOr GaRyMr
*/
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO freopen("check.out", "w", stdout... | replace | 66 | 67 | 66 | 67 | TLE | |
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using u64 = std::uint_fast64_t;
class RollingHash {
private:
using u64 = std::uint_fast64_t;
const u64 mod = ((u64)1 << 61) - 1;
std::vector<u64> hashes, pows;
inline u64 add(u64 a, u64 b) const {
a += b;
if (a >= mod)
a -= mod;
return a;
}
... | #include <bits/stdc++.h>
using namespace std;
using u64 = std::uint_fast64_t;
class RollingHash {
private:
using u64 = std::uint_fast64_t;
const u64 mod = ((u64)1 << 61) - 1;
std::vector<u64> hashes, pows;
inline u64 add(u64 a, u64 b) const {
a += b;
if (a >= mod)
a -= mod;
return a;
}
... | replace | 70 | 71 | 70 | 73 | 0 | |
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
class RollingHash {
private:
const uint64_t mod = (1ULL << 61) - 1;
std::vector<uint64_t> hashes, pows;
inline uint64_t add(uint64_t a, uint64_t b) const {
a += b;
if (a >= mod)
a -= mod;
return a;
}
inline uint64_t sub(uint64_t a, uint64_t b... | #include <bits/stdc++.h>
using namespace std;
class RollingHash {
private:
const uint64_t mod = (1ULL << 61) - 1;
std::vector<uint64_t> hashes, pows;
inline uint64_t add(uint64_t a, uint64_t b) const {
a += b;
if (a >= mod)
a -= mod;
return a;
}
inline uint64_t sub(uint64_t a, uint64_t b... | replace | 66 | 68 | 66 | 68 | 0 | |
p02816 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int, int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin... | insert | 136 | 136 | 136 | 137 | TLE | |
p02816 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
... | replace | 81 | 82 | 81 | 82 | TLE | |
p02816 | C++ | Runtime Error | // #undef _DEBUG
// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
... | // #undef _DEBUG
// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
... | replace | 288 | 289 | 288 | 289 | -6 | 6d2ca680-13a2-4a7d-86aa-0e209316e8bf.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02816/C++/s642465429.cpp:182: std::pair<ModInt<1000000007>, ModInt<1000000009> > RollingHash::hash(long long int, long long int): Assertion `r < n' failed.
|
p02816 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b)... | replace | 101 | 105 | 101 | 102 | TLE | |
p02816 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// std::vector Declaration
template <typen... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// std::vector Declaration
template <typen... | replace | 217 | 218 | 217 | 218 | 0 | |
p02816 | C++ | Time Limit Exceeded | // abc150
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define ft first
#define sc se... | // abc150
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define ft first
#define sc se... | replace | 97 | 107 | 97 | 99 | TLE | |
p02817 | Python | Runtime Error | s, t = input()
print(s + t)
| s, t = map(str, input().split())
print(t + s)
| replace | 0 | 2 | 0 | 2 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02817/Python/s530679524.py", line 1, in <module>
s, t = input()
ValueError: too many values to unpack (expected 2)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.