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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02719 | C++ | Time Limit Exceeded | /* Author:bhagatsunny96
JGEC
template__
lets_code_it_ */
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ll long long int
#define ld long double
#define fi first
#define se second
#define mod 1000000007
#define test ... | /* Author:bhagatsunny96
JGEC
template__
lets_code_it_ */
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ll long long int
#define ld long double
#define fi first
#define se second
#define mod 1000000007
#define test ... | replace | 121 | 124 | 121 | 124 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, a, b;
cin >> N >> K;
a = N % K;
b = -a + K;
cout << min(a, b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, a, b;
cin >> N >> K;
a = N % K;
b = -a + K;
cout << min(a, b) << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, k, ans;
cin >> n >> k;
ans = abs(n - k);
if (k == 1)
ans = 0;
else
while (2 * ans > k) {
ans = min(ans, abs(ans - k));
}
cout << ans << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, k, ans;
cin >> n >> k;
ans = n % k;
if (k == 1)
ans = 0;
else
while (2 * ans > k) {
ans = min(ans, abs(ans - k));
}
cout << ans << endl;
} | replace | 6 | 7 | 6 | 7 | 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 minnumber = (n % k);
int counter = 0;
for (int i = 0;; i++) {
if (minnumber == 0) {
cout << 0 << endl;
return 0;
}
if (counter == 2) {
break;
}
minnumber = min(min... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int m = n % k;
m = min(m, k - m);
cout << m << endl;
return 0;
}
| replace | 6 | 22 | 6 | 9 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
if (n % k == 0) {
cout << '0';
return 0;
}
long long int min = n;
long long int last = min;
for (int i = 0;; i++) {
if (abs(last - k) < min) {
min = abs(last - k);
}
if (last < abs(last ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
cout << min(n % k, k - n % k);
}
| replace | 5 | 21 | 5 | 6 | 1 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, K;
cin >> N >> K;
while (N > abs(N - K)) {
N = abs(N - K);
}
cout << N;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, K;
cin >> N >> K;
N = N % K;
while (N > abs(N - K)) {
N = abs(N - K);
}
cout << N;
} | insert | 7 | 7 | 7 | 8 | TLE | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
// code
int tc;
int i, j, k, n, m, p = 0;
cin >> n >> k;
cout << min(n % k, abs((n % k) - k)) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
// code
long long i, j, k, n, m, p = 0;
cin >> n >> k;
cout << min(n % k, abs((n % k) - k)) << endl;
return 0;
}
| replace | 9 | 11 | 9 | 11 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vii;
t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vii;
t... | replace | 33 | 38 | 33 | 34 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
long long int curr = a, prev;
while (true) {
prev = curr;
if (abs(curr - b) > prev) {
break;
}
curr = abs(curr - b);
}
cout << prev << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
cout << min(a % b, b - a % b) << endl;
} | replace | 5 | 14 | 5 | 6 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = (long long)1e18... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = (long long)1e18... | replace | 27 | 39 | 27 | 30 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef unsigned long long llong;
#define MAX 1e18
const llong mod = 1000000000 + 7;
int main() {
llong N, K;
llong prevN = mod;
scanf("%llu%llu", &N, &K);
llong sub;
if (N > K)
N -= N / K * K;
do {
prevN = min(prevN, N... | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef unsigned long long llong;
#define MAX 1e18
const llong mod = 1000000000 + 7;
int main() {
llong N, K;
llong prevN = MAX;
scanf("%llu%llu", &N, &K);
llong sub;
if (N > K)
N -= N / K * K;
do {
prevN = min(prevN, N... | replace | 12 | 13 | 12 | 13 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define all(n) (n).begin(), (n).end()
#define ll long long
void solve() {
ll n, k;
cin >> n >> k;
ll ans = n;
while (1) {
if (ans % k == 0) {
ans = 0;
break;
}
n = abs(n - k);
if (ans > n) {
ans = n;
} ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define all(n) (n).begin(), (n).end()
#define ll long long
void solve() {
ll n, k;
cin >> n >> k;
ll ans = n;
while (1) {
if (ans % k == 0) {
ans = 0;
break;
}
n = abs(n - k);
if (ans > n) {
ans = n;
} ... | insert | 23 | 23 | 23 | 24 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
while (true) {
if (N < abs(N - K)) {
break;
}
if (N > K) {
N = N % K;
} else {
N = abs(N - K);
}
}
cout << N << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, K;
cin >> N >> K;
while (true) {
if (N < abs(N - K)) {
break;
}
if (N > K) {
N = N % K;
} else {
N = abs(N - K);
}
}
cout << N << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
int m = n % k;
if (m == 0)
cout << 0 << endl;
else {
vector<ll> vec(m + 1);
vec.at(0) = n;
vec.at(1) = abs(n - k);
for (int i = 2; i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
ll m = n % k;
if (abs(m - k) < m)
cout << abs(m - k) << endl;
else
cout << m << endl;
} | replace | 7 | 20 | 7 | 13 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int, int>;
using psi = pair<string, int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int, int>;
using psi = pair<string, int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i... | replace | 29 | 38 | 29 | 31 | TLE | |
p02719 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
int a;
cin >> n >> k;
if (n % k == 0)
cout << '0';
else {
a = min(n % k, k - n % k);
cout << a;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n, k;
long long a;
cin >> n >> k;
if (n % k == 0)
cout << '0';
else {
a = min(n % k, k - n % k);
cout << a;
}
}
| replace | 7 | 9 | 7 | 9 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define for_(i, s, e) for (int i = s; i < e; i++)
#define for__(i, s, e) for (ull i = s; i < e; i++)
#define SSTR(x) \
static_cast<std::ostringstream &>((std::ostringstream() << std::dec << x)) \
.str(... | #include <bits/stdc++.h>
using namespace std;
#define for_(i, s, e) for (int i = s; i < e; i++)
#define for__(i, s, e) for (ull i = s; i < e; i++)
#define SSTR(x) \
static_cast<std::ostringstream &>((std::ostringstream() << std::dec << x)) \
.str(... | delete | 13 | 17 | 13 | 13 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
int main() {
fio;
int t;
cin >> t;
ll n, k, min;
cin >> n >> k;... | #include <bits/stdc++.h>
#define ll long long
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
int main() {
fio;
ll n, k, min;
cin >> n >> k;
if (n % k > k - n ... | delete | 9 | 11 | 9 | 9 | 0 | |
p02719 | C++ | Runtime Error | /*
--> WHEN IT'S OBVIOUS THAT THE GOAL CANNOT BE REACHED,
DON'T ADJUST THE GOALS,
ADJUST THE ACTION STEPS.
--> THE WAY YOU CONQUER SELF-DOUBT IS BY DOING THINGS THAT MAKE YOU
UNCOMFORTABLE.
--> IT IS DURING OUR DARKEST MOMENTS WE MUST FOCUS TO SEE LIGHT.
*/
#include <algorithm>
#include <climits>
#in... | /*
--> WHEN IT'S OBVIOUS THAT THE GOAL CANNOT BE REACHED,
DON'T ADJUST THE GOALS,
ADJUST THE ACTION STEPS.
--> THE WAY YOU CONQUER SELF-DOUBT IS BY DOING THINGS THAT MAKE YOU
UNCOMFORTABLE.
--> IT IS DURING OUR DARKEST MOMENTS WE MUST FOCUS TO SEE LIGHT.
*/
#include <algorithm>
#include <climits>
#in... | replace | 86 | 87 | 86 | 87 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
while (true) {
if (N > abs(N - K)) {
N = abs(N - K);
} else {
break;
}
}
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
if (N > K * 3) {
N = N - ((N / K) - 3) * K;
}
while (true) {
if (N > abs(N - K)) {
N = abs(N - K);
} else {
break;
}
}
cout << N << endl;
} | insert | 6 | 6 | 6 | 9 | TLE | |
p02719 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N, K;
int min;
cin >> N >> K;
min = N % K;
if (min > K - min)
min = K - min;
cout << min << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long N, K;
long min;
cin >> N >> K;
min = N % K;
if (min > K - min)
min = K - min;
cout << min << endl;
return 0;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02719 | 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;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
int main() {
ll n, k;
cin >> n >> k;
ll a, b;
if (n == 1) {
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
int main() {
ll n, k;
cin >> n >> k;
ll a = n % k;
ll ans = min(a, k -... | replace | 12 | 35 | 12 | 15 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
cout << min(k - n % k, n % k) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, k;
cin >> n >> k;
cout << min(k - n % k, n % k) << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
int main() {
int n, k;
cin >> n >> k;
cout << min(n % k, abs(n % k - k)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
int main() {
ll n, k;
cin >> n >> k;
cout << min(n % k, abs(n % k - k)) << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
using namespace std;
long int N, K;
cin >> N >> K;
while (true) {
if (K == 1) {
printf("0\n");
break;
}
if (N < abs(N - K)) {
printf("%ld\n", N);
break;
} else {
N = abs(N - K);
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
using namespace std;
long int N, K;
cin >> N >> K;
if (K == 1) {
printf("0\n");
} else if (N > K) {
long int tmp = N % K;
printf("%ld", abs(tmp - K));
} else {
while (true) {
if (N < abs(N - K)) {
printf("%ld\n", ... | replace | 8 | 18 | 8 | 21 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
if (N % K == 0) {
cout << 0 << endl;
return 0;
}
while ((2 * N) > K) {
N = abs(N - K);
}
cout << N << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
if (N % K == 0) {
cout << 0 << endl;
return 0;
}
if (N > K) {
N = N % K;
}
while ((2 * N) > K) {
N = abs(N - K);
}
cout << N << endl;
return 0;
} | insert | 12 | 12 | 12 | 16 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define pb push_back
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else {
se... | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define pb push_back
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
n = n % k;
cout << min(n, k - n) << endl;
re... | replace | 13 | 26 | 13 | 16 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, x;
cin >> n >> k;
x = min(n % k, k - n % k);
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, x;
cin >> n >> k;
x = min(n % k, k - n % k);
cout << x << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
void solve() {
int n, k;
cin >> n >> k;
cout << min(n % k, k - n % k) << "\n";
return;
};
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
Solution solution;
solution.solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
void solve() {
long long n, k;
cin >> n >> k;
cout << min(n % k, k - n % k) << "\n";
return;
};
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
Solution solution;
solution.solve();
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ff first
#define ss second
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define allin(a, x) for (auto a : x)
#define all(x) begin(x), end(x)
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define allin(a, x) for (auto a : x)
#define all(x) begin(x), end(x)
#defin... | replace | 2 | 3 | 2 | 3 | 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(k - n % k));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
cout << min(n % k, abs(k - n % k));
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | 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;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
cout << min({n % k, (n + k - 1) / k * k - n, n}) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n, k;
cin >> n >> k;
cout << min({n % k, (n + k - 1) / k * k - n, n}) << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
int main() {
long long N, K;
cin >> N >> K;
bool zero = false;
long long a = N;
long long b;
while (!zero) {
a = a - ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
int main() {
long long N, K;
cin >> N >> K;
bool zero = false;
long long a = N % K;
long long b = a - K;
b = -b;
if (b ... | replace | 15 | 25 | 15 | 17 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | replace | 12 | 22 | 12 | 13 | TLE | |
p02719 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i ... | replace | 29 | 30 | 29 | 30 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
if (N % K == 0) {
N = 0;
}
if (N > K) {
while (N > K) {
N -= K;
}
}
long Ans = min(N, abs(N - K));
cout << Ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
N -= (N / K) * K;
long Ans = min(N, abs(N - K));
cout << Ans << endl;
return 0;
}
| replace | 5 | 13 | 5 | 6 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define _for(i, j, k) for (int i = j; i < k; i++)
#define endl '\n'
#define inf 1 << 29 - 1
const int mod = 1e9 + 7;
const int MAX = 1e6 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, ... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define _for(i, j, k) for (int i = j; i < k; i++)
#define endl '\n'
#define inf 1 << 29 - 1
const int mod = 1e9 + 7;
const int MAX = 1e6 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, ... | replace | 17 | 25 | 17 | 19 | 0 | |
p02719 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
if (N > K) {
N = N - (N - K) / K * K;
}
if (N == K) {
cout << "0\n";
return 0;
}
if (N > K)
N -= K;
if (K - N > N) {
cout << N << "\n";
} else
cout << K -... | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long N, K;
cin >> N >> K;
if (N > K) {
N = N - (N - K) / K * K;
}
if (N == K) {
cout << "0\n";
return 0;
}
if (N > K)
N -= K;
if (K - N > N) {
cout << N << "\n";
} else
cout ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x, d) cout << fixed << setprecision(d) << x
#define fill(a, b) memset((a), (b), sizeof((a... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x, d) cout << fixed << setprecision(d) << x
#define fill(a, b) memset((a), (b), sizeof((a... | replace | 30 | 31 | 30 | 33 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <type_traits>
#include <vector>
typedef long long ll;
using namespace std;
// 素因数分解
void... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <type_traits>
#include <vector>
typedef long long ll;
using namespace std;
// 素因数分解
void... | replace | 43 | 49 | 43 | 53 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
int main() {
unsigned long long int n, k, n1;
cin >> n >> k;
n1 = n;
while (n >= 0) {
n = n - k;
}
n = llabs(n);
if (n > n1) {
cout << n1;
} else
cout << n;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
unsigned long long int n, k, n1;
cin >> n >> k;
if (n > k)
n = n % k;
cout << min(n, k - n);
return 0;
} | replace | 7 | 16 | 7 | 10 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
long N, K, cnt = 0;
cin >> N >> K;
while (N - K > 0) {
N -= K;
}
if (abs(N - K) < N) {
N = abs(N - K);
}
cout << N;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long N, K, cnt = 0;
cin >> N >> K;
cnt = N % K;
if (abs(cnt - K) < cnt) {
N = abs(cnt - K);
} else {
N = cnt;
}
cout << N;
} | replace | 6 | 11 | 6 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x, y;
ll abs2(ll f) {
if (f < 0)
return -f;
return f;
}
ll min2(ll a, ll b) {
if (a < b)
return a;
return b;
}
int main() {
cin >> x >> y;
while (x > y) {
x = x - y;
}
cout << min2(abs2(x - y), abs2(x));
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x, y;
ll abs2(ll f) {
if (f < 0)
return -f;
return f;
}
ll min2(ll a, ll b) {
if (a < b)
return a;
return b;
}
int main() {
cin >> x >> y;
if (x > y) {
x = x - (x / y) * y;
}
cout << min2(abs2(x - y), abs2(x));
} | replace | 16 | 18 | 16 | 18 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a %= b;
cout << min(a, abs(a - b));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
a %= b;
cout << min(a, abs(a - b));
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int long long a;
a = n % k;
int long long b;
b = k - a;
if (a <= b) {
cout << a << endl;
} else {
cout << b << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int long long n, k;
cin >> n >> k;
int long long a;
a = n % k;
int long long b;
b = k - a;
if (a <= b) {
cout << a << endl;
} else {
cout << b << endl;
}
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c, d = INT_MAX, e = 0;
cin >> a >> b;
cout << min(a % b, (a % b - b) * -1);
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
long long int a, b, c, d = INT_MAX, e = 0;
cin >> a >> b;
cout << min(a % b, (a % b - b) * -1);
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int x, k;
cin >> x >> k;
if (x > k) {
x = x % k;
}
if (x > k / 2) {
x = k - x;
}
cout << x << endl;
} | #include <iostream>
using namespace std;
int main() {
long x, k;
cin >> x >> k;
if (x > k) {
x = x % k;
}
if (x > k / 2) {
x = k - x;
}
cout << x << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % K < (K + 1) / 2)
cout << N % K << endl;
else
cout << K - N % K << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int long long N, K;
cin >> N >> K;
if (N % K < (K + 1) / 2)
cout << N % K << endl;
else
cout << K - N % K << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
long long int monmo(long long int n, long long int k, int keta) {
if (n == 0) {
return 0;
} else if (keta == -1) {
return n;
} else {
long long int tmpk;
tmpk = k;
for (int i = 0; i < keta; i++) {
tmpk *= 10;
}
while (n ... | #include <iostream>
#include <vector>
using namespace std;
long long int monmo(long long int n, long long int k, int keta) {
if (n == 0) {
return 0;
} else if (keta < 0) {
return n;
} else {
long long int tmpk;
tmpk = k;
for (int i = 0; i < keta; i++) {
tmpk *= 10;
}
while (n >=... | replace | 7 | 8 | 7 | 8 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long data = 0;
long long ans;
if (k == 1) {
ans = 0;
} else {
if (n > k) {
data = n % k;
ans = k - data;
} else if (n == k) {
ans = 0;
} else {
if (n == 1) {
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long data = n % k;
long long ans = min(data, k - data);
cout << ans << endl;
} | replace | 6 | 29 | 6 | 9 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll A = abs(N - K);
ll D = min(K, A);
cout << N % D << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
cout << min(N % K, K - N % K) << endl;
} | replace | 10 | 15 | 10 | 11 | 0 | |
p02719 | C++ | Runtime Error | // Author - Sumit
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define int ll
#define ps push
#define pb emplace_back
#define INF 10000000000000LL
#define MOD 1000000007
#de... | // Author - Sumit
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define ll long long
#define int ll
#define ps push
#define pb emplace_back
#define INF 10000000000000LL
#define MOD 1000000007
#de... | replace | 63 | 71 | 63 | 68 | 0 | 6.9e-05
|
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N < abs(N - K)) {
cout << N;
}
if (N % K == 0) {
cout << '0';
}
if (N % K == 1) {
cout << '1';
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M;
cin >> N >> M;
long long n = N % M;
long long ans;
ans = min(n, M - n);
cout << ans << endl;
} | replace | 3 | 14 | 3 | 9 | 0 | |
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)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
cout << min(N % K, K - (N % K)) << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
long long n, k;
cin >> n >> k;
set<long long> st;
long long n_min = n;
while (st.count(n) == 0) {
st.insert(n);
n = abs(n - k);
n_min = min(n, n_min);
}
cout << n_min << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
long long n, k;
cin >> n >> k;
n %= k;
long long a = abs(n - k);
long long ans = min(a, n);
cout << ans << endl;
} | replace | 7 | 15 | 7 | 11 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long min = n;
if (n % k == 0) {
cout << 0;
return 0;
}
while (1) {
n = abs(n - k);
if (n < min && n != 0) {
min = n;
} else {
cout << min;
return 0;
}
}
if (n != 0) {... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long min = n;
if (n > k) {
n = n % k;
}
if (n % k == 0) {
cout << 0;
return 0;
}
while (1) {
n = abs(n - k);
if (n < min && n != 0) {
min = n;
} else {
cout << min;
r... | insert | 7 | 7 | 7 | 10 | TLE | |
p02719 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << min(n % k, k - (n % k)) << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
cout << min(n % k, k - (n % k)) << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, a;
cin >> N >> K;
a = min(N % K, K - (N % K));
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, a;
cin >> N >> K;
a = min(N % K, K - (N % K));
cout << a << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n,... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n,... | replace | 22 | 27 | 22 | 25 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (n < k) {
cout << min(n, -(n - k)) << endl;
return 0;
}
long long big = n, small = n;
while (big % k != 0) {
big++;
}
while (small % k != 0) {
small--;
}
// cout << big << " & " << small <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long t = n % k;
cout << min(t, k - t) << endl;
return 0;
} | replace | 6 | 21 | 6 | 8 | TLE | |
p02719 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vector<ll>>;
using vvc = vector<vector<char>>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define a... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vector<ll>>;
using vvc = vector<vector<char>>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define a... | replace | 22 | 24 | 22 | 27 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define T long long
T Abs(T n) { return n > 0 ? n : -n; }
int main() {
T n, k;
std::cin >> n >> k;
while (1) {
if (Abs(n - k) >= n) {
std::cout << n << std::endl;
return 0;
} else if (n % k == 0) {
std::cout ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define T long long
T Abs(T n) { return n > 0 ? n : -n; }
int main() {
T n, k;
std::cin >> n >> k;
if (n > k) {
n = n % k;
}
while (1) {
if (Abs(n - k) >= n) {
std::cout << n << std::endl;
return 0;
} else ... | insert | 12 | 12 | 12 | 15 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
while (1) {
if (n <= 1000 * k)
break;
n -= 1000 * k;
}
long long int x = n;
while (1) {
if (abs(x - k) < x) {
x = abs(x - k);
// cout << x << endl;
} else
bre... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int p, q;
p = n % k;
q = k - n % k;
if (p < q)
cout << p << endl;
else
cout << q << endl;
return 0;
} | replace | 8 | 24 | 8 | 15 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long oper(long long n, long long k) { return abs(n - k); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << "\n";
else {
while (n >= 0) {
n = oper(n, k);
if (oper(n,... | #include <bits/stdc++.h>
using namespace std;
long long oper(long long n, long long k) { return abs(n - k); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << "\n";
else {
cout << min(n % k, k - (n % k)) << "\n";
}
return 0... | replace | 14 | 21 | 14 | 15 | TLE | |
p02719 | C++ | Runtime Error | #include <cmath>
#include <iostream>
typedef long long int ll;
#define fr(x, y) for (int x = 0; x < y; x++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
n = n % k;
cout << min(k - n, n);
}
| #include <cmath>
#include <iostream>
typedef long long int ll;
#define fr(x, y) for (int x = 0; x < y; x++)
#include <algorithm>
#include <vector>
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
n = n % k;
cout << min(k - n, n);
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k;
void solve() { cout << min(n % k, abs(n % k - k)) << endl; }
int main() {
cin >> n >> k;
solve();
} | #include <bits/stdc++.h>
using namespace std;
int64_t n, k;
void solve() { cout << min(n % k, abs(n % k - k)) << endl; }
int main() {
cin >> n >> k;
solve();
} | replace | 3 | 4 | 3 | 4 | 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 p = pair<int, int>;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
while (n > 0) {
n -= k;
}
if (n == 0) {
cout << 0 << endl;
} else if (n < 0) {
cout << min(abs(n), abs(n + k)) << e... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using p = pair<int, int>;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
cout << min(n % k, k - (n % k)) << endl;
return 0;
}
| replace | 10 | 18 | 10 | 12 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
for (int i = 0;; i++) {
int64_t a = max(N, K), b = min(N, K);
if (N <= a - N) {
cout << N << endl;
break;
} else {
N = a - b;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
int64_t a = N % K, b = K - a;
int64_t c = min(a, b);
cout << c << endl;
}
} | replace | 9 | 18 | 9 | 12 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
int main() {
ll N, K;
cin >> N >> K;
pi visited = {N};
ll result =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> pi;
typedef pair<int, int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
int main() {
ll N, K;
cin >> N >> K;
pi visited = {N};
ll result =... | insert | 19 | 19 | 19 | 20 | TLE | |
p02719 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, x;
cin >> n >> k;
if (n < k)
x = k % n;
else
x = n % k;
if (n != k)
cout << min(x, k - x) << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, x;
cin >> n >> k;
if (n < k)
x = n;
else
x = n % k;
if (n != k)
cout << min(x, k - x) << endl;
else
cout << 0 << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02719 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, K;
cin >> N >> K;
while (N > K) {
N -= K;
}
cout << min(N, K - N);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, K;
cin >> N >> K;
if (N > K) {
N = N - (N / K) * K;
}
cout << min(N, K - N);
} | replace | 7 | 9 | 7 | 9 | TLE | |
p02719 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (n); i++)
int main() {
long long int n, k;
cin >> n >> k;
while (n > abs(n - k)) {
if (n % k == 0)
n = 0;
n = abs(n - k);
}
cout << n;
} | #include <cmath>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (n); i++)
int main() {
long long int n, k;
cin >> n >> k;
n = min(n % k, abs(n % k - k));
cout << n;
} | replace | 7 | 12 | 7 | 8 | TLE | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int k;
long long c[13][10] = {};
cin >> k;
rep(i, 10) c[0][i] = 1;
for (int i = 0;; i++) {
for (int j = 1; j < 10; j++) {
if (k > c[i][j]) {
k -= c[i][j];
} else {
l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int k;
long long c[13][10] = {};
cin >> k;
rep(i, 10) c[0][i] = 1;
for (int i = 0;; i++) {
for (int j = 1; j < 10; j++) {
if (k > c[i][j]) {
k -= c[i][j];
} else {
l... | replace | 33 | 34 | 33 | 34 | 23 | |
p02720 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
long long lunlun_number(int k) {
int count = 0;
queue<long long> que;
for (int i = 1; i <= 9; i++) {
que.push(i);
}
long long ans;
while (count < k) {
ans = que.front();
que.pop();
count++;
// minus;
if (ans % 10 != 0) {
... | #include <iostream>
#include <queue>
using namespace std;
long long lunlun_number(int k) {
int count = 0;
queue<long long> que;
for (int i = 1; i <= 9; i++) {
que.push(i);
}
long long ans;
while (count < k) {
ans = que.front();
que.pop();
count++;
// minus;
if (ans % 10 != 0) {
... | replace | 36 | 37 | 36 | 37 | 23 | |
p02720 | C++ | Time Limit Exceeded | /* */
#include <bits/stdc++.h>
using namespace std;
using lint = int64_t;
char to_char(int n) { return n + '0'; };
int to_int(char c) { return c - '0'; };
/* */
void solve(string s, int ord, int k);
int cnt = 0;
int main() {
int k;
cin >> k;
int ord = 1;
cnt = 9;
ord = ... | /* */
#include <bits/stdc++.h>
using namespace std;
using lint = int64_t;
char to_char(int n) { return n + '0'; };
int to_int(char c) { return c - '0'; };
/* */
void solve(string s, int ord, int k);
int cnt = 0;
int main() {
int k;
cin >> k;
int ord = 1;
if (k < 10) {
... | insert | 15 | 15 | 15 | 19 | TLE | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define inf 100000000000... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define inf 100000000000... | replace | 26 | 27 | 26 | 27 | -6 | |
p02720 | C++ | Runtime Error | //
// lunlun.cpp
// learningCplusplus
//
// Created by Tran Duc Chinh on 2020/04/04.
// Copyright © 2020 Tran Duc Chinh. All rights reserved.
//
#include <iostream>
int main(int argc, const char *argv[]) {
int k;
std::cin >> k;
long long a[k];
int i = 0;
for (i = 0; i < 9; i++) {
a[i] = i + 1;
}
... | //
// lunlun.cpp
// learningCplusplus
//
// Created by Tran Duc Chinh on 2020/04/04.
// Copyright © 2020 Tran Duc Chinh. All rights reserved.
//
#include <iostream>
int main(int argc, const char *argv[]) {
int k;
std::cin >> k;
long long a[100000];
int i = 0;
for (i = 0; i < 9; i++) {
a[i] = i + 1;
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int k;
long ans;
// scanf("%d", &x);
cin >> k;
if (k <= 10) {
cout << k << endl;
return 1;
}
queue<long> que;
long i = 0;
rep(j, 9) {
que.push(i + 1);
i++;
}
... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int k;
long ans;
// scanf("%d", &x);
cin >> k;
if (k <= 10) {
cout << k << endl;
return 0;
}
queue<long> que;
long i = 0;
rep(j, 9) {
que.push(i + 1);
i++;
}
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define REP(i, n) for (int _n = n, i = 0; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
... | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define REP(i, n) for (int _n = n, i = 0; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b)... | replace | 0 | 1 | 0 | 5 | -11 | |
p02720 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | insert | 93 | 93 | 93 | 94 | TLE | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define m_k make_pair
#define P pair<int, int>
#define V vector
typedef long long LL;
typedef unsigned long long ULL;
// 补题：题解放在了怎么从第1个得到第k个
// 事实上，若a>b,则a变化得到的一定>b变化得到的
int main() {
int k;
cin >> k;
if (k <= 9) {
cout << k << endl;
return k;
}
queue<LL> ... | #include <bits/stdc++.h>
using namespace std;
#define m_k make_pair
#define P pair<int, int>
#define V vector
typedef long long LL;
typedef unsigned long long ULL;
// 补题：题解放在了怎么从第1个得到第k个
// 事实上，若a>b,则a变化得到的一定>b变化得到的
int main() {
int k;
cin >> k;
if (k <= 9) {
cout << k << endl;
return 0;
}
queue<LL> ... | replace | 15 | 16 | 15 | 16 | 0 | |
p02720 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | replace | 212 | 216 | 212 | 214 | 0 | |
p02720 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <typeinfo>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ALL(v) v.begin(), v.end()
#de... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <typeinfo>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ALL(v) v.begin(), v.end()
#de... | replace | 64 | 65 | 64 | 65 | TLE | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fin \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ii pair<int, int>
#define F fi... | #include <bits/stdc++.h>
#define fin \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ii pair<int, int>
#define F fi... | replace | 60 | 62 | 60 | 62 | 0 | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.t... | delete | 42 | 44 | 42 | 42 | 23 | |
p02720 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long LL;
int main() {
int K;
cin >> K;
vector<vector<int>> count(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long LL;
int main() {
int K;
cin >> K;
vector<vector<int>> count(... | replace | 37 | 38 | 37 | 40 | 0 | |
p02720 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using LL = long long;
class Edge {
public:
int from, to;
ll value, konzatu;
Edge(int a, int b, ll c, ll d) {
from = a;
to = b;
value = c;
... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using LL = long long;
class Edge {
public:
int from, to;
ll value, konzatu;
Edge(int a, int b, ll c, ll d) {
from = a;
to = b;
value = c;
... | replace | 62 | 63 | 62 | 63 | TLE | |
p02720 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
templa... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
templa... | insert | 50 | 50 | 50 | 51 | 0 | |
p02720 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp... | insert | 59 | 59 | 59 | 60 | TLE | |
p02720 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | delete | 48 | 52 | 48 | 48 | 0 | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace ... | insert | 25 | 25 | 25 | 27 | 0 | |
p02720 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k;
cin >> k;
vector<ll> a;
for (int i = 1; i <= 9; ++i)
a.push_back(i);
while (1) {
if (k <= a.size()) {
cout << a[k - 1] << endl;
} else {
k -= a.size();
vector<ll> old;
swap(old, a);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k;
cin >> k;
vector<ll> a;
for (int i = 1; i <= 9; ++i)
a.push_back(i);
while (1) {
if (k <= a.size()) {
cout << a[k - 1] << endl;
return 0;
} else {
k -= a.size();
vector<ll> old;
s... | insert | 13 | 13 | 13 | 14 | TLE | |
p02720 | Python | Time Limit Exceeded | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
k = int(readline())
q = [(i + 1) for i in range(9)]
if k < 10:
print(k)
cnt = 9
while q:
x = q.pop(0)
y = int(str(x)[-1])
if y != 0:
cnt += 1
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
k = int(readline())
q = [(i + 1) for i in range(9)]
if k < 10:
print(k)
exit()
cnt = 9
while q:
x = q.pop(0)
y = int(str(x)[-1])
if y != 0:
cnt +... | insert | 11 | 11 | 11 | 12 | TLE | |
p02720 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | replace | 76 | 77 | 76 | 77 | TLE | |
p02720 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k;
cin >> k;
vector<ll> a;
for (int i = 1; i <= 9; ++i)
a.push_back(i);
while (1) {
if (k <= a.size()) {
cout << a[k - 1] << endl;
}
k -= a.size();
vector<ll> old;
swap(old, a);
for (ll x :... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int k;
cin >> k;
vector<ll> a;
for (int i = 1; i <= 9; ++i)
a.push_back(i);
while (1) {
if (k <= a.size()) {
cout << a[k - 1] << endl;
return 0;
}
k -= a.size();
vector<ll> old;
swap(old, a);... | insert | 14 | 14 | 14 | 15 | TLE | |
p02720 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
bool lun(string n) {
int len = n.length();
for (int i = 1; i < len; i++) {
if (abs(n[i] - n[i - 1]) > 1)
return false;
}
return true;
}
string nxt(string n) {
int len = n.length();
for (int i = len - 2; i >= 0; i--) {
if (n[i] + 1 != n... | #include <iostream>
#include <vector>
using namespace std;
bool lun(string n) {
int len = n.length();
for (int i = 1; i < len; i++) {
if (abs(n[i] - n[i - 1]) > 1)
return false;
}
return true;
}
string nxt(string n) {
int len = n.length();
for (int i = len - 2; i >= 0; i--) {
if (n[i] + 1 != n... | replace | 42 | 44 | 42 | 46 | 0 | |
p02720 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
bool lun(string n) {
int len = n.length();
for (int i = 1; i < len; i++) {
if (abs(n[i] - n[i - 1]) > 1)
return false;
}
return true;
}
string nxt(string n) {
int len = n.length();
for (int i = len - 2; i >= 0; i--) {
if (n[i] + 1 !=... | #include <iostream>
#include <vector>
using namespace std;
bool lun(string n) {
int len = n.length();
for (int i = 1; i < len; i++) {
if (abs(n[i] - n[i - 1]) > 1)
return false;
}
return true;
}
string nxt(string n) {
int len = n.length();
for (int i = len - 2; i >= 0; i--) {
if (n[i] + 1 !=... | replace | 45 | 48 | 45 | 50 | 0 | |
p02720 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;... | replace | 63 | 64 | 63 | 64 | -11 | |
p02720 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class c, class cmp = less<c>>
using ordered_set =
tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class c, class cmp = less<c>>
using ordered_set =
tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ... | replace | 104 | 108 | 104 | 105 | TLE | |
p02720 | C++ | Runtime Error |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | replace | 82 | 83 | 82 | 83 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.