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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02854 | C++ | Runtime Error | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#else
// freopen("zalupa.in","r",stdin);
// freopen("zalupa.out","w",stdout);
#endif... | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#else
// freopen("zalupa.in","r",stdin);
// freopen("zalupa.out","w",stdout);
#endif... | replace | 29 | 31 | 29 | 31 | 0 | |
p02854 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005];
int main() {
int n;
cin >> n;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll sum1 = 0;
ll ans = sum;
for (int i = 0; i < n; i++) {
sum1 += a[i];
ans = min(ans, abs(sum - sum1 * 2)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200005];
int main() {
int n;
cin >> n;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll sum1 = 0;
ll ans = sum;
for (int i = 0; i < n; i++) {
sum1 += a[i];
ans = min(ans, abs(sum - sum1 * 2)... | replace | 3 | 4 | 3 | 4 | 0 | |
p02854 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mins(x, y) (x = min(x, y))
#define maxs(x, y) (x = max(x, y))
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mins(x, y) (x = min(x, y))
#define maxs(x, y) (x = max(x, y))
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;... | replace | 33 | 34 | 33 | 34 | 0 | |
p02854 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#define int long long
#define mod 1000000007
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
signed main() {
int n;
cin >> n;
int a[123456];
a[0] = 0;
for1(i, n) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#define int long long
#define mod 1000000007
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
signed main() {
int n;
cin >> n;
int a[223456];
a[0] = 0;
for1(i, n) ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02854 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int64_t> B(N + 1);
B.at(0) = 0;
for (int i = 0; i <= N; i++)
B.at(i) = B.at(i - 1) + A.at(i - 1);
int64_t a = B.at(N) / 2;
auto itr = lower_bound... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
vector<int64_t> B(N + 1);
B.at(0) = 0;
for (int i = 1; i <= N; i++)
B.at(i) = B.at(i - 1) + A.at(i - 1);
int64_t a = B.at(N) / 2;
auto itr = lower_bound... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744073709551615) >= this->size() (which is 4)
|
p02854 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = (int)1e5 + 5;
int n, a[N], sum[N];
void init() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
sum[0] = 0;
for (int i = 1; i <= n; ++i)
sum[i] = sum[i - 1] + a[i];
}
void solve() {
int ans = 1e18;
for (int i = ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = (int)2e5 + 5;
int n, a[N], sum[N];
void init() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
sum[0] = 0;
for (int i = 1; i <= n; ++i)
sum[i] = sum[i - 1] + a[i];
}
void solve() {
int ans = 1e18;
for (int i = ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02854 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define semicolon ;
#define ryan bear
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
const int in... | #include <algorithm>
#include <iostream>
#include <vector>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define semicolon ;
#define ryan bear
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
const int in... | replace | 17 | 18 | 17 | 18 | 0 | |
p02854 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> b(n + 1, 0);
for (int i = 0; i <= n; i++) {
b[i + 1] = b[i];
b[i + 1] += a[i];
}
long long ans = 90000000000;
long long min;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> b(n + 1, 0);
for (int i = 0; i < n; i++) {
b[i + 1] = b[i];
b[i + 1] += a[i];
}
long long ans = 90000000000;
long long min;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, k;
cin >> h >> w >> k;
vector<vector<char>> a(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> a.at(i).at(j);
}
}
vector<vector<int>> x(h... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, k;
cin >> h >> w >> k;
vector<vector<char>> a(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> a.at(i).at(j);
}
}
vector<vector<int>> x(h... | replace | 47 | 48 | 47 | 48 | 0 | |
p02855 | Python | Runtime Error | H, W, K = map(int, input().split())
c = []
cnt = [0] * W
num = 0
A = [[0] * W for _ in range(H)]
for i in range(H):
row = list(input())
c.append(row)
cnt[i] = row.count("#")
def solve(cl, cr):
global num
P = []
for i in range(cl, cr + 1):
for j in range(W):
if c[i][j] == "... | H, W, K = map(int, input().split())
c = []
cnt = [0] * H
num = 0
A = [[0] * W for _ in range(H)]
for i in range(H):
row = list(input())
c.append(row)
cnt[i] = row.count("#")
def solve(cl, cr):
global num
P = []
for i in range(cl, cr + 1):
for j in range(W):
if c[i][j] == "... | replace | 2 | 3 | 2 | 3 | 0 | |
p02855 | C++ | Runtime Error | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | replace | 96 | 104 | 96 | 123 | 0 | |
p02855 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
int main() {
ll H, W, K;
cin >> H >> W >> K;
vector<pii> in;
vector<vector<ll>> grid(H,... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
int main() {
ll H, W, K;
cin >> H >> W >> K;
vector<pii> in;
vector<vector<ll>> grid(H,... | replace | 69 | 70 | 69 | 70 | -11 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int h, w, k, f = 0;
bool flag;
cin >> h >> w >> k;
vector<vector<int>> sss(h, vector<int>(w));
vector<int> a(k), b(k);
char x;
rep(i, h) {
flag = false;
rep(j, w) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int h, w, k, f = 0;
bool flag;
cin >> h >> w >> k;
vector<vector<int>> sss(h, vector<int>(w));
vector<int> a(k), b(k);
char x;
rep(i, h) {
flag = false;
rep(j, w) {
... | replace | 39 | 40 | 39 | 40 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
const ll MAX = 1e9;
int main() {
int h, w, k;
cin >> h >> w >> k;
V<string> c(h);
rep(i, h) cin >> c[i];
V<V<int>> ans(h, V<int>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
const ll MAX = 1e9;
int main() {
int h, w, k;
cin >> h >> w >> k;
V<string> c(h);
rep(i, h) cin >> c[i];
V<V<int>> ans(h, V<int>... | replace | 27 | 28 | 27 | 28 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
constexpr int64_t mod = 1e9 + 7;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for (auto &&e : s) {
cin >> e;
}
vector<vector<int>> number(h, vector<int>(w, 0));
int cnt = 1;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w;... | #include <bits/stdc++.h>
using namespace std;
constexpr int64_t mod = 1e9 + 7;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for (auto &&e : s) {
cin >> e;
}
vector<vector<int>> number(h, vector<int>(w, 0));
int cnt = 1;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w;... | replace | 40 | 41 | 40 | 41 | -11 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
vector<vector<int>> num(h, vector<int>(w, 0));
int now = 1, okheight;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
vector<vector<int>> num(h, vector<int>(w, 0));
int now = 1, okheight;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
i... | replace | 52 | 53 | 52 | 53 | 0 | |
p02855 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 305;
int h, w, k;
char mat[N][N];
int ans[N][N];
int main() {
scanf("%d %d %d", &h, &w, &k);
for (int i = 0; i < h; i++)
scanf(" %s", mat[i]);
int cnt = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 305;
int h, w, k;
char mat[N][N];
int ans[N][N];
int main() {
scanf("%d %d %d", &h, &w, &k);
for (int i = 0; i < h; i++)
scanf(" %s", mat[i]);
int cnt = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
... | insert | 43 | 43 | 43 | 50 | TLE | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int contains(string s) {
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '#') {
return 1;
}
}
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int H, W, K;
cin >> H >> W >> K;
vector<vector<int>> res(H, vector<int>(W))... | #include <bits/stdc++.h>
using namespace std;
int contains(string s) {
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '#') {
return 1;
}
}
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int H, W, K;
cin >> H >> W >> K;
vector<vector<int>> res(H, vector<int>(W))... | replace | 42 | 43 | 42 | 43 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, K;
cin >> H >> W >> K;
vector<string> s(H);
for (int i = 0; i < H; i++) {
cin >> s[i];
}
int num = 0;
vector<vector<int>> ans(H, vector<int>(K, 0));
for (int i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, K;
cin >> H >> W >> K;
vector<string> s(H);
for (int i = 0; i < H; i++) {
cin >> s[i];
}
int num = 0;
vector<vector<int>> ans(H, vector<int>(W, 0));
for (int i ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
char Grid[110][110];
int Ans[110][110], P;
int main() {
int H, W, K;
cin >> H >> W >> K;
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
cin >> Grid[i][j];
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
if (Grid[i][j] == '#') {
... | #include <bits/stdc++.h>
using namespace std;
char Grid[310][310];
int Ans[310][310], P;
int main() {
int H, W, K;
cin >> H >> W >> K;
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
cin >> Grid[i][j];
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
if (Grid[i][j] == '#') {
... | replace | 2 | 4 | 2 | 4 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int N = 305;
int ans[N][N];
int main() {
int h, w, _;
char mat[N][N];
scanf("%d %d %d", &h, &w, &_);
for (int i = 0; i < h; i++) {
scanf("%s", mat[... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int N = 305;
int ans[N][N];
int main() {
int h, w, _;
char mat[N][N];
scanf("%d %d %d", &h, &w, &_);
for (int i = 0; i < h; i++) {
scanf("%s", mat[... | replace | 21 | 23 | 21 | 23 | 0 | |
p02855 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
int64_t H, W, K;
cin >> H >> W >> K;
vector<string> s(H);
for (int64_t i = 0; i < H; i++) {
cin >> s[i];
}
vector<vector<int64_t>> ans(H, vector<int64_t>(W, -1));
int64_t index = 1;
for (int64_t i = 0; i < H; i++) {
int64_t num = 0;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int64_t H, W, K;
cin >> H >> W >> K;
vector<string> s(H);
for (int64_t i = 0; i < H; i++) {
cin >> s[i];
}
vector<vector<int64_t>> ans(H, vector<int64_t>(W, -1));
int64_t index = 1;
for (int64_t i = 0; i < H; i++) {
int64_t num = 0;
... | replace | 38 | 39 | 38 | 53 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | replace | 54 | 55 | 54 | 55 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for (int i = 0; i < h; ++i) {
cin >> s[i];
}
vector<int> cnt(h);
for (int i = 0; i < h; ++i) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for (int i = 0; i < h; ++i) {
cin >> s[i];
}
vector<int> cnt(h);
for (int i = 0; i < h; ++i) ... | insert | 65 | 65 | 65 | 67 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | replace | 42 | 48 | 42 | 49 | 0 | |
p02855 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | replace | 42 | 43 | 42 | 43 | 0 | |
p02855 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
string tmp;
vector<vector<int>> ans;
for (int i = 0; i < H; i++) {
ans.emplace_back(vector<int>(W, 0));
}
int S = 1;
vector<bool> is_exist(W, false);
for (i... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
string tmp;
vector<vector<int>> ans;
for (int i = 0; i < H; i++) {
ans.emplace_back(vector<int>(W, 0));
}
int S = 1;
vector<bool> is_exist(W, false);
for (i... | replace | 61 | 62 | 61 | 66 | TLE | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
retur... | insert | 94 | 94 | 94 | 95 | 0 | |
p02855 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <new>
#include <queue>
#include <random>
#include <set>
#include <sstrea... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <new>
#include <queue>
#include <random>
#include <set>
#include <sstrea... | replace | 47 | 49 | 47 | 49 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi =... | replace | 60 | 61 | 60 | 61 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) ll(x.size())
using namespace std;
int main() {
ll h, w, k, kind = 1;
char s;
cin >> h >> w >> k;
vector<vector<ll>> a(h, vector<ll>(w));
rep(i, h) rep(j, w) {
cin >> s;
if (s == '#') {
a.... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define sz(x) ll(x.size())
using namespace std;
int main() {
ll h, w, k, kind = 1;
char s;
cin >> h >> w >> k;
vector<vector<ll>> a(h, vector<ll>(w));
rep(i, h) rep(j, w) {
cin >> s;
if (s == '#') {
a.... | replace | 40 | 41 | 40 | 41 | 0 | |
p02855 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<vector<int>> ichigo;
int main() {
int H, W, K;
cin >> H >> W >> K;
ichigo.resize(H);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
char c;
cin >> c;
if (c == '#')
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<vector<int>> ichigo;
int main() {
int H, W, K;
cin >> H >> W >> K;
ichigo.resize(H);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
char c;
cin >> c;
if (c == '#')
... | replace | 29 | 30 | 29 | 30 | 0 | |
p02855 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
int sup = h;
vector<vector<int>> cnt(h);
string *s = new string[h];
int **ans = new int *[h];
for (int i = 0; i < h; i++) {
ans[i] = new int[w];
cin >> s[i];
int sz = 0... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
int sup = h;
vector<vector<int>> cnt(h);
string *s = new string[h];
int **ans = new int *[h];
for (int i = 0; i < h; i++) {
ans[i] = new int[w];
cin >> s[i];
int sz = 0... | replace | 64 | 65 | 64 | 65 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVSORT(v) sort(... | replace | 40 | 41 | 40 | 41 | 0 | |
p02855 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>
// 使い方がよくわからない
#include <bitset>
#include <queue>
#include <sstream>
#include <stack>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define co(x) cout << x... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>
// 使い方がよくわからない
#include <bitset>
#include <queue>
#include <sstream>
#include <stack>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define co(x) cout << x... | replace | 38 | 39 | 38 | 39 | 0 | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | replace | 53 | 54 | 53 | 54 | 0 | |
p02855 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1LL << 62)
#defin... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1LL << 62)
#defin... | replace | 59 | 71 | 59 | 72 | TLE | |
p02855 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> ... | replace | 69 | 72 | 69 | 70 | -11 | |
p02856 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LARB 1
#define RARB 30000
#define inf 1e18
#define zeros(x) ((x ^ (x - 1)) & x)
#define endl '\n'
#define eps 1e-9
#define mod 1000000007
#define NMAX 300
using namespace std;
typedef long long ll;
typedef long double ld;
ll d, c, tot, sum, n;
vector<pair<ll, ll>> Init;
ll norm(ll &... | #include <bits/stdc++.h>
#define LARB 1
#define RARB 30000
#define inf 1e18
#define zeros(x) ((x ^ (x - 1)) & x)
#define endl '\n'
#define eps 1e-9
#define mod 1000000007
#define NMAX 300
using namespace std;
typedef long long ll;
typedef long double ld;
ll d, c, tot, sum, n;
vector<pair<ll, ll>> Init;
ll norm(ll &... | replace | 94 | 95 | 94 | 95 | 0 | |
p02856 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size(... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size(... | replace | 593 | 594 | 593 | 594 | 0 | |
p02856 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long
ll; // -9,223,372,036,854,775,808 から 9,223,372,036,854,775,807
template <class T> using vec = std::vector<T>;
template <class T> using vec2 = vec<vec<T>>;
template <class T> using vec3 = vec<vec<vec<T>>>;
// #define DEBUG
void pushAsDigits(vec<int>... | #include <bits/stdc++.h>
using namespace std;
typedef long long
ll; // -9,223,372,036,854,775,808 から 9,223,372,036,854,775,807
template <class T> using vec = std::vector<T>;
template <class T> using vec2 = vec<vec<T>>;
template <class T> using vec3 = vec<vec<vec<T>>>;
// #define DEBUG
void pushAsDigits(vec<int>... | replace | 67 | 68 | 67 | 68 | 0 | |
p02856 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9 + 7;
ll c[100100], d[100100];
int main() {
int m;
cin >> m;
rep(i, m) cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9 + 7;
ll c[200100], d[200100];
int main() {
int m;
cin >> m;
rep(i, m) cin >>... | replace | 8 | 9 | 8 | 9 | 0 | |
p02856 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | replace | 64 | 65 | 64 | 65 | TLE | |
p02856 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | insert | 64 | 64 | 64 | 66 | TLE | |
p02856 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int sum, tot;
int d[100001];
int c[100001];
int n;
signed main() {
int n;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &c[i], &d[i]);
tot += d[i];
sum += d[i] * c[i];
}
printf("%lld", (sum - 1) / 9 + tot - 1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int sum, tot;
int d[1000001];
int c[1000001];
int n;
signed main() {
int n;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &c[i], &d[i]);
tot += d[i];
sum += d[i] * c[i];
}
printf("%lld", (sum - 1) / 9 + tot -... | replace | 4 | 6 | 4 | 6 | 0 | |
p02856 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#incl... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#incl... | replace | 33 | 34 | 33 | 34 | TLE | |
p02856 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#in... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#in... | replace | 372 | 373 | 372 | 373 | TLE | |
p02856 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.e... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.e... | replace | 86 | 87 | 86 | 87 | TLE | |
p02856 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); \
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); \
cin... | replace | 17 | 18 | 17 | 18 | 0 | |
p02856 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | insert | 53 | 53 | 53 | 54 | TLE | |
p02856 | C++ | Runtime Error | #include <cstdio>
int m, d;
long long len, sum, c;
int main() {
scanf("%d", &m);
len = sum = -1;
for (int i = 0; i < m; ++i) {
scanf("%d%lld", d, c);
len += c;
sum += c * d;
}
printf("%lld\n", len + sum / 9);
}
| #include <cstdio>
int m, d;
long long len, sum, c;
int main() {
scanf("%d", &m);
len = sum = -1;
for (int i = 0; i < m; ++i) {
scanf("%d%lld", &d, &c);
len += c;
sum += c * d;
}
printf("%lld\n", len + sum / 9);
}
| replace | 8 | 9 | 8 | 9 | -11 | |
p02858 | Python | Runtime Error | from math import gcd
mod = 10**9 + 7
n, m, t = map(int, input().split())
a = gcd(n, t)
b = gcd(m, t)
n //= a
m //= b
ret = pow(2, n, mod) + pow(2, m, mod) + pow(2, gcd(n, m), mod) - 3
print(pow(ret, a * b, mod))
| from fractions import gcd
mod = 10**9 + 7
n, m, t = map(int, input().split())
a = gcd(n, t)
b = gcd(m, t)
n //= a
m //= b
ret = pow(2, n, mod) + pow(2, m, mod) + pow(2, gcd(n, m), mod) - 3
print(pow(ret, a * b, mod))
| replace | 0 | 1 | 0 | 1 | 0 | |
p02858 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
template <typename T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
while (b != 0) {
T tmp = b;
b = a % b;
a... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
template <typename T> T gcd(T a, T b) {
if (a < b)
swap(a, b);
while (b != 0) {
T tmp = b;
b = a % b;
a... | replace | 50 | 52 | 50 | 57 | 255 | |
p02859 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define mod 1000000007
int n, a, b, k, h, m, c;
int main() {
scanf("%d", a);
printf("%d", a * a);
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define mod 1000000007
int n, a, b, k, h, m, c;
int main() {
cin >> a;
cout << a * a;
return 0;
}
| replace | 7 | 9 | 7 | 9 | -11 | |
p02859 | C++ | Runtime Error | // Nihal Mittal - nihal_47
// Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀... | // Nihal Mittal - nihal_47
// Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀... | replace | 40 | 44 | 40 | 41 | 0 | |
p02859 | C++ | Runtime Error | // AUTHOR: *Akash Shrivastva*
// Birla Institute of Technology,Mesra,India
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define M 1000000007
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define pll vector<pair<ll, ll>>
#define F first
#define S seco... | // AUTHOR: *Akash Shrivastva*
// Birla Institute of Technology,Mesra,India
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define M 1000000007
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define pll vector<pair<ll, ll>>
#define F first
#define S seco... | delete | 19 | 23 | 19 | 19 | 0 | |
p02859 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <type_traits>
#include <utility>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <type_traits>
#include <utility>
#inclu... | replace | 55 | 56 | 55 | 56 | TLE | |
p02859 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
while (1) {
}
cout << r;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r;
cin >> r;
cout << r * r;
return 0;
} | replace | 7 | 10 | 7 | 9 | TLE | |
p02859 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
return r * r;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
cout << r * r;
} | replace | 6 | 7 | 6 | 7 | 4 | |
p02859 | C++ | Runtime Error | //
// main.cpp
// ABC124
//
// Created by hiroaki on 2019/05/07.
// Copyright © 2019年 hiroaki. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <tuple>
#include <vector>
// pair sort firstに揃う
#define int long long
#define double long double
#define Rap(n... | //
// main.cpp
// ABC124
//
// Created by hiroaki on 2019/05/07.
// Copyright © 2019年 hiroaki. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <tuple>
#include <vector>
// pair sort firstに揃う
#define int long long
#define double long double
#define Rap(n... | delete | 65 | 69 | 65 | 65 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02859 | Python | Runtime Error | r = input()
print(r**2)
| r = int(input())
print(r**2)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s029967199.py", line 2, in <module>
print(r ** 2)
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02859 | Python | Runtime Error | N = input()
print(N**2)
| N = int(input())
print(N**2)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s490869549.py", line 2, in <module>
print(N**2)
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02859 | Python | Runtime Error | r = int(input)
print(int(r**2))
| r = int(input())
print(int(r**2))
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s021145542.py", line 1, in <module>
r = int(input)
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'
|
p02859 | Python | Runtime Error | r = input()
ans = r * r
print(ans)
| r = int(input())
ans = r * r
print(ans)
| replace | 0 | 1 | 0 | 1 | TypeError: can't multiply sequence by non-int of type 'str' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s972374104.py", line 2, in <module>
ans = r * r
TypeError: can't multiply sequence by non-int of type 'str'
|
p02859 | Python | Runtime Error | r = int(input)
print(r**2)
| r = int(input())
print(r**2)
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s774524260.py", line 1, in <module>
r = int(input)
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'
|
p02859 | Python | Runtime Error | r = int(input().split())
print(r * r)
| r = int(input().strip())
print(r * r)
| 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/p02859/Python/s880229188.py", line 1, in <module>
r = int(input().split())
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'
|
p02859 | Python | Runtime Error | from sys import stdin
r = stdin.readline().rstrip()
print(r**2)
| from sys import stdin
r = int(stdin.readline().rstrip())
print(r**2)
| replace | 2 | 3 | 2 | 3 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s930082773.py", line 5, in <module>
print(r ** 2)
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02859 | Python | Runtime Error | r = int(input)
x = r**2
print(x)
| r = int(input())
x = r**2
print(x)
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s925177470.py", line 1, in <module>
r = int(input)
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'
|
p02859 | Python | Runtime Error | print(int(input() ** 2))
| print(int(input()) ** 2)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s090914848.py", line 1, in <module>
print(int(input()**2))
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02859 | Python | Runtime Error | r = input()
print(r**2)
| r = int(input())
print(r**2)
| replace | 0 | 1 | 0 | 1 | TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s447174511.py", line 2, in <module>
print(r**2)
TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'int'
|
p02859 | Python | Runtime Error | import sys
r = sys.argv[1]
print(int(r) ** 2)
| r = input()
print(int(r) ** 2)
| replace | 0 | 3 | 0 | 1 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02859/Python/s456514871.py", line 2, in <module>
r = sys.argv[1]
IndexError: list index out of range
|
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
if (n % 2 == 1) {
cout << "No" << endl;
} else {
for (int i = 0; i < n / 2; i++) {
if (s.at(i) != s.at(n / 2 + i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n % 2 == 1) {
cout << "No" << endl;
} else {
for (int i = 0; i < n / 2; i++) {
if (s.at(i) != s.at(n / 2 + i)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes... | insert | 8 | 8 | 8 | 9 | -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)
|
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int t = S.size();
if (t % 2 != 0)
cout << "No" << endl;
else {
vector<char> T(t);
for (int i = 0; i < t / 2; i++) {
T.at(i) = S.at(i);
T.at(i + 3) = S.at(i);
}
int c = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int t = S.size();
if (t % 2 != 0)
cout << "No" << endl;
else {
vector<char> T(t);
for (int i = 0; i < t / 2; i++) {
T.at(i) = S.at(i);
T.at(i + t / 2) = S.at(i);
}
int c = 0;
for (i... | replace | 13 | 14 | 13 | 14 | 0 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
string s;
cin >> n >> s;
if (n % 2 == 1) {
cout << "No" << endl;
return 1;
}
bool flag = true;
for (long long i = 0; i < n / 2; i++) {
if (s[i] != s[i + n / 2])
flag = false;
}
if (flag) {
cout << "Yes" << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
string s;
cin >> n >> s;
if (n % 2 == 1) {
cout << "No" << endl;
return 0;
}
bool flag = true;
for (long long i = 0; i < n / 2; i++) {
if (s[i] != s[i + n / 2])
flag = false;
}
if (flag) {
cout << "Yes" << ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02860 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
struct all_init {
all_init() { cout << fixed << setprecision(12... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
struct all_init {
all_init() { cout << fixed << setprecision(12... | insert | 22 | 22 | 22 | 23 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 3) > this->size() (which is 0)
|
p02860 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main(void) {
int n;
string s;
cin >> n >> s;
if (n % 2 == 1) {
cout << "No" << endl;
return 0;
}
string t0 = s.substr(0, 3), t1 ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main(void) {
int n;
string s;
cin >> n >> s;
if (n % 2 == 1) {
cout << "No" << endl;
return 0;
}
n >>= 1;
string t0 = s.substr... | replace | 15 | 16 | 15 | 17 | 0 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n % 2 == 1) {
cout << "No" << endl;
} else {
vector<char> hoge1(n / 2);
vector<char> hoge2(n / 2);
for (int i = 0; i < n; i++) {
if (i <= n / 2 - 1)
hoge1.at(i) = s... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n % 2 == 1) {
cout << "No" << endl;
} else {
vector<char> hoge1(n / 2);
vector<char> hoge2(n / 2);
for (int i = 0; i < n; i++) {
if (i <= n / 2 - 1)
hoge1.at(i) = s... | replace | 17 | 18 | 17 | 18 | 0 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
freopen("test.in", "r", stdin);
int n;
string s;
cin >> n >> s;
if (n % 2 == 1) {
cout << "No";
return 0;
}
string a = "";
for (int k = 0; k < n / 2; k++)
a += s[k];
a = a + a;
if (a == s)
cout << "Yes";
else
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("test.in","r",stdin);
int n;
string s;
cin >> n >> s;
if (n % 2 == 1) {
cout << "No";
return 0;
}
string a = "";
for (int k = 0; k < n / 2; k++)
a += s[k];
a = a + a;
if (a == s)
cout << "Yes";
else
cout << ... | replace | 4 | 5 | 4 | 5 | -11 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
bool flag = true;
// Nが奇数のときは必ず'NO'
if (N % 2 == 1)
flag = false;
else {
for (int i = 0; i < S.size(); i++) {
if (S.at(i) != S.at(i + N / 2)) {
flag = false;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
bool flag = true;
// Nが奇数のときは必ず'NO'
if (N % 2 == 1)
flag = false;
else {
for (int i = 0; i < N / 2; i++) {
if (S.at(i) != S.at(i + N / 2)) {
flag = false;
break;
}
}... | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 6) >= this->size() (which is 6)
|
p02860 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
int n;
cin >> n;
n = 6;
string s;
cin >> s;
if (n % 2 == 0) {
int t = n / 2;
string k = s.subs... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (n % 2 == 0) {
int t = n / 2;
string k = s.substr(0, t);... | delete | 11 | 12 | 11 | 11 | 0 | |
p02860 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N;
cin >> s;
int n;
n = N / 2;
int i = 0;
if (N % 2 == 1) {
cout << "No";
} else {
int b = 1;
while (i < n) {
if (s.at(i) != s.at(i + n)) {
b = 0;
}
}
if (b == 1) {
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
cin >> N;
cin >> s;
int n;
n = N / 2;
int i = 0;
if (N % 2 == 1) {
cout << "No";
} else {
int b = 1;
for (int i; i < n; i++) {
if (s.at(i) != s.at(i + n)) {
b = 0;
}
}
if (b == 1) {
... | replace | 18 | 19 | 18 | 19 | TLE | |
p02860 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2 != 0) {
cout << "No" << endl;
return -1;
}
string s;
cin >> s;
const int m = n / 2;
string p1 = s.substr(0, m);
string p2 = s.substr(m, m);
if (p1 == p2) {
cout << "Yes" << endl;
} el... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2 != 0) {
cout << "No" << endl;
return 0;
}
string s;
cin >> s;
const int m = n / 2;
string p1 = s.substr(0, m);
string p2 = s.substr(m, m);
if (p1 == p2) {
cout << "Yes" << endl;
} els... | replace | 10 | 11 | 10 | 11 | 0 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
if (N % 2 == 1) {
cout << "No" << endl;
return 0;
}
string s1;
s1 = S.substr(3);
S = S.erase(3);
if (s1 == S) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
if (N % 2 == 1) {
cout << "No" << endl;
return 0;
}
string s1;
s1 = S.substr(N / 2);
S = S.erase(N / 2);
if (s1 == S) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
... | replace | 16 | 18 | 16 | 18 | 0 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
string ans = "Yes";
if (S.size() % 2 != 0) {
ans = "No";
}
for (int i = 0; i < N; i++) {
if (S.at(i) != S.at(N / 2 + i)) {
ans = "No";
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
string ans = "Yes";
if (S.size() % 2 != 0) {
ans = "No";
}
for (int i = 0; i < N / 2; i++) {
if (S.at(i) != S.at(N / 2 + i)) {
ans = "No";
break;
}
}
cout << ans << endl;
}
| replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 6) >= this->size() (which is 6)
|
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
scanf("%d", &n);
cin >> s;
if (n % 2 != 0) {
cout << "No"
<< "\n";
} else {
if (s.substr(0, n / 2) == s.substr(n / 2, string::npos))
cout << "Yes\n";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
if (n % 2 != 0) {
cout << "No"
<< "\n";
} else {
if (s.substr(0, n / 2) == s.substr(n / 2, string::npos))
cout << "Yes\n";
else
cou... | replace | 8 | 10 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 3) > this->size() (which is 0)
|
p02860 | C++ | Runtime Error | #include <iostream>
using namespace std;
const string YES = "Yes";
const string NO = "No";
void solve(long long N, std::string S) {
if (N % 2)
cout << NO << '\n';
else {
string s1 = S.substr(0, N / 2);
string s2 = S.substr(N / 2);
if (s1 == s2)
cout << YES << '\n';
else
cout << NO ... | #include <iostream>
using namespace std;
const string YES = "Yes";
const string NO = "No";
void solve(long long N, std::string S) {
if (N % 2)
cout << NO << '\n';
else {
string s1 = S.substr(0, N / 2);
string s2 = S.substr(N / 2);
if (s1 == s2)
cout << YES << '\n';
else
cout << NO ... | replace | 23 | 24 | 23 | 24 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 3) > this->size() (which is 0)
|
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
string s;
cin >> r;
cin >> s;
if (r % 2 != 0) {
printf("No");
} else {
if (s.substr(0, 3) == (s.substr(3, 6))) {
printf("Yes");
} else
printf("No");
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r;
string s;
cin >> r;
cin >> s;
if (r % 2 != 0) {
printf("No");
} else {
if (s.substr(0, r / 2) == (s.substr(r / 2, r))) {
printf("Yes");
} else
printf("No");
}
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string tmp;
cin >> n >> tmp;
vector<string> str(n);
for (int i = 0; i < n; ++i)
str.at(i) = tmp[i];
sort(str.begin(), str.end());
if (n < 2) {
cout << "No";
return 0;
}
for (int i = 0; i < n; i = i + 2) {
if (str[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string tmp;
cin >> n >> tmp;
vector<string> str(n);
for (int i = 0; i < n; ++i)
str.at(i) = tmp[i];
sort(str.begin(), str.end());
if (n % 2 == 1) {
cout << "No";
return 0;
}
for (int i = 0; i < n; i = i + 2) {
if (s... | replace | 14 | 15 | 14 | 15 | 0 | |
p02860 | Python | Runtime Error | def solve(string):
n, s = string.split()
n = int(n)
return "Yes" if s[: n // 2] == s[n // 2 :] else "No"
if __name__ == "__main__":
print(solve(input()))
| def solve(string):
n, s = string.split()
n = int(n)
return "Yes" if s[: n // 2] == s[n // 2 :] else "No"
if __name__ == "__main__":
print(solve("\n".join([input(), input()])))
| replace | 7 | 8 | 7 | 8 | ValueError: not enough values to unpack (expected 2, got 1) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02860/Python/s478771892.py", line 8, in <module>
print(solve(input()))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02860/Python/s478771892.py", line 2, in solve
n, s = string.spli... |
p02860 | Python | Runtime Error | N = int(input())
S = int(input())
if N % 2 != 0:
print("No")
else:
arr = list(S)
s_len = len(arr) // 2
if arr[s_len:] == arr[:s_len]:
print("Yes")
else:
print("No")
| N = int(input())
S = input()
if N % 2 != 0:
print("No")
else:
arr = list(S)
s_len = len(arr) // 2
if arr[s_len:] == arr[:s_len]:
print("Yes")
else:
print("No")
| replace | 1 | 2 | 1 | 2 | ValueError: invalid literal for int() with base 10: 'abcabc' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02860/Python/s186953339.py", line 2, in <module>
S = int(input())
ValueError: invalid literal for int() with base 10: 'abcabc'
|
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
int n;
cin >> n, s;
bool ans = true;
if (n % 2 == 1)
ans = false;
else {
rep(i, n / 2) {
if (s.at(i) != s.at(i + n / 2))
ans = false;
}
}
if (ans)
cout << "Yes... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
int n;
cin >> n >> s;
bool ans = true;
if (n % 2 == 1)
ans = false;
else {
rep(i, n / 2) {
if (s.at(i) != s.at(i + n / 2))
ans = false;
}
}
if (ans)
cout << "Y... | replace | 6 | 7 | 6 | 7 | -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)
|
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int i;
cin >> N;
cin >> S;
int a;
a = N / 2;
if (N % 2 == 1) {
cout << "No" << endl;
return 0;
} else {
for (i == 0; i < N; i++) {
if (S.at(i) == S.at(i + a)) {
} else {
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int i;
cin >> N;
cin >> S;
int a;
a = N / 2;
if (N % 2 == 1) {
cout << "No" << endl;
return 0;
} else {
for (i == 0; i < a; i++) {
if (S.at(i) == S.at(i + a)) {
} else {
cout << "No" << endl;
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02860 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
// n = 10;
// s = "aabbcaabbc";
if (n % 2 == 1) {
printf("No");
return 0;
}
const char *ss = s.c_str();
for (int i = 0; i < n / 2; i++) {
if (ss[i] != ss[i + n / 2]) {
printf("No");
... | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
// n = 10;
// s = "aabbcaabbc";
if (n % 2 == 1) {
printf("No");
return 0;
}
const char *ss = s.c_str();
for (int i = 0; i < n / 2; i++) {
if (ss[i] != ss[i + n / 2]) {
printf("No");
... | replace | 26 | 27 | 26 | 28 | 3 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
bool nazo = true;
for (int i = 0; i < S.size() / 2; i++) {
if (S.at(i) == S.at(i + 3)) {
nazo = true;
} else {
nazo = false;
break;
}
}
if (N == 1) {
nazo = false;
}
if (nazo) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
bool nazo = true;
if (N % 2 == 0 && S.substr(0, N / 2) == S.substr(N / 2, N)) {
nazo = true;
} else {
nazo = false;
}
if (N == 1) {
nazo = false;
}
if (nazo) {
cout << "Yes";
} else {
cou... | replace | 7 | 15 | 7 | 11 | 0 | |
p02860 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N % 2 == 0) {
int center = N / 2;
for (int i = 0; i < N; i++) {
if (S.at(i) != S.at(i + center)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else
cout ... | #include <iostream>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if (N % 2 == 0) {
int center = N / 2;
for (int i = 0; i < center; i++) {
if (S.at(i) != S.at(i + center)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} else
... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 6) >= this->size() (which is 6)
|
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define prin(a) cout << (a) << endl
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define prin(a) cout << (a) << endl
using ll = int64_t;
using namespace std;
// define gcd and lcm (using 64bit)
ll gcd(ll a, ll b) {
if (a < b) {
//^はxor(bitwise operator)。以下三行でswap(a,b)を行っている。
a ^= b;
b ^= a;
a ^= b;
}
// ... | replace | 30 | 31 | 30 | 31 | 0 | |
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int cnt = 0;
if (N % 2 != 0) {
cout << "No" << endl;
} else {
rep(i, N) {
if (S.at(i) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int cnt = 0;
if (N % 2 != 0) {
cout << "No" << endl;
} else {
rep(i, N / 2) {
if (S.at... | replace | 16 | 17 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 6) >= this->size() (which is 6)
|
p02860 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string S;
getline(cin, S);
if (n % 2 == 0 && (S.substr(0, n / 2) == S.substr(n / 2, n))) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string S;
cin >> S;
if (n % 2 == 0 && (S.substr(0, n / 2) == S.substr(n / 2, n))) {
cout << "Yes";
} else {
cout << "No";
}
} | replace | 9 | 10 | 9 | 10 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 3) > this->size() (which is 0)
|
p02860 | Python | Runtime Error | n = int(input())
s = input()
ans = "No"
if n % 2 == 0:
ans = "Yes"
for i in range(n / 2):
if s[i] != s[n / 2 + i]:
ans = "No"
break
print(ans)
| n = int(input())
s = input()
ans = "No"
if n % 2 == 0:
ans = "Yes"
for i in range(n // 2):
if s[i] != s[n // 2 + i]:
ans = "No"
break
print(ans)
| replace | 5 | 7 | 5 | 7 | TypeError: 'float' object cannot be interpreted as an integer | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02860/Python/s022164402.py", line 6, in <module>
for i in range(n / 2):
TypeError: 'float' object cannot be interpreted as an integer
|
p02861 | Python | Runtime Error | import sys
from itertools import permutations
from math import factorial
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def distance2(x1, y1, x2, y2):
return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
def main():
N = int(readline... | import sys
from itertools import permutations
from math import factorial
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def distance2(x1, y1, x2, y2):
return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
def main():
N = int(readline... | replace | 22 | 23 | 22 | 23 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.