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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02723 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
char moji[100];
do {
scanf("%s", moji);
} while (sizeof(moji) != 6);
if (moji[2] == moji[3] && moji[4] == moji[5])
puts("Yes");
else
puts("No");
return 0;
} | #include <stdio.h>
int main(void) {
char moji[100];
scanf("%s", moji);
if (moji[2] == moji[3] && moji[4] == moji[5])
puts("Yes");
else
puts("No");
return 0;
} | replace | 5 | 8 | 5 | 6 | TLE | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
if (str.at(3) == str.at(4) && str.at(5) == str.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
if (str.at(2) == str.at(3) && str.at(4) == str.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02723 | C++ | Runtime Error | // fahadmd16(IIEST Shibpur)
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define db double
#define pll pair<ll, ll>
#define ALL(a) (a).begin(), (a).end()... | // fahadmd16(IIEST Shibpur)
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define db double
#define pll pair<ll, ll>
#define ALL(a) (a).begin(), (a).end()... | replace | 65 | 69 | 65 | 69 | 0 | |
p02723 | Python | Runtime Error | s = input()
if s[3] == s[4] and s[5] == s[6]:
print("Yes")
else:
print("No")
| s = input()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
| replace | 1 | 2 | 1 | 2 | 0 | |
p02723 | Python | Runtime Error | s = input()
if s[3] == s[4] and s[5] == s[6]:
print("Yes")
else:
print("No")
| s = input()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
| replace | 1 | 2 | 1 | 2 | 0 | |
p02723 | Python | Runtime Error | S = input()
print("Yes" if S[3] == S[4] and S[5] == S[6] else "No")
| S = input()
print("Yes" if S[2] == S[3] and S[4] == S[5] else "No")
| replace | 1 | 2 | 1 | 2 | 0 | |
p02723 | Python | Runtime Error | s = input().split()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
| s = input()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
| replace | 0 | 1 | 0 | 1 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02723/Python/s530567045.py", line 2, in <module>
if s[2] == s[3] and s[4] == s[5]:
IndexError: list index out of range
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll modularExponentiation(ll x, ll n, ll M) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return modularExponentiation((x * x) % M, n / 2, M);
return (x * modularExponentiation((x * x) % M, (n - 1) / 2, M)) % M;
}
ll binaryExponentiation(ll ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll modularExponentiation(ll x, ll n, ll M) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return modularExponentiation((x * x) % M, n / 2, M);
return (x * modularExponentiation((x * x) % M, (n - 1) / 2, M)) % M;
}
ll binaryExponentiation(ll ... | delete | 45 | 49 | 45 | 45 | 0 | |
p02724 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repeq(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define rep1(i, x, n) for (int(i) = (x); (i) < (int)(n); (i)++)
#define rep1eq(i, x, n) for (int(i) = (x); (i) <= (int)(n); (i)++)
#define rrep(i, x) for (int i = ((int)(x)-1);... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repeq(i, n) for (int(i) = 0; (i) <= (int)(n); (i)++)
#define rep1(i, x, n) for (int(i) = (x); (i) < (int)(n); (i)++)
#define rep1eq(i, x, n) for (int(i) = (x); (i) <= (int)(n); (i)++)
#define rrep(i, x) for (int i = ((int)(x)-1);... | replace | 31 | 32 | 31 | 37 | 0 | |
p02724 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio \
ios_base::sync_with_stdio(0); ... | replace | 64 | 66 | 64 | 66 | 0 | |
p02724 | C++ | Runtime Error | /*Author SHUBH AGRAWAL */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push // adds the value to the last of the queue
#define lld long long int
#define ins insert /// used in set to insert the values
#define adv advance /// used to increment the iterator
#define mp make_pair
#defin... | /*Author SHUBH AGRAWAL */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push // adds the value to the last of the queue
#define lld long long int
#define ins insert /// used in set to insert the values
#define adv advance /// used to increment the iterator
#define mp make_pair
#defin... | delete | 84 | 90 | 84 | 84 | 0 | |
p02724 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define mp make_pair
#define endl "\n"
#define N 998244353
#define INF 1e9
ll power(ll x, ll y, ll m) {
if (y == 0)
return 1;
ll p = power(x, y / 2, m) % m;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define mp make_pair
#define endl "\n"
#define N 998244353
#define INF 1e9
ll power(ll x, ll y, ll m) {
if (y == 0)
return 1;
ll p = power(x, y / 2, m) % m;... | replace | 20 | 24 | 20 | 24 | 0 | Time : 26.83ms
|
p02724 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef long long ll;
typedef double dd;
#define pb push_back
#define mp make_pair
#define endl ... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef long long ll;
typedef double dd;
#define pb push_back
#define mp make_pair
#define endl ... | delete | 101 | 105 | 101 | 101 | 0 | |
p02724 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | replace | 58 | 62 | 58 | 62 | 0 | |
p02724 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, n;
cin >> k >> n;
vector<long long> data(n);
for (long long i = 0; i < n; i++) {
cin >> data.at(i);
}
long long a = data.at(n - 1) - data.at(0);
vector<long long> table(1000000, 0);
table.at(a) = 1;
for (long long i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int c500 = x / 500;
x = x % 500;
int c5 = x / 5;
cout << c500 * 1000 + c5 * 5 << endl;
}
| replace | 4 | 24 | 4 | 10 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02724 | C++ | Runtime Error | #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
std::string line;
std::cin >> line;
int money = std::stoi(line);
int moneyTable[6] = {500, 100, 50, 5, 1};
int scoreTable[6] = {1000, 0, 0, 5, 0};
int result = 0;
for (int i = 0; i < 6; i++) {
int div = money / moneyTable[i];
... | #include <iostream>
#include <string>
int main(int argc, char *argv[]) {
std::string line;
std::cin >> line;
int money = std::stoi(line);
int div500 = money / 500;
money -= div500 * 500;
int div5 = money / 5;
money -= div5 * 5;
std::cout << std::to_string((div500 * 1000) + (div5 * 5)) << std::endl;
r... | replace | 7 | 16 | 7 | 12 | -8 | |
p02724 | C++ | Runtime Error | /*Given an array of n numbers find the largest difference in the
starting and ending indexes of the elements of the all possible
strictly decreasing sub-sequences in the array.
Input: 21, 13, 18, 10, 7, 3, 1
Output : 4
Input: 1, 18, 17, 14, 15, 32, 16
Output: 2 */
#include <bits/stdc++.h>
using namespace std;
#def... | /*Given an array of n numbers find the largest difference in the
starting and ending indexes of the elements of the all possible
strictly decreasing sub-sequences in the array.
Input: 21, 13, 18, 10, 7, 3, 1
Output : 4
Input: 1, 18, 17, 14, 15, 32, 16
Output: 2 */
#include <bits/stdc++.h>
using namespace std;
#def... | replace | 35 | 39 | 35 | 39 | 0 | |
p02724 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
int A = 0;
while (X -= 500 > 500) {
A += 1000;
}
while (X -= 5 > 0) {
A += 5;
}
cout << A << endl;
} | #include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
int A = 0;
int c = X / 500;
int d = (X % 500) / 5;
A += c * 1000;
A += d * 5;
cout << A << endl;
} | replace | 6 | 13 | 6 | 10 | TLE | |
p02724 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
int count500 = x / 500;
int count5 = (x % (500 * count500)) / 5;
int result = count500 * 1000 + count5 * 5;
cout << result << endl;
} | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
int count500 = x / 500;
int count5 = (x % 500) / 5;
int result = count500 * 1000 + count5 * 5;
cout << result << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02724 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll x = n / 500;
n -= x * 500;
ll y = n / 5;
ll ans = 0;
ans += x * 500 * 2;
ans += y * 5;
return ans;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll x = n / 500;
n -= x * 500;
ll y = n / 5;
ll ans = 0;
ans += x * 500 * 2;
ans += y * 5;
cout << ans;
return 0;
} | replace | 13 | 14 | 13 | 15 | 228 | |
p02724 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
void solve() {
ll ans = 0;
ll n;
cin >> n;
while (n > 0) {
if (n >= 500) {
ans += 1000;
n -= 500;
} else if (n >= 5) {
ans += 5;
n -= 5;
}
}
cout << ans << endl;
}
int main() {
solve... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
void solve() {
ll ans = 0;
ll n;
cin >> n;
ans = (1ll * 1000 * (n / 500)) + (1ll * 5 * ((n % 500) / 5));
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| replace | 10 | 19 | 10 | 11 | TLE | |
p02724 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, h = 0;
cin >> x;
if (x < 5) {
cout << h << endl;
} else {
while (x >= 5) {
if (x > 500) {
h = h + (x / 500) * 1000;
} else if (x > 5) {
h = h + (x / 5) * 5;
}
}
cout << h << endl;
}
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, h = 0;
cin >> x;
if (x < 5) {
cout << h << endl;
} else {
h = h + (x / 500) * 1000;
x = x % 500;
h = h + (x / 5) * 5;
cout << h << endl;
}
return 0;
} | replace | 8 | 17 | 8 | 11 | TLE | |
p02724 | C++ | Runtime Error | /*
NO
TIME
TO
DIE
--007
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #include <boost/functional/hash.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long ... | /*
NO
TIME
TO
DIE
--007
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #include <boost/functional/hash.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long ... | replace | 48 | 52 | 48 | 49 | 0 | |
p02724 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
while (n >= 500) {
n -= 500;
ans += 1000;
}
while (n >= 5) {
n -= 5;
ans += 5;
}
cout << ans;
return 0;
} | replace | 2 | 32 | 2 | 3 | TLE | |
p02724 | C++ | Runtime Error | /**
* ATCODER 160 B
* Kartikeya (doomsday861)
**/
#include <bits/stdc++.h>
#include <time.h>
#define ll long long
#define testcase \
ll t; \
cin >> t; ... | /**
* ATCODER 160 B
* Kartikeya (doomsday861)
**/
#include <bits/stdc++.h>
#include <time.h>
#define ll long long
#define testcase \
ll t; \
cin >> t; ... | delete | 18 | 22 | 18 | 18 | 0 | |
p02724 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define test(t) \
ll int t; \
cin >> t; \... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define test(t) \
ll int t; \
cin >> t; \... | delete | 29 | 34 | 29 | 29 | 0 | |
p02724 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int money;
int kind = 0;
do {
scanf("%d", &money);
} while (money <= 0 || money >= 1000000000);
while (money >= 500) {
kind += 1000;
money -= 500;
}
while (money >= 5) {
kind += 5;
money -= 5;
}
printf("%d\n", kind);
return 0;
} | #include <stdio.h>
int main(void) {
int money;
int kind = 0;
do {
scanf("%d", &money);
} while (money < 0 || money > 1000000000);
while (money >= 500) {
kind += 1000;
money -= 500;
}
while (money >= 5) {
kind += 5;
money -= 5;
}
printf("%d\n", kind);
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02724 | C++ | Runtime Error | /*
KUNAL RAUT (ZUKONIT14) :- "DO WHAT YOU LIKE!"
-PICT,PUNE! :)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define mod9 1000000009
#define pi 3.... | /*
KUNAL RAUT (ZUKONIT14) :- "DO WHAT YOU LIKE!"
-PICT,PUNE! :)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define mod9 1000000009
#define pi 3.... | replace | 87 | 91 | 87 | 91 | 0 | |
p02724 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int y = 0;
y = 1000 * (x / 500) + 5 * ((x % 500) / 5);
cout << y << endl;
return y;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int y = 0;
y = 1000 * (x / 500) + 5 * ((x % 500) / 5);
cout << y << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 228 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
int A[22000];
cin >> K >> N;
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int rightRes = 0;
int leftRes = 0;
int leftMax = 0;
int rightMax = 0;
for (int i = 0; i < N; ++i) {
if (i == N - 1) {
rightRes += K - A[i] + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
int A[220000];
cin >> K >> N;
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int rightRes = 0;
int leftRes = 0;
int leftMax = 0;
int rightMax = 0;
for (int i = 0; i < N; ++i) {
if (i == N - 1) {
rightRes += K - A[i] +... | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ull unsigned long long
#define rep(n) for (ll i = 0; i < n; i++)
#define rep2(n) for (ll j = 0; j < n; ++j)
#define repd(n) for (ll i = ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ull unsigned long long
#define rep(n) for (ll i = 0; i < n; i++)
#define rep2(n) for (ll j = 0; j < n; ++j)
#define repd(n) for (ll i = ... | replace | 25 | 41 | 25 | 32 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define endl '\n'
#define ll long long
const int N = 1e5 + 5;
ll a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen(".INP", "r")) {
freopen(".INP", "r", stdin);
freopen(".OUT", "w", stdout)... | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define endl '\n'
#define ll long long
const int N = 2e5 + 5;
ll a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen(".INP", "r")) {
freopen(".INP", "r", stdin);
freopen(".OUT", "w", stdout)... | replace | 6 | 7 | 6 | 7 | 0 | |
p02725 | C++ | Runtime Error | /*
* @Author: Kaizyn
* @Date: 2020-03-28 21:12:21
* @LastEditTime: 2020-03-28 21:16:53
*/
#include <bits/stdc++.h>
// #define DEBUG
using namespace std;
const int N = 1e5 + 7;
const int MOD = 998244353;
const double eps = 1e-7;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> pii;
int n, k;
int a[N];
inline ... | /*
* @Author: Kaizyn
* @Date: 2020-03-28 21:12:21
* @LastEditTime: 2020-03-28 21:16:53
*/
#include <bits/stdc++.h>
// #define DEBUG
using namespace std;
const int N = 2e5 + 7;
const int MOD = 998244353;
const double eps = 1e-7;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> pii;
int n, k;
int a[N];
inline ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02725 | C++ | Runtime Error | // Copyright [2020] <unknown>
#include <bits/stdc++.h>
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define dbg(x...) \
{ \
cerr << "\033[32;1m" << #x << " -... | // Copyright [2020] <unknown>
#include <bits/stdc++.h>
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define dbg(x...) \
{ \
cerr << "\033[32;1m" << #x << " -... | replace | 23 | 24 | 23 | 24 | 0 | |
p02725 | C++ | Runtime Error | /*
Hey there stalker....
█▀▀▄░░░░░░░░░░░▄▀▀█
░█░░░▀▄░▄▄▄▄▄░▄▀░░░█
░░▀▄░░░▀░░░░░▀░░░▄▀
░░░░▌░▄▄░░░▄▄░▐▀▀
░░░▐░░█▄░░░▄█░░▌▄▄▀▀▀▀█
░░░▌▄▄▀▀░▄░▀▀▄▄▐░░░░░░█
▄▀▀▐▀▀░▄▄▄▄▄░▀▀▌▄▄▄░░░█
█░░░▀▄░█░░░█░▄▀░░░░█▀▀▀
░▀▄░░▀░░▀▀▀░░▀░░░▄█▀
░░░█░░░░░░░░░░░▄▀▄░▀▄
░░░█░░░░░░░░░▄▀█░░█░░█
░░░█░░░░░░░░░░░█▄█░░▄▀
░░░█░░░░░░░░░░░████▀
░░░▀▄▄▀▀▄... | /*
Hey there stalker....
█▀▀▄░░░░░░░░░░░▄▀▀█
░█░░░▀▄░▄▄▄▄▄░▄▀░░░█
░░▀▄░░░▀░░░░░▀░░░▄▀
░░░░▌░▄▄░░░▄▄░▐▀▀
░░░▐░░█▄░░░▄█░░▌▄▄▀▀▀▀█
░░░▌▄▄▀▀░▄░▀▀▄▄▐░░░░░░█
▄▀▀▐▀▀░▄▄▄▄▄░▀▀▌▄▄▄░░░█
█░░░▀▄░█░░░█░▄▀░░░░█▀▀▀
░▀▄░░▀░░▀▀▀░░▀░░░▄█▀
░░░█░░░░░░░░░░░▄▀▄░▀▄
░░░█░░░░░░░░░▄▀█░░█░░█
░░░█░░░░░░░░░░░█▄█░░▄▀
░░░█░░░░░░░░░░░████▀
░░░▀▄▄▀▀▄... | replace | 83 | 85 | 83 | 85 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re register
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define lb long double
const int N = 1e4 + 10;
const int mod = 10086;
const int mod2 = 19260811;
void read(int &a) {
a = 0;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re register
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define lb long double
const int N = 1e6 + 10;
const int mod = 10086;
const int mod2 = 19260811;
void read(int &a) {
a = 0;... | replace | 10 | 11 | 10 | 11 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = 0x3f3f3f3f;
const int N = 100000 + 5;
int a[N], b[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int k, n;
cin >> k >> n;
int maxn = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = 0x3f3f3f3f;
const int N = 200000 + 5;
int a[N], b[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int k, n;
cin >> k >> n;
int maxn = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (... | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, N) for (i = 0; i < N; ++i)
#define fos(i, b, N) for (i = b; i < N; ++i)
#define forr(i, N) for (i = N - 1; i >= 0; --i)
#define disp(n) cout << n << endl;
#define M 10000007
#define ll long long
#define vll vector<long long int>
#define min(x, y) (x < y ? x : y)
#define max(x, y) ... | #include <bits/stdc++.h>
#define fo(i, N) for (i = 0; i < N; ++i)
#define fos(i, b, N) for (i = b; i < N; ++i)
#define forr(i, N) for (i = N - 1; i >= 0; --i)
#define disp(n) cout << n << endl;
#define M 10000007
#define ll long long
#define vll vector<long long int>
#define min(x, y) (x < y ? x : y)
#define max(x, y) ... | replace | 14 | 15 | 14 | 15 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, i, saidai = 0;
cin >> k >> n;
int a[i];
cin >> a[0];
for (i = 1; i < n; i++) {
cin >> a[i];
saidai = max(saidai, a[i] - a[i - 1]);
}
saidai = max(saidai, a[0] + k - a[n - 1]);
k -= saidai;
cout << k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, i, saidai = 0;
cin >> k >> n;
int a[n];
cin >> a[0];
for (i = 1; i < n; i++) {
cin >> a[i];
saidai = max(saidai, a[i] - a[i - 1]);
}
saidai = max(saidai, a[0] + k - a[n - 1]);
k -= saidai;
cout << k;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02725 | C++ | Runtime Error | // fahadmd16(IIEST Shibpur)
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define db double
#define pll pair<ll, ll>
#define ALL(a) (a).begin(), (a).end()... | // fahadmd16(IIEST Shibpur)
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define db double
#define pll pair<ll, ll>
#define ALL(a) (a).begin(), (a).end()... | replace | 65 | 69 | 65 | 69 | -11 | |
p02725 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec.at(i);
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (vec.at(i) < vec.at(j))
swap(vec.at(i), vec.at(j));
}
}
int longe... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec.at(i);
sort(vec.begin(), vec.end());
// for(int i=0;i<n;i++)cout<<vec.at(i)<<" ";
/*
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
if(vec.at(i)<v... | replace | 9 | 16 | 9 | 18 | TLE | |
p02725 | 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>;
ll x = 1e9 + 7;
int main() {
int k, n;
int x = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)
continue;
x = max(x, a[i] -... | #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>;
ll x = 1e9 + 7;
int main() {
int k, n;
cin >> k >> n;
int x = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)
continue;
... | insert | 10 | 10 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K, N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int l = 0;
for (int i = 0; i < N - 1; i++)
l = max(l, A.at(i + 1) - A.at(i));
cout << min(K - l, A.at(N - 1) - A.at(0)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
int l = 0;
for (int i = 0; i < N - 1; i++)
l = max(l, A.at(i + 1) - A.at(i));
cout << min(K - l, A.at(N - 1) - A.at(0)) << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>... | #include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>... | replace | 152 | 153 | 152 | 153 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | replace | 298 | 299 | 298 | 299 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
#define mod 10000000... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define pie 3.141592653589793238462643383279
#define mod 10000000... | replace | 61 | 62 | 61 | 62 | 0 | |
p02725 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long int K, N, max, ans;
max = 0;
ans = 0;
cin >> K >> N;
long long int A[20000], B[20001];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
A[N] = A[0] + K;
for (int j = 0; j < N + 1; j++) {
B[j] = A[j + 1] - A[j];
}
for (int k = 0; k... | #include <iostream>
using namespace std;
int main() {
long long int K, N, max, ans;
max = 0;
ans = 0;
cin >> K >> N;
long long int A[200000], B[200001];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
A[N] = A[0] + K;
for (int j = 0; j < N + 1; j++) {
B[j] = A[j + 1] - A[j];
}
for (int k = 0;... | replace | 7 | 8 | 7 | 8 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | replace | 27 | 28 | 27 | 28 | 0 | |
p02725 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int k, n, a[100005], max, f;
cin >> k >> n;
max = 0;
if (n == 0) {
cout << 0;
return 0;
}
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i == 1) {
f = a[i];
continue;
}
if (a[i] - a[i - 1] > max)
max = a[i] - a[... | #include <iostream>
using namespace std;
int main() {
int k, n, a[2000005] = {0}, max, f;
cin >> k >> n;
max = 0;
if (n == 0) {
cout << 0;
return 0;
}
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i == 1) {
f = a[i];
continue;
}
if (a[i] - a[i - 1] > max)
max = a[... | replace | 3 | 4 | 3 | 4 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for (int a = b; a <= c; ++a)
#define FORW(a, b, c) for (int a = b; a >= c; --a)
#define fi first
#define se second
#define pb push_back
#define int long long
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
const int N = 3e3 + 100;
const int oo ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for (int a = b; a <= c; ++a)
#define FORW(a, b, c) for (int a = b; a >= c; --a)
#define fi first
#define se second
#define pb push_back
#define int long long
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
const int N = 2e5 + 100;
const int oo ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 0x3f3f3f3f
#define MOD 998244353LL
#define EPSILON 0.00001
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 0x3f3f3f3f
#define MOD 998244353LL
#define EPSILON 0.00001
#define ... | replace | 21 | 22 | 21 | 22 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define erep(i, n) for (int i = 0; i <= (n); i++)
#define erep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
int main() {
int K, N;
cin >> K >> N;
vector<in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define erep(i, n) for (int i = 0; i <= (n); i++)
#define erep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
int main() {
int K, N;
cin >> K >> N;
vector<in... | replace | 19 | 20 | 19 | 20 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
using namespace std;
long long n, k, i, a[200005], mi, x;
int main() {
scanf("%lld%lld", &k, &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
a[n + i] = a[i... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
using namespace std;
long long n, k, i, a[500005], mi, x;
int main() {
scanf("%lld%lld", &k, &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
a[n + i] = a[i... | replace | 9 | 10 | 9 | 10 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
int b;
cin >> K, N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
b = (K - a.at(N - 1)) + a.at(0);
for (int i = 0; i < N - 1; i++) {
b = max(a.at(i + 1) - a.at(i), b);
}
cout << K - b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
int b;
cin >> K >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
b = (K - a.at(N - 1)) + a.at(0);
for (int i = 0; i < N - 1; i++) {
b = max(a.at(i + 1) - a.at(i), b);
}
cout << K - b << endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02725 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
ll a, b, c, n, i, j, k, m, t, arr[200005], ar[200005];
int main() {
string s;
cin >> n >> m;
for (i = 0; i < m; i++)
cin >> arr[i];
a = arr[m - 1] - arr[0];
ll minn = arr[0];
for (i = 1; i < n; i++) {
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
ll a, b, c, n, i, j, k, m, t, arr[200005], ar[200005];
int main() {
string s;
cin >> n >> m;
for (i = 0; i < m; i++)
cin >> arr[i];
a = arr[m - 1] - arr[0];
ll minn = arr[0];
for (i = 1; i < m; i++) {
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string... | replace | 84 | 85 | 84 | 85 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int, int> pii;
#define x first
#define y second
const int N = 1e5 + 100;
int a[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int k, n;
cin >> k >> n;
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int, int> pii;
#define x first
#define y second
const int N = 2e5 + 100;
int a[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int k, n;
cin >> k >> n;
fo... | replace | 12 | 13 | 12 | 13 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i > 0; i--)
#define print(n) cout << n << endl
#define all(n) n.begin(), n.end()
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll k, n;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i > 0; i--)
#define print(n) cout << n << endl
#define all(n) n.begin(), n.end()
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll k, n;
cin >> ... | replace | 20 | 21 | 20 | 21 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
cin >> a[i];
}
int ans = n;
for (int i = 2; i <= k; ++i) {
ans = min(ans, n - a[i] + a[i - 1]);
}
... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 2e5 + 10;
int a[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
cin >> a[i];
}
int ans = n;
for (int i = 2; i <= k; ++i) {
ans = min(ans, n - a[i] + a[i - 1]);
}
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int k, n, a[20000], min;
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[n - 1] - a[0];
for (... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int k, n, a[200000], min;
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[n - 1] - a[0];
for ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 | 32 | 33 | 32 | 33 | 0 | |
p02725 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int n, m;
int a[200001];
int main() {
cin >> n >> m;
int mx = 0;
for (int i = 0; i < m; i++) {
scanf("%d", &a[i]);
}
a[m] = n + a[0];
for (int i = 1; i <= n; i++)
mx = max(a[i] - a[i - 1], mx)... | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int n, m;
int a[200001];
int main() {
cin >> n >> m;
int mx = 0;
for (int i = 0; i < m; i++) {
scanf("%d", &a[i]);
}
a[m] = n + a[0];
for (int i = 1; i <= m; i++)
mx = max(a[i] - a[i - 1], mx)... | replace | 14 | 15 | 14 | 15 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
int maximumDistance = 0, previous = 0;
for (int i = 0; i < N; i++) {
maximumDistance = max(maximumDistance, abs(v[i] - previous));
previous = v[i];
}
maximumDis... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, N;
cin >> K >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
int maximumDistance = 0, previous = 0;
for (int i = 0; i < N; i++) {
maximumDistance = max(maximumDistance, abs(v[i] - previous));
previous = v[i];... | insert | 4 | 4 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 39 | 40 | 39 | 40 | 0 |
Time: 0.000180000000 ms
|
p02725 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int K = 0, N = 0;
int *A = NULL;
int d = 0, D = 0;
cin >> K;
cin >> N;
A = (int *)calloc(N + 1, N);
for (int i = 1; i <= N; i++) {
cin >> A[i];
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int K = 0, N = 0;
int *A = NULL;
int d = 0, D = 0;
cin >> K;
cin >> N;
A = (int *)calloc(N + 1, sizeof(int));
for (int i = 1; i <= N; i++) {
cin... | replace | 16 | 17 | 16 | 17 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a)... | replace | 13 | 14 | 13 | 14 | 0 | |
p02725 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define gcd(m, n) __gcd(m, n)
#define lcm(m, n) m *(n / gcd(m, n))
#define fast \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define gcd(m, n) __gcd(m, n)
#define lcm(m, n) m *(n / gcd(m, n))
#define fast \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); ... | replace | 38 | 58 | 38 | 43 | TLE | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
int a[1005], maxn = -1;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
maxn = max(a[i + 1] - a[i], maxn);
}
maxn = max(m + a[0] - a[n - 1], maxn);
cout << m - maxn;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
int a[1000005], maxn = -1;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++) {
maxn = max(a[i + 1] - a[i], maxn);
}
maxn = max(m + a[0] - a[n - 1], maxn);
cout << m - maxn;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[100000];
int k, n;
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int x = (k + a[0]) - a[n - 1];
for (int i = 0; i < n - 1; i++) {
x = max(x, a[i + 1] - a[i]);
}
cout << k - x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[200000];
int k, n;
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int x = (k + a[0]) - a[n - 1];
for (int i = 0; i < n - 1; i++) {
x = max(x, a[i + 1] - a[i]);
}
cout << k - x << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int k, n;
int a[N];
int solve() {
scanf("%d %d", &k, &n);
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
int ans = a[n - 1] - a[0];
for (int i = 1; i < n; ++i)
ans = min(ans, k - (a[i] - a[i - 1]));
printf("%d\n", ans);
return ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int k, n;
int a[N];
int solve() {
scanf("%d %d", &k, &n);
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
int ans = a[n - 1] - a[0];
for (int i = 1; i < n; ++i)
ans = min(ans, k - (a[i] - a[i - 1]));
printf("%d\n", ans);
return... | replace | 3 | 4 | 3 | 4 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, n, ans = 2000000;
cin >> k >> n;
long long a[300000];
for (int i = 0; i < n; i++) {
int l;
cin >> l;
a[i] = l;
}
for (int i = 0; i < n; i++) {
a[i + n] = a[i] + k;
}
for (int i = 0; i < n; i++) {
ans = min(ans, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, n, ans = 2000000;
cin >> k >> n;
long long a[500000];
for (int i = 0; i < n; i++) {
int l;
cin >> l;
a[i] = l;
}
for (int i = 0; i < n; i++) {
a[i + n] = a[i] + k;
}
for (int i = 0; i < n; i++) {
ans = min(ans, ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cerrno>
#include <cfenv>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int K, N;
vector<int> A(2 * 10 ^ 5);
int tmp = 0;
int ans = 0;
int tmpMaxDist = 0;
int edgeDist = 0;
int main(... | #include <algorithm>
#include <bitset>
#include <cerrno>
#include <cfenv>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int K, N;
vector<int> A(2 * 10 * 10 * 10 * 10 * 10);
int tmp = 0;
int ans = 0;
int tmpMaxDist = 0;
int edgeDist... | replace | 13 | 14 | 13 | 14 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 40;
long long a[N], k, mn = 1e18, n;
int main() {
cin >> k >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (i == n) {
mn = min(mn, a[n] - a[1]);
} else {
mn = min(mn, k - (a[i + 1] ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 40;
long long a[N], k, mn = 1e18, n;
int main() {
cin >> k >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (i == n) {
mn = min(mn, a[n] - a[1]);
} else {
mn = min(mn, k - (a[i + 1] ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int k, n, arr[100005], mini;
int main() {
cin >> k >> n;
for (int i = 0; i < n; ++i)
cin >> arr[i];
mini = arr[n - 1] - arr[0];
for (int i = 1; i < n; ++i) {
int tmp;
tmp = k - arr[i] + arr[i - 1];
mini = min(mini, tmp);
}
cout << mini << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int k, n, arr[200005], mini;
int main() {
cin >> k >> n;
for (int i = 0; i < n; ++i)
cin >> arr[i];
mini = arr[n - 1] - arr[0];
for (int i = 1; i < n; ++i) {
int tmp;
tmp = k - arr[i] + arr[i - 1];
mini = min(mini, tmp);
}
cout << mini << "\n";
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int k, n, a[N], maxn = -1;
int main() {
cin >> k >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[n + 1] = k + a[1];
for (int i = 2; i <= n + 1; i++)
maxn = max(maxn, a[i] - a[i - 1]);
cout << k - maxn << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int k, n, a[N], maxn = -1;
int main() {
cin >> k >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[n + 1] = k + a[1];
for (int i = 2; i <= n + 1; i++)
maxn = max(maxn, a[i] - a[i - 1]);
cout << k - maxn << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 10;
int c[N];
int main() {
int k, n;
scanf("%d %d", &k, &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
int ans = c[n] - c[1];
for (int i = 2; i <= n; i++) {
ans = min(ans, k - c[i] + c[i - 1]);
}
printf("... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 10;
int c[N];
int main() {
int k, n;
scanf("%d %d", &k, &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
int ans = c[n] - c[1];
for (int i = 2; i <= n; i++) {
ans = min(ans, k - c[i] + c[i - 1]);
}
printf("... | replace | 3 | 4 | 3 | 4 | 0 | |
p02725 | 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 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define ss second
#define ff first
#define N 100005
#define inf 1000000009
#define ll long long
#define all(a) a.begin(), a.end()
#define mid(a, b) (a + b) / 2
#define pii pair<int, int>
using namespace std;
int k, n, a[N], d[N], mx;
int main() {
scanf("%d%d", &k, &n)... | #include <bits/stdc++.h>
#define pb push_back
#define ss second
#define ff first
#define N 200005
#define inf 1000000009
#define ll long long
#define all(a) a.begin(), a.end()
#define mid(a, b) (a + b) / 2
#define pii pair<int, int>
using namespace std;
int k, n, a[N], d[N], mx;
int main() {
scanf("%d%d", &k, &n)... | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i... | replace | 130 | 131 | 130 | 131 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200005;
int a[maxn];
ll t[maxn];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
#ifdef acm
freopen("a.in", "r", stdin);
#endif // acm
int n, k;
cin >> k >> n;
for (int i = 1; i <= n; i++)
cin >> a[i], a[i +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200005;
int a[2 * maxn];
ll t[2 * maxn];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
#ifdef acm
freopen("a.in", "r", stdin);
#endif // acm
int n, k;
cin >> k >> n;
for (int i = 1; i <= n; i++)
cin >> a[i... | replace | 7 | 9 | 7 | 9 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
... | replace | 43 | 44 | 43 | 44 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define MAX_N 400
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define MAX_N 200000
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define MOD1 1000000007
#define MOD2 998244353
#define BOOST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
ll k, n;
vector<ll> h;... | #include <bits/stdc++.h>
#define ll long long int
#define MOD1 1000000007
#define MOD2 998244353
#define BOOST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
ll k, n;
vector<ll> h;... | replace | 24 | 28 | 24 | 28 | -11 | |
p02725 | C++ | Runtime Error | #define __USE_MINGW_ANSI_STDIO
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#... | #define __USE_MINGW_ANSI_STDIO
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#... | replace | 42 | 43 | 42 | 43 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1007050321;
const int base = 521;
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
const int inf = 2e9;
int n, K, a[N];
int main() {
ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> K >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1007050321;
const int base = 521;
const int N = 4e5 + 5;
const int MOD = 1e9 + 7;
const int inf = 2e9;
int n, K, a[N];
int main() {
ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> K >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[... | replace | 6 | 7 | 6 | 7 | 0 | |
p02725 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
uint64_t K, N;
cin >> K;
cin >> N;
vector<uint64_t> A;
for (uint64_t i = 0; i < N; i++) {
uint64_t tmp;
cin >> tmp;
A.push_back(tmp);
}
uint64_t i = 0;
uint64_t ans = UINT64_MAX;
const ui... | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
uint64_t K, N;
cin >> K;
cin >> N;
vector<uint64_t> A;
for (uint64_t i = 0; i < N; i++) {
uint64_t tmp;
cin >> tmp;
A.push_back(tmp);
}
uint64_t max_dist = 0;
for (uint64_t i = 0; i < N - 1... | replace | 16 | 60 | 16 | 23 | TLE | |
p02725 | 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;
int main(void) {
int k, n;
cin >> k >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) a[i + n] = a[i] + k;
int answer = k;
rep(i, n) {
if (a[i + n - 1] - a[i] < answer)
ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int k, n;
cin >> k >> n;
vector<int> a(2 * n);
rep(i, n) cin >> a[i];
rep(i, n) a[i + n] = a[i] + k;
int answer = k;
rep(i, n) {
if (a[i + n - 1] - a[i] < answer)
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02725 | C++ | Runtime Error | /******************************************
/@Author: LeafBelief
/@Date: 2020-04-07
/@Remark:
/@FileName: minumdistance
******************************************/
#include <bits/stdc++.h>
#define CSE(x, y) memset(x, y, sizeof(x))
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
#define FAST ... | /******************************************
/@Author: LeafBelief
/@Date: 2020-04-07
/@Remark:
/@FileName: minumdistance
******************************************/
#include <bits/stdc++.h>
#define CSE(x, y) memset(x, y, sizeof(x))
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
#define FAST ... | replace | 19 | 20 | 19 | 20 | 0 | |
p02725 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int k, n, i, max = 0;
int a[2000];
cin >> k >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n - 1; i++) {
if (a[i + 1] - a[i] > max)
max = a[i + 1] - a[i];
}
if (k + a[0] - a[n - 1] > max)
max = k + a[0] - a[n - 1];
... | #include <iostream>
using namespace std;
int main() {
int k, n, i, max = 0;
int a[200000];
cin >> k >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n - 1; i++) {
if (a[i + 1] - a[i] > max)
max = a[i + 1] - a[i];
}
if (k + a[0] - a[n - 1] > max)
max = k + a[0] - a[n - 1]... | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const int N = 110;
int n, a[N], k;
int main() {
cin >> k >> n;
int ans = 0x3f3f3f3f;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int pre = (i - 1 + n) % n;
int nex = (i + ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const int N = 2e5 + 100;
int n, a[N], k;
int main() {
cin >> k >> n;
int ans = 0x3f3f3f3f;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int pre = (i - 1 + n) % n;
int nex =... | replace | 5 | 6 | 5 | 6 | 0 | |
p02725 | Python | Runtime Error | K, N = [int(x) for x in input().split()]
A = list([int(x) for x in input().split()])
result = []
for i in range(N):
if i == N - 1:
result.append(K - A[i] + A[0])
else:
result.appnd(A[i + 1] - A[i])
result.sort()
print(sum(result[:-1]))
| K, N = [int(x) for x in input().split()]
A = list([int(x) for x in input().split()])
result = []
for i in range(N):
if i == N - 1:
result.append(K - A[i] + A[0])
else:
result.append(A[i + 1] - A[i])
result.sort()
print(sum(result[:-1]))
| replace | 9 | 10 | 9 | 10 | AttributeError: 'list' object has no attribute 'appnd'. Did you mean: 'append'? | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02725/Python/s465874099.py", line 10, in <module>
result.appnd(A[i + 1] - A[i])
AttributeError: 'list' object has no attribute 'appnd'. Did you mean: 'append'?
|
p02725 | Python | Runtime Error | K, N = map(int, input().split())
A = [int(e) for e in input().split()]
ans = 0
for i in range(N - 1):
S = [A[i + 1] - A[i]]
S.append((K - A[N - 1]) + A[0])
m = sorted(S)
for n in range(N - 1):
ans += m[n]
print(ans)
| K, N = map(int, input().split())
A = [int(e) for e in input().split()]
ans = 0
S = [(A[i + 1] - A[i]) for i in range(N - 1)]
S.append((K - A[N - 1]) + A[0])
S.sort
m = sorted(S)
for n in range(N - 1):
ans += m[n]
print(ans)
| replace | 4 | 10 | 4 | 10 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int t = 1e6, a[20005];
int main() {
int i, k, n, p;
scanf("%d %d", &k, &n);
scanf("%d", &a[0]);
for (i = 1; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
for (i = 1; i < n; i++) {
p = k - a[i] + a[i - 1];
if (p < t)
t = p;
}
p = a[n... | #include <bits/stdc++.h>
using namespace std;
int t = 1e6, a[200005];
int main() {
int i, k, n, p;
scanf("%d %d", &k, &n);
scanf("%d", &a[0]);
for (i = 1; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
for (i = 1; i < n; i++) {
p = k - a[i] + a[i - 1];
if (p < t)
t = p;
}
p = a[... | replace | 2 | 3 | 2 | 3 | 0 | |
p02725 | C++ | Runtime Error | #pragma GCC optimize( \
"Ofast") // Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fastio ... |
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | replace | 0 | 4 | 0 | 1 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
int main() {
int k, n;
int sum = 0;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> d(n);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
int main() {
int k, n;
int sum = 0;
cin >> k >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
v... | insert | 10 | 10 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define T() ... | #include <bits/stdc++.h>
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define T() ... | replace | 35 | 36 | 35 | 36 | 0 | |
p02725 | C++ | Runtime Error | #include <iostream>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdio.h>
#include <string.h>
int lst[110];
int main() {
int k;
int n;
int ans;
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> lst[i];
}
ans = -lst[n - 1] + lst[0] + k;
f... | #include <iostream>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdio.h>
#include <string.h>
int lst[200010];
int main() {
int k;
int n;
int ans;
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> lst[i];
}
ans = -lst[n - 1] + lst[0] + k;
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02725 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int arr[100005];
int main() {
int n, k;
scanf("%d", &k);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int x = arr[n - 1] - arr[0];
int y = arr[0] + (k - arr[1]);
x = min(x, y);
int d = (k - arr[n - 1]) + arr[n - 2];
int min... | #include <bits/stdc++.h>
using namespace std;
int arr[200005];
int main() {
int n, k;
scanf("%d", &k);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int x = arr[n - 1] - arr[0];
int y = arr[0] + (k - arr[1]);
x = min(x, y);
int d = (k - arr[n - 1]) + arr[n - 2];
int min... | replace | 2 | 3 | 2 | 3 | 0 | |
p02725 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef pair<long long int, long long int> iil;
typedef long long ll;
typedef vector<... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef pair<long long int, long long int> iil;
typedef long long ll;
typedef vector<... | replace | 65 | 67 | 65 | 76 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.