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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02710 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
vector<int> C;
vector<vector<int>> g;
vector<int> res;
vector<int> sz;
void dfs(int a, int p) {
sz[a] = 1;
for (int i : g[a]) {
if (i != p) {
dfs(i, a);
sz[a] += sz[i];
}
}
}
int dfs2(int a, int p,... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
vector<int> C;
vector<vector<int>> g;
vector<int> res;
vector<int> sz;
void dfs(int a, int p) {
sz[a] = 1;
for (int i : g[a]) {
if (i != p) {
dfs(i, a);
sz[a] += sz[i];
}
}
}
void dfs2(int a, int p... | replace | 18 | 19 | 18 | 19 | TLE | |
p02710 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int MAXN = 100005;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
... | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int MAXN = 200005;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02710 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// using ll = int64_t;
using ll = long long;
using ull = uint64_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = double;
#define X first
#define Y second
#ifndef ONL... | #include <bits/stdc++.h>
using namespace std;
// using ll = int64_t;
using ll = long long;
using ull = uint64_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = double;
#define X first
#define Y second
#ifndef ONL... | replace | 198 | 199 | 198 | 199 | 0 | |
p02710 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
#define N 200005
#define int long long
int n, c[N], num[N], ans[N], C[N];
int tot, head[2 * N], than[2 * N], to[2 * N];
inline int read() {
int s = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-')
c = getchar(), t = -1;
if ... | #include <algorithm>
#include <cstdio>
using namespace std;
#define N 200005
#define int long long
int n, c[N], num[N], ans[N], C[N];
int tot, head[2 * N], than[2 * N], to[2 * N];
inline int read() {
int s = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-')
c = getchar(), t = -1;
if ... | replace | 35 | 36 | 35 | 36 | 0 | |
p02710 | Python | Runtime Error | import sys
from collections import defaultdict
sys.setrecursionlimit(10**5 + 5)
def dfs(v, p, ccc, links, ans):
ret_colors = defaultdict(int)
ret_count = 1
cv = ccc[v]
for u in links[v]:
if u == p:
continue
sub_colors, sub_count = dfs(u, v, ccc, links, ans)
cc = su... | import sys
from collections import defaultdict
sys.setrecursionlimit(10**6)
def dfs(v, p, ccc, links, ans):
ret_colors = defaultdict(int)
ret_count = 1
cv = ccc[v]
for u in links[v]:
if u == p:
continue
sub_colors, sub_count = dfs(u, v, ccc, links, ans)
cc = sub_co... | replace | 3 | 4 | 3 | 4 | 0 | |
p02710 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); ++i)
#define drep2(i, m, n) for (int i = int(m - 1); i >= int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
using ll = long long;
usi... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); ++i)
#define drep2(i, m, n) for (int i = int(m - 1); i >= int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
using ll = long long;
usi... | replace | 96 | 97 | 96 | 97 | TLE | |
p02710 | C++ | Runtime Error | // Coded by tzc_wk
/*
数据不清空，爆零两行泪。
多测不读完，爆零两行泪。
边界不特判，爆零两行泪。
贪心不证明，爆零两行泪。
D P 顺序错，爆零两行泪。
大小少等号，爆零两行泪。
变量不统一，爆零两行泪。
越界不判断，爆零两行泪。
调试不注释，爆零两行泪。
溢出不 l l，爆零两行泪。
忘文件操作，爆零两行泪。
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define fz(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b... | // Coded by tzc_wk
/*
数据不清空，爆零两行泪。
多测不读完，爆零两行泪。
边界不特判，爆零两行泪。
贪心不证明，爆零两行泪。
D P 顺序错，爆零两行泪。
大小少等号，爆零两行泪。
变量不统一，爆零两行泪。
越界不判断，爆零两行泪。
调试不注释，爆零两行泪。
溢出不 l l，爆零两行泪。
忘文件操作，爆零两行泪。
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define fz(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b... | replace | 80 | 85 | 80 | 85 | 0 | |
p02710 | C++ | Runtime Error | // ref. https://www.youtube.com/watch?v=HVuSp_IhNZA
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
usi... | // ref. https://www.youtube.com/watch?v=HVuSp_IhNZA
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
usi... | replace | 126 | 127 | 126 | 130 | 0 | |
p02710 | C++ | Runtime Error | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#incl... | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#incl... | replace | 68 | 70 | 68 | 70 | 0 | |
p02710 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS... | replace | 31 | 32 | 31 | 32 | 0 | |
p02710 | C++ | Runtime Error |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) \
... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) \
... | replace | 79 | 80 | 79 | 80 | 0 | |
p02710 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define int64 long long
#define pii pair<int64, int64>
#define fr first
#define s... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define int64 long long
#define pii pair<int64, int64>
#define fr first
#define s... | replace | 32 | 33 | 32 | 33 | 0 | |
p02710 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define all(x) x.begin(), x.end()
template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) {
if (x > y)
x = y;
}
template <typename T1, typename T2> inline void chkmax(T1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define all(x) x.begin(), x.end()
template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) {
if (x > y)
x = y;
}
template <typename T1, typename T2> inline void chkmax(T1... | replace | 17 | 18 | 17 | 18 | 0 | |
p02710 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct ss {
int node, nxt;
} e[600005];
inline int read() {
int re = 0, k = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
k = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
re = (re << 1) + ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct ss {
int node, nxt;
} e[600005];
inline int read() {
int re = 0, k = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
k = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
re = (re << 1) + ... | replace | 20 | 22 | 20 | 22 | 0 | |
p02710 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | replace | 52 | 53 | 52 | 56 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n) {
if (n % 10 == 7) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n) {
if (n % 10 == 7) {
cout << "Yes" << endl;
return 0;
}
n /= 10;
}
cout << "No" << endl;
} | insert | 11 | 11 | 11 | 12 | TLE | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
char n[2];
cin >> n;
if (n[0] == '7' || n[1] == '7' || n[2] == '7')
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
char n[3];
cin >> n;
if (n[0] == '7' || n[1] == '7' || n[2] == '7')
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | -6 | *** stack smashing detected ***: terminated
|
p02711 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
typed... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
typed... | insert | 31 | 31 | 31 | 32 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define in freopen("in.txt","r",stdin)
// #define out freopen("out.txt","w",stdout)
#define N 1e9 + 10;
ll n, m, i, j, k, t, l, r;
ll a, b, c, d;
char A, C, X, Y, Z;
ll ans, MAX, MIN, sum;
ll ax[2000500];
char cx[500];
ll dx[12];
ll bx[500];
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define in freopen("in.txt","r",stdin)
// #define out freopen("out.txt","w",stdout)
#define N 1e9 + 10;
ll n, m, i, j, k, t, l, r;
ll a, b, c, d;
char A, C, X, Y, Z;
ll ans, MAX, MIN, sum;
ll ax[2000500];
char cx[500];
ll dx[12];
ll bx[500];
int ma... | replace | 21 | 27 | 21 | 29 | TLE | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(1) == '7' || s.at(2) == '7' || s.at(3) == '7')
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == '7' || s.at(1) == '7' || s.at(2) == '7')
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
for (int i = 0; i < 3; i++) {
if (N.at(i) == 7) {
cout << "Yes" << endl;
break;
} else {
cout << "No" << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N[0] == '7' || N[1] == '7' || N[2] == '7') {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 5 | 12 | 5 | 11 | -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)
|
p02711 | C++ | Runtime Error | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | insert | 57 | 57 | 57 | 58 | 0 | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
#define PI 3.14159265358979323846264338327950L
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
while (n > 0) {
int digit = n % 10;
if (digit == 7) {
cout << "Yes"
<< "\n";
... | #include <bits/stdc++.h>
#include <math.h>
#define PI 3.14159265358979323846264338327950L
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
while (n > 0) {
int digit = n % 10;
if (digit == 7) {
cout << "Yes"
<< "\n";
... | insert | 20 | 20 | 20 | 21 | TLE | |
p02711 | C++ | Time Limit Exceeded | // In the name of GOD
#include <bits/stdc++.h>
#define ll long long
#define pp pair<int, int>
using namespace std;
const int N = 1e5 + 10;
string s;
int n;
void solve() {
cin >> n;
while (n > 0) {
if (n % 10 == 7) {
cout << "Yes";
return;
}
}
cout << "No";
}
int main() {
ios_base::sync_w... | // In the name of GOD
#include <bits/stdc++.h>
#define ll long long
#define pp pair<int, int>
using namespace std;
const int N = 1e5 + 10;
string s;
int n;
void solve() {
cin >> n;
while (n > 0) {
if (n % 10 == 7) {
cout << "Yes";
return;
}
n /= 10;
}
cout << "No";
}
int main() {
ios... | insert | 17 | 17 | 17 | 18 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
const ll INF = 1000000009;
void solve() {
int n;
cin >> n;
while (n) {
if (n % 10 == 7) {
cout << "Yes\n";
return;
}
}
cout << "No\n";
}
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0), cin.tie(NU... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
const ll INF = 1000000009;
void solve() {
int n;
cin >> n;
while (n) {
if (n % 10 == 7) {
cout << "Yes\n";
return;
}
n /= 10;
}
cout << "No\n";
}
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0... | insert | 14 | 14 | 14 | 15 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n;
for (int i = n; i >= 0; i = i / 10) {
if (i % 10 == 7) {
cout << "Yes" << endl;
c = 1;
break;
} else
c = 0;
}
if (c == 0)
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n;
for (int i = n; i > 0; i = i / 10) {
if (i % 10 == 7) {
cout << "Yes" << endl;
c = 1;
break;
} else
c = 0;
}
if (c == 0)
cout << "No" << endl;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define Hello \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define Hello \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | replace | 13 | 14 | 13 | 14 | 1 | |
p02711 | Python | Runtime Error | N = int(input())
str(N)
listN = sorted(N)
if listN.count("7") >= 1:
print("Yes")
else:
print("No")
| N = int(input())
listN = sorted(str(N))
if listN.count("7") >= 1:
print("Yes")
else:
print("No")
| replace | 1 | 3 | 1 | 2 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02711/Python/s383379366.py", line 3, in <module>
listN = sorted(N)
TypeError: 'int' object is not iterable
|
p02711 | Python | Runtime Error | N = input()
ans = "No"
for i in range(len(N)):
if N[i] == 7:
global ans
ans = "Yes"
break
else:
continue
print(ans)
| N = int(input())
a1 = N % 10
a2 = ((N % 100) - a1) / 10
a3 = N // 100
if a1 == 7 or a2 == 7 or a3 == 7:
print("Yes")
else:
print("No")
| replace | 0 | 10 | 0 | 8 | SyntaxError: name 'ans' is assigned to before global declaration | File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02711/Python/s548817950.py", line 5
global ans
^^^^^^^^^^
SyntaxError: name 'ans' is assigned to before global declaration
|
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[3];
int i;
for (i = 0; i < 3; i++) {
cin >> s[i];
}
for (i = 0; i < 3; i++) {
if (s[i] == '7') {
cout << "Yes" << endl;
exit(1);
}
}
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char s[3];
int i;
for (i = 0; i < 3; i++) {
cin >> s[i];
}
for (i = 0; i < 3; i++) {
if (s[i] == '7') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| replace | 13 | 14 | 13 | 14 | 1 | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
int solve() {
int d_1 = n % 10;
int d_10 = (n - d_1) % 100 / 10;
int d_100 = (n - d_1 - d_10) % 1000 / 100;
if (d_1 == 7 || d_10 == 7 || d_100 == 7)
cout << "Yes";
else
cout << "No";
}
int main() {
cin >> n;
solve();
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
void solve() {
int d_1 = n % 10;
int d_10 = (n - d_1) % 100 / 10;
int d_100 = (n - d_1 - d_10) % 1000 / 100;
if (d_1 == 7 || d_10 == 7 || d_100 == 7)
cout << "Yes";
else
cout << "No";
}
int main() {
cin >> n;
solve();
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int r;
while (n > 0) {
r = n % 10;
if (r == 7) {
break;
}
}
if (n)
cout << "Yes" << endl;
else
cout << "... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int r;
while (n > 0) {
r = n % 10;
if (r == 7) {
break;
}
n /= 10;
}
if (n)
cout << "Yes" << endl;
else
... | insert | 18 | 18 | 18 | 19 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long K, count = 0;
cin >> K;
while (K != 0) {
if (K % 10 == 7) {
cout << "Yes\n";
return 0;
}
K %= 10;
}
cout << "No\n";
} | #include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long K, count = 0;
cin >> K;
while (K != 0) {
if (K % 10 == 7) {
cout << "Yes\n";
return 0;
}
K /= 10;
}
cout << "No\n";
} | replace | 15 | 16 | 15 | 16 | TLE | |
p02711 | Python | Runtime Error | N = input()
print("Yes" if 7 in N else "No")
| N = input()
print("Yes" if "7" in N else "No")
| replace | 1 | 2 | 1 | 2 | TypeError: 'in <string>' requires string as left operand, not int | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02711/Python/s754651467.py", line 2, in <module>
print('Yes' if 7 in N else 'No')
TypeError: 'in <string>' requires string as left operand, not int
|
p02711 | C++ | Time Limit Exceeded |
// Problem : A - Lucky 7
// Contest : AtCoder Beginner Contest 162
// URL : https://atcoder.jp/contests/abc162/tasks/abc162_a
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> ... |
// Problem : A - Lucky 7
// Contest : AtCoder Beginner Contest 162
// URL : https://atcoder.jp/contests/abc162/tasks/abc162_a
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> ... | insert | 21 | 21 | 21 | 22 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i;
bool p = true;
while (p) {
if (n % 10 == 7) {
cout << "Yes";
p = false;
}
n = n / 10;
}
if (p)
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i;
bool p = true;
while (p) {
if (n % 10 == 7) {
cout << "Yes";
p = false;
}
n = n / 10;
if (n == 0)
break;
}
if (p)
cout << "No";
return 0;
} | insert | 13 | 13 | 13 | 15 | TLE | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(1) == '7' || N.at(2) == '7' || N.at(3) == '7') {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N[0] == '7' || N[1] == '7' || N[2] == '7') {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 6 | 8 | 6 | 7 | 0 | |
p02711 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
void isN(int n) {
while (n) {
if (n % 10 == 7) {
cout << "Yes\n";
return;
}
}
cout << "No\n";
return;
}
int main() {
int T;
cin >> T;
isN(T);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
void isN(int n) {
while (n) {
if (n % 10 == 7) {
cout << "Yes\n";
return;
}
n /= 10;
}
cout << "No\n";
return;
}
int main() {
int T;
cin >> T;
isN(T);
return 0;
... | insert | 12 | 12 | 12 | 13 | TLE | |
p02711 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
char n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;... | replace | 20 | 29 | 20 | 33 | -6 | *** stack smashing detected ***: terminated
|
p02711 | C++ | Time Limit Exceeded | // #include<bits/stdc++.h>
// using namespace std;
// const int N = 1000000000, MAXI = N, D = 14;
// int main() {
// freopen("output.txt", "r", stdin);
// freopen("input.txt", "w", stdout);
// srand(time(nullptr));
// int tc = 5, flag = 1;
// cout << tc << "\n";
// while (tc--)
// {
// ... | // #include<bits/stdc++.h>
// using namespace std;
// const int N = 1000000000, MAXI = N, D = 14;
// int main() {
// freopen("output.txt", "r", stdin);
// freopen("input.txt", "w", stdout);
// srand(time(nullptr));
// int tc = 5, flag = 1;
// cout << tc << "\n";
// while (tc--)
// {
// ... | insert | 79 | 79 | 79 | 80 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <sys/time.h>
#include... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <sys/time.h>
#include... | insert | 53 | 53 | 53 | 54 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, c = 0;
cin >> a;
while (a) {
if (a % 10 == 7) {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, c = 0;
cin >> a;
while (a) {
if (a % 10 == 7) {
cout << "Yes\n";
return 0;
}
a /= 10;
}
cout << "No\n";
} | insert | 11 | 11 | 11 | 12 | TLE | |
p02711 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
using ll = long long;
int main() {
string N = 0;
cin >> N;
for (int i = 0; i < 3; i++) {
if (N[i] == '7') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
retur... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
using ll = long long;
int main() {
string N;
cin >> N;
for (int i = 0; i < 3; i++) {
if (N[i] == '7') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::logic_error'
what(): basic_string: construction from null is not valid
|
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | replace | 23 | 24 | 23 | 24 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, tmp;
cin >> N;
bool flg = true;
while (N > 0) {
tmp = N % 10;
if (tmp == 7) {
cout << "Yes" << endl;
flg = false;
break;
}
}
if (flg == true) {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, tmp;
cin >> N;
bool flg = true;
while (N > 0) {
tmp = N % 10;
N /= 10;
if (tmp == 7) {
cout << "Yes" << endl;
flg = false;
break;
}
}
if (flg == true) {
cout << "No" << endl;
}
}
| insert | 10 | 10 | 10 | 11 | TLE | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(1) != '7' && N.at(2) != '7' && N.at(3) != '7')
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) != '7' && N.at(1) != '7' && N.at(2) != '7')
cout << "No" << endl;
else
cout << "Yes" << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int s;
cin >> s;
ll c = 0;
while (s > 0) {
if (s % 10 == 7) {
c = 1;
break;
}
c = c / 10;
}
if (c == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int s;
cin >> s;
ll c = 0;
while (s > 0) {
if (s % 10 == 7) {
c = 1;
break;
}
s = s / 10;
}
if (c == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | replace | 37 | 39 | 37 | 39 | -11 | |
p02711 | C++ | Time Limit Exceeded | /// Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define f0(n) for (int i = 0; i < n; i++)
#define ms(x) memset(x, 0, sizeof(x))
#define ins insert
#define ALL(v) v.begin(), v.end()
#define highest(x) numeric_limits<x>::max()
#define lowest(x) numer... | /// Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define f0(n) for (int i = 0; i < n; i++)
#define ms(x) memset(x, 0, sizeof(x))
#define ins insert
#define ALL(v) v.begin(), v.end()
#define highest(x) numeric_limits<x>::max()
#define lowest(x) numer... | insert | 45 | 45 | 45 | 46 | TLE | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
if (n.at(1) != '7' && n.at(2) != '7' && n.at(3) != '7') {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
if (n.at(1) != '7' && n.at(2) != '7' && n.at(0) != '7') {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02711 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <t... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <t... | insert | 75 | 75 | 75 | 76 | TLE | |
p02711 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define LL long long
typedef pair<int, int> pii;
template <typename T> inline void read(T &x) {
static char _c;
static bool _f;
x = 0;
_f = 0;
_c = getchar();
while (_c < '0' || '9' < _c) {
if (_c == '-')
_f = true;
_c = getchar();
}
while ... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
typedef pair<int, int> pii;
template <typename T> inline void read(T &x) {
static char _c;
static bool _f;
x = 0;
_f = 0;
_c = getchar();
while (_c < '0' || '9' < _c) {
if (_c == '-')
_f = true;
_c = getchar();
}
while ... | replace | 130 | 131 | 130 | 131 | TLE | |
p02711 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char str1[2];
cin >> str1[2];
if (str1[0] == '7' || str1[1] == '7' || str1[2] == '7')
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool ans = false;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '7') {
ans = true;
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 4 | 7 | 4 | 13 | -6 | *** stack smashing detected ***: terminated
|
p02711 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int num, check = 7, count, temp;
while (cin >> num, num >= 100 && num < 1000) {
count = 0;
while (num > 0) {
temp = num % 10;
if (temp == check) {
count++;
if (count != 0) {
cout << "Yes" << endl;
}
b... | #include <iostream>
using namespace std;
int main() {
int num, check = 7, count, temp;
while (cin >> num, num >= 100 && num < 1000) {
count = 0;
while (num > 0) {
temp = num % 10;
if (temp == check) {
count++;
if (count != 0) {
cout << "Yes" << endl;
}
b... | insert | 21 | 21 | 21 | 22 | TLE | |
p02712 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
// jika 3 dan 5 membagi == fixxbuzz
// jika dibagi 3 doang ==fizz
// jika dibagi 5 doang == buzz
// jika ttidak a =i
// pakai long long int katanya warning overflow?
long long int n, sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
if (i % 3 == 0 || i % 5 == 0... | #include <stdio.h>
int main() {
long long int max, sum = 0;
scanf("%lld", &max);
for (int i = 0; i <= max; i++) {
if (i % 3 != 0 && i % 5 != 0) {
sum = sum + i;
}
}
printf("%lld", sum);
return 0;
} | replace | 3 | 15 | 3 | 8 | TLE | |
p02712 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | replace | 35 | 40 | 35 | 41 | TLE | |
p02712 | C++ | Runtime Error | #include <cstdio>
using namespace std;
typedef long long ll;
int main() {
int n;
ll sum = 0;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
if (i % 3 != 0 && i % 5 != 0)
sum += i;
}
printf("%lld", sum);
} | #include <cstdio>
using namespace std;
typedef long long ll;
int main() {
int n;
ll sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
if (i % 3 != 0 && i % 5 != 0)
sum += i;
}
printf("%lld", sum);
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02712 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
int i;
for (i = 1; 1 <= N; i++) {
if (i % 3 != 0 && i % 5 != 0) {
ans += i;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
int i;
for (i = 1; i <= N; i++) {
if (i % 3 != 0 && i % 5 != 0) {
ans += i;
}
}
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02712 | Python | Runtime Error | N = int(input().split())
print(sum([n + 1 for n in range(N) if (n + 1) % 3 != 0 and (n + 1) % 5 != 0]))
| N = int(input())
print(sum([n + 1 for n in range(N) if (n + 1) % 3 != 0 and (n + 1) % 5 != 0]))
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02712/Python/s624885598.py", line 1, in <module>
N = int(input().split())
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'
|
p02712 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <unordered_set>
#include <utility>
#include <vector>
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define pf printf
#define ff first
#define ss second
#define sef second.first
#define ses... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <unordered_set>
#include <utility>
#include <vector>
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define pf printf
#define ff first
#define ss second
#define sef second.first
#define ses... | replace | 30 | 33 | 30 | 33 | TLE | |
p02712 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long sum = 0, s[100000];
cin >> n;
for (int i = 1; i <= n; i++) {
if (i % 3 == 0 || i % 5 == 0)
s[i] = 0;
else
s[i] = i;
}
for (int i = 1; i <= n; i++)
sum += s[i];
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, s[1000009];
long long sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i % 3 == 0 || i % 5 == 0)
s[i] = 0;
else
s[i] = i;
}
for (int i = 1; i <= n; i++)
sum += s[i];
cout << sum << endl;
}
| replace | 3 | 5 | 3 | 5 | 0 | |
p02712 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long sum(int n) { return (long)n * (n + 1) / 2; }
int main() {
int n;
scanf("%ld", &n);
printf("%ld\n", sum(n) - sum(n / 3) * 3 - sum(n / 5) * 5 + sum(n / 15) * 15);
}
| #include <bits/stdc++.h>
using namespace std;
long sum(int n) { return (long)n * (n + 1) / 2; }
int main() {
int n;
scanf("%d", &n);
printf("%ld\n", sum(n) - sum(n / 3) * 3 - sum(n / 5) * 5 + sum(n / 15) * 15);
}
| replace | 7 | 8 | 7 | 8 | -6 | *** stack smashing detected ***: terminated
|
p02712 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
scanf("%ld", N);
long ans = 0;
for (long i = 1; i <= N; i++) {
if (i % 3 != 0 && i % 5 != 0)
ans += i;
}
printf("%ld", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
scanf("%ld", &N);
long ans = 0;
for (long i = 1; i <= N; i++) {
if (i % 3 != 0 && i % 5 != 0)
ans += i;
}
printf("%ld", ans);
}
| replace | 5 | 6 | 5 | 6 | -11 | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) {
if (a < b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) {
if (a < b... | replace | 25 | 26 | 25 | 26 | 0 | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int gcd(int, int);
vector<int> waru(vector<int>);
int main() {
int K;
int sum = 0;
cin >> K;
for (int a = 1; a <= K; a++) {
for (int b = 1; b <= K; b++) {
for (int c = 1; c <= K; c++) {
sum += gcd(gcd(a, b), c);
}
}
}
cout << sum << ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int, int);
vector<int> waru(vector<int>);
int main() {
int K;
int sum = 0;
cin >> K;
for (int a = 1; a <= K; a++) {
for (int b = 1; b <= K; b++) {
for (int c = 1; c <= K; c++) {
sum += gcd(gcd(a, b), c);
}
}
}
cout << sum << ... | insert | 21 | 21 | 21 | 23 | TLE | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) {
if (!(p % q))
return q;
else
return gcd(q, p % q);
}
int main() {
int k;
cin >> k;
int sum = 0;
for (int a = 0; a < k; a++) {
for (int b = 0; b < k; b++) {
for (int c = 0; c < k; c++) {
sum += gcd(gcd(a, b), c)... | #include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) {
if (!(p % q))
return q;
else
return gcd(q, p % q);
}
int main() {
int k;
cin >> k;
int sum = 0;
for (int a = 1; a <= k; a++) {
for (int b = 1; b <= k; b++) {
for (int c = 1; c <= k; c++) {
sum += gcd(gcd(a, b),... | replace | 14 | 17 | 14 | 17 | -8 | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
int main() {
int k;
cin >> k;
int sum = 0;
rep(h, k) {
rep(i, k) {
rep(j, k) { sum += ... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
int main() {
int k;
cin >> k;
int sum = 0;
for (int h = 1; h <= k; h++) {
for (int i = 1; i ... | replace | 16 | 19 | 16 | 21 | -8 | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
int x = 0, s = 0;
for (int l = 1; l <= k; l++) {
for (int m = 1; m <= k; m++) {
for (int n = 1; n <= k; n++) {
for (int i = 1; i <= max(l, max(m, n)); i++) {
if (l % i == 0 && m % i == 0 && n % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
int x = 0, s = 0;
for (int l = 1; l <= k; l++) {
for (int m = 1; m <= k; m++) {
for (int n = 1; n <= k; n++) {
for (int i = 1; i <= min(l, min(m, n)); i++) {
if (l % i == 0 && m % i == 0 && n % i == 0) {
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
int MOD = 1000000007;
ll gcd(ll N, ll M, ll L) {
while (M != N)
if (M > N)
M = M - N;
else
N = N - M;
while (M != L)
i... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
int MOD = 1000000007;
ll gcd(ll N, ll M, ll L) {
while (M != N)
if (M > N)
M = M - N;
else
N = N - M;
while (M != L)
i... | insert | 24 | 24 | 24 | 26 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#define il inline
#define re register
#define fo(i, j, k) for (register int i = j; i <= k; i++)
#define do(i, j, k) for (register int i = j; i >= k; i--)
#define inf 0x7fffffff
typedef long lon... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#define il inline
#define re register
#define fo(i, j, k) for (register int i = j; i <= k; i++)
#define do(i, j, k) for (register int i = j; i >= k; i--)
#define inf 0x7fffffff
typedef long lon... | replace | 53 | 54 | 53 | 54 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int k, min_;
int sum = 0, mul = 1;
cin >> k;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) {
for (int l = 1; l <= k; l++) {
int i1 = i;
int j1 = j;
int l1 = l;
mul = 1;
f... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int k, min_;
int sum = 0, mul = 1;
cin >> k;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) {
for (int l = 1; l <= k; l++) {
int i1 = i;
int j1 = j;
int l1 = l;
mul = 1;
f... | replace | 25 | 26 | 25 | 27 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.141592653589793
// vector < vector<int>>a(0, vector<int>(0));二次元配列宣言
int main() {
long long int sum = 0;
int i, j, h, g;
int k;
cin >> k;
for (i = 1; i <= k; i++) {
for (j = 1; j <= k; j++) {
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.141592653589793
// vector < vector<int>>a(0, vector<int>(0));二次元配列宣言
int main() {
long long int sum = 0;
int i, j, h, g;
int k;
cin >> k;
for (i = 1; i <= k; i++) {
for (j = 1; j <= k; j++) {
... | replace | 14 | 15 | 14 | 15 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int s = 0, a, b, c;
long long sum = 0;
int gcd(int a, int b, int c) {
for (int i = a; i >= 1; i--) {
if (a % i == 0 && b % i == 0 && c % i == 0) {
s = i;
break;
}
}
return s;
}
int main() {
int k;
cin >> k;
for (a = 1; a <= k; a++) {
for ... | #include <bits/stdc++.h>
using namespace std;
int s = 0, a, b, c;
long long sum = 0;
int gcd(int a, int b, int c) {
for (int i = a; i >= 1; i--) {
if (a % i == 0 && b % i == 0 && c % i == 0) {
s = i;
break;
}
}
return s;
}
int main() {
int k;
cin >> k;
for (a = 1; a <= k; a++) {
for ... | replace | 17 | 20 | 17 | 25 | TLE | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
int a = min(x, y);
int b = 0;
for (int i = 0; i < a + 1; i++) {
if (x % i == 0 && y % i == 0) {
b = i;
}
}
return b;
}
int main() {
int K;
cin >> K;
int ans = 0;
for (int i = 0; i < K; i++) {
for (int j = 0; j < ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
int a = min(x, y);
int b = 0;
for (int i = 0; i < a; i++) {
if (x % (i + 1) == 0 && y % (i + 1) == 0) {
b = i + 1;
}
}
return b;
}
int main() {
int K;
cin >> K;
int ans = 0;
for (int i = 0; i < K; i++) {
for (int... | replace | 6 | 9 | 6 | 9 | -8 | |
p02713 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long K;
cin >> K;
long sum = 0;
for (int a = 1; a < K + 1; a++) {
for (int b = 1; b < K + 1; b++) {
for (int c = 1; c < K + 1; c++) {
int gcd = 0;
for (int i = 1; i < c + 1; i++) {
if (a % i == 0 && b % i == 0 && c % i == ... | #include <iostream>
using namespace std;
int main() {
long K;
cin >> K;
long sum = 0;
for (int a = 1; a < K + 1; a++) {
for (int b = 1; b < K + 1; b++) {
for (int c = 1; c < K + 1; c++) {
int gcd = 0;
for (int i = 1; i < a + 1 && i < b + 1 && i < c + 1; i++) {
if (a % i == 0 ... | replace | 10 | 11 | 10 | 11 | TLE | |
p02713 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int kansuu(int a, int b) {
int tempa = max(a, b);
int tempb = min(a, b);
if (tempa % tempb == 0) {
return tempb;
} else {
kansuu(tempb, tempa % tempb);
}
}
int gcd(int a, int b, int c) { return kansuu(kansuu(a, b), c); }
int main() {
int k;
cin >> k... | #include "bits/stdc++.h"
using namespace std;
int kansuu(int a, int b) {
int tempa = max(a, b);
int tempb = min(a, b);
if (tempa % tempb == 0) {
return tempb;
} else {
return kansuu(tempb, tempa % tempb);
}
}
int gcd(int a, int b, int c) { return kansuu(kansuu(a, b), c); }
int main() {
int k;
c... | replace | 9 | 10 | 9 | 10 | 0 | |
p02713 | C++ | Runtime Error | #include <iostream>
using namespace std;
int gcd2(int a, int b) {
int c, max = 0;
max = b;
if (max < a) {
max = a;
a = b;
b = max;
}
c = b % a;
if (c == 0) {
return a;
} else {
gcd2(a, c);
}
}
int gcd3(int a, int b, int c) {
int x, y;
x = gcd2(a, b);
y = gcd2(x, c);
return ... | #include <iostream>
using namespace std;
int gcd2(int a, int b) {
int c, max = 0;
max = b;
if (max < a) {
max = a;
a = b;
b = max;
}
c = b % a;
if (c == 0) {
return a;
} else {
return gcd2(a, c);
}
}
int gcd3(int a, int b, int c) {
int x, y;
x = gcd2(a, b);
y = gcd2(x, c);
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int k, min_;
int sum = 0, mul = 1;
cin >> k;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) {
for (int l = 1; l <= k; l++) {
int i1 = i;
int j1 = j;
int l1 = l;
mul = 1;
f... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int k, min_;
int sum = 0, mul = 1;
cin >> k;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) {
for (int l = 1; l <= k; l++) {
int i1 = i;
int j1 = j;
int l1 = l;
mul = 1;
f... | replace | 25 | 27 | 25 | 27 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int K;
int gcd(int a, int b, int c) {
for (int d = K; d > 0; d--) {
if (a % d == 0 and b % d == 0 and c % d == 0) {
return d;
}
}
}
int main() {
int ans = 0;
cin >> K;
for (int a = 1; a < K + 1; a++) {
for (int b = 1; b < K + 1; b++) {
... | #include <bits/stdc++.h>
using namespace std;
int K;
int gcd(int a, int b, int c) {
for (int d = c; d > 0; d--) {
if (a % d == 0 and b % d == 0 and c % d == 0) {
return d;
}
}
}
int main() {
int ans = 0;
cin >> K;
for (int a = 1; a < K + 1; a++) {
for (int b = 1; b < K + 1; b++) {
... | replace | 6 | 7 | 6 | 7 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
freopen("input.txt", "r", stdin);
int n;
cin >> n;
long long int sum = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
int temp = __gcd(i, j);
sum += __gcd(temp, k);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen ("input.txt", "r", stdin);
int n;
cin >> n;
long long int sum = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
int temp = __gcd(i, j);
sum += __gcd(temp, k);... | replace | 6 | 7 | 6 | 7 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> P;
const int INF = 100000000;
int gcd(int a, int b, int c) {
int min_num = min(a, min(b, c));
int base;
for (int i = 1; min_num + 1; i++) {
if (min_num % i ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> P;
const int INF = 100000000;
int gcd(int a, int b, int c) {
int min_num = min(a, min(b, c));
int base;
for (int i = 1; min_num + 1; i++) {
if (min_num % i ... | replace | 26 | 29 | 26 | 37 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
int gcd(int a, int b, int c) {
for (int i = std::max(a, std::max(b, c)); i > 1; i--) {
if (a % i == 0 && b % i == 0 && c % i == 0)
return i;
}
return 1;
}
int main() {
int n;
long long res = 0;
std::cin >> n;
for (int i = 1; i <= n; i++) {
for... | #include <algorithm>
#include <iostream>
int gcd(int a, int b, int c) {
for (int i = std::min(a, std::min(b, c)); i > 1; i--) {
if (a % i == 0 && b % i == 0 && c % i == 0)
return i;
}
return 1;
}
int main() {
int n;
long long res = 0;
std::cin >> n;
for (int i = 1; i <= n; i++) {
for... | replace | 5 | 6 | 5 | 6 | TLE | |
p02713 | C++ | Runtime Error | // Sum of gcd of Tuples (Easy)
#include <algorithm>
#include <complex>
#include <deque>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
using P = pa... | // Sum of gcd of Tuples (Easy)
#include <algorithm>
#include <complex>
#include <deque>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
using P = pa... | replace | 27 | 29 | 27 | 29 | -8 | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll get(ll x, ll y) {
ll res = 1ll;
while (y) {
if (y & 1) {
res = (res * x) % MOD;
}
y >>= 1;
x = (x * x) % MOD;
}
return res;
}
void solve() {
int n, k;
n = 3;
cin >> k;
vector<ll> cur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll get(ll x, ll y) {
ll res = 1ll;
while (y) {
if (y & 1) {
res = (res * x) % MOD;
}
y >>= 1;
x = (x * x) % MOD;
}
return res;
}
void solve() {
int n, k;
n = 3;
cin >> k;
vector<ll> cur... | replace | 24 | 25 | 24 | 25 | 0 | |
p02713 | C++ | Runtime Error | /* include */
#include "bits/stdc++.h"
/* namespace */
using namespace std;
/* typedef */
/* long系 */
typedef long long ll; // long long
typedef long double ld; // long double
/* vector系 */
typedef vector<int> vint; // intのvector
typedef vector<double> vdouble; // doubleのvector
typedef ve... | /* include */
#include "bits/stdc++.h"
/* namespace */
using namespace std;
/* typedef */
/* long系 */
typedef long long ll; // long long
typedef long double ld; // long double
/* vector系 */
typedef vector<int> vint; // intのvector
typedef vector<double> vdouble; // doubleのvector
typedef ve... | replace | 76 | 77 | 76 | 77 | 0 | |
p02713 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int N = 210;
int dp[N][N];
int gcd(int a, int b) {
if (dp[a][b])
return dp[a][b];
if (dp[b][a]) {
dp[a][b] = dp[b][a];
return dp[a][b];
} else {
int aaaa = gcd(b, a - a / b * b);
dp[a][b] = aaaa;
dp[b][a] = aaaa;
return aaaa;
}
}
int ... | #include <iostream>
using namespace std;
const int N = 210;
int dp[N][N];
int gcd(int a, int b) {
if (dp[a][b])
return dp[a][b];
if (dp[b][a]) {
dp[a][b] = dp[b][a];
return dp[a][b];
} else {
if (a % b == 0) {
dp[a][b] = b;
dp[b][a] = b;
return b;
} else {
int aaaa = ... | replace | 13 | 17 | 13 | 23 | -8 | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)
return q;
else
gcd(q, p % q);
}
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
for (int k = 0; k < N; k++) {
sum += gcd(gcd(i + 1, j + 1),... | #include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)
return q;
else
return gcd(q, p % q);
}
int main() {
int N;
cin >> N;
int sum = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
for (int k = 0; k < N; k++) {
sum += gcd(gcd(i + 1, ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
ll sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; i <= n; j++) {
int gcd = __gcd(i, j);
for (int k = 1; k <= n; k++) {
sum += __gc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
ll sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int gcd = __gcd(i, j);
for (int k = 1; k <= n; k++) {
sum += __gc... | replace | 11 | 12 | 11 | 12 | TLE | |
p02713 | C++ | Runtime Error | #include <iostream>
using namespace std;
int gcd(int b, int c) {
while (b % c == 0) {
int a = b % c;
b = c;
c = a;
}
return c;
}
int main() {
int n;
cin >> n;
long long int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
a... | #include <iostream>
using namespace std;
int gcd(int b, int c) {
while (b % c != 0) {
int a = b % c;
b = c;
c = a;
}
return c;
}
int main() {
int n;
cin >> n;
long long int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
a... | replace | 3 | 4 | 3 | 4 | -8 | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <stdio.h>
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define nitro ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
const int INF = 1e9 + 5;
using namespace std;
using ll = unsigned long long int;
const ll mod = 998244353;
int main() {
// your code goes ... | #include <bits/stdc++.h>
#include <stdio.h>
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define nitro ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
const int INF = 1e9 + 5;
using namespace std;
using ll = unsigned long long int;
const ll mod = 998244353;
int main() {
// your code goes ... | replace | 12 | 14 | 12 | 13 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
freopen("input.txt", "r", stdin);
// freopen("output.txt","w",stdout);
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= ... | replace | 6 | 7 | 6 | 7 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int e_gcd(int a, int b) {
if (a < b)
return e_gcd(b, a);
int r = 0;
while (r == a % b) {
a = b;
b = r;
}
return b;
}
int gcd(int a, int b, int c) { return e_gcd(e_gcd(a, b), c); }
int main() {
int k;
cin >> k;
long long sum = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
int e_gcd(int a, int b) {
if (a < b)
return e_gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int gcd(int a, int b, int c) { return e_gcd(e_gcd(a, b), c); }
int main() {
int k;
cin >> k;
long long sum = 0;
for (int i = ... | replace | 6 | 8 | 6 | 8 | TLE | |
p02713 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) < ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) < ... | delete | 31 | 33 | 31 | 31 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
while (b)
b ^= a ^= b ^= a %= b;
}
int main() {
ll n, ans = 0;
scanf("%lld", &n);
ll c[n + 1];
fill(c, c + n + 1, 0);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
c[gcd(i, j)]... | #include <algorithm>
#include <cstdio>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
while (b)
b ^= a ^= b ^= a %= b;
return a;
}
int main() {
ll n, ans = 0;
scanf("%lld", &n);
ll c[n + 1];
fill(c, c + n + 1, 0);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
... | insert | 7 | 7 | 7 | 8 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int K;
cin >> K;
int sum = 0;
for (int a = 1; a <= K; a++) {
for (int b = 1; b <= K; b++) {
for (int c = 1; c <= K; c++) {
for (int d = (max(max(a, b), c)); d >= 1; d--) {
if (a % d == 0 && b % d == 0 && c % d == 0) {
... | #include <iostream>
using namespace std;
int main() {
int K;
cin >> K;
int sum = 0;
for (int a = 1; a <= K; a++) {
for (int b = 1; b <= K; b++) {
for (int c = 1; c <= K; c++) {
for (int d = (min(min(a, b), c)); d >= 1; d--) {
if (a % d == 0 && b % d == 0 && c % d == 0) {
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
while (true) {
if (x % y == 0)
break;
x = y;
y = x % y;
}
return y;
}
int main() {
int K;
cin >> K;
int sum = 0;
int s = 0;
for (int i = 1; i <= K; i++) {
for (int j = 1; j <= K; j+... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int K;
cin >> K;
int sum = 0;
int s = 0;
for (int i = 1; i <= K; i++) {
for (int j = 1; j <= K; j++) {
for (int k = 1; k <= K; k++) {
s = gcd(i,... | replace | 3 | 13 | 3 | 8 | 0 | |
p02713 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
gcd(b, a % b);
}
int gcd3(int a, int b, int c) {
int g = gcd(a, b);
return gcd(g, c)... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int x, int y) {
if (x < y) {
swap(x, y); // 小さい方をyとする
}
int r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int gcd3(int a, int b... | replace | 8 | 15 | 8 | 19 | 0 | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define froop1(a, n) for (long long i = a; i < n; i++)
#define froop2(a, n) for (int i = a; i > n; i--)
int main() {
long long N, sum = 0;
cin >> N;
froop1(1, N + 1) {
for (int j = 1; j <= N; j++) {
for (int k = 1; k <= N; k++) {
int min = i, max = ... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a, n) for (long long i = a; i < n; i++)
#define froop2(a, n) for (int i = a; i > n; i--)
int main() {
long long N, sum = 0;
cin >> N;
froop1(1, N + 1) {
for (int j = 1; j <= N; j++) {
for (int k = 1; k <= N; k++) {
sum += gcd(i, gcd(j... | replace | 11 | 24 | 11 | 12 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int gcd(int x, int y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
int main() {
int k;
cin >> k;
int ans = 0;
for (int i = 1; i <= k; ++i) {
for (int j = 1; j <= k; ++j) {
for (int h = 1; h ... | #include <bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int gcd(int x, int y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
int main() {
int k;
cin >> k;
int ans = 0;
for (int i = 1; i <= k; ++i) {
for (int j = 1; j <= k; ++j) {
for (int h = 1; h ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int K;
int ans = 0;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 1; i < (int)(n + 1); i++)
const int INF = 1e9;
const int MOD = 1e9 + 7;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int K;
int ans = 0;
cin... | replace | 3 | 4 | 3 | 4 | -8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.