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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03261 | C++ | Runtime Error | // ↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0,... | // ↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
#define rall(n) n.rbegin(), n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
const ll SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0,... | replace | 70 | 71 | 70 | 71 | -11 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, i, j, k;
string s[12];
int main() {
cin >> n;
for (i = 0; i < n; i++)
cin >> s[i];
for (i = 1; i < n; i++) {
if (s[i][0] != s[i - 1][s[i - 1].size() - 1]) {
cout << "No";
return 0;
}
for (j = 0; j < i; j++) {
if (s[i].size() !=... | #include <bits/stdc++.h>
using namespace std;
int n, i, j, k;
string s[102];
int main() {
cin >> n;
for (i = 0; i < n; i++)
cin >> s[i];
for (i = 1; i < n; i++) {
if (s[i][0] != s[i - 1][s[i - 1].size() - 1]) {
cout << "No";
return 0;
}
for (j = 0; j < i; j++) {
if (s[i].size() !... | replace | 3 | 4 | 3 | 4 | 0 | |
p03261 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string x, y;
vector<string> buff;
cin >> a;
cin >> x;
buff.push_back(x);
for (int i = 1; i < a; i++) {
cin >> x;
if (x[0] == buff[i - 1].back()) {
for (int j = 0; j < i; j++) {
if (x =... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
string x, y;
vector<string> buff;
cin >> a;
cin >> x;
buff.push_back(x);
for (int i = 1; i < a; i++) {
cin >> x;
if (x[0] == buff[i - 1].back()) {
for (int j = 0; j < i; j++) {
if (x =... | insert | 24 | 24 | 24 | 27 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<string> w = {s};
for (int i = 0; i < n - 1; i++) {
cin >> s;
if (s.at(0) != w.at(i).at(w.at(i).size() - 1)) {
cout << "No" << endl;
return 0;
}
for (int j = 0; j < w.size(); j++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<string> w = {s};
for (int i = 0; i < n - 1; i++) {
cin >> s;
if (s.at(0) != w.at(i).at(w.at(i).size() - 1)) {
cout << "No" << endl;
return 0;
}
for (int j = 0; j < w.size(); j++... | insert | 20 | 20 | 20 | 21 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 1) >= this->size() (which is 1)
|
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string w[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (w[j] == w[i]) {
cout << "No" << endl;
return 0;
}
}
if (w[i][0] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string w[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (w[j] == w[i]) {
cout << "No" << endl;
return 0;
}
}
if (w[i][0] ... | replace | 9 | 10 | 9 | 10 | -11 | |
p03261 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
int main() {
using namespace std;
long long a = 0, b = 0, c = 0, d = 0, e = 0, min = 0, ma = 0, ans = 0,
count = 0, nagax = 0, nagay = 0, size = 0;
int once[100020] = {}, info[100020] = {};
std::string str[100], strs;
bo... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
int main() {
using namespace std;
long long a = 0, b = 0, c = 0, d = 0, e = 0, min = 0, ma = 0, ans = 0,
count = 0, nagax = 0, nagay = 0, size = 0;
int once[100020] = {}, info[100020] = {};
std::string str[150], strs;
bo... | replace | 10 | 11 | 10 | 11 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n);
rep(i, n) { cin >> a[i]; }
rep(i, n - 1) {
if (a[i][a[i].size() - 1] != a[i + 1][0]) {
cout << "No" << endl;
return 0;
}
for (int j = i + 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n);
rep(i, n) { cin >> a[i]; }
rep(i, n - 1) {
if (a[i][a[i].size() - 1] != a[i + 1][0]) {
cout << "No" << endl;
return 0;
}
for (int j = i + 1;... | replace | 14 | 15 | 14 | 15 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int N, out = 0;
cin >> N;
string siritori[150];
for (int i = 0; i < N; i++) {
cin >> siritori[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int N, out = 0;
cin >> N;
string siritori[150];
for (int i = 0; i < N; i++) {
cin >> siritori[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j... | replace | 23 | 24 | 23 | 24 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAX 10
using namespace std;
int main() {
int n;
string s[MAX];
bool t = true;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> s[i];
if (i && s[i - 1][s[i - 1].length() - 1] != s[i][0])
t = false;
for (int j = 0; j < i; j++) {
if (s[j] == s[i])
... | #include <bits/stdc++.h>
#define MAX 105
using namespace std;
int main() {
int n;
string s[MAX];
bool t = true;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> s[i];
if (i && s[i - 1][s[i - 1].length() - 1] != s[i][0])
t = false;
for (int j = 0; j < i; j++) {
if (s[j] == s[i])
... | replace | 1 | 2 | 1 | 2 | 0 | |
p03261 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
vector<string> shiritori;
string buf;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> buf;
shiritori.push_back(buf);
}
for (int i = 0; i < N; i++) {
for (int j = N; j > i; ... | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
vector<string> shiritori;
string buf;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> buf;
shiritori.push_back(buf);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < i; ... | replace | 15 | 16 | 15 | 16 | 0 | |
p03261 | C++ | Runtime Error | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | replace | 116 | 121 | 116 | 122 | -11 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> W(n);
copy_n(istream_iterator<string>(cin), n, W.begin());
for (int i = 0; i < n - 1; i++) {
if (W[i][W[i].size() - 1] != W[i + 1][0]) {
return puts("No");
}
}
sort(W.begin(), W.end());
puts(uniqu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> W(n);
copy_n(istream_iterator<string>(cin), n, W.begin());
for (int i = 0; i < n - 1; i++) {
if (W[i][W[i].size() - 1] != W[i + 1][0]) {
puts("No");
return 0;
}
}
sort(W.begin(), W.end());
p... | replace | 11 | 12 | 11 | 13 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
int a, b;
map<string, int> mp;
string s[100];
int main() {
int n;
cin >> n;
rep(i, 1, n) {
cin >> s[i];
if (mp.count(s[i])) {
cout << "No";
return 0;
}
int sz = s[i - 1].size();
if (i > ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
int a, b;
map<string, int> mp;
string s[105];
int main() {
int n;
cin >> n;
rep(i, 1, n) {
cin >> s[i];
if (mp.count(s[i])) {
cout << "No";
return 0;
}
int sz = s[i - 1].size();
if (i > ... | replace | 5 | 6 | 5 | 6 | 0 | |
p03261 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 0, same = 0;
string s;
vector<string> w;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
w.push_back(s);
}
for (int i = 0; i < n; i++) {
if (w[i].back() == w[i + 1].front() && i != (n - 1))... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 0, same = 0;
string s;
vector<string> w;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
w.push_back(s);
}
for (int i = 0; i < (n - 1); i++) {
if (w[i].back() == w[i + 1].front())
ans... | replace | 13 | 15 | 13 | 15 | -11 | |
p03261 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a = 1;
string w[10] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < n - 1; i++) {
if (w[i][w[i].size() - 1] != w[i + 1][0])
a = 0;
}
// cout<<a<<endl;
for (int i = 0; i < n; i++) {
for ... | #include <iostream>
using namespace std;
int main() {
int n, a = 1;
string w[100] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < n - 1; i++) {
if (w[i][w[i].size() - 1] != w[i + 1][0])
a = 0;
}
// cout<<a<<endl;
for (int i = 0; i < n; i++) {
for... | replace | 6 | 7 | 6 | 7 | 0 | |
p03261 | C++ | Runtime Error | #include <iostream>
#include <string.h>
char c[10], d[10];
std::string b[100];
int a, e, f = 0;
int main() {
std::cin >> a;
for (int i = 1; i <= a; i++) {
std::cin >> c;
if (i > 1) {
if (c[0] != d[e - 1]) {
f = 1;
}
}
strcpy(d, c);
e = strlen(d);
b[i] = std::string(d);
... | #include <iostream>
#include <string.h>
char c[20], d[20];
std::string b[110];
int a, e, f = 0;
int main() {
std::cin >> a;
for (int i = 1; i <= a; i++) {
std::cin >> c;
if (i > 1) {
if (c[0] != d[e - 1]) {
f = 1;
}
}
strcpy(d, c);
e = strlen(d);
b[i] = std::string(d);
... | replace | 2 | 4 | 2 | 4 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int n;
cin >> n;
vector<string> w(n);
rep(i, n) { cin >> w.at(i); }
bool flag = true;
rep(i, n) {
rep(j, n) {
if (i == j)
continue;
else {
if (w.at(i) == w.at(j)) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int n;
cin >> n;
vector<string> w(n);
rep(i, n) { cin >> w.at(i); }
bool flag = true;
rep(i, n) {
rep(j, n) {
if (i == j)
continue;
else {
if (w.at(i) == w.at(j)) {
... | replace | 23 | 34 | 23 | 31 | 1 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | replace | 206 | 209 | 206 | 207 | -11 | |
p03261 | C++ | Runtime Error | #include <iostream>
#include <list>
#include <string>
using namespace std;
int main() {
int n, flg;
cin >> n;
flg = 0;
string w[10];
for (int i = 0; i < n; i++) {
cin >> w[i];
} /*
for(int i=0;i<n;i++){
cout<<w[i]<<"\n";
}
*/
for (int i = 0; i < n; i++) {
for (int j = 0; j < i;... | #include <iostream>
#include <list>
#include <string>
using namespace std;
int main() {
int n, flg;
cin >> n;
flg = 0;
string w[100];
for (int i = 0; i < n; i++) {
cin >> w[i];
} /*
for(int i=0;i<n;i++){
cout<<w[i]<<"\n";
}
*/
for (int i = 0; i < n; i++) {
for (int j = 0; j < i... | replace | 10 | 11 | 10 | 11 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> W(N);
for (int i = 0; i < N; i++)
cin >> W.at(i);
set<string> S;
S.insert(W.at(0));
bool ans = true;
for (int i = 1; i < N; i++) {
if (S.count(W.at(i))) {
ans = false;
break;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> W(N);
for (int i = 0; i < N; i++)
cin >> W.at(i);
set<string> S;
S.insert(W.at(0));
bool ans = true;
for (int i = 1; i < N; i++) {
if (S.count(W.at(i))) {
ans = false;
break;
} else {
... | replace | 16 | 17 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 4) >= this->size() (which is 4)
|
p03261 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <utility>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char str[1005] = {};
int n;
char *begin[105] = {};
begin[0] = &str[0];
int poi = 0;
... | #include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <utility>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char str[1500] = {};
int n;
char *begin[105] = {};
begin[0] = &str[0];
int poi = 0;
... | replace | 13 | 14 | 13 | 14 | 0 | |
p03261 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, flag = 0;
cin >> a;
vector<string> b(a);
for (int i = 0; i < a; i++)
cin >> b.at(i);
for (int i = 0; i < a - 1; i++) {
for (int j = i + 1; j < a; j++) {
if (b.at(i) == b.at(j))
flag = 1;
}
}
for (int i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, flag = 0;
cin >> a;
vector<string> b(a);
for (int i = 0; i < a; i++)
cin >> b.at(i);
for (int i = 0; i < a - 1; i++) {
for (int j = i + 1; j < a; j++) {
if (b.at(i) == b.at(j))
flag = 1;
}
}
for (int i... | replace | 19 | 20 | 19 | 20 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 4) >= this->size() (which is 4)
|
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
bool s = true;
string a[100];
set<string> b;
for (i = 0; i < n; i++) {
cin >> a[i];
b.insert(a[i]);
}
for (i = 0; i < n - 1; i++) {
if (a[i].at(a[i].size() - 1) != a[i + 1].at(0)) {
s = false;
}
}
cout << (b.siz... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
bool s = true;
string a[100];
set<string> b;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b.insert(a[i]);
}
for (i = 0; i < n - 1; i++) {
if (a[i].at(a[i].size() - 1) != a[i + 1].at(0)) {
s = false;
}
}
co... | insert | 7 | 7 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03261 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (ll i = 0; i < rept; i++)
typedef long long ll;
const ll MO... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, rept) for (ll i = 0; i < rept; i++)
typedef long long ll;
const ll MO... | replace | 46 | 48 | 46 | 48 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | replace | 20 | 21 | 20 | 21 | -11 | |
p03261 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x,... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x,... | replace | 20 | 21 | 20 | 21 | -11 | |
p03261 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> w(n);
rep(i, n) cin >> w[i];
rep(i, n - 1) {
if (w[i][w[i]... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> w(n);
rep(i, n) cin >> w[i];
rep(i, n - 1) {
if (w[i][w[i]... | replace | 21 | 22 | 21 | 22 | 0 | |
p03261 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <unordered_map>
#include <vector>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <unordered_map>
#include <vector>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse... | replace | 96 | 100 | 96 | 100 | 0 | |
p03261 | Python | Runtime Error | n = int(input())
soFar = []
last = None
flag = True
for i in range(n + 1):
x = input()
if i == 0:
soFar.append(x)
last = x
else:
if x not in soFar and last[len(last) - 1] == x[0]:
soFar.append(x)
last = x
else:
flag = False
brea... | n = int(input())
w = [input() for i in range(n)]
count = 0
for i in range(1, n):
if w[i - 1][len(w[i - 1]) - 1] != w[i][0]:
count += 1
if count == 0 and len(list(set(w))) == n:
print("Yes")
else:
print("No")
| replace | 1 | 17 | 1 | 7 | 0 | |
p03261 | Python | Runtime Error | #! /usr/bin/python
from sys import stdin
n = int(input())
w = list(map(int, stdin.read().splitlines()))
print("Yes" if n == len(set(w)) else "No")
| #! /usr/bin/python
from sys import stdin
n = int(input())
W = stdin.read().splitlines()
if n != len(set(W)):
print("No")
exit()
for i in range(n - 1):
if W[i][-1] != W[i + 1][0]:
print("No")
exit()
print("Yes")
| replace | 4 | 6 | 4 | 13 | ValueError: invalid literal for int() with base 10: 'hoge' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03261/Python/s621925685.py", line 4, in <module>
w = list(map(int, stdin.read().splitlines()))
ValueError: invalid literal for int() with base 10: 'hoge'
|
p03261 | C++ | Runtime Error | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string s;
set<string> check;
char c = '0';
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
if (check.count(s)) {
cout << "No" << endl;
return 0;
}
if (c != '0' && c != s.at(i)) {
... | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string s;
set<string> check;
char c = '0';
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
if (check.count(s)) {
cout << "No" << endl;
return 0;
}
if (c != '0' && c != s.at(0)) {
... | replace | 17 | 18 | 17 | 18 | 0 | |
p03261 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
const long long h = 0x7ffffff / 2, MAXN = 100 + 5;
long long t[h];
struct Hash {
char st[15];
int hash;
} s[MAXN];
int main() {
int n, sum = 0, hash;
scanf("%d",... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
const long long h = 0x7ffffff / 2, MAXN = 100 + 5;
long long t[h];
struct Hash {
char st[15];
int hash;
} s[MAXN];
int main() {
int n, sum = 0, hash;
scanf("%d",... | replace | 22 | 23 | 22 | 23 | -11 | |
p03261 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, flag = 0;
string W[100];
cin >> N;
for (int i = 0; i < N; i++)
cin >> W[i];
for (int i = 0; i < N - 1; i++) {
if (W[i].substr(W[i].length() - 1, 1) != W[i + 1].substr(0, 1)) {
flag++;
break;
}
}
if (fl... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, flag = 0;
string W[101];
cin >> N;
for (int i = 0; i < N; i++)
cin >> W[i];
for (int i = 0; i < N - 1; i++) {
if (W[i].substr(W[i].length() - 1, 1) != W[i + 1].substr(0, 1)) {
flag++;
break;
}
}
if (fl... | replace | 7 | 8 | 7 | 8 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
bool ans = true;
cin >> N;
vector<string> W(N);
for (int i = 0; i < N; i++) {
cin >> W.at(i);
}
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
if (W.at(i) == W.at(j)) {
ans = false;
}
}
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
bool ans = true;
cin >> N;
vector<string> W(N);
for (int i = 0; i < N; i++) {
cin >> W.at(i);
}
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
if (W.at(i) == W.at(j)) {
ans = false;
}
}
if ... | replace | 19 | 20 | 19 | 20 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, flag = 0;
string str[15];
cin >> n;
cin >> str[0];
for (int i = 1; i < n; i++) {
cin >> str[i];
for (int j = 0; j < i; j++) {
if (str[i] == str[j]) {
flag = 1;
}
}
if (str[i][0] != str[i - 1][str[i - 1]... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, flag = 0;
string str[101];
cin >> n;
cin >> str[0];
for (int i = 1; i < n; i++) {
cin >> str[i];
for (int j = 0; j < i; j++) {
if (str[i] == str[j]) {
flag = 1;
}
}
if (str[i][0] != str[i - 1][str[i - 1... | replace | 5 | 6 | 5 | 6 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<string> w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (w[i] == w[j])
count++;
if (count == 2) {
cout << "No";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<string> w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (w[i] == w[j])
count++;
if (count == 2) {
cout << "No";
... | replace | 20 | 21 | 20 | 21 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0, sub = 0;
vector<string> vec;
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (vec[i] == vec[j]) {
sub++;
}
}
}
if (su... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0, sub = 0;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (vec[i] == vec[j]) {
sub++;
}
}
}
if ... | replace | 6 | 7 | 6 | 7 | -11 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool ad = false;
vector<string> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (w[i] == w[j]) {
ad = true;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool ad = false;
vector<string> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (w[i] == w[j]) {
ad = true;
break;
}
}
... | replace | 21 | 22 | 21 | 22 | -11 | |
p03261 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
string a[11], b, c;
int n, i, x = 0, j;
cin >> n;
cin >> b;
a[0] = b;
for (i = 1; i < n; i++) {
cin >> c;
if (c[0] != b[b.size() - 1]) {
x++;
}
a[i] = c;
b = a[i];
for (j = 0; j < i; j++) {
if (a[i] == a[j]) {
... | #include <iostream>
using namespace std;
int main() {
string a[110], b, c;
int n, i, x = 0, j;
cin >> n;
cin >> b;
a[0] = b;
for (i = 1; i < n; i++) {
cin >> c;
if (c[0] != b[b.size() - 1]) {
x++;
}
a[i] = c;
b = a[i];
for (j = 0; j < i; j++) {
if (a[i] == a[j]) {
... | replace | 4 | 5 | 4 | 5 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i, n) for (ll i = (ll)(n - 1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#de... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i, n) for (ll i = (ll)(n - 1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#de... | replace | 18 | 19 | 18 | 19 | -11 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << "\n";
#define debug3(a, b, c) cout << a << " " << b << " " << c << "\n";
#define debug2(a, b) cout << a << " " << b << "\n";
#define debug4(a, b, c, d) ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define debug1(a) cout << a << "\n";
#define debug3(a, b, c) cout << a << " " << b << " " << c << "\n";
#define debug2(a, b) cout << a << " " << b << "\n";
#define debug4(a, b, c, d) ... | replace | 18 | 22 | 18 | 19 | 0 | |
p03261 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
typedef long long lint;
using namespace std;
int main() {
vector<string> v;
int n;
string s[100][11];
cin >> n;
bool flag = true;
for (int t = 0; t < n; t++) {
cin >> s[t]... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
typedef long long lint;
using namespace std;
int main() {
vector<string> v;
int n;
string s[110][11];
cin >> n;
bool flag = true;
for (int t = 0; t < n; t++) {
cin >> s[t]... | replace | 13 | 14 | 13 | 14 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int cnt[10010];
int res[10010];
int a[10010];
int main() {
int n, m;
cin >> n >> m;
int b = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cnt[b] = abs(a[i] - m);
b++;
}
sort(cnt, cnt + n);
int x = cnt[0];
int c = 0;
... | #include <bits/stdc++.h>
using namespace std;
int cnt[100010];
int res[100010];
int a[100010];
int main() {
int n, m;
cin >> n >> m;
int b = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cnt[b] = abs(a[i] - m);
b++;
}
sort(cnt, cnt + n);
int x = cnt[0];
int c = ... | replace | 2 | 5 | 2 | 5 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> data(N, -X);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
data.at(i) += a;
data.at(i) = abs(data.at(i));
}
int A, B, ans = data.at(0);
for (int i = 0; i < N; i++) {
A = ans;
B = data.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> data(N, -X);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
data.at(i) += a;
data.at(i) = abs(data.at(i));
}
int A, B, ans = data.at(0);
for (int i = 0; i < N; i++) {
A = ans;
B = data.at(... | insert | 16 | 16 | 16 | 18 | TLE | |
p03262 | C++ | Runtime Error | #include "algorithm"
#include "bits/stdc++.h"
#include "math.h"
#include "string.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define FOR(i, a, b) f... | #include "algorithm"
#include "bits/stdc++.h"
#include "math.h"
#include "string.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define FOR(i, a, b) f... | replace | 40 | 41 | 40 | 41 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x - y, y);
}
int main() {
int N, X, x[100000] = {}, ans = -1;
cin >> N >> X;
for (int i = 0; i < N; i+... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
int N, X, x[100000] = {}, ans = -1;
cin >> N >> X;
for (int i = 0; i < N; i+... | replace | 11 | 12 | 11 | 12 | TLE | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
if (b > a) {
swap(a, b);
}
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
ll n, x, a;
cin >> n;
cin >> x;
vector<ll> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r;
if (b > a) {
swap(a, b);
}
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
ll n, x, a;
cin >> n;
cin >> x;
vector<ll> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.p... | insert | 30 | 30 | 30 | 31 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
int n, s[10005];
scanf("%d", &n);
scanf("%d", &s[0]);
for (int i = 1; i <= n; i++)
scanf("%d", &s[i]);
sort(s, s + n + 1);
int ant = s[1] - s[0];
for (int i = 2; i <= n; i++)
a... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
int n, s[100005];
scanf("%d", &n);
scanf("%d", &s[0]);
for (int i = 1; i <= n; i++)
scanf("%d", &s[i]);
sort(s, s + n + 1);
int ant = s[1] - s[0];
for (int i = 2; i <= n; i++)
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, X;
cin >> N >> X;
vector<long> x(N);
for (long i = 0; i < N; i++) {
long t;
cin >> t;
x[i] = abs(t - X);
}
if (N == 1) {
cout << x[0] << endl;
return 0;
}
sort(x.begin(), x.end());
long ans = 1;
for (long i = x[0... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, X;
cin >> N >> X;
vector<long> x(N);
for (long i = 0; i < N; i++) {
long t;
cin >> t;
x[i] = abs(t - X);
}
if (N == 1) {
cout << x[0] << endl;
return 0;
}
sort(x.begin(), x.end());
long ans = 1;
for (long i = x[0... | replace | 20 | 22 | 20 | 22 | -8 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main(void) {
int N, X, ans = 0;
cin >> N >> X;
int px[10010], sa[10010];
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main(void) {
int N, X, ans = 0;
cin >> N >> X;
int px[100100], sa[100100];
for (int i... | replace | 21 | 22 | 21 | 22 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
int gcd(int, int);
int main() {
int n, x;
int mp[100000];
int ans;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> mp[i];
}
for (int i = 0; i < n; i++) {
if (i == 0)
ans = abs(x - mp[i]);
else
ans = gcd(ans, abs(x... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
int gcd(int, int);
int main() {
int n, x;
int mp[100000];
int ans;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> mp[i];
}
for (int i = 0; i < n; i++) {
if (i == 0)
ans = abs(x - mp[i]);
else
ans = gcd(ans, abs(x... | replace | 19 | 22 | 19 | 20 | TLE | |
p03262 | C++ | Runtime Error | #include <iostream>
using namespace std;
int gcd(int a, int b) {
int less, greater;
if (a < b) {
less = a;
greater = b;
} else {
less = b;
greater = a;
}
int remainder = greater % less;
if (remainder == 0) {
return less;
} else {
return gcd(less, remainder);
}
}
int main() {
... | #include <iostream>
using namespace std;
int gcd(int a, int b) {
int less, greater;
if (a < b) {
less = a;
greater = b;
} else {
less = b;
greater = a;
}
int remainder = greater % less;
if (remainder == 0) {
return less;
} else {
return gcd(less, remainder);
}
}
int main() {
... | replace | 24 | 25 | 24 | 25 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int m, long long int n) {
if (0 == m || 0 == n) {
return 0;
}
while (m != n) {
if (m > n) {
m = m - n;
} else {
n = n - m;
}
}
return m;
}
int main() {
int n;
long long int x;
cin >> n >> x;
long lo... | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int m, long long int n) {
if (0 == m || 0 == n) {
return 0;
}
while (m != n) {
if (m > n) {
m = m - n;
} else {
n = n - m;
}
}
return m;
}
int main() {
int n;
long long int x;
cin >> n >> x;
long lo... | insert | 26 | 26 | 26 | 27 | TLE | |
p03262 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, x;
cin >> n >> x;
ll a[10001];
ll tmp;
rep(i, n) {
cin ... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, x;
cin >> n >> x;
ll a[100001];
ll tmp;
rep(i, n) {
cin... | replace | 13 | 14 | 13 | 14 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | insert | 37 | 37 | 37 | 38 | TLE | |
p03262 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N, X;
int x[100000];
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> x[i];
// Xとの距離が最小のx[i]を求める
int min_dist = abs(X - x[0]);
for (int i = 1; i < N; i++)
min_dist = max(min_dist, abs(X - x[i]));
// 任意のiで (x[i] - X) % D == 0 となるようなD... | #include <iostream>
using namespace std;
int main() {
int N, X;
int x[100000];
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> x[i];
// Xとの距離が最小のx[i]を求める
int min_dist = abs(X - x[0]);
for (int i = 1; i < N; i++)
min_dist = min(min_dist, abs(X - x[i]));
// 任意のiで (x[i] - X) % D == 0 となるようなD... | replace | 15 | 16 | 15 | 16 | TLE | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, m, l;
m = 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10;
cin >> n >> x;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
if (m > abs(s.at(i) - x))
m = abs(s.at(i) - x);
}
for (int c = 1; c <= m; c++) {
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, m, l;
m = 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10 * 10;
cin >> n >> x;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s.at(i);
if (m > abs(s.at(i) - x))
m = abs(s.at(i) - x);
}
if (n < 2) {
cout << abs(s.at(0) - x... | insert | 12 | 12 | 12 | 16 | TLE | |
p03262 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using nam... | replace | 91 | 92 | 91 | 92 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <queue>
using namespace std;
typedef long long int ll;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
ll r = 999999999999;
while (r != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ll N, X;
cin >> N >> X;
vector<ll> A(N);
ll dif =... | #include <bits/stdc++.h>
#include <queue>
using namespace std;
typedef long long int ll;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
ll r = 999999999999;
while (r != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
ll N, X;
cin >> N >> X;
vector<ll> A(N);
ll dif =... | insert | 27 | 27 | 27 | 31 | 0 | |
p03262 | C++ | Runtime Error | #include <iostream>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
gcd(b, a % b);
}
}
int main() {
int n, x;
cin >> n >> x;
int xi, g;
cin >> xi;
g = abs(x - xi);
for (int i = 1; i < n; i++) {
int xi;
cin >> xi;
g = gcd(g, abs(x - xi));
}
cout... | #include <iostream>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
int n, x;
cin >> n >> x;
int xi, g;
cin >> xi;
g = abs(x - xi);
for (int i = 1; i < n; i++) {
int xi;
cin >> xi;
g = gcd(g, abs(x - xi));
}... | replace | 6 | 7 | 6 | 7 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int a[maxn];
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
ios::sync_with_stdio(false);
int n, x;
while (cin >> n >> x) {
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = abs(a[i] - x);
}
i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int a[maxn];
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
ios::sync_with_stdio(false);
int n, x;
while (cin >> n >> x) {
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = abs(a[i] - x);
}
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03262 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
#define MAXN 10000
int N, X;
int pos[MAXN + 5];
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
scanf("%d%d", &N, &X);
for (int i = 1; i <= N; i++)
scanf("%d", &pos[i]);
sort(pos + 1, pos + N + 1);
int i = 1, Ans = 0;
whil... | #include <algorithm>
#include <cstdio>
using namespace std;
#define MAXN 100000
int N, X;
int pos[MAXN + 5];
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
scanf("%d%d", &N, &X);
for (int i = 1; i <= N; i++)
scanf("%d", &pos[i]);
sort(pos + 1, pos + N + 1);
int i = 1, Ans = 0;
whi... | replace | 4 | 5 | 4 | 5 | 0 | |
p03262 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
int N;
long long X;
cin >> N >> X;
vector<long long> x;
for (int i = 0; i < N; ++i)
cin >> x[i], x[i] -= X;
long long g = abs... | #include <iostream>
#include <vector>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
int N;
long long X;
cin >> N >> X;
vector<long long> x(N);
for (int i = 0; i < N; ++i)
cin >> x[i], x[i] -= X;
long long g = ... | replace | 15 | 16 | 15 | 16 | -11 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, x, ans = 0;
long long a[10010];
int main() {
scanf("%lld %lld", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
a[i] = abs(a[i] - x);
}
for (int i = 2; i <= n; i++)
a[i] = __gcd(a[i], a[i - 1]);
cout << a[n] << endl;
return... | #include <bits/stdc++.h>
using namespace std;
long long n, x, ans = 0;
long long a[100010];
int main() {
scanf("%lld %lld", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
a[i] = abs(a[i] - x);
}
for (int i = 2; i <= n; i++)
a[i] = __gcd(a[i], a[i - 1]);
cout << a[n] << endl;
retur... | replace | 3 | 4 | 3 | 4 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <gmpxx.h>
#define NREP() for (ll i = 0; i < n; i++)
#define MREP() for (ll j = 0; j < m; j++)
#define REP(i, x, y) for (ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) ... | #include <bits/stdc++.h>
#include <gmpxx.h>
#define NREP() for (ll i = 0; i < n; i++)
#define MREP() for (ll j = 0; j < m; j++)
#define REP(i, x, y) for (ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) ... | replace | 98 | 102 | 98 | 101 | -8 | |
p03262 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
vector<long long> pt;
vector<long long> mid;
vector<long long> ans;
int gcd(long long u, long long v) {
l... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
vector<long long> pt;
vector<long long> mid;
vector<long long> ans;
int gcd(long long u, long long v) {
l... | replace | 39 | 40 | 39 | 40 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
// 上記が使用不可な環境において
/*
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include ... | #include <bits/stdc++.h>
// 上記が使用不可な環境において
/*
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include ... | replace | 465 | 470 | 465 | 470 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
vector<int> v;
while (n--) {
int h;
cin >> h;
v.push_back(abs(x - h));
}
if (v.size() == 1)
cout << v[0] << "\n";
else {
int ans = __gcd(v[0], v[1]);
for (int i = 2; i < v.size(); i++)
ans = __gcd(ans, v[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector<int> v;
while (n--) {
int h;
cin >> h;
v.push_back(abs(x - h));
}
if (v.size() == 1)
cout << v[0] << "\n";
else {
int ans = __gcd(v[0], v[1]);
for (int i = 2; i < v.size(); i++)
ans = _... | insert | 4 | 4 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03262 | C++ | Runtime Error | #include "bits/stdc++.h"
#define MOD 1000000007
#define inf 0x3f3f3f3f3f3f3f3f
#define pi acos(-1.0)
#define ri register int
#define int long long
#ifdef ONLINE_JUDGE
const int maxn = 3e5 + 10;
#else
const int maxn = 1e3 + 10;
#endif
using namespace std;
int N, X, arr[maxn];
signed main() {
ios::sync_with_stdio(false... | #include "bits/stdc++.h"
#define MOD 1000000007
#define inf 0x3f3f3f3f3f3f3f3f
#define pi acos(-1.0)
#define ri register int
#define int long long
#ifdef ONLINE_JUDGE
const int maxn = 3e5 + 10;
#else
const int maxn = 1e5 + 10;
#endif
using namespace std;
int N, X, arr[maxn];
signed main() {
ios::sync_with_stdio(false... | replace | 9 | 10 | 9 | 10 | 0 | |
p03262 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b... | insert | 29 | 29 | 29 | 35 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N, X;
int x[100010];
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin >> N >> X;
for (int i = 0; i < N; ++i)
cin >> x[i];
sort(begin(x), begin(x) + N);
vector<int> s;
for (int i = 0; i < N; ++i) {
int t ... | #include <bits/stdc++.h>
using namespace std;
int N, X;
int x[100010];
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin >> N >> X;
for (int i = 0; i < N; ++i)
cin >> x[i];
int D = abs(x[0] - X);
for (int i = 1; i < N; ++i) {
D = gcd(D, abs(x[i] - X));
}... | replace | 16 | 49 | 16 | 19 | TLE | |
p03262 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
const ll mod = 1e9 ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
const ll mod = 1e9 ... | insert | 32 | 32 | 32 | 37 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
long long N, X;
cin >> N >> X;
vector<long long> vec(N);
for (long long i = 0; i < N; i++) {
long long x;
cin >> x;
long long dist = ... | #include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
long long N, X;
cin >> N >> X;
vector<long long> vec(N);
for (long long i = 0; i < N; i++) {
long long x;
cin >> x;
long long dist = ... | replace | 24 | 25 | 24 | 25 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100001;
int smin(int x, int y) {
if (x == y)
return x;
else if (x > y)
return smin(x - y, y);
else
return smin(y - x, x);
}
int main() {
int n;
long long i, zmin, st, a[maxn] = {0};
cin >> n >> st;
for (i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100001;
int smin(int x, int y) {
if (x == y)
return x;
else if (x > y)
return smin(x - y, y);
else
return smin(y - x, x);
}
int main() {
int n;
long long i, zmin, st, a[maxn] = {0};
cin >> n >> st;
for (i = 1; i <= n; i++) {
... | insert | 25 | 25 | 25 | 27 | TLE | |
p03262 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <math.h>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll ans, mx, sum, mn = 1e8;
int main() {
ll n, x;
cin >> n >> x;
ll a[n];
for (l... | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <math.h>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll ans, mx, sum, mn = 1e8;
int main() {
ll n, x;
cin >> n >> x;
ll a[n];
for (l... | replace | 31 | 37 | 31 | 32 | TLE | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int m, long long int n) {
if (0 == m || 0 == n)
return 0;
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
int main() {
int N;
cin >> N;
long long int X;
cin >> X;
long long int ans,... | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int m, long long int n) {
if (n == 0)
return m;
else
return gcd(n, m % n);
}
int main() {
int N;
cin >> N;
long long int X;
cin >> X;
long long int ans, x;
cin >> ans;
ans = abs(ans - X);
for (int i = 1; i < N; i++) ... | replace | 4 | 13 | 4 | 8 | TLE | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, a[100020], x, b[100020], sum = 1, lmin = 1000000000, j;
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] > x)
b[i] = a[i] - x;
if (a[i] < x)
b[i] = x - a[i];
lmin = min(b[i... | #include <bits/stdc++.h>
using namespace std;
int n, a[100020], x, b[100020], sum = 1, lmin = 1000000000, j;
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
if (a[1] == 1000000000) {
cout << 999999999;
return 0;
}
for (int i = 1; i <= n; i++) {
if (a[i] > x)
b[i] = ... | insert | 7 | 7 | 7 | 11 | TLE | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1.0e9
#define MOD 1.0e9 + 7
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 100;
int x[MAX_N + 1];
int gcd(int a, int b) {
int large = max(a, b);
int small = min(a, b);
if (small == 0)
return large;
else
return gcd(small, large % small);
}
int ... | #include <bits/stdc++.h>
#define INF 1.0e9
#define MOD 1.0e9 + 7
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 100000;
int x[MAX_N + 1];
int gcd(int a, int b) {
int large = max(a, b);
int small = min(a, b);
if (small == 0)
return large;
else
return gcd(small, large % small);
}
i... | replace | 7 | 8 | 7 | 8 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdlib.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
if (b % a == 0)
return a;
int i, n, m;
if (a < b) {
n = b;
m = a;
i = a;
} else {
n = a;
m = b;
i = b;
}
for (; i > 1; i--) {
if (n % i == 0 && m % i == 0)
... | #include <iostream>
#include <stdlib.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
if (b % a == 0)
return a;
int i, n, m;
if (a < b) {
n = b;
m = a;
i = a;
} else {
n = a;
m = b;
i = b;
}
for (; i > 1; i--) {
if (n % i == 0 && m % i == 0)
... | delete | 27 | 32 | 27 | 27 | TLE | |
p03262 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
constexpr int ORD(int n) {
int res = 1;
for (int i = 0; i < n; i++) {
res *= n;
}
res++;
return res;
}
int xs[ORD(6)];
using namespace std;
int gcd_many(int *xs, int n) {
int res = xs[0];
for (int i = 0; i < n; i++) {
res = __gcd(res, xs[... | #include <algorithm>
#include <cmath>
#include <cstdio>
constexpr int ORD(int n) {
int res = 1;
for (int i = 0; i < n; i++) {
res *= 10;
}
res++;
return res;
}
int xs[ORD(6)];
using namespace std;
int gcd_many(int *xs, int n) {
int res = xs[0];
for (int i = 0; i < n; i++) {
res = __gcd(res, xs... | replace | 7 | 8 | 7 | 8 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#defi... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#defi... | replace | 114 | 115 | 114 | 115 | -6 | free(): invalid pointer
|
p03262 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int solve(int m, int n) {
if (m < n) {
int tmp = m;
m = n;
n = tmp;
}
if (n == 0)
return m;
return solve(n, m - n)... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int solve(int m, int n) {
if (m < n) {
int tmp = m;
m = n;
n = tmp;
}
if (n == 0)
return m;
return solve(n, m % n)... | replace | 21 | 22 | 21 | 22 | TLE | |
p03262 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using str = string;
#define rep(a, l, r) for (int a = (l); a < (r); a++)
#define get cin >>
#define put cout <<
int gcd_euclid(int u, int v) ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <limits>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using str = string;
#define rep(a, l, r) for (int a = (l); a < (r); a++)
#define get cin >>
#define put cout <<
int gcd_euclid(int u, int v) ... | replace | 33 | 34 | 33 | 34 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int N, X;
cin >> N >> X;
vector<int> city(N);
for (int i = 0; i < N; ++i) {
cin >> city.at(i);
... | #include <bits/stdc++.h>
using namespace std;
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int N, X;
cin >> N >> X;
vector<int> city(N);
for (int i = 0; i < N; ++i) {
cin >> city.at(i);
... | replace | 27 | 28 | 27 | 33 | 0 | |
p03262 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, x;
long long a[10005] = {};
long long b[10005] = {};
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, x;
long long a[100050] = {};
long long b[100050] = {}... | replace | 17 | 19 | 17 | 19 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int gcd(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);
int gcd(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m... | replace | 29 | 30 | 29 | 34 | TLE | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int P, int Q);
int main() {
int N;
cin >> N;
N++;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int D = gcd((A.at(1) - A.at(0)), (A.at(2) - A.at(1)));
int C;
for (int i = 3; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int gcd(int P, int Q);
int main() {
int N;
cin >> N;
N++;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
if (N == 2) {
cout << A.at(1) - A.at(0) << endl;
exit(0);
}
int D = gcd((A.at(1) - A.a... | insert | 16 | 16 | 16 | 21 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int IN... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int IN... | replace | 28 | 29 | 28 | 29 | 0 | |
p03262 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
unsigned GCD(unsigned u, unsigned v) {
while (v != 0) {
unsigned r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
int N, X, maxD = 0;
std::cin >> N >> X;
int a[N];
for (int i = 0; i < N; i++)
std::cin >> a[i];
for (int i = ... | #include <algorithm>
#include <cmath>
#include <iostream>
unsigned GCD(unsigned u, unsigned v) {
while (v != 0) {
unsigned r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
int N, X, maxD = 0;
std::cin >> N >> X;
int a[N];
for (int i = 0; i < N; i++)
std::cin >> a[i];
for (int i = ... | replace | 26 | 29 | 26 | 31 | TLE | |
p03262 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int yakusuu(int a, int b) {
if (b % a == 0)
return a;
else
return yakusuu(b % a, a);
}
int main() {
int N, X, x[100000], baisuu, k, b = 0, a = 0;
cin >> N >> X;
cin >> x[0];
x[0] -= X;
if (x[0] < 0)
x[0] *= -1;
// baisuu=x[0];
for ... | #include <iostream>
#include <string>
using namespace std;
int yakusuu(int a, int b) {
if (b % a == 0)
return a;
else
return yakusuu(b % a, a);
}
int main() {
int N, X, x[100000], baisuu, k, b = 0, a = 0;
cin >> N >> X;
cin >> x[0];
x[0] -= X;
if (x[0] < 0)
x[0] *= -1;
// baisuu=x[0];
for ... | replace | 25 | 26 | 25 | 26 | -8 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 10000
int n, X;
int x[N];
long long gcd(int u, int v) {
int r;
while (0 != v) {
r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
int n;
cin >> n >> X;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
long long ans = abs(x[0] ... | #include <bits/stdc++.h>
using namespace std;
#define N 100000
int n, X;
int x[N];
long long gcd(int u, int v) {
int r;
while (0 != v) {
r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
int n;
cin >> n >> X;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
long long ans = abs(x[0]... | replace | 3 | 4 | 3 | 4 | 0 | |
p03262 | Python | Runtime Error | import math
N, X = map(int, input().split())
X_lst = list(map(int, input().split()))
if len(X_lst) == 1:
print(abs(X_lst[0] - X))
exit()
u = 0
if X_lst[0] == X:
u = float("inf")
for i, x in enumerate(X_lst[1:], start=1):
if x == X:
u = float("inf")
if X_lst[i - 1] < X < x:
u = [... | import math
N, X = map(int, input().split())
X_lst = list(map(int, input().split()))
if len(X_lst) == 1:
print(abs(X_lst[0] - X))
exit()
u = 0
if X_lst[0] == X:
u = float("inf")
for i, x in enumerate(X_lst[1:], start=1):
if x == X:
u = float("inf")
if X_lst[i - 1] < X < x:
u = [... | replace | 18 | 19 | 18 | 19 | 0 | |
p03262 | Python | Runtime Error | from math import gcd
from functools import reduce
def gcd_list(numbers):
return reduce(gcd, numbers)
n, x = map(int, input().split())
x_arr = [0] * n
x_arr = list(map(int, input().split()))
for i in range(len(x_arr)):
x_arr[i] = abs(x_arr[i] - x)
print(gcd_list(x_arr))
| from fractions import gcd
from functools import reduce
def gcd_list(numbers):
return reduce(gcd, numbers)
n, x = map(int, input().split())
x_arr = [0] * n
x_arr = list(map(int, input().split()))
for i in range(len(x_arr)):
x_arr[i] = abs(x_arr[i] - x)
print(gcd_list(x_arr))
| replace | 0 | 1 | 0 | 1 | 0 | |
p03262 | Python | Runtime Error | from fractions import gcd
N, X = map(int, input().split())
X_list = list(map(int, input().split()))
dX = [abs(X - x) for x in X_list]
if len(dX) == 1:
print(dX[0])
exit(0)
D = [abs(X_list[i] - X_list[i + 1]) for i in range(0, N - 1)]
res = gcd(D[0], D[1])
for x in D[2:]:
res = gcd(res, x)
ans = 0
for d ... | from fractions import gcd
N, X = map(int, input().split())
X_list = list(map(int, input().split()))
dX = [abs(X - x) for x in X_list]
if len(dX) == 1:
print(dX[0])
exit(0)
D = [abs(X_list[i] - X_list[i + 1]) for i in range(0, N - 1)]
res = D[0]
for x in D[1:]:
res = gcd(res, x)
ans = 0
for d in dX:
... | replace | 11 | 13 | 11 | 13 | ImportError: cannot import name 'gcd' from 'fractions' (/usr/lib/python3.10/fractions.py) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03262/Python/s082976387.py", line 1, in <module>
from fractions import gcd
ImportError: cannot import name 'gcd' from 'fractions' (/usr/lib/python3.10/fractions.py)
|
p03262 | Python | Runtime Error | n, s = map(int, input().split())
xxx = [abs(s - y) for y in map(int, input().split())]
d = 0
while True:
d = min(xxx)
xxx = [x % d for x in xxx]
if all(x == 0 for x in xxx):
break
print(d)
| n, s = map(int, input().split())
xxx = [abs(s - y) for y in map(int, input().split())]
d = 0
while True:
xxx = [x for x in xxx if x > 0]
d = min(xxx)
xxx = [x % d for x in xxx]
if all(x == 0 for x in xxx):
break
print(d)
| insert | 4 | 4 | 4 | 5 | 0 | |
p03262 | Python | Runtime Error | def gcd(a, b):
if a > b:
a, b = b, a
while b > 0:
a, b = b, a % b
return a
def allgcd(d):
if len(d) == 1:
return d
ret_gcd = d[0]
for i in d:
ret_gcd = gcd(ret_gcd, i)
return ret_gcd
def maxNumVisitCity(N, X, x):
if len(x) == 1:
return abs(x[0]... | def gcd(a, b):
if a > b:
a, b = b, a
while b > 0:
a, b = b, a % b
return a
def allgcd(d):
if len(d) == 1:
return d
ret_gcd = d[0]
for i in d:
ret_gcd = gcd(ret_gcd, i)
return ret_gcd
def maxNumVisitCity(N, X, x):
if len(x) == 1:
return abs(x[0]... | replace | 29 | 30 | 29 | 30 | TypeError: object of type 'map' has no len() | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03262/Python/s914485510.py", line 35, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03262/Python/s914485510.py", line 31, in main
print(maxNumVisitCity(N, X, x))
... |
p03262 | Python | Time Limit Exceeded | n, x = map(int, input().split())
li = list(map(int, input().split()))
t = []
for i in li:
t.append(abs(i - x))
for j in range(min(t)):
if all(k % (min(t) - j) == 0 for k in t):
print(min(t) - j)
exit()
| n, x = map(int, input().split())
li = list(map(int, input().split()))
t = []
for i in li:
t.append(abs(i - x))
divisors = []
for i in range(1, int(min(t) ** 0.5) + 1):
if min(t) % i == 0:
divisors.append(i)
if i != min(t) // i:
divisors.append(min(t) // i)
divisors.sort()
divisors = ... | replace | 5 | 8 | 5 | 16 | TLE | |
p03262 | Python | Runtime Error | from functools import reduce
from math import gcd
X = int(input().split()[1])
x = [abs(int(x) - X) for x in input().split()]
print(reduce(gcd, x))
| from functools import reduce
from fractions import gcd
X = int(input().split()[1])
x = [abs(int(x) - X) for x in input().split()]
print(reduce(gcd, x))
| replace | 1 | 2 | 1 | 2 | 0 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[100007];
int gcd(int x, int y) {
if (x == 0)
return y;
else
return gcd(y, x % y);
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> a[0];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a, a + n + 1);
int g = 0;
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
int n, a[100007];
int gcd(int x, int y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> a[0];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a, a + n + 1);
int g = 0;
for (int i = 1... | replace | 4 | 6 | 4 | 6 | -8 | |
p03262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, ans, x[n + 1];
cin >> n;
REP(i, n + 1) cin >> x[i];
sort(x, x + n + 1);
ans = x[1] - x[0];
REP(i, n) ans = gcd(ans, x[i + 1] - x[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, ans, x[100001];
cin >> n;
REP(i, n + 1) cin >> x[i];
sort(x, x + n + 1);
ans = x[1] - x[0];
REP(i, n) ans = gcd(ans, x[i + 1] - x[i]);
... | replace | 7 | 8 | 7 | 8 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.