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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02722 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#def... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#def... | delete | 73 | 77 | 73 | 73 | TLE | |
p02722 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
int yakusuu(long long a) {
int count = 0;
for (int i = 2; i <= sqrt(a); i++) {
if (a % i == 0) {
if (i == sqrt(a))
count++;
else
count += 2;
}
}
count++;
return count;
}
int main() {
long long n;
cin >> n;
long long cou... |
#include <bits/stdc++.h>
using namespace std;
int yakusuu(long long a) {
int count = 0;
for (int i = 2; i <= sqrt(a); i++) {
if (a % i == 0) {
if (i == sqrt(a))
count++;
else
count += 2;
}
}
count++;
return count;
}
int main() {
long long n;
cin >> n;
long long cou... | replace | 25 | 26 | 25 | 26 | 0 | |
p02722 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (int i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll ans = 0;
ll calc(ll n, ll k) {
if (n % k == 0)
return n / k;
else
return n - k;
}
vector<ll> divisor(ll n) {
vector<ll> div;
for (ll i = 1; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (int i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll ans = 0;
ll calc(ll n, ll k) {
if (n % k == 0)
return n / k;
else
return n - k;
}
vector<ll> divisor(ll n) {
vector<ll> div;
for (ll i = 1; i ... | insert | 37 | 37 | 37 | 40 | TLE | |
p02722 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | replace | 865 | 866 | 865 | 866 | TLE | |
p02722 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define N 400050
#define int long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define coffee prince
#define sz(a) (int)a.size()
#define ll long long
#define SIZE N
using namespace std;
ll n, ans;
set<ll> pr;
ll che(ll x) {
ll m = n;
while ((m... | #include <bits/stdc++.h>
#define N 400050
#define int long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define coffee prince
#define sz(a) (int)a.size()
#define ll long long
#define SIZE N
using namespace std;
ll n, ans;
set<ll> pr;
bool che(int x) {
if (x < 2 || x > n... | replace | 14 | 15 | 14 | 17 | TLE | |
p02722 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
bool check(ll n, ll a) {
ll c = n;
while (c >= a) {
if (c % a == 0)
c /= a;
else
c %= a;
}
return (c == 1);
}
int main() {
ll n;
cin >> n;
vector<ll> v;
v.push_bac... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
bool check(ll n, ll a) {
ll c = n;
while (c >= a) {
if (c % a == 0)
c /= a;
else
c %= a;
}
return (c == 1);
}
int main() {
ll n;
cin >> n;
vector<ll> v;
v.push_bac... | replace | 21 | 22 | 21 | 23 | TLE | |
p02722 | C++ | Runtime Error | #define ll long long
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define fo(i, n) for (ll i = 0; i < n; i++)
// #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include ... | #define ll long long
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define fo(i, n) for (ll i = 0; i < n; i++)
// #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include ... | replace | 111 | 116 | 111 | 116 | 0 | |
p02722 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<ll> Yakusu(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<ll> Yakusu(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
res.push_back(i);
if (i * i != n)
res.push_b... | replace | 29 | 30 | 29 | 30 | -8 | |
p02722 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip> //double精度 setprecision
#include <iostream>
#include <map>
#include <numeric> //lcm
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#defi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip> //double精度 setprecision
#include <iostream>
#include <map>
#include <numeric> //lcm
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#defi... | replace | 92 | 93 | 92 | 93 | 0 | 1 5
1 6 2 3
6 2
|
p02722 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 2) {
cout << "1\n";
return 1;
}
double level = sqrt(n);
long long count = 2;
long long work;
long long j;
for (long long i = 2; i <= level; i++) {
if (n % i == 0) {
work = n;
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 2) {
cout << "1\n";
return 0;
}
double level = sqrt(n);
long long count = 2;
long long work;
long long j;
for (long long i = 2; i <= level; i++) {
if (n % i == 0) {
work = n;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02722 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> p;
typedef long long ll;
typedef pai... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> p;
typedef long long ll;
typedef pai... | replace | 30 | 31 | 30 | 31 | TLE | |
p02722 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
const int M = 1e6 + 7;
const int INF = 1e9 + 7;
ll ans = 0, n;
map<ll, bool> m1;
void check(ll x) {
if (x == 0)
return;
ll m = n;
while (m % x == 0)
m = m / x;
m = m % x;
if (m == 1) {
if (!m1[x]) {
an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
const int M = 1e6 + 7;
const int INF = 1e9 + 7;
ll ans = 0, n;
map<ll, bool> m1;
void check(ll x) {
if (x == 1)
return;
ll m = n;
while (m % x == 0)
m = m / x;
m = m % x;
if (m == 1) {
if (!m1[x]) {
an... | replace | 9 | 10 | 9 | 10 | TLE | |
p02722 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<long long> div(long long n) {
vector<long long> a;
for (int i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
a.push_back(i);
if (i * i != n)
a.push_back(n / i);
}
return a;
}
int main() {
long long n;
cin >> n;
long long ... | #include <bits/stdc++.h>
using namespace std;
vector<long long> div(long long n) {
vector<long long> a;
for (long long i = 1; i * i <= n; ++i) {
if (n % i != 0)
continue;
a.push_back(i);
if (i * i != n)
a.push_back(n / i);
}
return a;
}
int main() {
long long n;
cin >> n;
long... | replace | 6 | 7 | 6 | 7 | TLE | |
p02722 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define lli long long int
#define fr(i, a, b) for (lli i = a; i < b; i++)
#define bfr(i, a, b) for (lli i = a; i >= b; i--)
#define fio ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define lli long long int
#define fr(i, a, b) for (lli i = a; i < b; i++)
#define bfr(i, a, b) for (lli i = a; i >= b; i--)
#define fio ... | delete | 26 | 31 | 26 | 26 | 0 | |
p02722 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using heaP = priority_queue<T, vector<T>... | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using heaP = priority_queue<T, vector<T>... | replace | 45 | 46 | 45 | 46 | TLE | |
p02722 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef vector<pii> vii;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_orde... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef vector<pii> vii;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_orde... | replace | 100 | 103 | 100 | 101 | 0 | |
p02722 | C++ | Runtime Error | #pragma GCC optimize("fast-math")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Woverflow"
#include <bits/stdc++.h>
using namespace std;
#define to_s to_string
#define MP make_pair
#define fi first
#define se second
#define pb push_back
// #define all(x) x.begin(... | #pragma GCC optimize("fast-math")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Woverflow"
#include <bits/stdc++.h>
using namespace std;
#define to_s to_string
#define MP make_pair
#define fi first
#define se second
#define pb push_back
// #define all(x) x.begin(... | insert | 146 | 146 | 146 | 148 | -11 | |
p02722 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
#define int ll
#define IOS ... | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
#define int ll
#define IOS ... | replace | 73 | 74 | 73 | 74 | TLE | |
p02722 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | replace | 71 | 72 | 71 | 72 | TLE | |
p02722 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include <string.h>
// #define _USE_MATH_DEFINES
// #include <math.h>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stri... | #include <stdio.h>
#include <stdlib.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include <string.h>
// #define _USE_MATH_DEFINES
// #include <math.h>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stri... | insert | 63 | 63 | 63 | 64 | TLE | |
p02722 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> ANS;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) {
ANS.push_back(i);
if (i * i != N)
ANS.push_back(N / i);
} else if ((N - 1) % i == 0) {
ANS.push_back(i);
if... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> ANS;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) {
ANS.push_back(i);
if (i * i != N)
ANS.push_back(N / i);
} else if ((N - 1) % i == 0) {
ANS.push_back(i);
if... | insert | 24 | 24 | 24 | 26 | TLE | |
p02722 | C++ | Time Limit Exceeded | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define error(args...) ... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define error(args...) ... | replace | 76 | 78 | 76 | 82 | TLE | |
p02722 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(a) (a).begin(), (a).end()
using ll = long long;
using pii = pair<int, int>;
bool check(ll n, ll x) {
while (n % x == 0)
n /= x;
return (n % x == 1);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(a) (a).begin(), (a).end()
using ll = long long;
using pii = pair<int, int>;
bool check(ll n, ll x) {
while (n % x == 0)
n /= x;
return (n % x == 1);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin ... | insert | 20 | 20 | 20 | 24 | 0 | |
p02722 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include ... | replace | 115 | 116 | 115 | 117 | TLE | |
p02723 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(3) == s.at(4) && s.at(5) == s.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | /*
In the name of ALLAH
Author : Raashid Anwar
*/
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int M = 1000000007;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
string s;
cin >> s;
if (s[2] == s[... | /*
In the name of ALLAH
Author : Raashid Anwar
*/
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int M = 1000000007;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// #endif
string s;
cin >> s;
if ... | replace | 14 | 17 | 14 | 17 | 0 | |
p02723 | C++ | Runtime Error | #include "stdio.h"
#include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length() < 6)
cout << "No";
else if (s[2] == s[3] && s[4] == s[5]) {
cout << "Yes";
} else
cout << "No";
return 1;
} | #include "stdio.h"
#include <iostream>
#include <string.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length() < 6)
cout << "No";
else if (s[2] == s[3] && s[4] == s[5]) {
cout << "Yes";
} else
cout << "No";
return 0;
} | replace | 14 | 15 | 14 | 15 | 1 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | insert | 4 | 4 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 2) >= this->size() (which is 0)
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
// Write from here.
char s[6];
cin >> s;
if (s[2] == s[3] && s[4] == s[5]) {
cout << "Yes\n";
} else {... | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[6];
cin >> s;
if (s[2] == s[3] && s[4] == s[5]) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
} | delete | 4 | 11 | 4 | 4 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define MAX 100005
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define mii map<int, int>
#define vi vector<int>
#define ff first
#define ss second
#define T ... | #include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define MAX 100005
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define mii map<int, int>
#define vi vector<int>
#define ff first
#define ss second
#define T ... | replace | 44 | 48 | 44 | 48 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(3) == s.at(4) && s.at(5) == s.at(6))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(5) == S.at(4)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define endl "\n"
#define loop(i, s, e) for (int i = s; i < e; i++)
#define int long long
#define mp make_pair
#define pii pair<int, int>
#define mset(a, f) memset(a, f, sizeof(a))
#define pb push_back
const int N = 2e6 + 6;
const int M =... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define endl "\n"
#define loop(i, s, e) for (int i = s; i < e; i++)
#define int long long
#define mp make_pair
#define pii pair<int, int>
#define mset(a, f) memset(a, f, sizeof(a))
#define pb push_back
const int N = 2e6 + 6;
const int M =... | delete | 33 | 38 | 33 | 33 | 0 | |
p02723 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <ctime>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ti = clock();
// start-----------------------------------------------
ll x, y, a, b, c;
cin >> x >> y >> a >> b ... | #include <algorithm>
#include <cmath>
#include <ctime>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ti = clock();
// start-----------------------------------------------
string s;
cin >> s;
if (s[2] == s[3] && ... | replace | 14 | 45 | 14 | 20 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string R;
cin >> R;
if (R.at(3) == R.at(4) && R.at(5) == R.at(6))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string R;
cin >> R;
if (R.at(2) == R.at(3) && R.at(4) == R.at(5))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02723 | C++ | Runtime Error | /**
* abc 160 a
* Kartikeya (doomsday861)
**/
#include <bits/stdc++.h>
#include <time.h>
#define ll long long
#define testcase \
ll t; \
cin >> t; ... | /**
* abc 160 a
* Kartikeya (doomsday861)
**/
#include <bits/stdc++.h>
#include <time.h>
#define ll long long
#define testcase \
ll t; \
cin >> t; ... | replace | 18 | 22 | 18 | 19 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a.at(3) == a.at(4) || a.at(5) == a.at(6)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if (a.at(2) == a.at(3) && a.at(4) == a.at(5)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| replace | 8 | 9 | 8 | 9 | -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)
|
p02723 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
char x[5];
int f = 0;
int e = 0;
for (int i = 0; i < 6; i++)
cin >> x[i];
// for(int i = 0; i < 6; i++)... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
char x[6];
for (int i = 0; i < 6; i++)
cin >> x[i];
// for(int i = 0; i < 6; i++) cout << x[i] << endl;
i... | replace | 11 | 14 | 11 | 12 | -6 | *** stack smashing detected ***: terminated
|
p02723 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif // ONLINE_JUDGE
string s;
cin >> s;
bool coffe = s.size() >= 5 && (s[2] == s[3]) && (s[4] == s[5]);
cout <<... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif // ONLINE_JUDGE
string s;
cin >> s;
bool coffe = s.size() >= 5 && (s[2] == s[3]) && (s[4]... | replace | 10 | 12 | 10 | 12 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
if (str.at(2) == str.at(3) && str.at(4) == str.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
if (str.at(2) == str.at(3) && str.at(4) == str.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 2) >= this->size() (which is 0)
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(fals... | replace | 10 | 14 | 10 | 14 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define sz(x) ((int)(x).size())
#define F first
#define S second
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input1.txt", "r", stdin);
// for writing output to output.t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define sz(x) ((int)(x).size())
#define F first
#define S second
int main() {
// #ifndef ONLINE_JUDGE
// for getting input from input.txt
// freopen("input1.txt", "r", stdin);
// for writing output t... | replace | 11 | 17 | 11 | 17 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 2) >= this->size() (which is 0)
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int YesFlag = 0;
if (S.at(2) == S.at(3)) {
YesFlag++;
}
if (S.at(4) == S.at(5)) {
YesFlag++;
}
if (YesFlag == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int YesFlag = 0;
if (S.at(2) == S.at(3)) {
YesFlag++;
}
if (S.at(4) == S.at(5)) {
YesFlag++;
}
if (YesFlag == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 2) >= this->size() (which is 0)
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s;
cin >> s;
assert((int)s.size() == 6);
if (s[2] == s[3] and s[4] == s[5]) {
cout << "Yes";
} else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
string s;
cin >> s;
assert((int)s.size() == 6);
if (s[2] == s[3] and s[4] == s[5]) {
cout << "Yes";
} else
cout <<... | replace | 5 | 9 | 5 | 9 | -6 | c835c8d0-a374-4592-ad34-ae42138ae6a4.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02723/C++/s087558683.cpp:14: int main(): Assertion `(int)s.size()==6' failed.
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string a;
if (a.at(2) == a.at(3) && a.at(4) == a.at(5)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string a;
cin >> a;
if (a.at(2) == a.at(3) && a.at(4) == a.at(5)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}
| insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 2) >= this->size() (which is 0)
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string ch;
cin >> ch;
bool ans = false;
if (ch.at(3) == ch.at(4) && ch.at(5) == ch.at(6)) {
ans == true;
}
if (ans) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string ch;
cin >> ch;
if (ch.at(2) == ch.at(3) && ch.at(4) == ch.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 6 | 11 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// 文字列
string str;
cin >> str;
if (str.at(3) == str.at(4) && str.at(5) == str.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// 文字列
string str;
cin >> str;
if (str.at(2) == str.at(3) && str.at(4) == str.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
getline(cin, s);
if ((s.at(3) == s.at(4)) && (s.at(5) == s.at(6)))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
getline(cin, s);
if ((s.at(2) == s.at(3)) && (s.at(4) == s.at(5)))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string mozi;
for (int i = 0; i < 6; i++) {
cin >> mozi.at(i);
}
if (mozi.at(2) == mozi.at(3) && mozi.at(4) == mozi.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string mozi;
cin >> mozi;
if (mozi.at(2) == mozi.at(3) && mozi.at(4) == mozi.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 5 | 8 | 5 | 6 | -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)
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<string> S(6);
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes";
}
else {
cout << "No";
}
} | replace | 5 | 10 | 5 | 14 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 6) >= this->size() (which is 6)
|
p02723 | C++ | Runtime Error | /******************************************
/@Author: LeafBelief
/@Date: 2020-04-04
/@Remark:
/@FileName: coffeestring
******************************************/
#include <bits/stdc++.h>
#define CSE(x, y) memset(x, y, sizeof(x))
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
#define FAST ... | /******************************************
/@Author: LeafBelief
/@Date: 2020-04-04
/@Remark:
/@FileName: coffeestring
******************************************/
#include <bits/stdc++.h>
#define CSE(x, y) memset(x, y, sizeof(x))
#define lowbit(x) (x & (-x))
#define INF 0x3f3f3f3f
#define FAST ... | delete | 23 | 26 | 23 | 23 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
S.size() == 6;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
S.size() == 6;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef long long ll;
typedef double dd;
#define pb push_back
#define mp make_pair
#define endl ... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef long long ll;
typedef double dd;
#define pb push_back
#define mp make_pair
#define endl ... | delete | 100 | 105 | 100 | 100 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1001001001;
int main() {
string s;
cin >> s;
string ans = (s[2] == s[3] && s[4] ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
typedef unsigned long long ull;
typedef long long ll;
const int INF = 1001001001;
int main() {
string s;
cin >> s;
string ans = (s[2] == s[3] && s[4] ... | delete | 17 | 18 | 17 | 17 | 1 | |
p02723 | C++ | Runtime Error | // Deep Godhani
// DAIICT
#include <bits/stdc++.h>
using namespace std;
#define N 100000000000
#define PI acos(-1)
#define INF LONG_LONG_MAX
#define NINF LONG_LONG_MIN
#define ll long long int
#define ld long double
#define precision(x, d) cout << fixed << setprecision(d) << x
#define FAST ... | // Deep Godhani
// DAIICT
#include <bits/stdc++.h>
using namespace std;
#define N 100000000000
#define PI acos(-1)
#define INF LONG_LONG_MAX
#define NINF LONG_LONG_MIN
#define ll long long int
#define ld long double
#define precision(x, d) cout << fixed << setprecision(d) << x
#define FAST ... | replace | 33 | 37 | 33 | 39 | 0 | |
p02723 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
char c[6];
scanf("%c%c%c%c%c%c", &c[0], &c[1], &c[2], &c[3], &c[4], c[5]);
if (c[4] == c[5] && c[2] == c[3])
printf("Yes");
else
printf("No");
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
char c[6];
scanf("%c%c%c%c%c%c", &c[0], &c[1], &c[2], &c[3], &c[4], &c[5]);
if (c[4] == c[5] && c[2] == c[3])
printf("Yes");
else
printf("No");
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02723 | C++ | Runtime Error | /*
Author - Bohot harami
Motive - Candidate Master banunga ek din
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Policy_based_Data_Structure
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
... | /*
Author - Bohot harami
Motive - Candidate Master banunga ek din
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Policy_based_Data_Structure
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
... | replace | 277 | 278 | 277 | 278 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool answer = false;
if (s.at(3) == s.at(4))
answer = true;
if (s.at(5) == s.at(6))
answer = true;
if (answer)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool answer = false;
if ((s.at(2) == s.at(3)) && (s.at(4) == s.at(5)))
answer = true;
if (answer)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 9 | 12 | 9 | 10 | -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)
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << (S.at(3) == S.at(4) && S.at(5) == S.at(6) ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << ((S.at(2) == S.at(3) && S.at(4) == S.at(5)) ? "Yes" : "No") << endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(3) == N.at(4) && N.at(5) == N.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
char a = S.at(2);
char b = S.at(3);
char c = S.at(4);
char d = S.at(5);
if (a == b && c == d) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 4 | 7 | 4 | 11 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if ((S.at(3) == S.at(4)) && (S.at(5) == S.at(6)))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if ((S.at(2) == S.at(3)) && (S.at(4) == S.at(5)))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | /*
h3110_fr13nd,
AUTHOR : @sam_jn
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<pair<int, int>, null_type, less_equal<pair<int, int>>,
// rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define boost ... | /*
h3110_fr13nd,
AUTHOR : @sam_jn
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<pair<int, int>, null_type, less_equal<pair<int, int>>,
// rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define boost ... | replace | 48 | 54 | 48 | 54 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if ((S.at(3) == S.at(4)) && (S.at(5) == S.at(6)))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if ((S.at(2) == S.at(3)) && (S.at(4) == S.at(5)))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s[2] == s[3] && s[4] == s[5])
cout << "Yes";
else
cout << "No";
return 0;
} | replace | 2 | 32 | 2 | 3 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(6) == 'e' && s.at(3) == 'f' && s.at(4) == 'f' && s.at(5) == 'e')
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(5) == s.at(4) && s.at(2) == s.at(3))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 6 | 7 | 6 | 7 | -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)
|
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(3) == s.at(4) && s.at(5) == s.at(6)) {
cout << "Yes";
} else {
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5)) {
cout << "Yes";
} else {
cout << "No";
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | delete | 58 | 62 | 58 | 58 | 0 | |
p02723 | C++ | Runtime Error | /* CREATED BY
STREAM_CIPHER
28-03-2020
*/
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
... | /* CREATED BY
STREAM_CIPHER
28-03-2020
*/
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a;
cin >> a;
if (a[2] == a[3] && a[4] == a[5])
cout << "Yes\n";
else
cout << "No... | replace | 11 | 15 | 11 | 12 | 0 | |
p02723 | C++ | Runtime Error | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); ... | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); ... | replace | 222 | 223 | 222 | 223 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 6 | 7 | 6 | 8 | 0 | |
p02723 | C++ | Runtime Error | /*
NO
TIME
TO
DIE
--007
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #include <boost/functional/hash.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long ... | /*
NO
TIME
TO
DIE
--007
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
// #include <boost/functional/hash.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long ... | replace | 48 | 52 | 48 | 52 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
return s[2] == s[3] && s[4] == s[5];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
if (s[2] == s[3] && s[4] == s[5])
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
}
| replace | 12 | 13 | 12 | 18 | 1 | |
p02723 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | delete | 61 | 65 | 61 | 61 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | /*
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
| |
| author : yash1399 Language : C ++ |
| college : MSIT |
| _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _... | /*
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
| |
| author : yash1399 Language : C ++ |
| college : MSIT |
| _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _... | delete | 40 | 44 | 40 | 40 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s.length() == 6) {
char x[6];
strcpy(x, s.c_str());
bool b = 0;
for (int i = 0; i < 2; i++) {
if (int(x[i]) < 97 || int(x[i]) > 122) {
b = 1;
break;
}
}
if (b == 0 && x[2] == ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
if (s.length() == 6) {
char x[7];
strcpy(x, s.c_str());
bool b = 0;
for (int i = 0; i < 2; i++) {
if (int(x[i]) < 97 || int(x[i]) > 122) {
b = 1;
break;
}
}
if (b == 0 && x[2] == ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
... | #include <bits/stdc++.h>
#include <math.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
... | delete | 25 | 30 | 25 | 25 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(3) == s.at(4) && s.at(5) == s.at(6)) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(5) == s.at(4)) {
cout << "Yes";
} else {
cout << "No";
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);
#define FO cout.tie(NULL);
#define FI cin.tie(NULL);
#define IN cin >>
#define OUT cout <<
#define loop(i, a, n) for (int i = a; i < n; i++)
#define rloop(i, a, n) for (int i = a; i >= n; i--)
#define endl "\n";
#define p... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);
#define FO cout.tie(NULL);
#define FI cin.tie(NULL);
#define IN cin >>
#define OUT cout <<
#define loop(i, a, n) for (int i = a; i < n; i++)
#define rloop(i, a, n) for (int i = a; i >= n; i--)
#define endl "\n";
#define p... | replace | 66 | 67 | 66 | 67 | 0 | |
p02723 | C++ | Runtime Error | /*
KUNAL RAUT (ZUKONIT14) :- "DO WHAT YOU LIKE!"
-PICT,PUNE! :)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define mod9 1000000009
#define pi 3.... | /*
KUNAL RAUT (ZUKONIT14) :- "DO WHAT YOU LIKE!"
-PICT,PUNE! :)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define mod9 1000000009
#define pi 3.... | replace | 87 | 91 | 87 | 91 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
#define maxn 6
#define INF 0x3f3f3f3f
#define mod 1000000007
typedef long long ll;
using namespace std;
char buf[maxn];
void slove() {
cin >> buf;
if (buf[2] == buf[3] && buf[4] == buf[5])
cout << "Yes\n";
else
cout << "No\n";
}
int main() {
ios_base::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define maxn 6
#define INF 0x3f3f3f3f
#define mod 1000000007
typedef long long ll;
using namespace std;
char buf[maxn];
void slove() {
cin >> buf;
if (buf[2] == buf[3] && buf[4] == buf[5])
cout << "Yes\n";
else
cout << "No\n";
}
int main() {
ios_base::sync_with_stdio(false);... | replace | 21 | 26 | 21 | 22 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define ll long long
#define pb push_back
#define endl "\n"
#... | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#define ll long long
#define pb push_back
#define endl "\n"
#... | replace | 22 | 26 | 22 | 26 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(3) == s.at(4) && s.at(5) == s.at(6))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> S(6);
for (int i = 0; i < 6; i++) {
cin >> S.at(i);
}
if (S.at(3) == S.at(4) && S.at(5) == S.at(6)) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> S(6);
for (int i = 0; i < 6; i++) {
cin >> S.at(i);
}
if (S.at(2) == S.at(3) && S.at(4) == S.at(5)) {
cout << "Yes";
} else {
cout << "No";
}
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if ((a.at(3) == a.at(4)) && (a.at(5) == a.at(6))) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
if ((a.at(3) == a.at(2)) && (a.at(5) == a.at(4))) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02723 | C++ | Runtime Error | // coffee と似ているかを判定
#include <iostream>
int main(int argc, char const *argv[]) {
std::string input;
std::cin >> input;
if (input.at(3) == input.at(4) && input.at(5) == input.at(6)) {
std::cout << "Yes\n";
} else {
std::cout << "No\n";
}
return 0;
}
| // coffee と似ているかを判定
#include <iostream>
int main(int argc, char const *argv[]) {
std::string input;
std::cin >> input;
if (input.at(2) == input.at(3) && input.at(4) == input.at(5)) {
std::cout << "Yes\n";
} else {
std::cout << "No\n";
}
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02723 | C++ | Runtime Error |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#defin... |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#defin... | replace | 26 | 33 | 26 | 33 | 0 | |
p02723 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define test(t) \
ll int t; \
cin >> t; \... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define test(t) \
ll int t; \
cin >> t; \... | delete | 29 | 34 | 29 | 29 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
string s;
cin >> s;
bool flag = 0;
if (s[2] == s[3] && s[4] == s[5])
flag = 1;
if (flag)
cout << "Yes" <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
#endif
string s;
cin >> s;
bool flag = 0;
if (s[2] == s[3] && s[4] == s[5])
flag = 1;
if (flag)
cout << "Yes" ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02723 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i = 0;
for (int i = 0; i < s.length(); i++) {
/* code */
if (s[2] == s[3] and s[4] == s[5]) {
cout << "Yes" << endl;
i = 1;
}
}
if (i != 1) {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i = 0;
if (s[2] == s[3] and s[4] == s[5]) {
cout << "Yes" << endl;
i = 1;
}
if (i != 1) {
cout << "No" << endl;
}
} | replace | 7 | 13 | 7 | 10 | TLE | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
if (s.at(3) == s.at(4) && s.at(5) == s.at(6))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02723 | C++ | Runtime Error | // HE WHO TRAVELS THE FASTEST, TRAVELS ALONE
#include <bits/stdc++.h>
#include <stack>
using namespace std;
#define ORIGAMI ios_base::sync_with_stdio(false), cin.tie(NULL);
#define pb push_back
#define INF 1e18LL
#define ll long long int
vector<ll> adj[100000];
vector<bool> vis(100000, false);
ll mod = 998244353;
ll ... | // HE WHO TRAVELS THE FASTEST, TRAVELS ALONE
#include <bits/stdc++.h>
#include <stack>
using namespace std;
#define ORIGAMI ios_base::sync_with_stdio(false), cin.tie(NULL);
#define pb push_back
#define INF 1e18LL
#define ll long long int
vector<ll> adj[100000];
vector<bool> vis(100000, false);
ll mod = 998244353;
ll ... | replace | 65 | 69 | 65 | 69 | 0 | |
p02723 | C++ | Runtime Error | #include <stdio.h>
int main() {
char s[6];
int i;
for (i = 0; i < 6; i++) {
scanf("%s", s[i]);
}
if (s[2] == s[3] && s[4] == s[5]) {
printf("Yes");
} else {
printf("No");
}
return 0;
} | #include <stdio.h>
int main() {
char s[6];
int i;
for (i = 0; i < 6; i++) {
scanf("%s", &s[i]);
}
if (s[2] == s[3] && s[4] == s[5]) {
printf("Yes");
} else {
printf("No");
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02723 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(3) == s.at(4) && s.at(5) == s.at(6)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(2) == s.at(3) && s.at(4) == s.at(5)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| replace | 5 | 6 | 5 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.