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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> v;
for (int i = 1; i < max(A / 2 + 1, B / 2 + 1); i++) {
if (A % i == 0 && B % i == 0) {
v.push_back(i);
}
}
cout << v[v.size() - K] << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> v;
for (int i = 1; i <= max(A, B); i++) {
if (A % i == 0 && B % i == 0) {
v.push_back(i);
}
}
cout << v[v.size() - K] << endl;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll cnt = 0;
for (int i = 0; i <= 1000; i++) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == c) {
cout << i << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll cnt = 0;
for (int i = 1000; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == c) {
cout << i << endl;
return 0;
}
}
return 0;
} | replace | 7 | 8 | 7 | 8 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i, n, m) for (int i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) \
REP(d, a.size()) { \
cout << a[d]; \
if (d != a.size() - 1) \
cout << " "; \
else \
cout << endl; \
}
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define pb push_back
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int c = 0;
REP(i, 101) {
if (a % i == 0 && b % i == 0) {
c++;
}
if (c == k) {
cout << i << endl;
return 0;
}
}
return 0;
}
/* --------------------------------------- */
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i, n, m) for (int i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) \
REP(d, a.size()) { \
cout << a[d]; \
if (d != a.size() - 1) \
cout << " "; \
else \
cout << endl; \
}
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define pb push_back
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, k;
cin >> a >> b >> k;
int c = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
c++;
}
if (c == k) {
cout << i << endl;
return 0;
}
}
return 0;
}
/* --------------------------------------- */
| replace | 36 | 37 | 36 | 37 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> n(100);
int C = min(A, B);
for (int i = 1; i <= C; i++) {
if (A % i == 0 && B % i == 0)
n.at(i) = i;
}
sort(n.begin(), n.end(), greater<int>());
cout << n.at(K - 1) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> n(110);
int C = min(A, B);
for (int i = 1; i <= C; i++) {
if (A % i == 0 && B % i == 0)
n.at(i) = i;
}
sort(n.begin(), n.end(), greater<int>());
cout << n.at(K - 1) << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
int gcd(int A, int B) {
if (B % A == 0) {
return A;
} else {
return gcd(A % B, B);
}
}
std::vector<int> enum_div(int n) {
std::vector<int> ret;
for (int i = 1; i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
}
}
return ret;
}
int main(int argc, char const *argv[]) {
int A, B, K;
std::cin >> A >> B >> K;
int value_max = gcd(std::min(A, B), std::max(A, B));
std::vector<int> elements = enum_div(value_max);
int ans = elements[elements.size() - K];
std::cout << ans << std::endl;
return 0;
}
| #include <iostream>
#include <vector>
int gcd(int A, int B) {
if (B % A == 0) {
return A;
} else {
return gcd(B % A, B);
}
}
std::vector<int> enum_div(int n) {
std::vector<int> ret;
for (int i = 1; i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
}
}
return ret;
}
int main(int argc, char const *argv[]) {
int A, B, K;
std::cin >> A >> B >> K;
int value_max = gcd(std::min(A, B), std::max(A, B));
std::vector<int> elements = enum_div(value_max);
int ans = elements[elements.size() - K];
std::cout << ans << std::endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int a, b, k;
Scd3(a, b, k);
int i = a * b;
while (k) {
i--;
if (a % i == 0 && b % i == 0) {
k--;
}
}
printf("%d\n", i);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &y)
#define Scll3(x, y, z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x, y) for (int x = 0; x < y; x++)
#define Repe(x, y, z) for (int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a) ? printf("Yes\n") : printf("No\n");
// }}} 2
// }}} 1
int main() {
int a, b, k;
Scd3(a, b, k);
int i = a * b + 1;
while (k) {
i--;
if (a % i == 0 && b % i == 0) {
k--;
}
}
printf("%d\n", i);
return 0;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#include <string>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> retu(100);
for (int i = 1; i < 101; i++) {
if (A % i == 0) {
if (B % i == 0) {
retu.at(i) = i;
}
}
}
sort(retu.begin(), retu.end());
reverse(retu.begin(), retu.end());
cout << retu.at(K - 1) << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#include <string>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> retu(101);
for (int i = 1; i < 101; i++) {
if (A % i == 0) {
if (B % i == 0) {
retu.at(i) = i;
}
}
}
sort(retu.begin(), retu.end());
reverse(retu.begin(), retu.end());
cout << retu.at(K - 1) << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
vector<int> cd;
for (int a = 2; a <= A; ++a) {
if (A % a == 0 && B % a == 0)
cd.push_back(a);
}
sort(cd.begin(), cd.end());
cout << cd[cd.size() - K] << "\n";
return 0;
} | #include <algorithm>
#include <chrono>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, K;
cin >> A >> B >> K;
vector<int> cd;
for (int a = 1; a <= A; ++a) {
if (A % a == 0 && B % a == 0)
cd.push_back(a);
}
sort(cd.begin(), cd.end());
cout << cd[cd.size() - K] << "\n";
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define DEBUG(x) cout << #x << ": " << x << endl
using namespace std;
int main() {
int A, B, K;
vector<int> ans;
cin >> A >> B >> K;
for (int i = 1; i < A; i++) {
if (A % i == 0 && B % i == 0)
ans.push_back(i);
}
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
cout << ans[K - 1] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define DEBUG(x) cout << #x << ": " << x << endl
using namespace std;
int main() {
int A, B, K;
vector<int> ans;
cin >> A >> B >> K;
for (int i = 1; i <= A; i++) {
if (A % i == 0 && B % i == 0)
ans.push_back(i);
}
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
cout << ans[K - 1] << endl;
return 0;
}
| replace | 33 | 34 | 33 | 34 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> v;
for (int i = 1; i < max(A, B); i++) {
if (0 == (A % i) && 0 == (B % i))
v.push_back(i);
}
// 順序反転
reverse(v.begin(), v.end());
// 出力
cout << v[K - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> v;
for (int i = 1; i <= max(A, B); i++) {
if (0 == (A % i) && 0 == (B % i))
v.push_back(i);
}
// 順序反転
reverse(v.begin(), v.end());
// 出力
cout << v[K - 1] << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int x = A;
while (A % x == 0 && B % x == 0)
x--;
int i = x, y = 1;
while (y < K) {
i--;
if (x % i == 0)
y++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int x = A;
while (A % x != 0 || B % x != 0)
x--;
int i = x, y = 1;
while (y < K) {
i--;
if (x % i == 0)
y++;
}
cout << i << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, L, ans;
cin >> A >> B >> K;
if (A > B)
L = A;
else
L = B;
vector<int> vec = {};
for (int i = 1; i <= L; i++) {
if (A % i == 0 && B % i == 0)
vec.push_back(i);
}
int size = vec.size();
ans = vec.at(size - K + 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, L, ans;
cin >> A >> B >> K;
if (A > B)
L = A;
else
L = B;
vector<int> vec = {};
for (int i = 1; i <= L; i++) {
if (A % i == 0 && B % i == 0)
vec.push_back(i);
}
int size = vec.size();
ans = vec.at(size - K);
cout << ans << endl;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> v;
for (int i = 0; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> v;
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> intersection;
int limit = max(a, b);
for (int i = 1; i < limit; i++) {
if (a % i == 0 && b % i == 0) {
intersection.push_back(i);
}
}
cout << intersection[intersection.size() - k] << "\n";
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> intersection;
int limit = max(a, b);
for (int i = 1; i <= limit; i++) {
if (a % i == 0 && b % i == 0) {
intersection.push_back(i);
}
}
cout << intersection[intersection.size() - k] << "\n";
} | replace | 13 | 14 | 13 | 14 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i >= 1; ++i) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k)
return cout << i << "\n", 0;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = 100; i >= 1; --i) {
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k)
return cout << i << "\n", 0;
}
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
k--;
int n = max(a, b);
vector<int> arr;
for (int i = 1; i < n; i++) {
if (a % i == 0 && b % i == 0)
arr.push_back(i);
}
sort(arr.rbegin(), arr.rend());
Cout(arr[k]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main() {
int a, b, k;
cin >> a >> b >> k;
k--;
int n = max(a, b);
vector<int> arr;
for (int i = 1; i <= n; i++) {
if (a % i == 0 && b % i == 0)
arr.push_back(i);
}
sort(arr.rbegin(), arr.rend());
Cout(arr[k]);
return 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p03106 | C++ | Time Limit Exceeded | // ABC120_B
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = min(A, B); i > 0; i++) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K)
cout << i << endl;
}
}
return 0;
}
| // ABC120_B
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = min(A, B); i > 0; i--) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K)
cout << i << endl;
}
}
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
ans.push_back(i);
}
}
cout << ans[ans.size() - k] << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
ans.push_back(i);
}
}
cout << ans[ans.size() - k] << endl;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p03106 | Python | Runtime Error | a, b, k = map(int, input().split())
m = 0
ans = []
if a < b:
m = b
n = a
else:
m = a
n = b
for i in range(1, m):
if n % i == 0 and m % i == 0:
ans.append(i)
if ans:
print(ans[-k])
else:
print("1")
| a, b, k = map(int, input().split())
m = 0
ans = []
if a < b:
m = b
n = a
else:
m = a
n = b
for i in range(1, n + 1):
if m % i == 0 and n % i == 0:
ans.append(i)
if ans:
print(ans[-k])
else:
print("1")
| replace | 11 | 13 | 11 | 13 | 0 | |
p03106 | Python | Runtime Error | def main():
from math import gcd
A, B, K = map(int, input().split())
g = gcd(A, B)
rt = int(pow(g, 0.5))
divisors = set()
for d in range(1, rt + 1):
if g % d == 0:
divisors.add(d)
divisors.add(g // d)
ans = sorted(divisors, reverse=True)[K - 1]
print(ans)
if __name__ == "__main__":
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| def main():
# from math import gcd
def gcd(a, b):
return a if b == 0 else gcd(b, a % b)
A, B, K = map(int, input().split())
g = gcd(A, B)
rt = int(pow(g, 0.5))
divisors = set()
for d in range(1, rt + 1):
if g % d == 0:
divisors.add(d)
divisors.add(g // d)
ans = sorted(divisors, reverse=True)[K - 1]
print(ans)
if __name__ == "__main__":
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| replace | 1 | 2 | 1 | 5 | 0 | |
p03106 | Python | Runtime Error | A, B, K = map(int, input().split())
n = max(A, B)
k = 0
if n == 1:
print("1")
else:
while k < K:
n = n - 1
if A % n == 0 and B % n == 0:
k = k + 1
print(n)
| A, B, K = map(int, input().split())
n = max(A, B)
k = 0
while True:
if A % n == 0 and B % n == 0:
k = k + 1
if k >= K:
break
n = n - 1
print(n)
| replace | 3 | 11 | 3 | 10 | 0 | |
p03106 | Python | Runtime Error | # coding:utf-8
def main():
A, B, K = map(int, input().split())
ans = []
ans.append(1)
for i in range(2, max(A, B)):
if A % i == 0 and B % i == 0:
ans.append(i)
# if len(ans) >= K:
# break
# print(ans)
print(ans[-K])
if __name__ == "__main__":
main()
| # coding:utf-8
def main():
A, B, K = map(int, input().split())
ans = []
ans.append(1)
for i in range(2, max(A, B) + 1):
if A % i == 0 and B % i == 0:
ans.append(i)
# if len(ans) >= K:
# break
# print(ans)
print(ans[-K])
if __name__ == "__main__":
main()
| replace | 7 | 8 | 7 | 8 | 0 | |
p03106 | Python | Runtime Error | a, b, k = map(int, input().split())
if a == 1 or b == 1:
print(1)
exit(0)
div = []
ans = 0
for i in range(1, max(a, b)):
if a % i == 0 and b % i == 0:
div.append(i)
div.reverse()
print(div[k - 1])
| a, b, k = map(int, input().split())
if a == 1 or b == 1:
print(1)
exit(0)
div = []
ans = 0
for i in range(1, max(a, b) + 1):
if a % i == 0 and b % i == 0:
div.append(i)
div.reverse()
print(div[k - 1])
| replace | 6 | 7 | 6 | 7 | 0 | |
p03106 | Python | Runtime Error | a, b, k = map(int, input().split())
divisers = []
for i in range(1, max(a, b)):
if a % i == 0 and b % i == 0:
divisers.append(i)
print(divisers[-k])
| a, b, k = map(int, input().split())
divisers = []
for i in range(1, min(a, b) + 1):
if a % i == 0 and b % i == 0:
divisers.append(i)
print(divisers[-k])
| replace | 3 | 4 | 3 | 4 | 0 | |
p03106 | Python | Runtime Error | a, b, k = map(int, input().split())
common_factors = []
for i in range(1, a):
if a % i == 0 and b % i == 0:
common_factors.append(i)
print(common_factors[-k])
| a, b, k = map(int, input().split())
common_factors = []
for i in range(1, a + 1):
if a % i == 0 and b % i == 0:
common_factors.append(i)
print(common_factors[-k])
| replace | 3 | 4 | 3 | 4 | 0 | |
p03106 | Python | Runtime Error | A, B, K = [int(i) for i in input().split()]
th = []
i = 1
while True:
i += 1
if (A % i, B % i) == (0, 0):
th.append(i)
if i > A or i > B:
break
print(th[len(th) - K])
| A, B, K = [int(i) for i in input().split()]
th = []
i = 0
while True:
i += 1
if (A % i, B % i) == (0, 0):
th.append(i)
if i > A or i > B:
break
print(th[len(th) - K])
| replace | 2 | 3 | 2 | 3 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main() {
int N, M, k;
cin >> N >> M >> k;
if (N <= M) {
int A = gcd(M, N);
vector<ll> B = divisor(A);
// cout << B.at(k-1) << endl ;
int C = B.size();
cout << B.at(C - k + 1) << endl;
} else {
int A = gcd(N, M);
vector<ll> B = divisor(A);
int C = B.size();
// cout << C << endl ;
cout << B.at(C - k + 1) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
sort(ret.begin(), ret.end());
return ret;
}
int main() {
int N, M, k;
cin >> N >> M >> k;
int E = max(N, M);
int F = min(N, M);
int A = gcd(E, F);
// cout << A << endl << endl ;
vector<ll> B = divisor(A);
int C = B.size();
vector<int> D(C + 1);
D.at(C) = A;
rep(i, C) D.at(i) = B.at(i);
// rep(i,C+1) cout << D.at(i) << endl ;
cout << D.at(C + 1 - k) << endl;
}
| replace | 22 | 35 | 22 | 33 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> c;
_rep(i, 1, max(a, b)) {
if (a % i == 0 && b % i == 0)
c.push_back(i);
}
print(c[c.size() - k]);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
const ll mod = 1000000007;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> c;
_rep(i, 1, max(a, b) + 1) {
if (a % i == 0 && b % i == 0)
c.push_back(i);
}
print(c[c.size() - k]);
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 1; i < max(A, B); i++) {
if (A % i == 0 && B % i == 0)
a.push_back(i);
}
sort(a.rbegin(), a.rend());
cout << a[K - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a = {1};
for (int i = 1; i <= min(A, B); i++) {
if (A % i == 0 && B % i == 0)
a.push_back(i);
}
sort(a.rbegin(), a.rend());
cout << a[K - 1];
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = a; i >= 1; i++) {
if (a % i == 0 && b % i == 0)
c--;
if (c == 0) {
cout << i;
return 0;
}
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = a; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
c--;
if (c == 0) {
cout << i;
return 0;
}
}
} | replace | 5 | 6 | 5 | 6 | TLE | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define fi first
#define se second
#define int long long
// template
// main
signed main() {
int A, B, K;
cin >> A >> B >> K;
int k = 0, ans = 0;
for (int i = 100; i > 0; i++) {
if (A % i == 0 || B % i == 0) {
k++;
if (k == K)
ans = i;
}
}
Cout(ans);
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define fi first
#define se second
#define int long long
// template
// main
signed main() {
int A, B, K;
cin >> A >> B >> K;
int k = 0, ans = 0;
for (int i = 100; i > 0; i--) {
if (A % i == 0 && B % i == 0) {
k++;
if (k == K)
ans = i;
}
}
Cout(ans);
}
| replace | 23 | 25 | 23 | 25 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1e9 + 7
#define PI 3.141592653589793238
#define pb push_back
#define ALL(V) (V).begin(), (V).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long long int lint;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<int> VI;
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { return (a % b == 0 ? b : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll char_to_ll(char c) { return (int)(c - '0'); }
ll string_to_ll(string s) { return char_to_ll(atoi(s.c_str())); }
bool is_prime(ll x) {
if (x <= 1)
return false;
for (ll i = 2; sqrt(i) <= x; i++)
if (x % i == 0)
return false;
return true;
}
int main() {
int a, b, c, k;
vector<int> ans;
cin >> a >> b >> k;
if (a >= b)
c = b;
else
c = a;
for (int i = 2; i <= c; i++) {
if (a % i == 0 && b % i == 0)
ans.push_back(i);
}
sort(ans.begin(), ans.end(), greater<int>());
if (ans.size() == 0) {
cout << 1 << endl;
} else {
cout << ans.at(k - 1) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define MOD 1e9 + 7
#define PI 3.141592653589793238
#define pb push_back
#define ALL(V) (V).begin(), (V).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long long int lint;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<int> VI;
typedef pair<ll, ll> P;
ll gcd(ll a, ll b) { return (a % b == 0 ? b : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll char_to_ll(char c) { return (int)(c - '0'); }
ll string_to_ll(string s) { return char_to_ll(atoi(s.c_str())); }
bool is_prime(ll x) {
if (x <= 1)
return false;
for (ll i = 2; sqrt(i) <= x; i++)
if (x % i == 0)
return false;
return true;
}
int main() {
int a, b, c, k;
vector<int> ans;
cin >> a >> b >> k;
for (int i = min(a, b); i >= 1; --i) {
if (a % i == 0 && b % i == 0) {
--k;
}
if (k == 0) {
cout << i << endl;
break;
}
}
return 0;
}
| replace | 33 | 46 | 33 | 41 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
typedef long long ll;
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int i = gcd(A, B);
while (count < K) {
if (A % i > 0 && B % i > 0) {
count++;
}
i--;
}
cout << i + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
typedef long long ll;
int A, B, K;
cin >> A >> B >> K;
int count = 0;
int i = gcd(A, B);
while (count < K) {
if (A % i == 0 && B % i == 0) {
count++;
}
i--;
}
cout << i + 1 << endl;
}
| replace | 15 | 16 | 15 | 16 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k, r;
cin >> a >> b >> k;
swap(a, b);
while ((r = a % b)) {
a = b;
b = r;
}
vector<int> ans;
for (int i = 1; i < b; i++) {
if (b % i == 0)
ans.push_back(i);
}
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[k - 1] << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k, r;
cin >> a >> b >> k;
swap(a, b);
while ((r = a % b)) {
a = b;
b = r;
}
vector<int> ans;
for (int i = 1; i <= b; i++) {
if (b % i == 0)
ans.push_back(i);
}
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[k - 1] << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03106 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int end = a > b ? b : a;
int count = 0;
for (int i = end; i > 0; i--) {
if (!(b % i) && !(a % i))
count++;
if (count == k)
return i;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int end = a > b ? b : a;
int count = 0;
for (int i = end; i > 0; i--) {
if (!(b % i) && !(a % i))
count++;
if (count == k) {
cout << i << endl;
return 0;
}
}
} | replace | 10 | 12 | 10 | 14 | 2 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> d;
for (int i = a; i >= 0; --i) {
if (a % i == 0 && b % i == 0) {
d.emplace_back(i);
}
}
cout << d[k - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> d;
for (int i = a; i > 0; --i) {
if (a % i == 0 && b % i == 0) {
d.emplace_back(i);
}
}
cout << d[k - 1] << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
#define range(i, n) for (i = 0; i < n; i++)
#define rrange(i, n) for (i = n - 1; i >= 0; i--)
typedef long long int ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
inline ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
int main() {
int i, k, l;
int A, K, B;
cin >> A >> B >> K;
int count = 0;
int ret = 0;
rrange(i, max(A, B)) {
if (A % i == 0 && B % i == 0) {
count++;
if (count == K) {
ret = i;
break;
}
}
}
cout << dec << ret;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
#define range(i, n) for (i = 0; i < n; i++)
#define rrange(i, n) for (i = n - 1; i >= 0; i--)
typedef long long int ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
inline ll max(ll a, ll b) {
if (a < b)
return b;
else
return a;
}
int main() {
int i, k, l;
int A, K, B;
cin >> A >> B >> K;
int count = 0;
int ret = 0;
for (i = A; i >= 0; i--) {
if (A % i == 0 && B % i == 0) {
count++;
if (count == K) {
ret = i;
break;
}
}
}
cout << dec << ret;
return 0;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int p = 0;
vector<int> com(100, 0);
for (int i = 100; i >= 1; i++) {
if (a % i == 0 && b % i == 0) {
com[p] = i;
p++;
}
}
cout << com[c - 1] << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int p = 0;
vector<int> com(100, 0);
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
com[p] = i;
p++;
}
}
cout << com[c - 1] << endl;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 0; i < min(A, B); i++)
if (A % i == 0 && B % i == 0)
a.push_back(i);
cout << a.at(a.size() - K);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> a;
for (int i = 1; i <= min(A, B); i++)
if (A % i == 0 && B % i == 0)
a.push_back(i);
cout << a.at(a.size() - K);
}
| replace | 6 | 7 | 6 | 7 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
int main(int argc, char const *argv[]) {
freopen("input.txt", "r", stdin);
int a, b, k;
cin >> a >> b >> k;
int g = gcd(a, b);
vector<int> V;
for (int i = g; i >= 1; i--) {
if (g % i == 0)
V.push_back(i);
}
printf("%d\n", V[k - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
int main(int argc, char const *argv[]) {
// freopen("input.txt" , "r" , stdin) ;
int a, b, k;
cin >> a >> b >> k;
int g = gcd(a, b);
vector<int> V;
for (int i = g; i >= 1; i--) {
if (g % i == 0)
V.push_back(i);
}
printf("%d\n", V[k - 1]);
return 0;
} | replace | 10 | 11 | 10 | 11 | -11 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = 0;
for (int i = 0; i < max(a, b); i--) {
if (a % i == 0 && b % i == 0) {
d++;
if (d == c) {
cout << i << endl;
break;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = 0;
for (int i = max(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0) {
d++;
if (d == c) {
cout << i << endl;
break;
}
}
}
} | replace | 7 | 8 | 7 | 8 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int k;
cin >> k;
int m = min(a, b);
vector<int> c(m);
for (int i = 1; i <= m; i++) {
if (a % i == 0 && b % i == 0)
c.at(i) = i;
}
for (int i = 0; i < m; i++) {
cout << c.at(i) << endl;
}
int cnt = 0;
for (int i = m - 1; i >= 0; i--) {
if (c.at(i) != 0)
cnt++;
if (cnt == k) {
cout << c.at(i) << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int k;
cin >> k;
int m = min(a, b);
vector<int> c(m);
for (int i = 1; i <= m; i++) {
if (a % i == 0 && b % i == 0)
c.at(i - 1) = i;
}
int cnt = 0;
for (int i = m - 1; i >= 0; i--) {
if (c.at(i) != 0)
cnt++;
if (cnt == k) {
cout << c.at(i) << endl;
break;
}
}
} | replace | 12 | 16 | 12 | 13 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
rep(i, 100) {
if (a % i == 0 && b % i == 0)
count++;
if (count == k) {
cout << i << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define dup(x, y) (((x) + (y)-1) / (y))
#define sz(x) (int)(x).size()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
int count = 0;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0)
count++;
if (count == k) {
cout << i << endl;
return 0;
}
}
return 0;
} | replace | 13 | 14 | 13 | 14 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[k - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
sort(ans.begin(), ans.end(), greater<int>());
cout << ans[k - 1] << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
std::vector<int> va(101, 0);
std::vector<int> vb(101, 0);
void enum_divisors(long long N, int aorb) {
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
if (aorb) {
va[i]++;
if (N / i != i)
va[N / i]++;
} else {
vb[i]++;
if (N / i != i)
vb[N / i]++;
}
}
}
return;
}
int main() {
long long a, b, k;
cin >> a >> b >> k;
enum_divisors(a, 1);
// for (int x:va) cout << x << " ";
// cout<<endl;
enum_divisors(b, 0);
// for (int x:vb) cout << x << " ";
int cnt = 0;
for (int i = 100; i >= 1; i++) {
if (va[i] > 0 && vb[i] > 0) {
cnt++;
if (cnt == k) {
cout << i << endl;
break;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
std::vector<int> va(101, 0);
std::vector<int> vb(101, 0);
void enum_divisors(long long N, int aorb) {
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
if (aorb) {
va[i]++;
if (N / i != i)
va[N / i]++;
} else {
vb[i]++;
if (N / i != i)
vb[N / i]++;
}
}
}
return;
}
int main() {
long long a, b, k;
cin >> a >> b >> k;
enum_divisors(a, 1);
// for (int x:va) cout << x << " ";
// cout<<endl;
enum_divisors(b, 0);
// for (int x:vb) cout << x << " ";
int cnt = 0;
for (int i = 100; i >= 1; i--) {
if (va[i] > 0 && vb[i] > 0) {
cnt++;
if (cnt == k) {
cout << i << endl;
break;
}
}
}
return 0;
} | replace | 32 | 33 | 32 | 33 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, k, v, c = 0;
cin >> a >> b >> k;
for (int i = a; i > 0; i++) {
if (a % i == 0 && b % i == 0)
c++;
if (c == k) {
v = i;
break;
}
}
cout << v << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, k, v, c = 0;
cin >> a >> b >> k;
for (int i = a; i > 0; i--) {
if (a % i == 0 && b % i == 0)
c++;
if (c == k) {
v = i;
break;
}
}
cout << v << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define SPACE " "
#define fpf first.first
#define fps first.second
#define spf second.first
#define sps second.second
#define all(VECTOR) (VECTOR).begin(), (VECTOR).end()
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
if (a % b == 0)
return b;
return gcd(b, a % b);
}
// 最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// 最小公倍数
int main() {
ll a, b, c;
cin >> a >> b >> c;
int cnt = 0;
int num = min(a, b);
while (true) {
num--;
if (a % num == 0 && b % num == 0)
cnt++;
if (cnt == c) {
cout << num << endl;
break;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define SPACE " "
#define fpf first.first
#define fps first.second
#define spf second.first
#define sps second.second
#define all(VECTOR) (VECTOR).begin(), (VECTOR).end()
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
if (a % b == 0)
return b;
return gcd(b, a % b);
}
// 最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// 最小公倍数
int main() {
ll a, b, c;
cin >> a >> b >> c;
int cnt = 0;
int num = min(a, b) + 1;
while (true) {
num--;
if (a % num == 0 && b % num == 0)
cnt++;
if (cnt == c) {
cout << num << endl;
break;
}
}
return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = max(A, B); i > 0; i++) {
if (A % i == 0 && B % i == 0) {
K--;
if (K == 0)
cout << i << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = max(A, B); i > 0; i--) {
if (A % i == 0 && B % i == 0) {
K--;
if (K == 0)
cout << i << endl;
}
}
} | replace | 7 | 8 | 7 | 8 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int A, B, K;
vector<int> X;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> K;
FOR(i, 1, max(A, B)) {
if (A % i == 0 && B % i == 0) {
X.push_back(i);
}
}
cout << X[X.size() - K] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int A, B, K;
vector<int> X;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B >> K;
FOR(i, 1, max(A, B) + 1) {
if (A % i == 0 && B % i == 0) {
X.push_back(i);
}
}
cout << X[X.size() - K] << endl;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
div.push_back(i);
}
}
cout << div.at(div.size() - 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> div;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
div.push_back(i);
}
}
cout << div.at(div.size() - k) << endl;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 100; i > 0; i++) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0)
k--;
if (k == 0) {
cout << i;
return 0;
}
}
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
vector<long long> v;
for (int i = 0; i <= 1000000; ++i) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
// if(v[0] == k) { cout<<k<<endl; }
// else{ cout<<v[1]<<endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
vector<long long> v;
for (int i = 1; i <= max(a, b); ++i) {
if (a % i == 0 && b % i == 0) {
v.push_back(i);
}
}
reverse(v.begin(), v.end());
cout << v[k - 1] << endl;
// if(v[0] == k) { cout<<k<<endl; }
// else{ cout<<v[1]<<endl; }
return 0;
} | replace | 6 | 7 | 6 | 7 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> vec;
for (int i = 2; i <= min(a, b); ++i)
if (a % i == 0 && b % i == 0)
vec.push_back(i);
sort(vec.begin(), vec.end(), cmp);
cout << vec[c - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<int> vec;
for (int i = 1; i <= min(a, b); ++i)
if (a % i == 0 && b % i == 0)
vec.push_back(i);
sort(vec.begin(), vec.end(), cmp);
cout << vec[c - 1] << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int i = 0; i < min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
cnt++;
if (cnt == c) {
cout << i << endl;
return 0;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int cnt = 0;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0) {
cnt++;
if (cnt == c) {
cout << i << endl;
return 0;
}
}
}
} | replace | 7 | 8 | 7 | 8 | -8 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(), greater<int>());
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define ret return
#define lb(v, n) lower_bound(v.begin(), v.end(), n)
#define ub(v, n) upper_bound(v.begin(), v.end(), n)
#define mae(v) max_element(v.begin(), v.end())
#define mie(v) min_element(v.begin(), v.end())
#define INF 0x7FFFFFFF
#define mod 1000000007
#define fir first
#define sec second
typedef long long ll;
////////////////////////////////////////////////////////////
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = max(a, b); i >= 1; i++) {
if (!(a % i) && !(b % i)) {
cnt++;
if (cnt == k)
cout << i << endl;
}
}
ret 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(), greater<int>());
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define ret return
#define lb(v, n) lower_bound(v.begin(), v.end(), n)
#define ub(v, n) upper_bound(v.begin(), v.end(), n)
#define mae(v) max_element(v.begin(), v.end())
#define mie(v) min_element(v.begin(), v.end())
#define INF 0x7FFFFFFF
#define mod 1000000007
#define fir first
#define sec second
typedef long long ll;
////////////////////////////////////////////////////////////
int main() {
int a, b, k;
cin >> a >> b >> k;
int cnt = 0;
for (int i = max(a, b); i >= 1; i--) {
if (!(a % i) && !(b % i)) {
cnt++;
if (cnt == k)
cout << i << endl;
}
}
ret 0;
} | replace | 29 | 30 | 29 | 30 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> p;
int N = max(A, B);
for (int i = 1; i < N; i++) {
if ((A % i == 0) && (B % i == 0)) {
p.push_back(i);
}
}
cout << p[p.size() - K] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> p;
int N = max(A, B);
for (int i = 1; i <= N; i++) {
if ((A % i == 0) && (B % i == 0)) {
p.push_back(i);
}
}
cout << p[p.size() - K] << endl;
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define ll long long
#define llint long long int
#define sort(s) sort(s.begin(), s.end())
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define rt0 return 0
#define INF 100000000
constexpr auto mod = 1000000007;
// 辞書順はnext_permutation( begin( v ), end( v ) );やで！
// 2のn乗を求めるよ！！！
int ni(int n) {
if (n == 0)
return 1;
int x = ni(n / 2);
x *= x;
if (n % 2 == 1)
x *= 2;
return x;
}
// フィボナッチ数列のx番目を求めるよ！
llint f(int x, vector<llint> &s) {
if (x == 0)
return 0;
if (x == 1)
return 1;
if (s[x] != 0)
return s[x];
return s[x] = f(x - 1, s) + f(x - 2, s);
}
// aとｂの最大公約数を求めるよ！
llint gcd(llint a, llint b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// mod. m での a の逆元 a^{-1} を計算するよ！
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// aCbをmod.mで割った余りを求める
ll int c(ll int a, ll int b, ll int m) {
ll int ans = 1;
for (ll int i = 0; i < b; i++) {
ans *= a - i;
ans %= m;
}
for (ll int i = 1; i <= b; i++) {
ans *= modinv(i, m);
ans %= m;
}
return ans;
}
// m進数のn桁を全列挙やで
int dfs(int m, int n, vector<int> a, vector<int> s) {
int MIN = 100000000;
stack<string> st;
st.push("");
while (!st.empty()) {
string now = st.top();
st.pop();
if (now.size() == n) {
int x[3] = {0};
int y[3] = {0};
for (int i = 0; i < n; i++) {
if (now[i] - '0' != 3) {
x[now[i] - '0'] += s[i];
y[now[i] - '0']++;
}
}
int sum = 0;
int ng = 0;
for (int i = 0; i < 3; i++) {
if (x[i] == 0)
ng = 1;
sum += abs(x[i] - a[i]);
if (y[i] > 1)
sum += 10 * (y[i] - 1);
}
if (ng == 0)
MIN = min(MIN, sum);
} else {
for (int i = m - 1; i >= 0; i--) {
string next = now + to_string(i);
st.push(next);
}
}
}
return MIN;
}
// 迷路やで
void bfs() {
int sx, sy;
int gx, gy;
int h, w;
cin >> h >> w;
cin >> sx >> sy >> gx >> gy;
sx--;
sy--;
gx--;
gy--;
whei(char) a(h, vector<char>(w));
whei(int) d(h, vector<int>(w, INF));
rep(i, 0, h) rep(j, 0, w) { cin >> a[i][j]; }
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
d[sx][sy] = 0;
queue<pair<int, int>> que;
que.push(pair<int, int>(sx, sy));
while (que.size()) {
pair<int, int> p = que.front();
que.pop();
if (p.first == gx && p.second == gy)
break;
for (int i = 0; i < 4; i++) {
int nx = p.first + dx[i];
int ny = p.second + dy[i];
if (0 <= nx && 0 <= ny && nx < h && ny < w && a[nx][ny] != '#' &&
d[nx][ny] == INF) {
que.push(pair<int, int>(nx, ny));
d[nx][ny] = d[p.first][p.second] + 1;
}
}
}
cout << d[gx][gy] << endl;
}
void press(vector<int> &v) { v.erase(unique((v).begin(), (v).end()), v.end()); }
void press(vector<char> &v) {
v.erase(unique((v).begin(), (v).end()), v.end());
}
llint min(llint a, llint b) {
if (a < b)
return a;
return b;
}
llint max(llint a, llint b) {
if (a < b)
swap(a, b);
return a;
}
llint p(int n) {
if (n == 1)
return 1;
return n * p(n - 1);
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int size(int a) { return par[root(a)]; }
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
int a, b, k;
int y = 0;
cin >> a >> b >> k;
for (int i = min(a, b); i > 0; i++) {
if (a % i == 0 && b % i == 0)
y++;
if (y == k) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define ll long long
#define llint long long int
#define sort(s) sort(s.begin(), s.end())
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define rt0 return 0
#define INF 100000000
constexpr auto mod = 1000000007;
// 辞書順はnext_permutation( begin( v ), end( v ) );やで！
// 2のn乗を求めるよ！！！
int ni(int n) {
if (n == 0)
return 1;
int x = ni(n / 2);
x *= x;
if (n % 2 == 1)
x *= 2;
return x;
}
// フィボナッチ数列のx番目を求めるよ！
llint f(int x, vector<llint> &s) {
if (x == 0)
return 0;
if (x == 1)
return 1;
if (s[x] != 0)
return s[x];
return s[x] = f(x - 1, s) + f(x - 2, s);
}
// aとｂの最大公約数を求めるよ！
llint gcd(llint a, llint b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// mod. m での a の逆元 a^{-1} を計算するよ！
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// aCbをmod.mで割った余りを求める
ll int c(ll int a, ll int b, ll int m) {
ll int ans = 1;
for (ll int i = 0; i < b; i++) {
ans *= a - i;
ans %= m;
}
for (ll int i = 1; i <= b; i++) {
ans *= modinv(i, m);
ans %= m;
}
return ans;
}
// m進数のn桁を全列挙やで
int dfs(int m, int n, vector<int> a, vector<int> s) {
int MIN = 100000000;
stack<string> st;
st.push("");
while (!st.empty()) {
string now = st.top();
st.pop();
if (now.size() == n) {
int x[3] = {0};
int y[3] = {0};
for (int i = 0; i < n; i++) {
if (now[i] - '0' != 3) {
x[now[i] - '0'] += s[i];
y[now[i] - '0']++;
}
}
int sum = 0;
int ng = 0;
for (int i = 0; i < 3; i++) {
if (x[i] == 0)
ng = 1;
sum += abs(x[i] - a[i]);
if (y[i] > 1)
sum += 10 * (y[i] - 1);
}
if (ng == 0)
MIN = min(MIN, sum);
} else {
for (int i = m - 1; i >= 0; i--) {
string next = now + to_string(i);
st.push(next);
}
}
}
return MIN;
}
// 迷路やで
void bfs() {
int sx, sy;
int gx, gy;
int h, w;
cin >> h >> w;
cin >> sx >> sy >> gx >> gy;
sx--;
sy--;
gx--;
gy--;
whei(char) a(h, vector<char>(w));
whei(int) d(h, vector<int>(w, INF));
rep(i, 0, h) rep(j, 0, w) { cin >> a[i][j]; }
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
d[sx][sy] = 0;
queue<pair<int, int>> que;
que.push(pair<int, int>(sx, sy));
while (que.size()) {
pair<int, int> p = que.front();
que.pop();
if (p.first == gx && p.second == gy)
break;
for (int i = 0; i < 4; i++) {
int nx = p.first + dx[i];
int ny = p.second + dy[i];
if (0 <= nx && 0 <= ny && nx < h && ny < w && a[nx][ny] != '#' &&
d[nx][ny] == INF) {
que.push(pair<int, int>(nx, ny));
d[nx][ny] = d[p.first][p.second] + 1;
}
}
}
cout << d[gx][gy] << endl;
}
void press(vector<int> &v) { v.erase(unique((v).begin(), (v).end()), v.end()); }
void press(vector<char> &v) {
v.erase(unique((v).begin(), (v).end()), v.end());
}
llint min(llint a, llint b) {
if (a < b)
return a;
return b;
}
llint max(llint a, llint b) {
if (a < b)
swap(a, b);
return a;
}
llint p(int n) {
if (n == 1)
return 1;
return n * p(n - 1);
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int size(int a) { return par[root(a)]; }
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
int a, b, k;
int y = 0;
cin >> a >> b >> k;
for (int i = min(a, b); i > 0; i--) {
if (a % i == 0 && b % i == 0)
y++;
if (y == k) {
cout << i << endl;
return 0;
}
}
return 0;
}
| replace | 239 | 240 | 239 | 240 | TLE | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, k;
cin >> a >> b >> k;
queue<int> d;
for (int i = min(a, b); i <= 1; i--) {
if (a % i == 0 && b % i == 0) {
d.push(i);
}
}
for (int i = 0; i < k - 1; i++) {
d.pop();
}
cout << d.front() << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, k;
cin >> a >> b >> k;
queue<int> d;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
d.push(i);
}
}
for (int i = 0; i < k - 1; i++) {
d.pop();
}
cout << d.front() << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03106 | C++ | Runtime Error |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
double myabs(double a) { return sqrt(a * a); }
int main() {
int a, b, k;
std::cin >> a >> b >> k;
std::vector<int> t;
for (int i = 1; i < a; i++) {
if (0 == a % i) {
if (0 == b % i) {
t.push_back(i);
}
}
}
std::cout << *(t.end() - k);
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
double myabs(double a) { return sqrt(a * a); }
int main() {
int a, b, k;
std::cin >> a >> b >> k;
std::vector<int> t;
for (int i = 1; i <= a; i++) {
if (0 == a % i) {
if (0 == b % i) {
t.push_back(i);
}
}
}
std::cout << *(t.end() - k);
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p03106 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int i = max(A, B);
while (K > 0) {
i--;
if (A % i == 0 && B % i == 0)
K--;
}
cout << i << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
int i = max(A, B) + 1;
while (K > 0) {
i--;
if (A % i == 0 && B % i == 0)
K--;
}
cout << i << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03106 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k, c;
cin >> a >> b >> k;
c = 0;
for (int i = 0; i < 100; i++) {
if (a % i == 0 && b % i == 0) {
c++;
if (c == k) {
cout << i << endl;
return 0;
}
}
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k, c;
cin >> a >> b >> k;
c = 0;
for (int i = 100; i > -1; i--) {
if (a % i == 0 && b % i == 0) {
c++;
if (c == k) {
cout << i << endl;
return 0;
}
}
}
return 0;
} | replace | 8 | 9 | 8 | 9 | -8 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << endl
#define MOD 1000000007
#define loop(i, start, end) for (ll i = start; i < end; i++)
#define N 100001
#define all(v) v.begin(), v.end()
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define ov(a) \
for (int i = 0; i < a.size(); i++) \
cout << a[i] << " "; \
nl
int main() {
fastio();
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int a, b, c, k = 0;
cin >> a >> b >> c;
for (int i = 101; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
k++;
if (c == k) {
cout << i;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << endl
#define MOD 1000000007
#define loop(i, start, end) for (ll i = start; i < end; i++)
#define N 100001
#define all(v) v.begin(), v.end()
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define ov(a) \
for (int i = 0; i < a.size(); i++) \
cout << a[i] << " "; \
nl
int main() {
fastio();
int a, b, c, k = 0;
cin >> a >> b >> c;
for (int i = 101; i >= 1; i--) {
if (a % i == 0 && b % i == 0)
k++;
if (c == k) {
cout << i;
return 0;
}
}
return 0;
} | delete | 29 | 33 | 29 | 29 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
int main() {
ll a, b, k;
cin >> a >> b >> k;
vll d(0);
for (int i = 100; i >= 1; i--) {
if (a % i == b % i == 0) {
d.pb(i);
}
}
COUT(d[k - 1]);
}
| #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
int main() {
ll a, b, k;
cin >> a >> b >> k;
vll d(0);
for (int i = 100; i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
d.pb(i);
}
}
COUT(d[k - 1]);
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
int ans = 0;
for (U i : text) {
ans += (i == character);
}
return ans;
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {
{0, -1},
{1, 0},
{0, 1},
{-1, 0}}; // double euclidean(position first, position second){ return
// sqrt((second.x - first.x) * (second.x - first.x) + (second.y -
// first.y) * (second.y - first.y)); }
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd_calc(T a, T b) {
if (b) {
return gcd_calc(b, a % b);
} else {
return a;
}
}
template <class T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
return gcd_calc(a, b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
inline int at(int x, int k) { return (x >> k) & 1; }
random_device rnd;
int main() {
int A, B;
cin >> A >> B;
int K;
cin >> K;
int cnt = 0;
for (int i = A; i >= 1; i++) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K) {
cout << i << endl;
return 0;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T = string, class U = char>
int character_count(T text, U character) {
int ans = 0;
for (U i : text) {
ans += (i == character);
}
return ans;
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {
{0, -1},
{1, 0},
{0, 1},
{-1, 0}}; // double euclidean(position first, position second){ return
// sqrt((second.x - first.x) * (second.x - first.x) + (second.y -
// first.y) * (second.y - first.y)); }
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
ans += to_string(*i) + " ";
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd_calc(T a, T b) {
if (b) {
return gcd_calc(b, a % b);
} else {
return a;
}
}
template <class T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
return gcd_calc(a, b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
inline int at(int x, int k) { return (x >> k) & 1; }
random_device rnd;
int main() {
int A, B;
cin >> A >> B;
int K;
cin >> K;
int cnt = 0;
for (int i = A; i >= 1; i--) {
if (A % i == 0 && B % i == 0) {
cnt++;
if (cnt == K) {
cout << i << endl;
return 0;
}
}
}
}
| replace | 118 | 119 | 118 | 119 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int d = 0;
int ans = 0;
for (int i = 0; i <= min(a, b); i++) {
if (a % i == 0 && b % i == 0) {
d++;
if (d == k) {
ans = i;
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int d = 0;
int ans = 0;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
d++;
if (d == k) {
ans = i;
}
}
}
cout << ans << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a, b, k;
vector<int> gcd;
int main() {
cin >> a >> b >> k;
for (int i = 1; i < max(a, b); i++) {
if (a % i == 0 && b % i == 0)
gcd.push_back(i);
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a, b, k;
vector<int> gcd;
int main() {
cin >> a >> b >> k;
for (int i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0)
gcd.push_back(i);
}
sort(gcd.begin(), gcd.end(), greater<int>());
cout << gcd[k - 1] << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int i;
vector<int> vec(100);
for (i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
vec.at(i) = i;
}
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
cout << vec.at(k - 1);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int i;
vector<int> vec(1000);
for (i = 1; i <= max(a, b); i++) {
if (a % i == 0 && b % i == 0) {
vec.at(i) = i;
}
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
cout << vec.at(k - 1);
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll int64_t
const long mod = 1e9 + 7;
const long LINF = 1e13;
const long LLINF = 1e18;
const long ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x; // for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
return is;
}
// 最大公約数
int gcd(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
// ユークリッドの方法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
} // gcd
// 最小公倍数
int lcm(int m, int n) { // 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
} // lcm
int main() {
long a, b, k;
cin >> a >> b >> k;
long ans = 0;
long count = 0;
vector<long> stock;
for (int i = 1; i < max(a, b); ++i) {
if (a % i == 0 && b % i == 0) {
count++;
stock.push_back(i);
}
}
ans = stock[stock.size() - k];
cout << ans;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll int64_t
const long mod = 1e9 + 7;
const long LINF = 1e13;
const long LLINF = 1e18;
const long ALPHABET = 26;
template <class T> void Swap(T &r, T &l) {
T tmp = r;
r = l;
l = tmp;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x; // for(int i=0; i<vec.size(); i++) is >> x[i]; とかでもいい
return is;
}
// 最大公約数
int gcd(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
// ユークリッドの方法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
} // gcd
// 最小公倍数
int lcm(int m, int n) { // 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
} // lcm
int main() {
long a, b, k;
cin >> a >> b >> k;
long ans = 0;
long count = 0;
vector<long> stock;
for (int i = 1; i <= max(a, b); ++i) {
if (a % i == 0 && b % i == 0) {
count++;
stock.push_back(i);
}
}
ans = stock[stock.size() - k];
cout << ans;
}
| replace | 79 | 80 | 79 | 80 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i < max(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
reverse(ans.begin(), ans.end());
cout << ans[k - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 1; i <= min(a, b); i++) {
if ((a % i == 0) && (b % i == 0)) {
ans.push_back(i);
}
}
reverse(ans.begin(), ans.end());
cout << ans[k - 1] << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, N;
cin >> A >> B >> K;
vector<int> Div(0);
for (int i = 1; i < max(A, B); i++) {
if (A % i == 0 && B % i == 0) {
Div.push_back(i);
N++;
}
}
cout << Div.at(N - K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K, N;
cin >> A >> B >> K;
vector<int> Div(0);
for (int i = 1; i <= max(A, B); i++) {
if (A % i == 0 && B % i == 0) {
Div.push_back(i);
N++;
}
}
cout << Div.at(N - K) << endl;
} | replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 32520) >= this->size() (which is 3)
|
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// define
typedef pair<int, int> pi;
#define int long long
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define vint vector<int>
#define vvint vector<vector<int>>
#define mod 100000007
#define elif else if
#define str string
signed main() {
int N, M, O, P = 0, count = 0, count2 = 0;
double d;
char c;
string S, T;
vint A(0);
cin >> N >> M >> O;
rep(1, max(N, M)) {
if (N % i == 0 && M % i == 0) {
A.pb(i);
}
}
cout << A[A.size() - O];
}
| #include <bits/stdc++.h>
using namespace std;
// define
typedef pair<int, int> pi;
#define int long long
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define vint vector<int>
#define vvint vector<vector<int>>
#define mod 100000007
#define elif else if
#define str string
signed main() {
int N, M, O, P = 0, count = 0, count2 = 0;
double d;
char c;
string S, T;
vint A(0);
cin >> N >> M >> O;
for (int i = 1; i <= max(N, M); i++) {
if (N % i == 0 && M % i == 0) {
A.pb(i);
}
}
cout << A[A.size() - O];
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p03106 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int n1 = max(n, m), count = 0;
for (int i = 0; i < n1; i++) {
if (n % i == 0 && m % i == 0)
count++;
if (count == k) {
cout << i << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int n1 = max(n, m), count = 0;
for (int i = n1; i >= 1; i--) {
if (n % i == 0 && m % i == 0)
count++;
if (count == k) {
cout << i << endl;
break;
}
}
}
| replace | 6 | 7 | 6 | 7 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int waru[100], kazu;
kazu = 0;
for (int i = min(a, b); i >= 0; i--) {
if (a % i == 0 && b % i == 0) {
kazu++;
waru[kazu] = i;
}
}
cout << waru[k] << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
int waru[100], kazu;
kazu = 0;
for (int i = min(a, b); i >= 1; i--) {
if (a % i == 0 && b % i == 0) {
kazu++;
waru[kazu] = i;
}
}
cout << waru[k] << endl;
} | replace | 9 | 10 | 9 | 10 | -8 | |
p03106 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
void _cout() { cout << "\n"; }
template <class Head, class... Tail> void _cout(Head &&head, Tail &&...tail) {
cout << head;
_cout(forward<Tail>(tail)...);
}
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
#define For(i, n) for (int i = 0; i < (n); i++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Vec2(T, n, m, xs) vector<vector<T>> xs(n, vector<T>(m))
#define Sum(a) accumulate(Range(a), 0)
#define Cusum(T, n, xs, sxs) \
vector<T> sxs(n + 1); \
For(i, n) sxs[i + 1] = sxs[i] + xs[i]
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) \
vector<T> xs(n), ys(n); \
For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) \
vector<T> xs(n), ys(n), zs(n); \
For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) \
Vec2(T, n, m, xs); \
For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) \
unordered_map<T, int> map; \
Rep(n) { \
Cin(T, x); \
map[x]++; \
}
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) \
for (const auto &e : xs) \
cout << e << " "; \
cout << "\n"
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
int main(void) {
Cin(int, a, b, k);
for (int i = 100; i > 0; i++) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
Cout(i);
return 0;
}
}
}
Cout();
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
void _cout() { cout << "\n"; }
template <class Head, class... Tail> void _cout(Head &&head, Tail &&...tail) {
cout << head;
_cout(forward<Tail>(tail)...);
}
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
#define For(i, n) for (int i = 0; i < (n); i++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Vec2(T, n, m, xs) vector<vector<T>> xs(n, vector<T>(m))
#define Sum(a) accumulate(Range(a), 0)
#define Cusum(T, n, xs, sxs) \
vector<T> sxs(n + 1); \
For(i, n) sxs[i + 1] = sxs[i] + xs[i]
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) \
vector<T> xs(n), ys(n); \
For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) \
vector<T> xs(n), ys(n), zs(n); \
For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) \
Vec2(T, n, m, xs); \
For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) \
unordered_map<T, int> map; \
Rep(n) { \
Cin(T, x); \
map[x]++; \
}
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) \
for (const auto &e : xs) \
cout << e << " "; \
cout << "\n"
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
int main(void) {
Cin(int, a, b, k);
for (int i = 100; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
k--;
if (k == 0) {
Cout(i);
return 0;
}
}
}
Cout();
} | replace | 67 | 68 | 67 | 68 | TLE | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
// 自然数nの約数列挙 O(root(N))
// 使い方
// 自然数nを渡すとvector<long long>を返す
// ソート含めると O(root(N) + N log N)
vl divisor(ll n) {
vl ret;
for (ll i = 0; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
// これ入れたらオーダーちょい上がる
sort(ret.begin(), ret.end());
return ret;
}
// ユークリッドの互除法 ラメの定理よりO(log N)
// 使い方
// 整数a,bを渡すと最小公倍数を返す
ll gcd(ll a, ll b) {
ll q = max(a, b);
ll r = min(a, b);
while (r) {
ll t = q;
q = r;
r = t % r;
}
return q;
}
int main() {
ll a, b, k;
cin >> a >> b >> k;
ll d = gcd(a, b);
vl ngo = divisor(d);
cout << ngo[ngo.size() - 1 - (k - 1)] << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll>>
using namespace std;
// 自然数nの約数列挙 O(root(N))
// 使い方
// 自然数nを渡すとvector<long long>を返す
// ソート含めると O(root(N) + N log N)
vl divisor(ll n) {
vl ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
// これ入れたらオーダーちょい上がる
sort(ret.begin(), ret.end());
return ret;
}
// ユークリッドの互除法 ラメの定理よりO(log N)
// 使い方
// 整数a,bを渡すと最小公倍数を返す
ll gcd(ll a, ll b) {
ll q = max(a, b);
ll r = min(a, b);
while (r) {
ll t = q;
q = r;
r = t % r;
}
return q;
}
int main() {
ll a, b, k;
cin >> a >> b >> k;
ll d = gcd(a, b);
vl ngo = divisor(d);
cout << ngo[ngo.size() - 1 - (k - 1)] << endl;
} | replace | 18 | 19 | 18 | 19 | -8 | |
p03106 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
vector<int> num;
for (int i = 1; i <= max(a, b); i++) {
if (i % a == 0 && i % b == 0) {
num.push_back(i);
}
}
sort(num.begin(), num.end(), greater<int>());
cout << num[k - 1] << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, k;
vector<int> num;
cin >> a >> b >> k;
for (int i = 1; i <= 100; i++) {
if (a % i == 0 && b % i == 0) {
num.push_back(i);
}
}
sort(num.begin(), num.end(), greater<int>());
cout << num[k - 1] << endl;
} | replace | 8 | 10 | 8 | 11 | TLE | |
p03106 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, count = 0, i, j;
cin >> a >> b >> k;
for (i = 100; i > 0; i++) {
if (a % i == 0 && b % i == 0) {
count++;
}
if (count == k) {
break;
}
}
cout << i << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k, count = 0, i, j;
cin >> a >> b >> k;
for (i = max({a, b}); i > 0; i -= 1) {
if (a % i == 0 && b % i == 0) {
count++;
}
if (count == k) {
break;
}
}
cout << i << endl;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p03107 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (N); i++)
#define REPP(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define VSORT(c) sort((c).begin(), (c).end())
#define SZ(x) ((int)(x).size())
using namespace std;
string redbul;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> redbul;
stack<char> rb;
ll count = 0;
char before_rb = redbul[0];
rb.push(redbul[0]);
for (int i = 1; i < redbul.length(); i++) {
if (before_rb != redbul[i]) {
count++;
rb.pop();
} else {
rb.push(redbul[i]);
}
before_rb = redbul[i];
}
cout << count * 2 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (N); i++)
#define REPP(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define VSORT(c) sort((c).begin(), (c).end())
#define SZ(x) ((int)(x).size())
using namespace std;
string redbul;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> redbul;
stack<char> rb;
ll count = 0;
char before_rb = redbul[0];
rb.push(redbul[0]);
for (int i = 1; i < redbul.length(); i++) {
if (before_rb != redbul[i]) {
count++;
rb.pop();
} else {
rb.push(redbul[i]);
}
if (rb.empty()) {
i++;
rb.push(redbul[i]);
}
before_rb = rb.top();
}
cout << count * 2 << endl;
return 0;
} | replace | 44 | 45 | 44 | 49 | 0 | |
p03107 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char a[10000];
long n = 0;
int i;
int j = 0;
int h = 0;
for (i = 0; i < 1; i++) {
scanf("%s", a);
}
// printf("%d\n", strlen(a));
for (i = 0; i < strlen(a); i++) {
// printf("%c", a[i]);
if (a[i] == '0') {
j++;
} else if (a[i] == '1') {
h++;
}
}
if (j > h) {
printf("%d", h * 2);
} else {
printf("%d", j * 2);
}
// long b[a[1]];
// long c[a[1]];
// long d[a[1]];//番目
// long *e;
// e = (long *)malloc(sizeof(long) * a[0]*a[1]);
// long *f;
// f = (long *)malloc(sizeof(long) * a[0]*a[1]);
// for(i=0;i<a[0]*a[1];i++){
// e[i]=0;
// f[i]=0;
// }
// long g[a[0]];
// for(i=0;i<a[0];i++){
// g[i]=0;
// }
// for(j=0;j<a[1];j++){
// scanf("%ld",b+j);
// scanf("%ld",c+j);
// e[(b[j]-1)*a[1]+g[b[j]-1]]=c[j];
// f[(b[j]-1)*a[1]+g[b[j]-1]]=j;
// d[j]=1;
// g[b[j]-1]++;
// for(h=0;h<g[b[j]-1];h++){
// if(e[(b[j]-1)*a[1]+h]==0){}
// else if(e[(b[j]-1)*a[1]+h]<c[j]){
// d[j]++;
// }
// else if(e[(b[j]-1)*a[1]+h]>c[j]){
// d[f[(b[j]-1)*a[1]+h]]++;
// }
// }
// }
// for(i=0;i<a[1];i++){
// printf("%06d",b[i]);
// printf("%06d\n",d[i]);
// }
// for(i=0;i<a[1]*a[0];i++){
// printf("%d,",e[i]);
// }
} | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char a[100000];
long n = 0;
int i;
int j = 0;
int h = 0;
for (i = 0; i < 1; i++) {
scanf("%s", a);
}
// printf("%d\n", strlen(a));
for (i = 0; i < strlen(a); i++) {
// printf("%c", a[i]);
if (a[i] == '0') {
j++;
} else if (a[i] == '1') {
h++;
}
}
if (j > h) {
printf("%d", h * 2);
} else {
printf("%d", j * 2);
}
// long b[a[1]];
// long c[a[1]];
// long d[a[1]];//番目
// long *e;
// e = (long *)malloc(sizeof(long) * a[0]*a[1]);
// long *f;
// f = (long *)malloc(sizeof(long) * a[0]*a[1]);
// for(i=0;i<a[0]*a[1];i++){
// e[i]=0;
// f[i]=0;
// }
// long g[a[0]];
// for(i=0;i<a[0];i++){
// g[i]=0;
// }
// for(j=0;j<a[1];j++){
// scanf("%ld",b+j);
// scanf("%ld",c+j);
// e[(b[j]-1)*a[1]+g[b[j]-1]]=c[j];
// f[(b[j]-1)*a[1]+g[b[j]-1]]=j;
// d[j]=1;
// g[b[j]-1]++;
// for(h=0;h<g[b[j]-1];h++){
// if(e[(b[j]-1)*a[1]+h]==0){}
// else if(e[(b[j]-1)*a[1]+h]<c[j]){
// d[j]++;
// }
// else if(e[(b[j]-1)*a[1]+h]>c[j]){
// d[f[(b[j]-1)*a[1]+h]]++;
// }
// }
// }
// for(i=0;i<a[1];i++){
// printf("%06d",b[i]);
// printf("%06d\n",d[i]);
// }
// for(i=0;i<a[1]*a[0];i++){
// printf("%d,",e[i]);
// }
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03107 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
#include <tgmath.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
// repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
string s;
cin >> s;
ll ans = 0;
bool jdg = true;
while (jdg) {
jdg = false;
rep(i, s.size() - 1) {
if (s[i] != s[i + 1]) {
s.erase(s.begin() + i, s.begin() + i + 2);
ans += 2;
jdg = true;
break;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
#include <tgmath.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long long)(n); i--)
// repr…「ｓからnまで」の降順の繰り返し
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
string s;
cin >> s;
ll ans = 0;
bool jdg = true;
if (s.size() == 1) {
cout << 0 << endl;
return 0;
}
while (jdg) {
jdg = false;
rep(i, s.size() - 1) {
if (s[i] != s[i + 1]) {
s.erase(s.begin() + i, s.begin() + i + 2);
ans += 2;
jdg = true;
break;
}
}
}
cout << ans << endl;
}
| insert | 27 | 27 | 27 | 32 | TLE | |
p03107 | C++ | Runtime Error | #include <stdio.h>
using namespace std;
#include <algorithm>
int main(void) {
char S[100000];
scanf("%s", S);
int count[2] = {0};
int i = 0;
while (S[i] != '\n') {
if (S[i] == '1')
count[0]++;
else
count[1]++;
i++;
}
if (count[0] > count[1]) {
printf("%d", count[1] * 2);
} else
printf("%d", count[0] * 2);
return 0;
} | #include <stdio.h>
using namespace std;
#include <algorithm>
int main(void) {
char S[100000];
scanf("%s", S);
int count[2] = {0};
int i = 0;
while (S[i] != '\0') {
if (S[i] == '1')
count[0]++;
else
count[1]++;
i++;
}
if (count[0] > count[1]) {
printf("%d", count[1] * 2);
} else
printf("%d", count[0] * 2);
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03107 | Python | Time Limit Exceeded | S = input()
cnt1 = 0
cnt2 = 0
while True:
before = S
S = before.replace("01", "", 1)
if before != S:
cnt1 += 1
else:
break
while True:
before = S
S = before.replace("10", "", 1)
if before != S:
cnt2 += 1
else:
break
print(2 * (cnt1 + cnt2))
| S = input()
print(2 * min(S.count("1"), S.count("0")))
| replace | 1 | 20 | 1 | 2 | TLE | |
p03107 | 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>;
void Main() {
vector<char> v;
string S;
cin >> S;
int N = S.size();
rep(i, N) { v.push_back(S[i]); }
int removed = 0;
int idx = 0;
int vsize = v.size();
while (idx < vsize) {
// cout << idx << ", " << v.size() << endl;
if (v[idx] != v[idx + 1]) {
v.erase(v.begin() + idx);
v.erase(v.begin() + idx);
idx = 0; // 最初からチェックし直し
removed += 2;
} else
idx++;
vsize = v.size();
}
cout << removed << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
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>;
void Main() {
vector<char> v;
string S;
cin >> S;
int N = S.size();
rep(i, N) { v.push_back(S[i]); }
int removed = 0;
int idx = 0;
int vsize = v.size();
while (idx < vsize - 1) {
// cout << idx << ", " << v.size() << endl;
if (v[idx] != v[idx + 1]) {
v.erase(v.begin() + idx);
v.erase(v.begin() + idx);
idx = 0; // 最初からチェックし直し
removed += 2;
} else
idx++;
vsize = v.size();
}
cout << removed << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p03107 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin(int &a, int b) {
if (a > b)
a = b;
}
inline void chkmax(int &a, int b) {
if (a < b)
a = b;
}
#define _ read()
int top, S[1000005];
int main() {
string s;
cin >> s;
int n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] != s[S[top]])
top--;
else
S[++top] = i;
}
cout << n - top;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
inline void chkmin(int &a, int b) {
if (a > b)
a = b;
}
inline void chkmax(int &a, int b) {
if (a < b)
a = b;
}
#define _ read()
int top, S[1000005];
int main() {
string s;
cin >> s;
int n = s.length();
for (int i = 0; i < n; i++) {
if (s[i] != s[S[top]] && top)
top--;
else
S[++top] = i;
}
cout << n - top;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p03107 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int count = 0;
string s;
cin >> n >> s;
vector<char> c(n);
for (int i = 0; i < n; i++) {
c[i] = s.at(i);
if (c[i] == '0') {
count++;
}
}
cout << 2 * min(count, n - count);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int count = 0;
string s;
cin >> s;
n = s.length();
vector<char> c(n);
for (int i = 0; i < n; i++) {
c[i] = s.at(i);
if (c[i] == '0') {
count++;
}
}
cout << 2 * min(count, n - count);
}
| replace | 6 | 7 | 6 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p03107 | C++ | Runtime Error | // https://atcoder.jp/contests/abc120/tasks/abc120_b
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
// int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int cnt = 0, pos;
bool flag = true;
string s;
cin >> s;
int i = 0;
while (i < s.size() - 1) {
// [0, 1]か[1, 0]のデータを見つけたら削除して、前に戻る
if (s[i] == '0' && s[i + 1] == '1' || s[i] == '1' && s[i + 1] == '0') {
s.erase(s.begin() + i, s.begin() + i + 2);
cnt += 2;
if (i > 0)
i--;
} else {
i++;
}
}
cout << cnt << endl;
return 0;
} | // https://atcoder.jp/contests/abc120/tasks/abc120_b
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
// int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int cnt = 0, pos;
bool flag = true;
string s;
cin >> s;
int i = 0;
while (i < s.size() - 1 && s.size() >= 2) {
// [0, 1]か[1, 0]のデータを見つけたら削除して、前に戻る
if (s[i] == '0' && s[i + 1] == '1' || s[i] == '1' && s[i + 1] == '0') {
s.erase(s.begin() + i, s.begin() + i + 2);
cnt += 2;
if (i > 0)
i--;
} else {
i++;
}
}
cout << cnt << endl;
return 0;
} | replace | 29 | 30 | 29 | 30 | -11 | |
p03107 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
string s;
cin >> s;
int cnt = 0;
bool q = true;
while (q) {
bool w = false;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] != s[i + 1]) {
s.erase(s.begin() + i, s.begin() + i + 2);
i -= 2;
cnt += 2;
w = true;
}
}
q = w;
}
cout << cnt;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int INF = 1e9 + 5;
int main() {
string s;
cin >> s;
int cnt = 0;
bool q = true;
while (q) {
bool w = false;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] != s[i + 1]) {
s.erase(s.begin() + i, s.begin() + i + 2);
i -= 2;
cnt += 2;
w = true;
}
}
if (s.size() == 0)
break;
q = w;
}
cout << cnt;
} | insert | 35 | 35 | 35 | 37 | -6 | /usr/include/c++/12/bits/basic_string.h:1221: std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::reference std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator[](size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>; reference = char&; size_type = long unsigned int]: Assertion '__pos <= size()' failed.
|
p03107 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int k = 0;
int t = 0;
int l = 0;
while (k < N) {
if ((S[k] == '0' && S[k + 1] == '1') || (S[k] == '1' && S[k + 1] == '0')) {
for (int j = k; j < N; j++) {
S[j] = S[j + 2];
}
l += 2;
k -= 1;
} else {
k += 1;
}
}
cout << l << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int k = 0;
int t = 0;
int l = 0;
while (k < N) {
if ((S[k] == '0' && S[k + 1] == '1') || (S[k] == '1' && S[k + 1] == '0')) {
S.erase(k, 2);
l += 2;
k -= 1;
} else {
k += 1;
}
}
cout << l << endl;
return 0;
}
| replace | 16 | 19 | 16 | 17 | TLE | |
p03107 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char **argv) {
int count = 0;
string s;
cin >> s;
int i = 0;
while (true) {
if (i > s.size() - 1 || s.empty()) {
break;
}
if (s[i] == '0' && s[i + 1] == '1' || s[i] == '1' && s[i + 1] == '0') {
s.erase(s.begin() + i + 1);
s.erase(s.begin() + i);
count += 2;
i = 0;
} else {
i++;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char **argv) {
int count = 0;
string s;
cin >> s;
int i = 0;
while (true) {
if (i > s.size() - 1 || s.empty()) {
break;
}
if (s[i] == '0' && s[i + 1] == '1' || s[i] == '1' && s[i + 1] == '0') {
s.erase(s.begin() + i + 1);
s.erase(s.begin() + i);
count += 2;
if (i != 0) {
i--;
}
} else {
i++;
}
}
cout << count << endl;
return 0;
} | replace | 21 | 22 | 21 | 24 | TLE | |
p03107 | C++ | Runtime Error | #include "iostream"
#include "set"
#include "vector"
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> pre(n), post(n), dond(n);
for (int i = 0; i < n; ++i)
pre[i] = i - 1, post[i] = i + 1;
int res = 0;
for (int i = 1; i < n; i++) {
if (pre[i] == -1) {
continue;
}
if (s[i] != s[pre[i]]) {
res += 2;
pre[i + 1] = pre[pre[i]];
}
}
printf("%d\n", res);
} | #include "iostream"
#include "set"
#include "vector"
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> pre(n), post(n), dond(n);
for (int i = 0; i < n; ++i)
pre[i] = i - 1, post[i] = i + 1;
int res = 0;
for (int i = 1; i < n; i++) {
if (pre[i] == -1) {
continue;
}
if (s[i] != s[pre[i]]) {
res += 2;
if (i + 1 < n)
pre[i + 1] = pre[pre[i]];
}
}
printf("%d\n", res);
} | replace | 23 | 24 | 23 | 25 | 0 | |
p03107 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
void dbg() { cerr << "\n"; }
template <typename T, typename... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); }
ll lcm(ll x, ll y) { return (x / gcd(x, y) * y); }
int main() {
// cin.tie(0); ios_base::sync_with_stdio(false);
string s;
cin >> s;
int n = sz(s);
bool nxt = true;
while (nxt) {
nxt = false;
rep(i, n - 1) {
if (s[i] == '0' && s[i + 1] == '1') {
s[i] = s[i + 1] = '9';
nxt = true;
}
if (s[i] == '1' && s[i + 1] == '0') {
s[i] = s[i + 1] = '9';
nxt = true;
}
s.erase(remove(all(s), '9'), s.end());
}
// dbg(s);
}
cout << n - sz(s) << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
void dbg() { cerr << "\n"; }
template <typename T, typename... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); }
ll lcm(ll x, ll y) { return (x / gcd(x, y) * y); }
int main() {
// cin.tie(0); ios_base::sync_with_stdio(false);
string s;
cin >> s;
int n = sz(s), one = 0, two = 0;
rep(i, n) one += s[i] == '1';
two = n - one;
cout << min(one, two) * 2 << "\n";
return 0;
}
| replace | 26 | 44 | 26 | 31 | TLE | |
p03107 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int cnt = 0, len;
string s;
cin >> s;
len = s.size();
for (int i = 0; i < len - 1; i++) {
if (s.size() == 1)
break;
if ((s[i] == '0' && s[i + 1] == '1') || (s[i] == '1' && s[i + 1] == '0')) {
cnt += 2;
s.erase(i, 2);
len = s.size();
i = -1;
}
}
cout << cnt << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int cnt = 0, len;
string s;
cin >> s;
len = s.size();
for (int i = 0; i < len - 1; i++) {
if (s.size() == 1)
break;
if ((s[i] == '0' && s[i + 1] == '1') || (s[i] == '1' && s[i + 1] == '0')) {
cnt += 2;
s.erase(i, 2);
len = s.size();
i -= 2;
}
}
cout << cnt << endl;
} | replace | 16 | 17 | 16 | 17 | TLE | |
p03107 | C++ | Runtime Error | /*
Author: Mohammad faisal
Problem: unification
Date: 06/08/2019
*/
// #include<bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
stack<char> con;
con.push(s[0]);
// cout<<"first top: "<<con.top()<<endl;
int count = 0;
int len = s.length();
for (int i = 1; i < len; i++) {
if ((con.top() == '0' && s[i] == '1') ||
(con.top() == '1' && s[i] == '0')) {
// cout<<"upper"<<endl;
count++;
con.pop();
s[i] = '2';
// i++;
} else {
// cout<<"nicheL : "<<endl;
con.push(s[i]);
}
}
// if(con.size()!=0){
// if((con.top()=='0' && s[len-1]=='1') || (con.top()=='1' && s[len]=='0')){
// count++;
// }
// }
cout << 2 * count << endl;
return 0;
}
| /*
Author: Mohammad faisal
Problem: unification
Date: 06/08/2019
*/
// #include<bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int red = 0, blue = 0;
red = count(s.begin(), s.end(), '0');
blue = count(s.begin(), s.end(), '1');
cout << min(red, blue) * 2 << endl;
// cout<<2*count<<endl;
return 0;
}
| replace | 17 | 41 | 17 | 23 | 0 | |
p03107 | Python | Time Limit Exceeded | S = input()
num = 0
while True:
p = S.find("01")
if p > -1:
S = S[:p] + S[p + 2 :]
num += 2
else:
break
while True:
p = S.find("10")
if p > -1:
S = S[:p] + S[p + 2 :]
num += 2
else:
print(num)
break
| S = input()
print(min(S.count("0"), S.count("1")) * 2)
| replace | 1 | 18 | 1 | 2 | TLE | |
p03107 | Python | Runtime Error | S = input()
S = [Si for Si in S]
i = len(S) - 2
number_of_deleted_qube = 0
while i >= 0 and len(S) >= 2:
current = S[i]
right = S[i + 1]
if current != right:
del S[i + 1]
del S[i]
number_of_deleted_qube += 2
i -= 1
print(number_of_deleted_qube)
| S = input()
S = [Si for Si in S]
i = len(S) - 2
number_of_deleted_qube = 0
while i >= 0 and len(S) >= 2:
if i >= len(S) - 1:
i -= 1
continue
current = S[i]
right = S[i + 1]
if current != right:
del S[i + 1]
del S[i]
number_of_deleted_qube += 2
i -= 1
print(number_of_deleted_qube)
| insert | 6 | 6 | 6 | 10 | 0 | |
p03107 | Python | Time Limit Exceeded | s = input()
count = 0
while s.find("01") != -1 or s.find("10") != -1:
count += 2 * s.count("01")
s = s.replace("01", "")
count += 2 * s.count("10")
s = s.replace("10", "")
print(count)
| s = input()
print(2 * min(s.count("0"), s.count("1")))
| replace | 1 | 9 | 1 | 2 | TLE | |
p03107 | Python | Runtime Error | S = list(int(input()))
a = S.count(0)
b = S.count(1)
ans = 2 * min(a, b)
print(ans)
| S = list(input())
a = S.count("0")
b = S.count("1")
ans = 2 * min(a, b)
print(ans)
| replace | 0 | 3 | 0 | 3 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03107/Python/s301284896.py", line 1, in <module>
S = list(int(input()))
TypeError: 'int' object is not iterable
|
p03107 | Python | Time Limit Exceeded | s = input()
n = len(s)
i = 0
while True:
before = len(s)
s = s.replace("01", "").replace("10", "")
after = len(s)
if before == after:
break
print(n - len(s))
| s = input()
n0 = s.count("0")
n1 = s.count("1")
print(2 * min(n0, n1))
| replace | 1 | 10 | 1 | 4 | TLE | |
p03107 | Python | Time Limit Exceeded | b = list(map(int, input()))
cnt = 0
while len(b) > 1:
if len(list(set(b))) == 1:
break
if b[0] != b[1]:
b = b[2:]
cnt += 1
continue
temp = b[:1]
b = b[1:]
b.append(*temp)
print(cnt * 2)
| s = input()
zom = min(s.count("1"), s.count("0"))
if len(set(list(s))) == 1:
zom = 0
print(zom * 2)
| replace | 0 | 13 | 0 | 5 | TLE | |
p03107 | Python | Time Limit Exceeded | def recursin_operation(S, len_init_s):
S = list(S)
N = len(S)
lst = [i for i in range(N - 1) if S[i] != S[i + 1]]
nums_of_deleted = []
if len(lst) != 0:
for i in lst:
S_next = [S[j] for j in range(len(S)) if j < i or j > i + 1]
nums_of_deleted.append(recursin_operation(S_next, len_init_s))
else:
nums_of_deleted.append(len_init_s - len(S))
return max(nums_of_deleted)
def main():
S = input()
len_init_s = len(S)
ans = recursin_operation(S, len_init_s)
print(ans)
if __name__ == "__main__":
main()
| S = input()
len_S = len(S)
zero_lst = [S[i] for i in range(len_S) if S[i] == "0"]
one_lst = [S[i] for i in range(len_S) if S[i] == "1"]
ans = min(len(zero_lst), len(one_lst)) * 2
print(ans)
| replace | 0 | 24 | 0 | 6 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.