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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " ... | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y;
return 0;
} | delete | 6 | 11 | 6 | 6 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define p... | #include <bits/stdc++.h>
#define ll long long int
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define p... | replace | 16 | 20 | 16 | 20 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a, n) a, a + n
using namespace std;
typede... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a, n) a, a + n
using namespace std;
typede... | replace | 24 | 28 | 24 | 28 | 0 | |
p02717 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r" , stdin);
// freopen("output.txt", "w", stdout);
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y;
return 0;
}
| replace | 9 | 11 | 9 | 11 | 0 | |
p02718 | C++ | Runtime Error | #include <stdio.h>
int main() {
int n, m, i;
int sum = 0;
int re = 0;
scanf("%d %d", &n, &m);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", a[i]);
sum = sum + a[i];
}
for (i = 0; i < n; i++) {
if (a[i] * 4 * m >= sum)
re++;
}
if (re >= m)
printf("Yes");
else
print... | #include <stdio.h>
int main() {
int n, m, i;
int sum = 0;
int re = 0;
scanf("%d %d", &n, &m);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum = sum + a[i];
}
for (i = 0; i < n; i++) {
if (a[i] * 4 * m >= sum)
re++;
}
if (re >= m)
printf("Yes");
else
prin... | replace | 12 | 13 | 12 | 13 | -11 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, sum;
sum = 0;
cin >> N >> M;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
sum += a.at(i);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
if (a.at(M) >= sum / (4 * M)) {
cout << "Yes" << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, sum;
sum = 0;
cin >> N >> M;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
sum += a.at(i);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
if (sum % (4 * M) == 0) {
if (a.at(M - 1) >= sum / (... | replace | 16 | 22 | 16 | 28 | 0 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
#define eps 1e-9
#define MOD 1000000007;
#define INV_10 299473306;
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int n;
double m;
cin >> n >> m;
double a[n], sum = 0;
... | #include <bits/stdc++.h>
#define eps 1e-9
#define MOD 1000000007;
#define INV_10 299473306;
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
double m;
cin >> n >> m;
double a[n], sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort... | delete | 9 | 11 | 9 | 9 | 0 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ull unsigned long long int
#define ll long long int
#define ld dou... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ull unsigned long long int
#define ll long long int
#define ld dou... | replace | 28 | 32 | 28 | 29 | -11 | |
p02718 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, n, m, all = 0, p = 0; // n個の内、m個を選ぶ//
cin >> n >> m;
vector<int> a(i);
for (i = 0; i < n; i++) {
cin >> a[i];
all = all + a[i];
}
for (i = 0; i < n; i++) {
if ((4 * m) * a[i] >= all)
p = p + 1;
}
if (p >=... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, n, m, all = 0, p = 0; // n個の内、m個を選ぶ//
cin >> n >> m;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
all = all + a[i];
}
for (i = 0; i < n; i++) {
if ((4 * m) * a[i] >= all)
p = p + 1;
}
if (p >=... | replace | 8 | 9 | 8 | 9 | 0 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
//<<setprecision(30)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 1000000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int N, M;
cin >> N >> M;
... | #include <bits/stdc++.h>
using namespace std;
//<<setprecision(30)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 1000000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int N, M;
cin >> N >> M;
... | replace | 20 | 21 | 20 | 21 | 0 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, a, b;
b = 0;
vector<int> A(N);
a = 0;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
b += A.at(i);
}
sort(A.begin(), A.end());
if (A.at(N - M - 1) >= b / (4 * M)) {
cout << "Yes" << endl;
} else {
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, a, b;
b = 0;
vector<int> A(N);
a = 0;
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
b += A.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) * 4 * M >= b) {
a++;
}
}
if (a >= M) {
cout << ... | replace | 13 | 15 | 13 | 19 | 0 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// 0~nの範囲操作
#define rep(i, n) for (ll i = 0; i < (n); ++i)
// 1~nの範囲操作
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
// n~0を後ろから範囲操作
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
// 出力後改行を
#define fin(ans) cout << (ans) << endl;
// 出力後空白を
#define blank(ans) cout <... | #include <bits/stdc++.h>
using namespace std;
// 0~nの範囲操作
#define rep(i, n) for (ll i = 0; i < (n); ++i)
// 1~nの範囲操作
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
// n~0を後ろから範囲操作
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
// 出力後改行を
#define fin(ans) cout << (ans) << endl;
// 出力後空白を
#define blank(ans) cout <... | replace | 308 | 324 | 308 | 311 | -8 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, sum = 0;
cin >> n >> m;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a + 1, a + 1 + n);
int x = sum / (4 * m);
int f = 0;
if (x * m * 4 == sum)
f = 1;
bool f1 = true;
for (int i = n; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, sum = 0;
cin >> n >> m;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a + 1, a + 1 + n);
int x = sum / (4 * m);
int f = 0;
if (x * m * 4 == sum)
f = 1;
bool f1 = true;
// cout << "lol"... | replace | 17 | 18 | 17 | 19 | -11 | |
p02718 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
int main() {
int n, m;
int c = 0, i = 0, all = 0;
scanf("%d %d", &n, &m);
vector<int> vec(n);
for (i = 0; i < n; i++) {
cin >> vec.at(i);
all += vec.at(i);
}
i = 0;
while (i < n) {
if (n * 4 / all <= vec.at(i))
c += 1;... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
int main() {
int n, m;
int c = 0, i = 0, all = 0;
scanf("%d %d", &n, &m);
vector<int> vec(n);
for (i = 0; i < n; i++) {
cin >> vec.at(i);
all += vec.at(i);
}
i = 0;
for (i = 0; i < n && c < m; i++) {
if (all <= vec.at(i) * m... | replace | 16 | 18 | 16 | 18 | TLE | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio() \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio() \
ios_base::sync_with_stdio(0); ... | delete | 51 | 55 | 51 | 51 | 0 |
Time elapsed: 43ms
|
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef vector<pii> vii;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_orde... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef vector<pii> vii;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_orde... | replace | 87 | 90 | 87 | 88 | 0 | |
p02718 | Python | Runtime Error | #!/usr/bin/env python3
a = int(input())
a, b = map(int, input().split())
a = list(str(input()))
| #!/usr/bin/env python3
import numpy as np
N, M = map(int, input().split())
A = list(map(int, input().split()))
A = np.array(A)
num = np.sum(A >= np.sum(A) / (4 * M))
if num >= M:
print("Yes")
else:
print("No")
| replace | 2 | 5 | 2 | 15 | ValueError: invalid literal for int() with base 10: '4 1' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02718/Python/s781697127.py", line 3, in <module>
a = int(input())
ValueError: invalid literal for int() with base 10: '4 1'
|
p02718 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
int total = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
total += a[i];
}
string res;
if (a[m] > total / (4 * a[m]))
res = "Yes";
else
res = "No";
cout << res;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
int total = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
total += a[i];
}
string res;
int count = 0;
for (int i = 0; i < n; ++i)
if (a[i] >= float(total) / (4 * m))
++count;
i... | replace | 16 | 17 | 16 | 21 | 0 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
#define mod 1000000007
#define mem(a, val) memset(a, val, sizeof(a))
#define ps(x, noOfDecimal) fixed << setprecision(noOfDecimal) << x
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", ... | #include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
#define mod 1000000007
#define mem(a, val) memset(a, val, sizeof(a))
#define ps(x, noOfDecimal) fixed << setprecision(noOfDecimal) << x
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("outp... | replace | 9 | 13 | 9 | 13 | 0 | |
p02718 | C++ | Runtime Error | // Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
#define PI acos(-1.0)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
... | // Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
#define PI acos(-1.0)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
... | replace | 66 | 73 | 66 | 67 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
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;
#define INF 1000000000
#define MOD 1000000007LL
#define EPSILON 0.00001
... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
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;
#define INF 1000000000
#define MOD 1000000007LL
#define EPSILON 0.00001
... | replace | 21 | 22 | 21 | 22 | 0 | |
p02718 | C++ | Runtime Error | #include <fstream>
#include <iostream>
#include <stdio.h>
#define DEV 1
using std::cin;
using std::cout;
using std::endl;
using std::terminate;
void solve() {
int n, m;
cin >> n >> m;
int a[n];
int all = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
all += a[i];
a[i] *= 4 * m;
}
int y = 0;... | #include <fstream>
#include <iostream>
#include <stdio.h>
using std::cin;
using std::cout;
using std::endl;
using std::terminate;
void solve() {
int n, m;
cin >> n >> m;
int a[n];
int all = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
all += a[i];
a[i] *= 4 * m;
}
int y = 0;
for (int i =... | delete | 3 | 5 | 3 | 3 | 0 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, sum = 0;
cin >> N >> M;
vector<int> vo(N);
for (int i = 0; i, N; i++) {
cin >> vo.at(i);
sum += vo.at(i);
}
sort(vo.begin(), vo.end(), greater<int>());
cout << ((vo.at(M - 1) >= (sum + 4 * M - 1) / (4 * M)) ? "Yes" : "No")
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, sum = 0;
cin >> N >> M;
vector<int> vo(N);
for (int i = 0; i < N; i++) {
cin >> vo.at(i);
sum += vo.at(i);
}
sort(vo.begin(), vo.end(), greater<int>());
cout << ((vo.at(M - 1) >= (sum + 4 * M - 1) / (4 * M)) ? "Yes" : "No")
... | replace | 6 | 7 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
double sum;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
sum += a.at(i);
sort(a.begin(), a.end());
if (a.at(n - m + 1) < sum / 4 * m)
cout << "Yes" << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
double sum;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
sum += a.at(i);
sort(a.begin(), a.end());
if (a.at(n - m) >= sum / (4 * m))
cout << "Yes" << endl;
else
... | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02718 | Python | Runtime Error | n, m = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
if a[m] >= sum(a) / (4 * m):
print("Yes")
else:
print("No")
| n, m = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
if a[m - 1] >= sum(a) / (4 * m):
print("Yes")
else:
print("No")
| replace | 2 | 3 | 2 | 3 | 0 | |
p02718 | Python | Runtime Error | n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
total = sum(a)
canPick = True
for i in range(m):
if a[m] < total // (4 * m):
canPick = False
if canPick is True:
print("Yes")
else:
print("No")
| n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
total = sum(a)
canPick = True
for i in range(m):
if a[i] < total / (4 * m):
canPick = False
if canPick is True:
print("Yes")
else:
print("No")
| replace | 8 | 9 | 8 | 9 | 0 | |
p02718 | Python | Runtime Error | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
real = A[M] / sum(A)
ideal = 1 / (4 * M)
if real >= ideal:
print("Yes")
else:
print("No")
| N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
real = A[M - 1] / sum(A)
ideal = 1 / (4 * M)
if real >= ideal:
print("Yes")
else:
print("No")
| replace | 3 | 4 | 3 | 5 | 0 | |
p02718 | Python | Runtime Error | n, m = set(map(int, input().split()))
a = set(map(int, input().split()))
count = 0
for x in a:
if x >= sum(a) / (4 * m):
count += 1
if m <= count:
print("Yes")
else:
print("No")
| n, m = map(int, input().split())
a = list(map(int, input().split()))
count = 0
for x in a:
if x >= sum(a) / (4 * m):
count += 1
if m <= count:
print("Yes")
else:
print("No")
| replace | 0 | 2 | 0 | 2 | 0 | |
p02718 | Python | Runtime Error | n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
if a[m] * 4 * m >= sum(a):
print("Yes")
else:
print("No")
| n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
if a[m - 1] * 4 * m >= sum(a):
print("Yes")
else:
print("No")
| replace | 3 | 4 | 3 | 4 | 0 | |
p02718 | C++ | Runtime Error | #include <iostream>
#include <sstream>
using namespace std;
#include <algorithm>
#include <bits/stdc++.h>
#include <iterator>
#include <utility>
#define go return 0
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep(j, n) for (int j = 0; j < n; ++j)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(v) (... | #include <iostream>
#include <sstream>
using namespace std;
#include <algorithm>
#include <bits/stdc++.h>
#include <iterator>
#include <utility>
#define go return 0
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep(j, n) for (int j = 0; j < n; ++j)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(v) (... | replace | 40 | 42 | 40 | 43 | 4 | |
p02718 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, N;
cin >> N >> M;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
if (A.at(M) > accumulate(A.begin(), A.end(), 0) / (4 * M)) {
cout << "Yes" << endl;
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, N;
cin >> N >> M;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
if (A.at(M - 1) >=
float(accumulate(A.begin(), A.end(), 0)) / float((4 * M))) {
cout... | replace | 12 | 13 | 12 | 14 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using n... | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using n... | replace | 81 | 89 | 81 | 82 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
long k;
long calc(long n) {
long result = abs(n - k);
if (n < result)
return n;
return calc(result);
}
int main() {
long n;
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
long k;
long calc(long n) {
long result = abs(n - k);
if (n < result)
return n;
return calc(result);
}
int main() {
long n;
... | replace | 16 | 20 | 16 | 21 | TLE | |
p02719 | C++ | Runtime Error | /*
NAYEEM
Information and Communication Engineering ,
University of Rajshahi
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); ... | /*
NAYEEM
Information and Communication Engineering ,
University of Rajshahi
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); ... | replace | 62 | 68 | 62 | 64 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else if (n < k) {
if (2 * n < k)
cout << n << endl;
else
cout << k - n << endl;
} else if (n >= k) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
n %= k;
cout << min(n, k - n) << endl;
return 0;
}
| replace | 8 | 25 | 8 | 10 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, k, ans;
cin >> n >> k;
if (n == k)
ans = 0;
else if (n > k)
ans = min(n % k, k - n % k);
else
ans = min(n, k - n);
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k, ans;
cin >> n >> k;
if (n == k)
ans = 0;
else if (n > k)
ans = min(n % k, k - n % k);
else
ans = min(n, k - n);
cout << ans;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | replace | 488 | 490 | 488 | 499 | 0 | |
p02719 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k, t;
cin >> n >> k;
t = n % k;
cout << min(t, abs(t - k)) << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long int n, k, t;
cin >> n >> k;
t = n % k;
cout << min(t, abs(t - k)) << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Runtime Error | #pragma region
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define repc(i, m, n) for (int i = m; i < n; i++)
#define reprc(i, m, n) for (int i = m; i > n; i--)
#define all(v) v.begin(), v.end()
#define INF 1e9
#defi... | #pragma region
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define repc(i, m, n) for (int i = m; i < n; i++)
#define reprc(i, m, n) for (int i = m; i > n; i--)
#define all(v) v.begin(), v.end()
#define INF 1e9
#defi... | replace | 15 | 16 | 15 | 16 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
while (1) {
if (k == 1) {
n = 0;
break;
}
if (abs(n - k) < n)
n = abs(n - k);
else
break;
}
cout << n << endl;
} | #include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
cout << min(k - n % k, n % k) << endl;
} | replace | 6 | 17 | 6 | 7 | TLE | |
p02719 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, k, a, b;
cin >> n >> k;
if (n % k == 0)
cout << 0 << endl;
else {
a = n % k;
b = k - a;
cout << min(a, b) << endl;
}
} | #include <iostream>
using namespace std;
int main() {
long long n, k, a, b;
cin >> n >> k;
if (n % k == 0)
cout << 0 << endl;
else {
a = n % k;
b = k - a;
cout << min(a, b) << endl;
}
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
long long X, K;
cin >> X >> K;
if (X == K || K == 1)
cout << 0;
else {
long long temp = X;
X = abs(X - K);
while (X < temp) {
temp = X;
X = abs(X - K);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
long long X, K;
cin >> X >> K;
if (X == K || K == 1)
cout << 0;
else {
X %= K;
long long temp = X;
X = abs(X - K);
while (X < temp) {
temp = X;
X = abs(X - K)... | insert | 10 | 10 | 10 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define each(i, mp) for (auto &i : mp)
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
ll tmp = n, tmp_prev = n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define each(i, mp) for (auto &i : mp)
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
ll tmp = n % k, tmp_prev... | replace | 14 | 15 | 14 | 15 | TLE | |
p02719 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end... | insert | 23 | 23 | 23 | 24 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
ll ans = n;
while (1) {
n = abs(k - n);
if (n < ans)
ans = n;
else
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
cin >> n >> k;
ll t = n % k;
ll ans = min(t, k - t);
cout << ans << endl;
} | replace | 9 | 17 | 9 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long N, K;
long long cnt;
bool update = true;
cin >> N >> K;
long long minimum;
while (update) {
update = false;
minimum = N;
N = min(N, abs(N - K));
if (minimum > N) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long N, K;
long long cnt;
bool update = true;
cin >> N >> K;
long long minimum;
N = N % K;
while (update) {
update = false;
minimum = N;
N = min(N, abs(N - K));
if (mini... | insert | 16 | 16 | 16 | 18 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, a;
cin >> n >> k;
if (n % k == 0) {
cout << 0 << endl;
} else {
while (1) {
a = n;
n = abs(n - k);
if (n > a) {
cout << a << endl;
break;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, flag, sum = 0, sum1 = 0, cnt = 0, ans, lo, mo, n, m;
vector<long long int> vec;
list<long long int> mylist;
vector<long long int>::iterator it1;
list<long long int>::iterator it2;
cin >> n >> m;
cout << min(n % m, abs(n % m - ... | replace | 3 | 17 | 3 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
long long n, k, ans;
int flag = 0;
scanf("%lld %lld", &n, &k);
ans = abs(n - k);
while (flag < 100) {
if (n >= k && n % k == 0) {
printf("0\n");
return 0;
}
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
long long n, k, ans;
int flag = 0;
scanf("%lld %lld", &n, &k);
if (n >= k)
n = n % k;
ans = n;
if (k - n < ans)
ans = k - n;
printf("%lld\n", ans);
return 0;
}
| replace | 10 | 23 | 10 | 15 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <math.h>
#include <stdio.h>
int main() {
long long n, k;
scanf("%lld %lld", &n, &k);
while (abs(n - k) < n) {
n = abs(n - k);
}
printf("%lld\n", n);
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
long long n, k;
scanf("%lld %lld", &n, &k);
n = n % k;
while (abs(n - k) < n) {
n = abs(n - k);
}
printf("%lld\n", n);
return 0;
} | insert | 6 | 6 | 6 | 7 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
ll output = n % abs(n - k);
cout << output << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
ll remainder = n % k;
ll output = min(remainder, abs(k - remainder));
cout << output << endl;
}
| replace | 8 | 9 | 8 | 10 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n = 0;
long long k = 0;
cin >> n >> k;
long long checker = 1000000000000000000;
while (1) {
checker = n;
n = abs(n - k);
if (n >= checker) {
break;
}
}
cout << checker << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n = 0;
long long k = 0;
cin >> n >> k;
cout << min(n % k, k - n % k) << "\n";
return 0;
} | replace | 9 | 20 | 9 | 10 | TLE | |
p02719 | C++ | Runtime Error | #line 2 "../../library/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pl = pair<ll, ll>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep3(i, l, r) for (ll i = l; i < (ll)r; i++)
#define per(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pe... | #line 2 "../../library/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pl = pair<ll, ll>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep3(i, l, r) for (ll i = l; i < (ll)r; i++)
#define per(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pe... | replace | 57 | 59 | 57 | 66 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <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 | 21 | 42 | 21 | 24 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0;
return 0;
}
while (n >= k) {
int p = n / k;
n = n - p * k;
}
if (abs(n - k) > n)
cout << n;
else
cout << abs(n - k);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0;
return 0;
}
while (n >= k) {
n %= k;
}
if (abs(n - k) > n)
cout << n;
else
cout << abs(n - k);
} | replace | 11 | 13 | 11 | 12 | TLE | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define MAX(x, y) (x > y ? x : y)
#define MIN(x, y) (x < y ? x : y)
#define ABS(x) (x > 0 ? x : -(x))
#define INF 2147483647
#define LLINF 9223372036854775807
#d... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define MAX(x, y) (x > y ? x : y)
#define MIN(x, y) (x < y ? x : y)
#define ABS(x) (x > 0 ? x : -(x))
#define INF 2147483647
#define LLINF 9223372036854775807
#d... | replace | 103 | 104 | 103 | 107 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
int k;
cin >> n >> k;
int ans = n;
if (n > k) {
n = n % k;
ans = min(ans, n);
n = k - n;
ans = min(ans, n);
} else {
n = k % n;
ans = min(ans, n);
n = k - n;
ans = min(ans, n);
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
int k;
cin >> n >> k;
int ans = n;
n = abs(n % k);
ans = min(ans, n);
n = k - n;
ans = min(ans, n);
cout << ans;
} | replace | 9 | 20 | 9 | 13 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
cout << min(abs(n - m * (n / m)), abs(n - m * (n / m + 1)));
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
cout << min(abs(n - m * (n / m)), abs(n - m * (n / m + 1)));
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0 << endl;
} else {
if (n > k) {
n = n % k;
}
cout << min(n, k - n) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0 << endl;
} else {
if (n > k) {
n = n % k;
}
cout << min(n, k - n) << endl;
}
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <sstream>
#include <stdio.h>
#include <string>
#include <valarray>
#include <vector>
using namespace std;
vector<int> Data;
int main(void) {
int n, k;
cin >> n >> k;
n = n % k;
if (n == 0) {
cout << n << endl;
return... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <sstream>
#include <stdio.h>
#include <string>
#include <valarray>
#include <vector>
using namespace std;
vector<int> Data;
int main(void) {
long n, k;
cin >> n >> k;
n = n % k;
if (n == 0) {
cout << n << endl;
retur... | replace | 13 | 14 | 13 | 14 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
while (N > abs(K - N)) {
N = abs(N - K);
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long ans = min(N % K, K - N % K);
cout << ans << endl;
} | replace | 6 | 10 | 6 | 8 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
long long gcd(long long a, long long b) {
ll gcdmax = max(a, b);
ll gcdmin = min(a, b);
while (true) {
if (gcdmax % gcdmin == 0)
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
long long gcd(long long a, long long b) {
ll gcdmax = max(a, b);
ll gcdmin = min(a, b);
while (true) {
if (gcdmax % gcdmin == 0)
break;
... | replace | 30 | 36 | 30 | 31 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <exception>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<int, int> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl "\n"
#define fx(n) fixed << setprecisio... | #include <bits/stdc++.h>
#include <exception>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<int, int> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl "\n"
#define fx(n) fixed << setprecisio... | replace | 44 | 46 | 44 | 54 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << min(N % K, abs(N % K - K));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
cout << min(N % K, abs(N % K - K));
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define sz(x) (int)(x).size()
using namespace std;
typedef long long int lli;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
in... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define sz(x) (int)(x).size()
using namespace std;
typedef long long int lli;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
in... | replace | 13 | 29 | 13 | 18 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << min(n % k, abs((n % k) - k)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
cout << min(n % k, abs((n % k) - k)) << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Time Limit Exceeded | // --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)\
#pr... | // --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)\
#pr... | replace | 242 | 259 | 242 | 244 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n % k < k - n % k)
cout << n % k;
else
cout << k - n % k;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (n % k < k - n % k)
cout << n % k;
else
cout << k - n % k;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
if (k == 1) {
cout << "0";
} else if (k == 0) {
cout << n;
} else {
while (abs(n - k) <= n) {
n = abs(n - k);
}
cout << n;
}
} | #include <iostream>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int mn;
n = n % k;
mn = min(n, k - n);
cout << mn;
return 0;
} | replace | 8 | 18 | 8 | 15 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, x, y;
cin >> N >> K;
x = N % K;
y = K - x;
if (x > y)
cout << y << endl;
else
cout << x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K, x, y;
cin >> N >> K;
x = N % K;
y = K - x;
if (x > y)
cout << y << endl;
else
cout << x << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
int main() {
long long n, k;
scanf("%lld %lld", &n, &k);
if (k == 1) {
printf("%d\n", 0);
return 0;
}
long long tmp = 0;
while (1) {
tmp = n;
n = llabs(n - k);
if (tmp <= n) {
printf("%lld\n", tmp);
return 0;
}
}
return 0;
} | #include <stdio.h>
#include <stdlib.h>
int main() {
long long n, k;
scanf("%lld %lld", &n, &k);
if (k == 1) {
printf("%d\n", 0);
return 0;
}
long long tmp = 0;
n = n % k;
while (1) {
tmp = n;
n = llabs(n - k);
if (tmp <= n) {
printf("%lld\n", tmp);
return 0;
}
}
ret... | insert | 10 | 10 | 10 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
set<int64_t> x;
for (; !x.count(N);) {
x.insert(N);
if (N > K)
N -= K;
else
N = K - N;
}
cout << *begin(x) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
set<int64_t> x;
for (; !x.count(N);) {
x.insert(N);
if (N > K)
N %= K;
else
N = K - N;
}
cout << *begin(x) << endl;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ld long double
#define ll long long int
#define ull unsigned long long int
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define ALL(v) v.... | #include <bits/stdc++.h>
#define ld long double
#define ll long long int
#define ull unsigned long long int
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define ALL(v) v.... | insert | 83 | 83 | 83 | 84 | TLE | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
cout << min(a % b, b % a);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if (a == 0) {
cout << 0;
return 0;
}
cout << min(a % b, b - (a % b));
return 0;
} | replace | 9 | 10 | 9 | 14 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
a %= b;
}
if (a > b / 2) {
a = b - a;
}
cout << a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a > b) {
a %= b;
}
if (a > b / 2) {
a = b - a;
}
cout << a;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
cin >> K;
N %= K;
if (N > K - N)
cout << K - N;
else
cout << N;
} | #include <iostream>
using namespace std;
int main() {
long long N, K;
cin >> N;
cin >> K;
N %= K;
if (N > K - N)
cout << K - N;
else
cout << N;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define ll long long
using namespace std;
int main() {
ll N, K;
cin >> N >> K;
ll ans = N;
while (ans > K / 2) {
ans = abs(ans - K);
}
cout << ans << endl;
return... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define ll long long
using namespace std;
int main() {
ll N, K;
cin >> N >> K;
ll ans = N % K;
while (ans > K / 2) {
ans = abs(ans - K);
}
cout << ans << endl;
re... | replace | 10 | 11 | 10 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
#define MAX 1000003
#define pii pair<ll, ll>
#define VP vector<pii>
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define all(v) (v).begin(), (v).end()
#define S(x) scanf("%d", &(x))
#define S2(... | #include <bits/stdc++.h>
#define ll long long int
#define MAX 1000003
#define pii pair<ll, ll>
#define VP vector<pii>
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define all(v) (v).begin(), (v).end()
#define S(x) scanf("%d", &(x))
#define S2(... | insert | 24 | 24 | 24 | 25 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define vi(v) vector<int> v;
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
while (true) {
if (n % k == 0) {
cout << "0";
break;
}
if (n <= k) {
cout <... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define vi(v) vector<int> v;
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
cout << min(k - (n % k), n % k) << '\n';
// else if(n%k!=0&&n<k)
// cout<<min(n%k, n);
// else
... | replace | 11 | 22 | 11 | 17 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define X first
#define Y second
int dx[4] ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define X first
#define Y second
int dx[4] ... | replace | 39 | 46 | 39 | 40 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long min = n;
while (true) {
if (k == 1) {
min = 0;
break;
}
long long a = n - k;
if (a < 0)
a = -a;
if (a < min) {
min = a;
n = a;
} else
break;
}
cout << m... | #include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long min = n;
long long a = n % k;
long long ans = std::min(a, k - a);
cout << ans << endl;
return 0;
} | replace | 7 | 22 | 7 | 10 | TLE | |
p02719 | 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, M;
cin >> N >> K;
M = min(N % K, K - N % K);
cout << M << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N, K, M;
cin >> N >> K;
M = min(N % K, K - N % K);
cout << M << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02719 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N > K) {
N = N % K;
}
N = min(N, K - N);
cout << N << endl;
}
| #include <iostream>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
if (N > K) {
N = N % K;
}
N = min(N, K - N);
cout << N << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int a, b;
cin >> a >> b;
if (a % b == 0)
cout << 0;
else if (a < b)
cout << min(b - a, a);
else
cout << min(abs(b - (a % b)), a % b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long a, b;
cin >> a >> b;
if (a % b == 0)
cout << 0;
else if (a < b)
cout << min(b - a, a);
else
cout << min(abs(b - (a % b)), a % b);
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | // -----------------------------------
// Author : MatsuTaku
// Affiliation: Tokushima University
// Country : Japan
// Date : 04/04/2020
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(fal... | // -----------------------------------
// Author : MatsuTaku
// Affiliation: Tokushima University
// Country : Japan
// Date : 04/04/2020
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(fal... | replace | 16 | 17 | 16 | 17 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1001001001;
int main() {
ll n, k;
cin >> n >> k;
ull ans = 0;
if (n % k == 0) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1001001001;
int main() {
ll n, k;
cin >> n >> k;
ull ans = 0;
if (n % k == 0) ... | replace | 27 | 34 | 27 | 29 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int a;
long long int x;
x = n;
for (int i = 0; i < n + 1; ++i) {
if (x > abs(x - k)) {
x = abs(x - k);
} else {
cout << x << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int r;
long long int s;
r = n % k;
s = abs(n % k - k);
long long int ans;
ans = min(r, s);
cout << ans << endl;
} | replace | 5 | 16 | 5 | 12 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
if (k == 1) {
cout << "0" << endl;
} else {
long x = 0, y = 0;
for (int i = 0; i < n; i++) {
n = abs(n - k);
if (n == x || n == y) {
break;
}
y = x;
x = n;
}
cout << mi... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
cout << min(n % k, k - (n % k)) << endl;
} | replace | 6 | 20 | 6 | 7 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k - (n % k) <= n % k) {
cout << k - (n % k) << endl;
} else {
cout << n % k << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (k - (n % k) <= n % k) {
cout << k - (n % k) << endl;
} else {
cout << n % k << endl;
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define pll pair<ll, ll>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
int inf = 1000001000;
ll INF = 100000000000000000;
ll MOD = 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define pll pair<ll, ll>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
int inf = 1000001000;
ll INF = 100000000000000000;
ll MOD = 1... | replace | 16 | 19 | 16 | 18 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdarg.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() { /*7日目*/
// 少数も使いたい割り算はしない方がいい
// 数値の大きさ
// for文で0代入する場所... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdarg.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() { /*7日目*/
// 少数も使いたい割り算はしない方がいい
// 数値の大きさ
// for文で0代入する場所... | replace | 22 | 40 | 22 | 28 | TLE | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, k;
cin >> n >> k;
if (n > k) {
ll ans = min(n % k, llabs(n - (n % k)));
cout << ans;
}
else {
ll ans = min(k % n, llabs(k - (k % n)));
cout << ... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, k;
cin >> n >> k;
ll r = n % k;
ll ans = min(r, llabs(k - r));
cout << ans;
} | replace | 11 | 21 | 11 | 14 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
// typedef long long int lli;
int main() {
long n, k;
cin >> n >> k;
if (n % k == 0)
cout << 0 << endl;
else {
while (1) {
if (abs(n - k) < n)
n = abs(n - k);
else
break;
}
cout << n << endl;
}
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
// typedef long long int lli;
int main() {
long n, k;
cin >> n >> k;
if (n % k == 0)
cout << 0 << endl;
else {
long d = fabs((n % k) - k);
if (d < n)
cout << d << endl;
else
cout << n << endl;
}
}
| replace | 12 | 20 | 12 | 17 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n, k, m;
cin >> n >> k;
long long int time = n / k;
if (k * time != n) {
time += 1;
}
m = 0;
if (n % k == 0) {
cout << 0;
return 0;
}
for (long long int i = 0; i <... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n, k, m;
cin >> n >> k;
cout << min(n % k, k - n % k);
return 0;
}
| replace | 10 | 34 | 10 | 11 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << min(n % k, k - n % k);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
cout << min(n % k, k - n % k);
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
long long n = 0, k = 0;
cin >> n >> k;
long long a = llabs(n - k);
n = llabs(a - k);
while (n < a) {
a = n;
n = llabs(n - k);
}
cout << a << endl;
return 0;
}
| #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
long long n = 0, k = 0;
cin >> n >> k;
n = n % k;
if (n > k - n)
cout << k - n << endl;
else
cout << n << endl;
return 0;
} | replace | 7 | 14 | 7 | 12 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ll n, k;
cin >> n >> k;
n = min(n % k, n);
while (true) {
int pre = n;
n = min(abs(n - k), n);
if (n == pre)
break;
}
cout << n ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
ll n, k;
cin >> n >> k;
n = min(n % k, n);
while (true) {
ll pre = n;
n = min(abs(n - k), n);
if (n == pre)
break;
}
cout << n <... | replace | 11 | 12 | 11 | 12 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
long long n, k;
cin >> n >> k;
if (k == n % abs(n - k))
cout << "0";
else
cout << n % abs(n - k);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
long long n, k;
cin >> n >> k;
n %= k;
cout << min(n, abs(n - k));
return 0;
}
| replace | 9 | 13 | 9 | 11 | 0 | |
p02719 | C++ | Runtime Error | // using no_way as a way
// using no_limitation as a limitation
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
const doub... | // using no_way as a way
// using no_limitation as a limitation
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
const doub... | insert | 52 | 52 | 52 | 54 | 0 | |
p02719 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
ll n, k;
cin >> n >> k;
while (n >= k) {
n -= k;
}
ll ans = min(n, k - n);
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
ll n, k;
cin >> n >> k;
ll r = n % k;
ll ans = min(r, k - r);
cout << ans << endl;
}
| replace | 8 | 12 | 8 | 10 | TLE | |
p02719 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
N = N % K;
cout << min(N, K - N) << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
unsigned long long N, K;
cin >> N >> K;
N = N % K;
cout << min(N, K - N) << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.