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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02624 | C++ | Runtime Error | #include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define INF ((1 << 30) - 1 + (1 << 30))
#define INFLL (1LL << 60)
#define MOD 1000000007
#de... | #include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define INF ((1 << 30) - 1 + (1 << 30))
#define INFLL (1LL << 60)
#define MOD 1000000007
#de... | replace | 32 | 33 | 32 | 33 | 0 | |
p02624 | C++ | Time Limit Exceeded | #include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
ll ans = 0;
for (int i = 1; i <= N; i++) {
for (int j = i; i <= N; j += i) {
ans += j;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
ll ans = 0;
for (int i = 1; i <= N; i++) {
for (int j = i; j <= N; j += i) {
ans += j;
}
}
cout << ans << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02624 | C++ | Time Limit Exceeded |
///***### بسم الله الرحمن الرحيم ###***///
/*
Author : Borhan Uddin Rafi
University : Begum Rokeya University,Rangpur.
Date : 27 June,2020;
*/
///************************Start Of Template**************... |
///***### بسم الله الرحمن الرحيم ###***///
/*
Author : Borhan Uddin Rafi
University : Begum Rokeya University,Rangpur.
Date : 27 June,2020;
*/
///************************Start Of Template**************... | replace | 50 | 51 | 50 | 51 | TLE | |
p02624 | C++ | Time Limit Exceeded | /*BISMILLAH
THE WHITE WOLF
NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb pus... | /*BISMILLAH
THE WHITE WOLF
NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb pus... | replace | 24 | 35 | 24 | 30 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
ll pass() {
ll k = 0, s = 0;
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= n; j += i) {
a[j]++;
}
}
for (int i = 1; i <= n; i++) {
s += (i * (ll)a[i]);
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
void pass() {
ll k = 0, s = 0;
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= n; j += i) {
a[j]++;
}
}
for (int i = 1; i <= n; i++) {
s += (i * (ll)a[i])... | replace | 4 | 5 | 4 | 5 | 0 | |
p02624 | Python | Time Limit Exceeded | import numpy as np
from numba import njit
n = int(input())
@njit
def f(n):
cnt = np.zeros(n + 1, np.int32)
for i in range(1, n + 1):
cnt[i::i] += 1
return (cnt * np.arange(n + 1)).sum()
ans = f(n)
print(ans)
| import numpy as np
from numba import njit
n = int(input())
@njit
def f(n):
cnt = np.zeros(n + 1, np.int16)
for i in range(1, n + 1):
cnt[i::i] += 1
return (cnt * np.arange(n + 1)).sum()
ans = f(n)
print(ans)
| replace | 8 | 9 | 8 | 9 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
ll ans = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (i % j == 0) {
ans += i;
}
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
ll ans = 0;
for (int i = 1; i <= N; i++) {
ll c = N / i;
ans += c * (c + 1) / 2 * i;
}
cout << ans;
return 0;
} | replace | 11 | 16 | 11 | 13 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll x = 0;
vector<ll> div(10000000000, 0);
for (ll i = 1; i <= N; i++) {
for (ll j = 1; i * j <= N; j++) {
div[i * j]++;
}
}
for (ll k = 1; k <= N; k++) {
x += k * div[k];
}
cout << x <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll x = 0;
vector<ll> div(10000000, 0);
for (ll i = 1; i <= N; i++) {
for (ll j = 1; i * j <= N; j++) {
div[i * j]++;
}
}
for (ll k = 1; k <= N; k++) {
x += k * div[k];
}
cout << x << e... | replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
int main() {
i64 N;
cin >> N;
i64 ans = 1;
vector<map<i64, i64>> cnt(N + 1);
vector<i64> memo(N + 1);
memo[1] = 1;
for (i64 i = 2; i <= N; i++) {
i64 t = i;
for (i64 j = 2; j * j <= i; j++) {
if (i % j !=... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
int main() {
i64 N;
cin >> N;
vector<i64> cnt(N + 1);
for (i64 i = 1; i <= N; i++)
for (i64 j = 1; i * j <= N; j++)
cnt[i * j]++;
i64 ans = 0;
for (i64 i = 1; i <= N; i++)
ans += cnt[i] * i;
cout << ans <... | replace | 8 | 25 | 8 | 15 | TLE | |
p02624 | C++ | Runtime Error | // Problem : D - Sum of Divisors
// Contest : AtCoder - AtCoder Beginner Contest 172
// URL : https://atcoder.jp/contests/abc172/tasks/abc172_d
// Memory Limit : 1024 MB
// Time Limit : 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define endl '\... | // Problem : D - Sum of Divisors
// Contest : AtCoder - AtCoder Beginner Contest 172
// URL : https://atcoder.jp/contests/abc172/tasks/abc172_d
// Memory Limit : 1024 MB
// Time Limit : 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define endl '\... | replace | 118 | 119 | 118 | 120 | 0 | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// TEMPLATE
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define F first
#define S second
#define newline printf("\n")
#define minusone printf("-1\n")
#define zeroo printf("0\n")
... | #include <bits/stdc++.h>
using namespace std;
// TEMPLATE
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define F first
#define S second
#define newline printf("\n")
#define minusone printf("-1\n")
#define zeroo printf("0\n")
... | replace | 65 | 66 | 65 | 66 | 0 | |
p02624 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#define int long long
#define rr register
#define inf 1e9
#define MAXN 10000010
using namespace std;
inline int read() {
int s = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#define int long long
#define rr register
#define inf 1e9
#define MAXN 10000010
using namespace std;
inline int read() {
int s = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
... | replace | 38 | 39 | 38 | 39 | TLE | |
p02624 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll s = 0;
vector<ll> a(n);
rep(i... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll s = 0;
vector<ll> a(n);
rep(i... | replace | 16 | 22 | 16 | 19 | 0 | |
p02624 | C++ | Time Limit Exceeded |
/*****/
#define TRUE true
#define FALSE false
#include <bits/stdc++.h>
/**/
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/**/
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
template... |
/*****/
#define TRUE true
#define FALSE false
#include <bits/stdc++.h>
/**/
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/**/
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
template... | replace | 285 | 293 | 285 | 286 | TLE | |
p02624 | C++ | Time Limit Exceeded | // time out
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll ans = 0;... | // time out
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll ans = 0;... | replace | 15 | 18 | 15 | 17 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ss string
#define ll long long int
#define Endl endl
#define u_b upper_bound
#define rep(i, n) for (int i = 0; i < n; i++)
#define ld long double
#define tc ... | #include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ss string
#define ll long long int
#define Endl endl
#define u_b upper_bound
#define rep(i, n) for (int i = 0; i < n; i++)
#define ld long double
#define tc ... | replace | 88 | 89 | 88 | 89 | -11 | |
p02624 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> pin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> pin... | insert | 81 | 81 | 81 | 85 | TLE | |
p02624 | C++ | Time Limit Exceeded | /*==============================================*\
Codeforces ID: mdshihab
Atcoder ID : mdshihab |
Name: Md. Shihabul Minhaz |
Study: CSE, JKKNIU |
Address: Trishal, Mymensingh, Bangladesh |
... | /*==============================================*\
Codeforces ID: mdshihab
Atcoder ID : mdshihab |
Name: Md. Shihabul Minhaz |
Study: CSE, JKKNIU |
Address: Trishal, Mymensingh, Bangladesh |
... | replace | 68 | 71 | 68 | 70 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 998244353
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 998244353
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
... | replace | 62 | 73 | 62 | 68 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
rep(i, n) {
ll k = n / i;
ans += i * k * (k + 1) / 2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = 0;
rep(i, n) {
ll k = n / i;
ans += i * k * (k + 1) / 2;
}
cout << ans << endl;
} | replace | 1 | 2 | 1 | 2 | -8 | |
p02624 | C++ | Runtime Error | /*
──────────────────────────────░░░────────
───────────────────────────░▓█████▒──────
──────────────────────────░████████▒─────
─────────────────────────░██████████░────
─────────────────────────███████████▓────
────────────────────────░████████████────
────────────────────────█████████████... | /*
──────────────────────────────░░░────────
───────────────────────────░▓█████▒──────
──────────────────────────░████████▒─────
─────────────────────────░██████████░────
─────────────────────────███████████▓────
────────────────────────░████████████────
────────────────────────█████████████... | replace | 70 | 72 | 70 | 72 | -11 | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define vi vector<int>
#define pob push_back
#define pf pop_front()
#define mp make_pair
#define loop(i, a, b) for (int i = a; i < b; ++i)
#define eloop(i, a, b) for (int i = a; i <= b; ++i)
#define rloop(i, a, b) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define vi vector<int>
#define pob push_back
#define pf pop_front()
#define mp make_pair
#define loop(i, a, b) for (int i = a; i < b; ++i)
#define eloop(i, a, b) for (int i = a; i <= b; ++i)
#define rloop(i, a, b) for (int i = ... | replace | 191 | 192 | 191 | 194 | TLE | |
p02624 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, h, i, j, k, l, m, n, x, y;
ll ans = 0;
string s;
cin >> n;
for (a = 1; a <= n; a++) {
ll fk = 0;
for (i = 1; i * i <= a; i++... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, h, i, j, k, l, m, n, x, y;
ll ans = 0;
string s;
cin >> n;
for (i = 1; i <= n; i++) {
ans += (n - (n % i) + i) * (n / i) / 2;
... | replace | 13 | 24 | 13 | 16 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define debug printf("\n<<CameHere<<\n")
#define mem(x, y) memset(x, y, sizeof(x))
#define all(qz) qz.begin(), qz.end()
#define rall(qz) qz.rbegin(), qz.rend()
#define inf LLONG_MIN
#define INF LLONG_MAX
#define mod 1000000007
#define Sqr(x) ((x) * (x))
#define ll long long... | #include <bits/stdc++.h>
using namespace std;
#define debug printf("\n<<CameHere<<\n")
#define mem(x, y) memset(x, y, sizeof(x))
#define all(qz) qz.begin(), qz.end()
#define rall(qz) qz.rbegin(), qz.rend()
#define inf LLONG_MIN
#define INF LLONG_MAX
#define mod 1000000007
#define Sqr(x) ((x) * (x))
#define ll long long... | replace | 22 | 23 | 22 | 23 | TLE | |
p02624 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9 + 7;
const int vx[6] = {0, 1, 0, -1, 1, -1};
const int vy[6] =... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9 + 7;
const int vx[6] = {0, 1, 0, -1, 1, -1};
const int vy[6] =... | replace | 31 | 32 | 31 | 32 | MLE | |
p02624 | C++ | Time Limit Exceeded | /*input
*/
// assic value of ('0'-'9') is(48 - 57) and (a-z) is (97-122) and (A-Z)
// is(65-90) and 32 for space #pragma GCC target ("avx2") #pragma GCC
// optimization ("O3") #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hp... | /*input
*/
// assic value of ('0'-'9') is(48 - 57) and (a-z) is (97-122) and (A-Z)
// is(65-90) and 32 for space #pragma GCC target ("avx2") #pragma GCC
// optimization ("O3") #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hp... | replace | 84 | 95 | 84 | 88 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define arep(a, i, n) for (int i = (a); i < (n); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define cinf(x, n) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define coutf(... | #include <bits/stdc++.h>
#define arep(a, i, n) for (int i = (a); i < (n); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define cinf(x, n) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define coutf(... | replace | 22 | 23 | 22 | 23 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
typedef long long int lli;
using na... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
typedef long long int lli;
using na... | replace | 33 | 36 | 33 | 40 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<in... | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<in... | replace | 59 | 62 | 59 | 61 | TLE | |
p02624 | C++ | Runtime Error | // Created by Kshitij Anand NSIT
#include <bits/stdc++.h>
// #include <ext/numeric>
// using namespace __gnu_cxx;
using namespace std;
#define int long long
#define pb push_back
#define P pair<int, int>
#define F first
#define S second
#define vi vector<int>
#define vc vector<char>
#define vb vector<bool>
#define all... | // Created by Kshitij Anand NSIT
#include <bits/stdc++.h>
// #include <ext/numeric>
// using namespace __gnu_cxx;
using namespace std;
#define int long long
#define pb push_back
#define P pair<int, int>
#define F first
#define S second
#define vi vector<int>
#define vc vector<char>
#define vb vector<bool>
#define all... | replace | 30 | 31 | 30 | 31 | 0 | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pb push_back
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pb push_back
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | replace | 22 | 26 | 22 | 24 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#includ... | replace | 135 | 162 | 135 | 139 | TLE | |
p02624 | C++ | Runtime Error | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
struct _ {
ios_base::Init i;
_() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); }
} _;
vector<long long> spf(1e7 + 1, 0);
int main() {
long long n;
cin >> n;
iota(spf.begin(), spf.begin() + n, 0);
for (lo... | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
struct _ {
ios_base::Init i;
_() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); }
} _;
vector<long long> spf(1e7 + 1, 0);
int main() {
long long n;
cin >> n;
iota(spf.begin(), spf.begin() + n + 1, 0);
for... | replace | 17 | 18 | 17 | 18 | -8 | |
p02624 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<str... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<str... | replace | 56 | 58 | 56 | 62 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h> // This will work only for g++ compiler.
#include <ext/pb_ds/assoc_container.hpp> // Used to include policy based data structure
using namespace __gnu_pbds; // Only for g++ compiler
using namespace std;
#define for0(i, n) for (int i = 0; i < (int)(n); ++i) // 0 based indexing
#de... | #include <bits/stdc++.h> // This will work only for g++ compiler.
#include <ext/pb_ds/assoc_container.hpp> // Used to include policy based data structure
using namespace __gnu_pbds; // Only for g++ compiler
using namespace std;
#define for0(i, n) for (int i = 0; i < (int)(n); ++i) // 0 based indexing
#de... | replace | 83 | 87 | 83 | 85 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define endl '\n'
#define pi 2 * acos(0.0)
#define pb(a) push_back(a)
#define db double
#define ld long double
#define ll long long
#define ull unsigned long long
#define mod 1000000007
#define inf 1000000000000000001
#define sqr(x) (x) * (x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a ... | #include <bits/stdc++.h>
#define endl '\n'
#define pi 2 * acos(0.0)
#define pb(a) push_back(a)
#define db double
#define ld long double
#define ll long long
#define ull unsigned long long
#define mod 1000000007
#define inf 1000000000000000001
#define sqr(x) (x) * (x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a ... | replace | 28 | 32 | 28 | 30 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll a = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= n; j++) {
if (i % j == 0)
a += i;
}
}
cout << a;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll a = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = i; j <= n; j += i) {
a += j;
}
}
cout << a;
}
| replace | 8 | 11 | 8 | 10 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int n, i, j, s = 0, sum = 0;
cin >> n;
for (i = 1; i <= n; i++) {
for (j = 1; j <= i; j++) {
if (i % j == 0)
s++;
}
sum += (s * i);
s = 0;
}
cout << sum;
}
| #include <iostream>
using namespace std;
int main() {
long long int n, i, j, s = 0, sum = 0;
cin >> n;
for (i = 1; i <= n; i++) {
for (j = i; j <= n; j = j + i)
sum += j;
}
cout << sum;
}
| replace | 6 | 12 | 6 | 8 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
map<ll, int> mp;
ll ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; j = j + i) {
mp[j]++;
}
ans += i * mp[i];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
// map<ll,int> mp;
vector<ll> mp(n + 1, 0);
ll ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; j = j + i) {
mp[j]++;
}
ans += i * mp[i];
}
cout << ans << endl;
return 0;
... | replace | 7 | 8 | 7 | 9 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> p(n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / i; j++) {
p[i * j - 14]++;
}
}
ll ans = 0;
rep(i, n) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> p(n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n / i; j++) {
p[i * j - 1]++;
}
}
ll ans = 0;
rep(i, n) {... | replace | 12 | 13 | 12 | 13 | 0 | |
p02624 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
// INPUT
ll N = 0;
cin >> N;
// SOURCE
ll ans = 0;
for (ll i = 1; i < N + 1; ++i) {
for (ll j = 1; j <= i; ++j) {
if (i % j == 0)
ans += i;
}
}
// OUTPUT
cout << ans <... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
// INPUT
ll N = 0;
cin >> N;
// SOURCE
ll ans = 0;
for (ll i = 1; i < N + 1; ++i) {
ll Y = N / i;
ans += (Y * (Y + 1) * i) / 2;
}
// OUTPUT
cout << ans << endl;
return 0;
}
| replace | 13 | 17 | 13 | 15 | TLE | |
p02624 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
#define ll long long
int n;
int main() {
scanf("%d", &n);
ll ans = 0;
for (int i = 1; i <= n; i++) {
ll sum = 0;
for (int j = 1; j <= i; j++)
if (i % j == 0)
sum++;
ans += 1ll * i * sum;
}
printf("%lld", ans);
return 0;
} | #include <cstdio>
using namespace std;
#define ll long long
int n;
int main() {
scanf("%d", &n);
ll ans = 0;
for (int i = 1; i <= n; i++) {
ll x = n / i;
ans += x * (x + 1) / 2 * i;
}
printf("%lld", ans);
return 0;
} | replace | 11 | 16 | 11 | 13 | TLE | |
p02624 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | replace | 37 | 40 | 37 | 40 | -8 | |
p02624 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", std... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", std... | replace | 180 | 181 | 180 | 185 | TLE | |
p02624 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long... | replace | 358 | 359 | 358 | 359 | -8 | |
p02624 | C++ | Time Limit Exceeded | // prepared by dumb
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define dl double
#define llu unsigned long long int
#define scll(x) scanf("%lld", &x)
#define scdl(x) scanf("%lf", &x)
#define scull(x) scanf("%llu", &x)
#define scch(x) scanf(" %c", &x)
#define pb(x) push_back(x)
#define pf(x) ... | // prepared by dumb
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define dl double
#define llu unsigned long long int
#define scll(x) scanf("%lld", &x)
#define scdl(x) scanf("%lf", &x)
#define scull(x) scanf("%llu", &x)
#define scch(x) scanf(" %c", &x)
#define pb(x) push_back(x)
#define pf(x) ... | replace | 42 | 43 | 42 | 43 | TLE | |
p02624 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
long long N;
cin >> N;
long long ans = 0;
for (int X = 0; X < N; X++) {
long long Y = N / X;
long long G = Y * (Y + 1) * X / 2;
ans += G;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
long long N;
cin >> N;
long long ans = 0;
for (int X = 1; X <= N; X++) {
long long Y = N / X;
long long G = Y * (Y + 1) * X / 2;
ans += G;
}
cout << ans << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | -8 | |
p02625 | C++ | Runtime Error |
/* You are being watched. */
//~ while (clock() <= 69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") ~ #pragma
//GCC optimize("unroll-loops")
using namespa... |
/* You are being watched. */
//~ while (clock() <= 69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") ~ #pragma
//GCC optimize("unroll-loops")
using namespa... | replace | 56 | 57 | 56 | 57 | 0 | |
p02625 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#defi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#defi... | replace | 83 | 84 | 83 | 84 | 0 | |
p02625 | 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;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
... | replace | 38 | 39 | 38 | 39 | 0 | |
p02625 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ar array
#define AC \
ios_base::sync_with_stdio(0); \
cin.tie(NULL);
using namespace std;
const int MOD = 1e9 + 7;
const int N = 5 * 1e5;
struct m... | #include <bits/stdc++.h>
#define ll long long
#define ar array
#define AC \
ios_base::sync_with_stdio(0); \
cin.tie(NULL);
using namespace std;
const int MOD = 1e9 + 7;
const int N = 5 * 1e5;
struct m... | replace | 81 | 83 | 81 | 83 | 0 | |
p02625 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
#define pb push_back
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define ll l... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
#define pb push_back
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define ll l... | replace | 38 | 39 | 38 | 39 | 0 | |
p02625 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define big 1e18 + 10
#define small -big
#define pb push_back
#define endl "\n"
template <typename T>
void prarr(T a) {
cerr << "[ ";
for (auto i : a) {
cerr << i << " ";
}
cerr << "]" <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define big 1e18 + 10
#define small -big
#define pb push_back
#define endl "\n"
template <typename T>
void prarr(T a) {
cerr << "[ ";
for (auto i : a) {
cerr << i << " ";
}
cerr << "]" <... | replace | 128 | 129 | 128 | 129 | TLE | |
p02625 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02625 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5, MOD = 1e9 + 7;
struct mi {
ll v;
explicit operator ll() const { return v; }
mi() { v = 0; }
mi(ll _v) {
v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
if (v < 0)
v += MOD;
}
friend bool operator==(c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5e5 + 5, MOD = 1e9 + 7;
struct mi {
ll v;
explicit operator ll() const { return v; }
mi() { v = 0; }
mi(ll _v) {
v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
if (v < 0)
v += MOD;
}
friend bool operator==(c... | replace | 5 | 6 | 5 | 6 | 0 | |
p02626 | C++ | Runtime Error | //{{{
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll... | //{{{
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll... | replace | 89 | 91 | 89 | 100 | 0 | |
p02626 | C++ | Runtime Error | // Utkarsh.25dec
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define vi vector<int>... | // Utkarsh.25dec
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#define ll long long int
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, a, b) for (ll i = a; i <= b; i++)
#define vi vector<int>... | replace | 99 | 100 | 99 | 103 | 0 | Time : 46.366ms
|
p02626 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef tree<int,null_type,less<int
// >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template <class T1, class T2> ostream &operator<<(... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
// typedef tree<int,null_type,less<int
// >,rb_tree_tag,tree_order_statistics_node_update>indexed_set;
template <class T1, class T2> ostream &operator<<(... | replace | 30 | 31 | 30 | 31 | 0 | |
p02626 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N;
cin >> N;
ull x, A1, A2;
cin >> A1;
cin >> A2;
x = 0;
for (int i = 3; i <= N; i++) {
ull a;
cin >> a;
x ^= a;
}
set<pair<ull, ull>> S; // (z+b,b)
S.insert(pair<ull, ul... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N;
cin >> N;
ull x, A1, A2;
cin >> A1;
cin >> A2;
x = 0;
for (int i = 3; i <= N; i++) {
ull a;
cin >> a;
x ^= a;
}
set<pair<ull, ull>> S; // (z+b,b)
S.insert(pair<ull, ul... | replace | 35 | 38 | 35 | 40 | TLE | |
p02626 | 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 && このテンプレートが使... | insert | 7,194 | 7,194 | 7,194 | 7,196 | TLE | |
p02626 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, set<T> S) {
os << "{ ";
for (auto s : S)
os << s << " ";
return os << ... | #include <bits/stdc++.h>
using namespace std;
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, set<T> S) {
os << "{ ";
for (auto s : S)
os << s << " ";
return os << ... | replace | 111 | 112 | 111 | 115 | 0 | |
p02626 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | replace | 36 | 37 | 36 | 37 | TLE | |
p02627 | Python | Runtime Error | s = input()
if s.isuper():
print("A")
else:
print("a")
| s = input()
if s.isupper():
print("A")
else:
print("a")
| replace | 1 | 2 | 1 | 2 | AttributeError: 'str' object has no attribute 'isuper'. Did you mean: 'isupper'? | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02627/Python/s327847448.py", line 2, in <module>
if s.isuper():
AttributeError: 'str' object has no attribute 'isuper'. Did you mean: 'isupper'?
|
p02627 | Python | Runtime Error | a = input()
if ord(a) >= "a" and ord(a) <= "z":
print("a")
else:
print("A")
| a = input()
if ord(a) >= ord("a") and ord(a) <= ord("z"):
print("a")
else:
print("A")
| replace | 1 | 2 | 1 | 2 | TypeError: '>=' not supported between instances of 'int' and 'str' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02627/Python/s399590534.py", line 2, in <module>
if ord(a) >= 'a' and ord(a) <= 'z':
TypeError: '>=' not supported between instances of 'int' and 'str'
|
p02627 | Python | Runtime Error | s = int(input())
if s == s.lower():
print("a")
else:
print("A")
| s = input()
if s == s.lower():
print("a")
else:
print("A")
| replace | 0 | 1 | 0 | 1 | ValueError: invalid literal for int() with base 10: 'B' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02627/Python/s654626857.py", line 1, in <module>
s = int(input())
ValueError: invalid literal for int() with base 10: 'B'
|
p02627 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define SCANF(i) \
int i; ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define SCANF(i) \
int i; ... | replace | 35 | 36 | 35 | 36 | 0 | |
p02627 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(A) A.begin(), A.end()
#define MEM(a, b) memset(a, b, sizeof(a))
#define FOR(n) for (int i = 0; i < n; ++i)
#define FOR_(n) for (int i = 1; i <= n; ++i)
#define FOR_J(n) for (int j = 0; j < n; ++j)
#define FOR_J_(n) for (int j = 1; j <= n; ++j)
#define IT_FOR(A) ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(A) A.begin(), A.end()
#define MEM(a, b) memset(a, b, sizeof(a))
#define FOR(n) for (int i = 0; i < n; ++i)
#define FOR_(n) for (int i = 1; i <= n; ++i)
#define FOR_J(n) for (int j = 0; j < n; ++j)
#define FOR_J_(n) for (int j = 1; j <= n; ++j)
#define IT_FOR(A) ... | replace | 35 | 36 | 35 | 36 | TLE | |
p02627 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pii pair<int, int>
#define vvi vector<vector<int>>
#define vi... | #include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pii pair<int, int>
#define vvi vector<vector<int>>
#define vi... | insert | 61 | 61 | 61 | 62 | 0 | |
p02628 | Python | Runtime Error | N, K = map(int, input().split())
P = list(map(int, input().split())).sort()
print(sum(P[:K]))
| N, K = map(int, input().split())
P = sorted(list(map(int, input().split())))
print(sum(P[:K]))
| replace | 1 | 2 | 1 | 2 | TypeError: 'NoneType' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02628/Python/s595641778.py", line 3, in <module>
print(sum(P[:K]))
TypeError: 'NoneType' object is not subscriptable
|
p02628 | Python | Runtime Error | N, K = (int(i) for i in input().split())
p = [input().split()]
sp = sorted(p)
print(sum(sp[:K]))
| N, K = (int(i) for i in input().split())
p = [int(i) for i in input().split()]
sp = sorted(p)
print(sum(sp[:K]))
| replace | 1 | 2 | 1 | 2 | TypeError: unsupported operand type(s) for +: 'int' and 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02628/Python/s927789922.py", line 5, in <module>
print(sum(sp[:K]))
TypeError: unsupported operand type(s) for +: 'int' and 'list'
|
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end() // Forward traversal
#define rall(x) (x).rbegin, (x).rend(... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end() // Forward traversal
#define rall(x) (x).rbegin, (x).rend(... | replace | 192 | 193 | 192 | 193 | -11 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, sum = 0;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
for (int i = 0; i, K; i++) {
sum += A.at(i);
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, sum = 0;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
for (int i = 0; i < K; i++) {
sum += A.at(i);
}
cout << sum << endl;
} | replace | 11 | 12 | 11 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02628 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define sre... | replace | 30 | 32 | 30 | 33 | TLE | |
p02628 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
const int N = 2e5 + 10;
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> v;
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
... | #include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
const int N = 2e5 + 10;
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end()... | replace | 14 | 15 | 14 | 15 | -11 | |
p02628 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
int p[n];
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
int min, tmp;
for (int i = 0; i < n - 1; i++) {
min = p[i];
for (int j = i + 1; j < n; j++) {
if (min > p[j]) {
min = p[j];
... | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
int p[n];
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
int min, tmp;
for (int i = 0; i < n - 1; i++) {
min = p[i];
tmp = i;
for (int j = i + 1; j < n; j++) {
if (min > p[j]) {
min =... | insert | 18 | 18 | 18 | 19 | 0 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define input1 \
freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout);
const ll nax = 1e9 + 7;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a;
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define input1 \
freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout);
const ll nax = 1e9 + 7;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a;
for (int ... | replace | 25 | 26 | 25 | 26 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02628 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int N, K, p[100];
int main() {
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> p[i];
sort(p, p + N);
int ans = 0;
for (int i = 0; i < K; ++i)
ans += p[i];
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int N, K, p[1010];
int main() {
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> p[i];
sort(p, p + N);
int ans = 0;
for (int i = 0; i < K; ++i)
ans += p[i];
cout << ans << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02628 | C++ | Runtime Error | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<s... | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<s... | replace | 46 | 50 | 46 | 50 | 0 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, K, Only1;
cin >> N >> K;
if (N == 1) {
cin >> Only1;
cout << Only1 << endl;
} else {
vector<int> nedan(N);
for (int i = 0; i < N; i++) {
cin >> nedan.at(i);
}
sort(nedan.begin(), nedan.end());... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, K, Only1;
cin >> N >> K;
if (N == 1) {
cin >> Only1;
cout << Only1 << endl;
} else {
vector<int> nedan(N);
for (int i = 0; i < N; i++) {
cin >> nedan.at(i);
}
sort(nedan.begin(), nedan.end());... | replace | 20 | 22 | 20 | 25 | 0 | |
p02628 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int sum = 0, min = 1001;
while (k != 0) {
for (int i = 0; i < n; i++) {
if (min > arr[i]) {
min = arr[i];
}
}
sum += min;
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int sum = 0, min = 1001;
while (k != 0) {
for (int i = 0; i < n; i++) {
if (min > arr[i]) {
min = arr[i];
}
}
sum += min;
for (in... | insert | 22 | 22 | 22 | 24 | TLE | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
// using ll = long long;
// using P = pair<int,int>;
int main() {
int n, k, sum = 0;
cin >> n >> k;
vector<int> p;
rep(i, n) cin >> p.at(i);
sort(p.begin(), p.end());
rep(i, k) { sum += p.at(i); }
cout << sum <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
// using ll = long long;
// using P = pair<int,int>;
int main() {
int n, k, sum = 0;
cin >> n >> k;
vector<int> p(n);
rep(i, n) cin >> p.at(i);
sort(p.begin(), p.end());
rep(i, k) { sum += p.at(i); }
cout << sum... | replace | 9 | 10 | 9 | 10 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
// #define ll long long
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.... | #include <bits/stdc++.h>
// #define ll long long
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.... | replace | 23 | 24 | 23 | 24 | 0 | |
p02628 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <map>
#include <set>
#include <utility>
#include <vector>
using namespace std;
using P = pair<int, int>;
using ll = long long;
constexpr int MOD = 998244353;
constexpr int MAX = 510000;
int main() {
int n, k;
cin >> n >> k;
vec... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <map>
#include <set>
#include <utility>
#include <vector>
using namespace std;
using P = pair<int, int>;
using ll = long long;
constexpr int MOD = 998244353;
constexpr int MAX = 510000;
int main() {
int n, k;
cin >> n >> k;
vec... | replace | 16 | 17 | 16 | 17 | -11 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[50], k, t, i, s = 0, j;
cin >> t >> k;
for (i = 0; i < t; i++) {
cin >> a[i];
}
sort(a, a + t);
for (j = 0; j < k; j++) {
s = s + a[j];
}
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[1001], k, t, i, s = 0, j;
cin >> t >> k;
for (i = 0; i < t; i++) {
cin >> a[i];
}
sort(a, a + t);
for (j = 0; j < k; j++) {
s = s + a[j];
}
cout << s << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02628 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main(void) {
int i, n, k, p[1000], sum = 0;
scanf("%d %d", n, k);
for (i = 0; i < n; i++)
scanf("%d", &p[i]);
sort(p, p + n);
for (i = 0; i < k; i++)
sum += p[i];
printf("%d\n", sum);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main(void) {
int i, n, k, p[1000], sum = 0;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d", &p[i]);
sort(p, p + n);
for (i = 0; i < k; i++)
sum += p[i];
printf("%d\n", sum);
return 0;
}
| replace | 6 | 7 | 6 | 7 | -11 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
vector<int> vec(N);
int money = 0;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < K; i++) {
money += vec.at(i);
}
cout << money << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
int money = 0;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < K; i++) {
money += vec.at(i);
}
cout << money << endl;
} | replace | 4 | 6 | 4 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02628 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long int llint;
unsigned int min(unsigned int A, unsigned int B) {
if (A < B) {
return A;
} else {
return B;
}
}
int main() {
int N, K;
cin >> N >> K;
ve... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long int llint;
unsigned int min(unsigned int A, unsigned int B) {
if (A < B) {
return A;
} else {
return B;
}
}
int main() {
int N, K;
cin >> N >> K;
ve... | replace | 42 | 48 | 42 | 50 | TLE | |
p02628 | C++ | Runtime Error | #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 <iostream> // cout, endl, cin
... | #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 <iostream> // cout, endl, cin
... | replace | 30 | 31 | 30 | 31 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02628 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
#define endl '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int K, N;
cin >> N >> K;
int a[K];
for (int i = 0; i < N; i++) {
int n;
cin >> n;
a[i] = n;
}
sort(a, a + N);
int num = 0;
for (int j = 0; j < K;... | #include <algorithm>
#include <iostream>
using namespace std;
#define endl '\n'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int K, N;
cin >> N >> K;
int a[N];
for (int i = 0; i < N; i++) {
int n;
cin >> n;
a[i] = n;
}
sort(a, a + N);
int num = 0;
for (int j = 0; j < K;... | replace | 10 | 11 | 10 | 11 | 0 | |
p02628 | C++ | Runtime Error | /**********************************************************************************************
******************************AUTHOR:**********************************************************
****************************ASHISH
*RANJAN******************************************************
*******************************... | /**********************************************************************************************
******************************AUTHOR:**********************************************************
****************************ASHISH
*RANJAN******************************************************
*******************************... | replace | 34 | 35 | 34 | 35 | -6 | *** stack smashing detected ***: terminated
|
p02628 | Python | Time Limit Exceeded | import itertools
N, K = map(int, input().split())
p = list(map(int, input().split()))
ans = sum(p)
for v in itertools.permutations(p, K):
ans = min(ans, sum(v))
print(ans)
| import itertools
N, K = map(int, input().split())
p = list(map(int, input().split()))
ans = 0
for _ in range(K):
min_index = p.index(min(p))
minv = p.pop(min_index)
ans += minv
print(ans)
| replace | 5 | 8 | 5 | 10 | TLE | |
p02628 | Python | Time Limit Exceeded | N, K = map(int, input().split())
P = list(map(int, input().split()))
ans = float("inf")
for i in range(1 << len(P)):
sum = 0
cnt = 0
for j in range(len(P)):
if (i >> j) & 1 == 1:
sum += P[j]
cnt += 1
if cnt == K:
ans = min(ans, sum)
print(ans)
| N, K = map(int, input().split())
P = list(map(int, input().split()))
P = sorted(P)
print(sum(P[:K]))
| replace | 3 | 14 | 3 | 6 | TLE | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define PB push_back
#define in insert
#define MP make_pair
#define F first
#define S second
void faster() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void inout() {
freopen("in.txt", "r", stdin);
freopen("out.txt"... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define PB push_back
#define in insert
#define MP make_pair
#define F first
#define S second
void faster() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void inout() {
freopen("in.txt", "r", stdin);
freopen("out.txt"... | replace | 33 | 34 | 33 | 34 | -11 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> wage;
for (int i = 0; i < N; i++) {
cin >> wage.at(i);
}
sort(wage.begin(), wage.end());
int answer = 0;
for (int i = 0; i < K; i++) {
answer = answer + wage.at(i);
}
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> wage(N);
for (int i = 0; i < N; i++) {
cin >> wage.at(i);
}
sort(wage.begin(), wage.end());
int answer = 0;
for (int i = 0; i < K; i++) {
answer = answer + wage.at(i);
}
cout << answer << endl;
} | replace | 5 | 6 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02628 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int p[100];
int i;
for (i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
sort(p, p + n);
int sum = 0;
for (i = 0; i < k; i++) {
sum += p[i];
}
printf("%d\n", sum);
return 0;
}
| #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int p[1001];
int i;
for (i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
sort(p, p + n);
int sum = 0;
for (i = 0; i < k; i++) {
sum += p[i];
}
printf("%d\n", sum);
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02628 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
int arr[1030];
int N, K;
int answer;
int main() {
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%d", arr[i]);
}
std::sort(arr, arr + N);
for (int i = 0; i < K; i++) {
answer += arr[i];
}
printf("%d", answer);
} | #include <algorithm>
#include <iostream>
int arr[1030];
int N, K;
int answer;
int main() {
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%d", &arr[i]);
}
std::sort(arr, arr + N);
for (int i = 0; i < K; i++) {
answer += arr[i];
}
printf("%d", answer);
} | replace | 10 | 11 | 10 | 11 | -11 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> p(N);
for (int &i : p)
cin >> i;
sort(p.begin(), p.end());
int ans = 0;
for (int i = 0; i < 3; i++)
ans += p.at(i);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> p(N);
for (int &i : p)
cin >> i;
sort(p.begin(), p.end());
int ans = 0;
for (int i = 0; i < K; i++)
ans += p.at(i);
cout << ans << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int p[100];
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n, k, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
sort(p, p + n);
for (int i = 0; i < k; ++i) {
sum += p[i];
}
cout << sum << endl;
... | #include <bits/stdc++.h>
using namespace std;
int p[10000];
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n, k, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
sort(p, p + n);
for (int i = 0; i < k; ++i) {
sum += p[i];
}
cout << sum << endl... | replace | 3 | 4 | 3 | 4 | 0 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k, price[n + 1], total = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> price[i];
}
sort(price, price + n);
for (int i = 0; i < k; i++)
total = total + price[i];
cout << total;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k, price[1001], total = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> price[i];
}
sort(price, price + n);
for (int i = 0; i < k; i++)
total = total + price[i];
cout << total;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02628 | C++ | Runtime Error | #pragma region header
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>... | #pragma region header
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>... | replace | 139 | 141 | 139 | 143 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.