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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02572 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define PI 3.14159265358979
#define MOD 1000000007
// fixed << setprecision(15) <<
using namespace std;
int main(void) {
long long int n, m, max... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
#define PI 3.14159265358979
#define MOD 1000000007
// fixed << setprecision(15) <<
using namespace std;
int main(void) {
long long int n, m, max... | replace | 26 | 32 | 26 | 31 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr long long INF = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr long long INF = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(nullptr... | replace | 26 | 27 | 26 | 27 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define lint long long
const lint mod = 1e9 + 7;
const lint inf = 2.19e15 + 1;
const long double eps = 1e-10;
template <class T, class U> bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define lint long long
const lint mod = 1e9 + 7;
const lint inf = 2.19e15 + 1;
const long double eps = 1e-10;
template <class T, class U> bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}... | replace | 28 | 33 | 28 | 34 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const lint N = 1e5 + 5, mod = 1e9 + 7;
lint n, a[N];
int main() {
#ifdef LOCAL
freopen("input", "r", stdin);
#endif
scanf("%lld", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &a[i]);
lint sum = a[n - 1], ans = 0;
for (int i = n... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const lint N = 2e5 + 5, mod = 1e9 + 7;
lint n, a[N];
int main() {
#ifdef LOCAL
freopen("input", "r", stdin);
#endif
scanf("%lld", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &a[i]);
lint sum = a[n - 1], ans = 0;
for (int i = n... | replace | 5 | 6 | 5 | 6 | 0 | |
p02572 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ctime>
using namespace std;
#define ll long long
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ctime>
using namespace std;
#define ll long long
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); ... | replace | 65 | 70 | 65 | 72 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int64_t ans = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j < N - i; j++) {
ans += (vec.at(i) * vec.at(i + j)) % (1000000007);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int64_t sum = 0;
int64_t SUM = 0;
for (int i = 0; i < N; i++) {
sum += (vec.at(i) % 1000000007);
sum %= 1000000007;
}
for (int i = 0; i <... | replace | 10 | 16 | 10 | 27 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << end... | #include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << end... | replace | 126 | 127 | 126 | 127 | 0 | |
p02572 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
long a[20020];
long mod = 1000000007;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
long long x = 0;
for (int i = 0; i < n; i++) {
ans = (ans + a[i] * x) % mod;
x = (x + a[i]) % mod;
}
cout << ans << e... | #include <iostream>
using namespace std;
int main() {
int n;
long a[200020];
long mod = 1000000007;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
long long x = 0;
for (int i = 0; i < n; i++) {
ans = (ans + a[i] * x) % mod;
x = (x + a[i]) % mod;
}
cout << ans << ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define each(i, mp) for (auto &i : mp)
const int INF = 1001001001;
const ll MOD = 1000000007;
int main() {
int n;
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define each(i, mp) for (auto &i : mp)
const int INF = 1001001001;
const ll MOD = 1000000007;
int main() {
int n;
cin... | replace | 18 | 23 | 18 | 46 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define Mid ((l + r) / 2)
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define drep(i, a, b) for (int i = (a); i >= (b); --i)
#define file(a) freopen(#a ".in", "r", stdin), freopen(#a ".out", "w", stdout);
const int maxn = 1e5 + ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define Mid ((l + r) / 2)
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define drep(i, a, b) for (int i = (a); i >= (b); --i)
#define file(a) freopen(#a ".in", "r", stdin), freopen(#a ".out", "w", stdout);
const int maxn = 2e5 + ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &... | replace | 44 | 45 | 44 | 45 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int int64_t
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define REPP(i, n) fo... | #include <bits/stdc++.h>
#define int int64_t
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define REPP(i, n) fo... | replace | 102 | 105 | 102 | 111 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b, c) for (ll i = a; i < b; i += c)
#define r(i, a, b, c) for (ll i = a; i >= b; i -= c)
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n;
cin >> n;
ll ar[n];
ll sum = 0;
f(i, 0,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b, c) for (ll i = a; i < b; i += c)
#define r(i, a, b, c) for (ll i = a; i >= b; i -= c)
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n;
cin >> n;
ll ar[n];
ll sum = 0;
f(i, 0,... | replace | 13 | 18 | 13 | 21 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int M = (int)1e5;
const int N = (int)5e5;
const int inf = 0x3f3f3f3f;
const ll mod = (ll)1e9 + 7;
const double eps = 1e-6;
int n, a[M + 5];
int main() {
// freopen("input.txt", "r", stdin);
// freopen... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int M = (int)2e5;
const int N = (int)5e5;
const int inf = 0x3f3f3f3f;
const ll mod = (ll)1e9 + 7;
const double eps = 1e-6;
int n, a[M + 5];
int main() {
// freopen("input.txt", "r", stdin);
// freopen... | replace | 6 | 7 | 6 | 7 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iostream... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iostream... | replace | 32 | 38 | 32 | 39 | TLE | |
p02572 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#define mod 1000000007
using namespace std;
unsigned long long a[100005], cnt, sum;
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum = sum + a[i];
}
for (int i = 1; i <= n; i++) {
sum = sum - a[i];
cnt = (cnt + (sum % mod ... | #include <cstdio>
#include <iostream>
#define mod 1000000007
using namespace std;
unsigned long long a[1000005], cnt, sum;
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum = sum + a[i];
}
for (int i = 1; i <= n; i++) {
sum = sum - a[i];
cnt = (cnt + (sum % mod... | replace | 4 | 5 | 4 | 5 | 0 | |
p02572 | C++ | Time Limit Exceeded | /*----------------------------------------------------*
* लेखक --> अमित सिंह
* संस्थान --> राष्ट्रीय प्रौद्योगिकी संस्थान, कुरुक्षेत्र
*-----------------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define w(t) ... | /*----------------------------------------------------*
* लेखक --> अमित सिंह
* संस्थान --> राष्ट्रीय प्रौद्योगिकी संस्थान, कुरुक्षेत्र
*-----------------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define w(t) ... | replace | 26 | 30 | 26 | 37 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define IN(type, n) \
type n; \
cin >> n
int main() {
IN(ll, N);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define IN(type, n) \
type n; \
cin >> n
int main() {
IN(ll, N);... | replace | 19 | 24 | 19 | 25 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const int P = 1000000007;
int n, i, a[100005];
i64 tot, ans;
int main() {
scanf("%d", &n);
for (i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (i = n; i > 0; --i) {
ans = (ans + tot * a[i]) % P;
tot = (tot + a[i]) % P;
}
printf("%ll... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const int P = 1000000007;
int n, i, a[200005];
i64 tot, ans;
int main() {
scanf("%d", &n);
for (i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (i = n; i > 0; --i) {
ans = (ans + tot * a[i]) % P;
tot = (tot + a[i]) % P;
}
printf("%ll... | replace | 4 | 5 | 4 | 5 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[100005];
const long long MOD = (long long)(1e9) + 7;
void solve() {
long long subsum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
subsum = (subsum + a[i]) % MOD;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
su... | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[200005];
const long long MOD = (long long)(1e9) + 7;
void solve() {
long long subsum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
subsum = (subsum + a[i]) % MOD;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
su... | replace | 4 | 5 | 4 | 5 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
const long long llINF = 1LL << 60;
const int iINF = 0x20000000;
template <class T> inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if ... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
const long long llINF = 1LL << 60;
const int iINF = 0x20000000;
template <class T> inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if ... | replace | 41 | 46 | 41 | 47 | TLE | |
p02572 | C++ | Runtime Error | #include <iostream>
using namespace std;
using ll = long long;
#define MOD 1000000007;
int main() {
ll N;
ll A[N + 1];
cin >> N;
ll sum = 0;
ll res = 0;
for (ll i = 1; i <= N; i++) {
cin >> A[i];
sum += A[i];
sum %= MOD;
}
for (ll i = 1; i < N; i++) {
sum -= A[i];
if (sum < 0) {
... | #include <iostream>
using namespace std;
using ll = long long;
#define MOD 1000000007;
int main() {
ll N;
ll A[200002];
cin >> N;
ll sum = 0;
ll res = 0;
for (ll i = 1; i <= N; i++) {
cin >> A[i];
sum += A[i];
sum %= MOD;
}
for (ll i = 1; i < N; i++) {
sum -= A[i];
if (sum < 0) {
... | replace | 7 | 8 | 7 | 8 | -11 | |
p02572 | 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 <iterator... | // インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator... | replace | 57 | 61 | 57 | 59 | TLE | |
p02572 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <math.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define str string
#define deb_arr(arr, n) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <math.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define str string
#define deb_arr(arr, n) ... | replace | 62 | 63 | 62 | 63 | 0 | |
p02572 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
long long a[100000];
long long mod = 1000000007;
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum = sum + a[i];
}
long... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
long long a[1000000];
long long mod = 1000000007;
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum = sum + a[i];
}
lon... | replace | 7 | 8 | 7 | 8 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000007
class Graph {
int V;
vector<list<int>> edges;
public:
Graph(int nodes) {
V = nodes;
edges.resize(nodes + 1);
}
void addEdge(int from, int to) { edges[from].push_back(to); }
int min_dist(int &fin, int i, map<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000007
class Graph {
int V;
vector<list<int>> edges;
public:
Graph(int nodes) {
V = nodes;
edges.resize(nodes + 1);
}
void addEdge(int from, int to) { edges[from].push_back(to); }
int min_dist(int &fin, int i, map<... | replace | 56 | 62 | 56 | 60 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mn = 1e5 + 7, mod = 1e9 + 7;
long long a[mn], sum[mn], ans;
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%lld", a + i);
sum[i] = (sum[i - 1] + a[i]) % mod;
}
for (int i = 1; i <= n; ++i)
ans = (ans + a[i] * (sum[... | #include <bits/stdc++.h>
using namespace std;
const int mn = 2e5 + 7, mod = 1e9 + 7;
long long a[mn], sum[mn], ans;
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%lld", a + i);
sum[i] = (sum[i - 1] + a[i]) % mod;
}
for (int i = 1; i <= n; ++i)
ans = (ans + a[i] * (sum[... | replace | 3 | 4 | 3 | 4 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long int ull;
#define base 31
#define MOD 1000000007
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORs(i, a, b) for (int i = a; i >= b; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define __FOR(i, a, b, k) for (int i = a; i <= b... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long int ull;
#define base 31
#define MOD 1000000007
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORs(i, a, b) for (int i = a; i >= b; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define __FOR(i, a, b, k) for (int i = a; i <= b... | replace | 23 | 24 | 23 | 24 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
long long sum = 0;
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j)
sum = (sum + a[i] * a[j]) % 1000000007;
cout << sum << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
long long sum = 0, cnt = 0;
for (int i = 1; i < n; ++i)
sum += a[i];
cnt += a[0] % 1000000007 * (sum % 1000000007);
for (int i = 1; i < n; ++i) {
s... | replace | 8 | 13 | 8 | 19 | TLE | |
p02572 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
int main() {
int num;
std::cin >> num;
long A[num];
std::vector<long long> B(num, 0);
for (int i = 0; i < num; i++) {
std::cin >> A[i];
B[i + 1] = B[i] + A[i];
}
int mod = 1000000007;
long ans = 0;
for (int i = 0; i < num; i++) {
lon... | #include <cmath>
#include <iostream>
#include <vector>
int main() {
int num;
std::cin >> num;
long A[num];
std::vector<long long> B(num + 1, 0);
for (int i = 0; i < num; i++) {
std::cin >> A[i];
B[i + 1] = B[i] + A[i];
}
int mod = 1000000007;
long ans = 0;
for (int i = 0; i < num; i++) {
... | replace | 8 | 9 | 8 | 9 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 100005
#define mod 1000000007
using namespace std;
template <typename T> inline void in(T &x) {
x = 0;
char c = getchar();
bool fu = 0;
while (c < '0' || c > '9') {
if (c == '-')
fu = 1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3... | #include <bits/stdc++.h>
#define N 200005
#define mod 1000000007
using namespace std;
template <typename T> inline void in(T &x) {
x = 0;
char c = getchar();
bool fu = 0;
while (c < '0' || c > '9') {
if (c == '-')
fu = 1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3... | replace | 1 | 2 | 1 | 2 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define MOD 1000000007
#define MAX 100010
#define aout(a) \
REP(i, sizeof(a)) cout << a[i] << " "; ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define MOD 1000000007
#define MAX 100010
#define aout(a) \
REP(i, sizeof(a)) cout << a[i] << " "; ... | replace | 22 | 25 | 22 | 28 | TLE | |
p02572 | C++ | Runtime Error | #include <cstdio>
// #include<iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int maxv = 100005;
const int inf = 1e9 + 7;
int ar[maxv];
int main() {
int n;
ll sum = ... | #include <cstdio>
// #include<iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int maxv = 200005;
const int inf = 1e9 + 7;
int ar[maxv];
int main() {
int n;
ll sum = ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize(2)
#define ll long long
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define endl '\n'
#define eps 0.000000001
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#define IO ... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
#define ll long long
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define endl '\n'
#define eps 0.000000001
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#define IO ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 10009;
const int P = 1000000007;
int n;
int a[maxn];
long long sum[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
sum[i] = (sum[i - 1] + a[i]) % P;
}
long long ans = 0;
for (int i = 2; i <= n; ++i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200009;
const int P = 1000000007;
int n;
int a[maxn];
long long sum[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
sum[i] = (sum[i - 1] + a[i]) % P;
}
long long ans = 0;
for (int i = 2; i <= n; ++... | replace | 2 | 3 | 2 | 3 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long a[100005];
int main() {
int n;
scanf("%d", &n);
long long tot1 = 0, tot2 = 0;
for (int i = 1; i <= n; ++i)
scanf("%lld", &a[i]), tot1 += a[i], tot2 += a[i] * a[i] % mod;
tot1 %= mod;
tot2 %= mod;
long long ans = ... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long a[200005];
int main() {
int n;
scanf("%d", &n);
long long tot1 = 0, tot2 = 0;
for (int i = 1; i <= n; ++i)
scanf("%lld", &a[i]), tot1 += a[i], tot2 += a[i] * a[i] % mod;
tot1 %= mod;
tot2 %= mod;
long long ans = ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
/*
cout<<"\ndebugging\n";
*/
int main() {
ios_base::sync_with_stdio(false); // Fast I/O
cin.tie(NULL);
ll t, n, i, j;
cin >> n;
vector<ll> a;
ll x;
for (i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
/*
cout<<"\ndebugging\n";
*/
int main() {
ios_base::sync_with_stdio(false); // Fast I/O
cin.tie(NULL);
ll t, n, i, j;
cin >> n;
vector<ll> a;
ll x;
for (i = 0; i < n; i++) {
cin >> x;
a.push_back(x);
... | replace | 22 | 27 | 22 | 26 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
for (int ... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
vector<ll... | replace | 16 | 22 | 16 | 28 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, m, t, a[100005];
vector<ll> adj[100005];
#define ari \
for (int i = 0; i < n; i++) \
cin >> a[i];
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, m, t, a[200005];
vector<ll> adj[100005];
#define ari \
for (int i = 0; i < n; i++) \
cin >> a[i];
#d... | replace | 4 | 5 | 4 | 5 | 0 | |
p02572 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<double, double>;
using vi = ve... | #pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<double, double>;
using vi = ve... | replace | 381 | 384 | 381 | 386 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
inline long long qr() {
long long x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch <= '9' && ch >= '0') {
x = x * 10 + ch - '0';
ch = getchar()... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
inline long long qr() {
long long x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch <= '9' && ch >= '0') {
x = x * 10 + ch - '0';
ch = getchar()... | insert | 25 | 25 | 25 | 26 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define GO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | #include <bits/stdc++.h>
using namespace std;
#define GO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | replace | 9 | 10 | 9 | 10 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int64_t sum = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
sum += (vec.at(i) * vec.at(j)) % 1000000007;
sum = sum... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int64_t sum = 0;
int64_t ksum = 0;
for (int i = 1; i < N; i++) {
ksum += vec.at(i);
ksum = ksum % 1000000007;
}
for (int i = 0; i < N - ... | replace | 11 | 16 | 11 | 23 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
int addm(int a, int b) { return ((ll)a + b) % MOD; }
int mulm(int a, int b) { return ((ll)a * b) % MOD; }
int main() {
int n;
vector<int> arr(n), pref(n);
for (auto &x : arr)
cin >> x;
pref[0] = arr[0];
for ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
using ll = long long;
int addm(int a, int b) { return ((ll)a + b) % MOD; }
int mulm(int a, int b) { return ((ll)a * b) % MOD; }
int main() {
int n;
cin >> n;
vector<int> arr(n), pref(n);
for (auto &x : arr)
cin >> x;
pref[0] = ar... | insert | 14 | 14 | 14 | 15 | -11 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int n, a[100005], bc[100005], ans = 0;
signed main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
bc[i] = a[i] + bc[i + 1], bc[i] %= mod;
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int n, a[200005], bc[200005], ans = 0;
signed main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = n; i >= 1; i--)
bc[i] = a[i] + bc[i + 1], bc[i] %= mod;
for (int i = 1; i <= n; i++) {
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | replace | 342 | 349 | 342 | 353 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
typedef std::vector<long long> vll;
typedef std::vector<std::vector<long long>> vvll;
typedef long double ld;
typedef std::vector<long double> vld;
typedef std::vector<std::vector<long double>> vvld;
using namespace std;
v... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
typedef std::vector<long long> vll;
typedef std::vector<std::vector<long long>> vvll;
typedef long double ld;
typedef std::vector<long double> vld;
typedef std::vector<std::vector<long double>> vvld;
using namespace std;
v... | replace | 20 | 22 | 20 | 25 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = (1e9 + 7) * 2;
ll a[100005];
int main(int argc, char *argv[]) {
int n;
ll sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += ((sum - a[i]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = (1e9 + 7) * 2;
ll a[200005];
int main(int argc, char *argv[]) {
int n;
ll sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += ((sum - a[i]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define nl '\n'
using namespace std;
typedef long long ll;
void solve() {
int N;
cin >> N;
int A[N];
for (int &i : A)
cin >> i;
ll ans = 0;
const int mod = 1e9 + 7;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
ans += (1ll * A[i] * A[j]) % mod;... | #include <bits/stdc++.h>
#define nl '\n'
using namespace std;
typedef long long ll;
void solve() {
int N;
cin >> N;
int A[N];
for (int &i : A)
cin >> i;
ll ans = 0;
const int mod = 1e9 + 7;
int suff[N] = {0};
suff[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
suff[i] = (A[i] + suff[... | replace | 17 | 24 | 17 | 23 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
using namespace std;
const int mod = 1e9 + 7;
const long long INF = 1e18;
#define PI 3.141592653589793
#define REP(i, n) for (long long i = 0; i < n; i++)
int main() {
long long N;
long long A[100000];
long long sum = 0;
long long ans = 0;
cin >> N;
REP(i, N) {
... | #include <bits/stdc++.h>
#include <string>
using namespace std;
const int mod = 1e9 + 7;
const long long INF = 1e18;
#define PI 3.141592653589793
#define REP(i, n) for (long long i = 0; i < n; i++)
int main() {
long long N;
int A[300000];
long long sum = 0;
long long ans = 0;
cin >> N;
REP(i, N) {
cin ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02572 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < ll(b); i++)
#define repr(i, a, b) for (ll i = a; i >= ll(b); i--)
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.rbegin(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < ll(b); i++)
#define repr(i, a, b) for (ll i = a; i >= ll(b); i--)
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.rbegin(... | replace | 22 | 23 | 22 | 23 | 0 | |
p02572 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define int long long
#define N 100010
#define M 1010
using namespace std;
const int mod = 1e9 + 7;
int sum[N], a[N], n;
int read() {
int s = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
f |= (ch == '-'), c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define int long long
#define N 200010
#define M 1010
using namespace std;
const int mod = 1e9 + 7;
int sum[N], a[N], n;
int read() {
int s = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
f |= (ch == '-'), c... | replace | 6 | 7 | 6 | 7 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
int a[maxn];
int sum[maxn];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sum[n + 1] = 0;
for (int i = n; i >= 2;... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
int a[maxn];
int sum[maxn];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sum[n + 1] = 0;
for (int i = n; i >= 2;... | replace | 3 | 4 | 3 | 4 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define _dec(i, N, j) for (int i = (N - 1); i >= (j); i--)
#define _rec(i, N, j) for (int i = (N); i >= (j); i--)
#define ALL(x) x.begin(), x.end()
#define MEM(a, n... | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define _dec(i, N, j) for (int i = (N - 1); i >= (j); i--)
#define _rec(i, N, j) for (int i = (N); i >= (j); i--)
#define ALL(x) x.begin(), x.end()
#define MEM(a, n... | replace | 149 | 150 | 149 | 150 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// using namespace __gnu_pbds;
... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// using namespace __gnu_pbds;
... | replace | 68 | 78 | 68 | 75 | TLE | |
p02572 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC o... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC o... | replace | 72 | 73 | 72 | 73 | 0 | |
p02572 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define BOUND 27182818284
#define MAT 2
typedef long long ll;
typedef long long int lli;
typedef... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define BOUND 27182818284
#define MAT 2
typedef long long ll;
typedef long long int lli;
typedef... | replace | 447 | 448 | 447 | 448 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02572 | Python | Time Limit Exceeded | # -*- coding: utf-8 -*-
n = int(input())
nums = list(map(int, input().split()))
x = 10**9 + 7
ans = 0
for i in range(1, n):
ans += (sum(nums[:i]) % x) * nums[i]
ans = ans % x
print(ans)
| # -*- coding: utf-8 -*-
n = int(input())
nums = list(map(int, input().split()))
x = 10**9 + 7
ans = 0
sums = [0] * (n - 1)
for j in range(n - 1):
if j == 0:
sums[0] = nums[0] % x
else:
sums[j] = (sums[j - 1] + nums[j]) % x
for i in range(1, len(nums)):
ans += sums[i - 1] * nums[i]
a... | replace | 8 | 10 | 8 | 18 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ull = unsigned long long int;
using ll = long long int;
constexpr ull mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ull> A(n);
for (int i = 0; i < n; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ull = unsigned long long int;
using ll = long long int;
constexpr ull mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ull> A(n);
for (int i = 0; i < n; i++) {
... | replace | 21 | 28 | 21 | 26 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define vite \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define tst ... | #include <bits/stdc++.h>
using namespace std;
#define vite \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define tst ... | replace | 27 | 32 | 27 | 34 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[100005];
// ------------------------------------
// 1 is true
// 0 is false
// ------------------------------------
ll binexp(ll x, ll n, ll m) {
x %= m;
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % m;
}
x = x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[200005];
// ------------------------------------
// 1 is true
// 0 is false
// ------------------------------------
ll binexp(ll x, ll n, ll m) {
x %= m;
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % m;
}
x = x... | replace | 3 | 4 | 3 | 4 | 0 | |
p02572 | C++ | Runtime Error | #include "algorithm"
#include "cmath"
#include "cstdio"
#include "cstring"
#include "iostream"
#include "queue"
#include "stack"
using namespace std;
#define read(x) scanf("%d", &x)
#define readl(x) scanf("%lld", &x)
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
int n;
ll a[100005];
ll su... | #include "algorithm"
#include "cmath"
#include "cstdio"
#include "cstring"
#include "iostream"
#include "queue"
#include "stack"
using namespace std;
#define read(x) scanf("%d", &x)
#define readl(x) scanf("%lld", &x)
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
int n;
ll a[200005];
ll su... | replace | 16 | 18 | 16 | 18 | 0 | |
p02572 | 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 P 1000000007
int main() {
// input
int64_t N;
cin >> N;
vector<int64_t> A(N);
rep(i, N) { cin >> A.at(i); }
// calc
int64_t ans = 0;
rep(i, N - 1) {
for (int64_t j = i + 1; j < N; j++)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define P 1000000007
int main() {
// input
int64_t N;
cin >> N;
vector<int64_t> A(N);
rep(i, N) { cin >> A.at(i); }
// calc
int64_t ans = 0;
int64_t S = 0;
for (int i = N - 2; i >= 0; i--) {
... | replace | 13 | 18 | 13 | 19 | TLE | |
p02572 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <string.h>
#define mod 1000000007
using namespace std;
long long a[100100];
long long h, n;
int main() {
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
h += a[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
h -= a[i]... | #include <algorithm>
#include <stdio.h>
#include <string.h>
#define mod 1000000007
using namespace std;
long long a[10010000];
long long h, n;
int main() {
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
h += a[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
h -= a[... | replace | 6 | 7 | 6 | 7 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define endl '\n'
const ll MOD = 1000000007;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define endl '\n'
const ll MOD = 1000000007;... | replace | 35 | 37 | 35 | 39 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
ll n, sum = 0, summ = 0, a[300005];
cin >> n;
rep(i, n) { cin >> a[i]; }
rep(i, n - 1) {
summ = 0;
for (int j = i + 1; j < n; j... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
ll n, sum = 0, summ = 0, a[300005];
cin >> n;
rep(i, n) { cin >> a[i]; }
rep(i, n - 1) {
summ += a[n - 1 - i];
summ %= mod;
... | replace | 12 | 18 | 12 | 15 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long a[100005], pref[100005], res = 0;
int main() {
int n, mod = 1000000007;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pref[i] = a[i] + pref[i - 1];
}
for (int i = 1; i <= n; i++) {
res += ((pref[i - 1] % mod) * (a[i] % mod)) % mod;
... | #include <bits/stdc++.h>
using namespace std;
long long a[200005], pref[200005], res = 0;
int main() {
int n, mod = 1000000007;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pref[i] = a[i] + pref[i - 1];
}
for (int i = 1; i <= n; i++) {
res += ((pref[i - 1] % mod) * (a[i] % mod)) % mod;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long int ans = 0;
for (int i = 0; i < n - 1; i++) {
long long int sum = 0;
for (int j = i + 1; j < n; j++) {
s... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long int ans = 0;
long long int sum = 0;
for (int i = n - 1; i > 0; i--) {
sum += a[i];
sum %= MOD;
ans += a[i ... | replace | 14 | 22 | 14 | 19 | TLE | |
p02572 | 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;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
long long sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
sum += (long long)a.at(i) * a.at(j);... | #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;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
long long sum = 0;
long long u = 0;
for (int i = n - 1; i > 0; i--) {
u += a.at(i);
u = u % 1000000007;
sum += u * a.at... | replace | 11 | 16 | 11 | 17 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define endl '\n'
#define pb push_back
const int N = 1e5 + 1;
const int INF = 1e9 + 7;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int A[n];
for (int i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define endl '\n'
#define pb push_back
const int N = 1e5 + 1;
const int INF = 1e9 + 7;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int A[n];
for (int i = 0; i < n; i++) ... | replace | 20 | 25 | 20 | 29 | TLE | |
p02572 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | replace | 80 | 81 | 80 | 81 | 0 | |
p02572 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
s = 0
for i in range(n):
for j in range(i + 1, n):
s += a[i] * a[j]
s %= 1000000007
print(s % 1000000007)
| n = int(input())
a = list(map(int, input().split()))
s1 = sum(a)
s2 = 0
ans = 0
for i in range(n - 1):
s2 += a[i]
ans += a[i] * (s1 - s2)
print(ans % 1000000007)
| replace | 2 | 8 | 2 | 9 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll inf = 1000000007;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll inf = 1000000007;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ... | replace | 22 | 23 | 22 | 23 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<ll> a(n)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<ll> a(n)... | replace | 17 | 21 | 17 | 23 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define pii p... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define pii p... | replace | 35 | 39 | 35 | 42 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<int, pii> viii;
typedef vector<pll> vll;
typedef vector<ll> vl;
typedef vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<int, pii> viii;
typedef vector<pll> vll;
typedef vector<ll> vl;
typedef vect... | replace | 25 | 26 | 25 | 26 | -11 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int ll
#define FOR(i, s, e) for (ll i = s; i <= (ll)e; ++i)
#define DEC(i, s, e) for (ll i = s; i >= (ll)e; --i)
#define IAMSPEED \
ios_b... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int ll
#define FOR(i, s, e) for (ll i = s; i <= (ll)e; ++i)
#define DEC(i, s, e) for (ll i = s; i >= (ll)e; --i)
#define IAMSPEED \
ios_b... | replace | 48 | 49 | 48 | 49 | 0 | |
p02572 | C++ | Runtime Error | #include <cstring>
#include <fstream>
#include <iostream>
#define rep(a) for (int i = 0; i < a; i++)
#define E << endl;
#define Mode 1000000007
#define F freopen("in.txt", "r", stdin);
using namespace std;
int main() {
// F;
int ar[20005];
int tem[20005];
int n;
cin >> n;
rep(n) cin >> ar[i];
long long... | #include <cstring>
#include <fstream>
#include <iostream>
#define rep(a) for (int i = 0; i < a; i++)
#define E << endl;
#define Mode 1000000007
#define F freopen("in.txt", "r", stdin);
using namespace std;
int main() {
// F;
int ar[200005];
long long tem[200005];
int n;
cin >> n;
rep(n) cin >> ar[i];
l... | replace | 12 | 14 | 12 | 14 | 0 | |
p02572 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 10000000000... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const int MOD = 998244353;
const ll INF = 10000000000... | replace | 17 | 18 | 17 | 18 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long ans = 0;
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
ans += a[i] * a[j];
ans = ans % (1000000007);
}
}
cout <... | #include <iostream>
using namespace std;
int main() {
long long ans = 0;
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long b[n + 1] = {};
for (int i = n - 1; i >= 0; i--) {
b[i] = b[i + 1] + a[i];
b[i] = b[i] % 1000000007;
}
for (int i = 0; i < n... | replace | 13 | 18 | 13 | 22 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
ll ans = 0;
ll temp;
for (int i = 0; i < N - 1; i++) {
temp = 0;
for (int j = i + 1; j < N; j++)... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
ll ans = 0;
ll temp;
for (int i = 1; i < N; i++) {
temp += A.at(i - 1);
temp %= MOD;
ans += ... | replace | 18 | 23 | 18 | 20 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <queue>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define ll long long
#define ld long double
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repsl(i, s, n) for (ll i =... | #include <bits/stdc++.h>
#include <queue>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define ll long long
#define ld long double
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repsl(i, s, n) for (ll i =... | replace | 29 | 34 | 29 | 33 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
ll r = 1e9 + 7;
cin >> n;
ll arr[n];
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
for (ll j = 0; j < i; j++) {
sum += (arr[i] * arr[j]) % r;
}
}
cout << sum % r;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
ll r = 1e9 + 7;
cin >> n;
ll arr[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
ll temp;
cin >> temp;
if (i == 0)
arr[i] = temp;
else {
sum += (temp * arr[i - 1]) % r;
arr[i] = (arr[i - 1]... | replace | 10 | 14 | 10 | 18 | TLE | |
p02572 | C++ | Runtime Error | #pragma GCC optimize(2)
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#inc... | #pragma GCC optimize(2)
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#inc... | replace | 28 | 29 | 28 | 29 | 0 | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
const ll m = 1e9 + 7;
using namespace std;
ll add(ll i, ll j) { return ((i % m) + (j % m)) % m; }
ll mod(ll i, ll j) { return ((i % m) * (j % m)) % m; }
int main() {
int n;
cin >> n;
vector<ll> v(n);
vector<ll> presum(n);
v[n] = 0;
presum[n] = 0;
for (int i = ... | #include <bits/stdc++.h>
#define ll long long
const ll m = 1e9 + 7;
using namespace std;
ll add(ll i, ll j) { return ((i % m) + (j % m)) % m; }
ll mod(ll i, ll j) { return ((i % m) * (j % m)) % m; }
int main() {
int n;
cin >> n;
vector<ll> v(n + 1, 0);
vector<ll> presum(n + 1, 0);
v[n] = 0;
presum[n] = 0;
... | replace | 9 | 11 | 9 | 11 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
const ll p = 1000000007;
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
ans += (a.at(i) % p) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
const ll p = 1000000007;
ll ans = 0;
ll b = a.at(0) % p;
for (int i = 1; i < n; i++) {
ans += (a.at(i) % p) * (b % p);
ans %= ... | replace | 13 | 18 | 13 | 19 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, b, n) for (int i = (b); i < (n); i++)
using namespace std;
using ll = long long;
const ll M = 1000000007;
int main() {
ll n, ans = 0;
cin >> n;
vector<ll> a(n + 10);
r... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, b, n) for (int i = (b); i < (n); i++)
using namespace std;
using ll = long long;
const ll M = 1000000007;
int main() {
ll n, ans = 0;
cin >> n;
vector<ll> a(n + 10);
v... | replace | 14 | 20 | 14 | 27 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pai... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pai... | replace | 21 | 22 | 21 | 22 | 0 | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
ll mod = 7 + 1e9;
ll n, ans = 0;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
rep(i, n) rep(j, i) {
ans += (a[i] * a[j]) % mod;
ans %= mod;
}
c... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
ll mod = 7 + 1e9;
ll n, ans = 0;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) {
cin >> a[i];
if (i != 0)
b[i] += b[i - 1] + a[i];
}
rep(i, n) {
... | replace | 10 | 14 | 10 | 19 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> av(n);
long long suma = 0;
for (auto &a : av) {
cin >> a;
suma += a;
}
long long ret = 0;
for (long long i = 0; i < n - 1; ++i) {
suma -= av[i];
if (1000000007 < suma) {
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> av(n);
long long suma = 0;
for (auto &a : av) {
cin >> a;
suma += a;
}
long long ret = 0;
for (long long i = 0; i < n - 1; ++i) {
suma -= av[i];
long long tempa = suma % 100... | replace | 17 | 30 | 17 | 20 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
int main() {
LL n, ans = 0;
cin >> n;
vector<LL> a(n);
for (LL i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans += (a[i] % MOD) * (a[j] % MOD);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
int main() {
LL n, ans = 0;
cin >> n;
vector<LL> a(n);
for (LL i = 0; i < n; i++)
cin >> a[i];
LL subSum = 0;
for (int i = 0; i < n - 1; i++) {
subSum += a[i];
subSum %= MOD;
ans += subSum * a[i + ... | replace | 10 | 15 | 10 | 16 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define vvi vector<vector<int>>
#define vvll vector<vector<... | #include <algorithm>
#include <climits>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define vvi vector<vector<int>>
#define vvll vector<vector<... | replace | 26 | 31 | 26 | 30 | TLE | |
p02572 | Python | Time Limit Exceeded | def main():
import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N):
ans += sum(list(map(lambda x: A[i] * x, A[i + 1 :])))
print(ans % (10**9 + 7))
main()
| def main():
import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
ans = 0
all_num = sum(A)
for i in range(N, 1, -1):
all_num -= A[i - 1]
ans += A[i - 1] * all_num
print(ans % (10**9 + 7))
main()
| replace | 9 | 11 | 9 | 13 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MM = 1e9 + 7;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll &i : A)
cin >> i;
ll count = 0;
for (ll i = 0; i < N - 1; i++)
for (ll j = i + 1; j < N; j++) {
count += (A[i] * A[j]) % MM;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MM = 1e9 + 7;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll &i : A)
cin >> i;
ll sum = 0, count = 0;
vector<ll> B(N);
for (ll j = N - 1; j >= 0; j--) {
// cout << j << endl;
sum += A... | replace | 12 | 18 | 12 | 27 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &... | replace | 144 | 148 | 144 | 149 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int, int> pi;
typedef pair<lld, lld> pl;
typedef pair<int, lld> pil;
typedef pair<lld, int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int, int> pi;
typedef pair<lld, lld> pl;
typedef pair<int, lld> pil;
typedef pair<lld, int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef ve... | replace | 31 | 32 | 31 | 32 | 0 | |
p02572 | Python | Time Limit Exceeded | #!/usr/bin/env python3
N = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for i in range(N - 1):
ans += (A[i] * (sum(A[i + 1 :]) % mod)) % mod
ans = ans % mod
print(ans)
| #!/usr/bin/env python3
N = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
s = sum(A) ** 2
a = 0
for i in A:
a += i**2
ans = (s - a) // 2
ans = ans % mod
print(ans)
| replace | 5 | 9 | 5 | 15 | TLE | |
p02572 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int __int128
using namespace std;
const int mod = 1e9 + 7;
int n, sum[100005], a[100005], ans;
inline int read() {
int s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
... | #include <bits/stdc++.h>
#define int __int128
using namespace std;
const int mod = 1e9 + 7;
int n, sum[1000005], a[1000005], ans;
inline int read() {
int s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02572 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += a[i] * sum(a[i + 1 :])
print(ans % (10**9 + 7))
| n = int(input())
a = list(map(int, input().split()))
ans = 0
r = [0] * (n + 1)
for i, v in enumerate(a, start=1):
r[i] = v + r[i - 1]
for i in range(n - 1):
ans += a[i + 1] * r[i + 1]
print(ans % (10**9 + 7))
| replace | 3 | 5 | 3 | 9 | TLE | |
p02572 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, sum = 0;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (i < j) {
sum += a[i] * a[j];
sum = sum % 1000000007;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, sum = 0;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int x = 0;
for (long long int i = 0; i < n; i++) {
// for(long long int j=i+1;j<n;j++)
// {
// if(i<j)
// {
sum = (sum + ((long ... | replace | 8 | 15 | 8 | 19 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.