problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03698 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main(void) {
string s;
cin >> s;
bool flag = true;
int N = s.length();
sort(s.begin(), s.end());
for (int i = 0; i <= N - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "no";
flag = false;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main(void) {
string s;
cin >> s;
bool flag = true;
int N = s.length();
sort(s.begin(), s.end());
for (int i = 0; i <= N - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "no";
flag = false;
... | [
"assignment.change"
] | 1,370,222 | 1,370,223 | u789417951 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main(void) {
string s;
cin >> s;
bool flag = true;
int N = s.length();
sort(s.begin(), s.end());
for (int i = 0; i <= N - 2; i++) {
if (s[i] == s[i + 1]) {
cout << "no";
flag = false;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main(void) {
string s;
cin >> s;
bool flag = true;
int N = s.length();
sort(s.begin(), s.end());
for (int i = 0; i <= N - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "no";
flag = false;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 1,370,224 | 1,370,223 | u789417951 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main(void) {
string s;
cin >> s;
bool flag = false;
int N = s.length();
sort(s.begin(), s.end());
for (int i = 0; i <= N - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "no";
flag = true;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
using namespace std;
int main(void) {
string s;
cin >> s;
bool flag = true;
int N = s.length();
sort(s.begin(), s.end());
for (int i = 0; i <= N - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "no";
flag = false;
... | [
"misc.opposites",
"variable_declaration.value.change",
"assignment.value.change",
"assignment.change"
] | 1,370,225 | 1,370,223 | u789417951 | cpp |
p03698 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
string S;
cin >> S;
bool flag;
FOR(i, 1, S.length()) {
REP(j, i) {
if (S[j] == S[i]) {
flag = false;
brea... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
string S;
cin >> S;
bool flag = true;
FOR(i, 1, S.length()) {
REP(j, i) {
if (S[j] == S[i]) {
flag = false;
... | [
"variable_declaration.value.change"
] | 1,370,226 | 1,370,227 | u244712228 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64, i64> P;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
int main() {
string s;
set... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64, i64> P;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
int main() {
string s;
cin... | [] | 1,370,237 | 1,370,238 | u852585808 | cpp |
p03698 | #include <bits/stdc++.h>
//---------------------------
using namespace std;
//---------------------------
#define REP(i, n) for (int i = 0; i < (n); i++)
#define P(x) cout << (x) << "\n"
#define MOD 1000000007 // 1e9+7
#define PI acos(-1.0)
#define ll long long int // 10^18
#define INF 1000000001 // 1e9+1
int dx[4]... | #include <bits/stdc++.h>
//---------------------------
using namespace std;
//---------------------------
#define REP(i, n) for (int i = 0; i < (n); i++)
#define P(x) cout << (x) << "\n"
#define MOD 1000000007 // 1e9+7
#define PI acos(-1.0)
#define ll long long int // 10^18
#define INF 1000000001 // 1e9+1
int dx[4]... | [
"literal.string.change",
"call.arguments.change"
] | 1,370,241 | 1,370,242 | u421777980 | cpp |
p03698 | #include <iostream>
using namespace std;
typedef long long ll;
static const ll Z = 1 << 21;
char s[Z];
int main() {
cin >> s;
char *p = &s[0];
while (*p) {
ll i = 1;
while (*(p++ + i)) {
if (*p == *(p + i++)) {
cout << "no" << endl;
;
return 0;
}
}
}
cout << "y... | #include <iostream>
using namespace std;
typedef long long ll;
static const ll Z = 1 << 21;
char s[Z];
int main() {
cin >> s;
char *p = &s[0];
while (*p) {
ll i = 1;
while (*(p + i)) {
if (*p == *(p + i++)) {
cout << "no" << endl;
;
return 0;
}
}
p++;
}
cou... | [
"control_flow.loop.condition.change",
"expression.unary.arithmetic.add"
] | 1,370,245 | 1,370,246 | u147154640 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 1,370,253 | 1,370,254 | u866107333 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool s_let = false;
for (int i = 0; i < s.size() - 1; ++i) {
for (int j = i + 1; j < s.size(); ++j) {
if (s[i] == s[j]) {
s_let = true;
break;
}
}
}
if (s_let)
cout << "No" <<... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool s_let = false;
for (int i = 0; i < s.size() - 1; ++i) {
for (int j = i + 1; j < s.size(); ++j) {
if (s[i] == s[j]) {
s_let = true;
break;
}
}
}
if (s_let)
cout << "no" <<... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,259 | 1,370,260 | u155088988 | cpp |
p03698 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
string s;
cin >> s;
int x = 1;
for (int i = 0; i < s.length(); i++) {
for (int j = 0; j < s.length(); j++) {
if (i == j) {
} else if (s[i] == s[j]) {
cout << "No" << endl;
return 0;
}
}
}
cout ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
string s;
cin >> s;
int x = 1;
for (int i = 0; i < s.length(); i++) {
for (int j = 0; j < s.length(); j++) {
if (i == j) {
} else if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,261 | 1,370,262 | u090967649 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j;
string s;
cin >> s;
bool flag = true;
for (i = 0; i < s.size(); i++) {
for (j = 0; j < s.size(); j++) {
if (i != j && s[i] == s[j]) {
flag = false;
}
}
}
if (flag) {
cout << 'yes' << endl;
} else {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j;
string s;
cin >> s;
bool flag = true;
for (i = 0; i < s.size(); i++) {
for (j = 0; j < s.size(); j++) {
if (i != j && s[i] == s[j]) {
flag = false;
}
}
}
if (flag) {
cout << "yes" << endl;
} else {
c... | [
"literal.string.change",
"io.output.change"
] | 1,370,263 | 1,370,264 | u928976909 | cpp |
p03698 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,269 | 1,370,270 | u227125252 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
for (int j = i + 1; j < S.size(); j++) {
if (S[i] == S[j]) {
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES" << endl;
}... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
for (int j = i + 1; j < S.size(); j++) {
if (S[i] == S[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,275 | 1,370,276 | u115888500 | cpp |
p03698 | #include <bits/stdc++.h>
// #include "bits/stdc++.h"
#define pout(n) printf("%d\n", n)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 0, s.length()) {
rep(j, i + 1, s.... | #include <bits/stdc++.h>
// #include "bits/stdc++.h"
#define pout(n) printf("%d\n", n)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 0, s.length()) {
rep(j, i + 1, s.... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,370,285 | 1,370,284 | u917715822 | cpp |
p03698 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"variable_declaration.remove"
] | 1,370,286 | 1,370,287 | u692336506 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define vsort(v) sort(v.begin(), v.end())
#define asort(a,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define vsort(v) sort(v.begin(), v.end())
#define asort(a,... | [
"expression.operation.binary.remove"
] | 1,370,288 | 1,370,289 | u810724221 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
int main() {
std::string s, t;
std::cin >> s;
std::sort(s.begin(), s.end());
t = s;
s.erase(std::unique(s.begin(), s.end()));
if (s == t) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
int main() {
std::string s, t;
std::cin >> s;
std::sort(s.begin(), s.end());
t = s;
s.erase(std::unique(s.begin(), s.end()) - s.begin());
if... | [
"expression.operation.binary.add"
] | 1,370,292 | 1,370,293 | u914739916 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a[100];
cin >> a;
int i, j;
bool flag = true;
for (i = 0; i < strlen(a); i++) {
for (j = i + 1; j < strlen(a); j++) {
if (a[i] == a[j])
flag = false;
}
}
if (flag == false)
cout << "No" << endl;
else
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
char a[100];
cin >> a;
int i, j;
bool flag = true;
for (i = 0; i < strlen(a); i++) {
for (j = i + 1; j < strlen(a); j++) {
if (a[i] == a[j])
flag = false;
}
}
if (flag == false)
cout << "no" << endl;
else
cout ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,294 | 1,370,295 | u226393020 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, a, b) for (int i = (int)(a - 1); i >= b; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, a, b) for (int i = (int)(a - 1); i >= b; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x... | [
"literal.string.change",
"io.output.change"
] | 1,370,299 | 1,370,300 | u601070043 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
for (j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
for (j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
return 0;
... | [] | 1,370,301 | 1,370,302 | u373958718 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
for (j = 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
for (j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
return 0;
... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 1,370,303 | 1,370,302 | u373958718 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
for (j = 0; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
for (j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
return 0;
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 1,370,304 | 1,370,302 | u373958718 | cpp |
p03698 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no";
return 0;
}
}
}
cout << "yes";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no";
return 0;
}
}
}
cout << "yes";
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,370,305 | 1,370,306 | u373958718 | cpp |
p03698 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using IP = pair<int, int>;
const ll INF = 1LL << 62;
#define atcoder(int) 1e9 + 7
#define Endl endl
#define mp make_pair
#define all(v) v.begin(), v.end()
#define pb push_back
ll gcd(ll a, ll b) { //最大公約数
if (a % b == 0)
return b;
else
g... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using IP = pair<int, int>;
const ll INF = 1LL << 62;
#define atcoder(int) 1e9 + 7
#define Endl endl
#define mp make_pair
#define all(v) v.begin(), v.end()
#define pb push_back
ll gcd(ll a, ll b) { //最大公約数
if (a % b == 0)
return b;
else
g... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,307 | 1,370,308 | u538244943 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string p;
int i, j;
cin >> p;
for (size_t i = 0; i < p.length(); i++) {
/* code */
for (size_t j = 0; j < p.length(); j++) {
/* code */
if (i != j) {
if (p[i] == p[j]) {
cout << "yes\n";
retur... | #include <iostream>
#include <string>
using namespace std;
int main() {
string p;
int i, j;
cin >> p;
for (size_t i = 0; i < p.length(); i++) {
/* code */
for (size_t j = 0; j < p.length(); j++) {
/* code */
if (i != j) {
if (p[i] == p[j]) {
cout << "no\n";
return... | [
"literal.string.change",
"io.output.change"
] | 1,370,309 | 1,370,310 | u363981555 | cpp |
p03698 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [
"control_flow.branch.if.condition.change"
] | 1,370,311 | 1,370,312 | u318334550 | cpp |
p03698 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,370,313 | 1,370,314 | u098844816 | cpp |
p03698 | #include <iostream>
#include <vector>
#define EACH(i, a) for (auto(i) = (a).begin(), _END = (a).end(); i != _END; ++i)
std::string S;
std::vector<int> cnt;
int main(void) {
std::cin >> S;
cnt.resize((int)('z' - 'a' + 1), 0);
bool f = true;
EACH(it, S) {
if (++cnt[*it - 'a'] >= 2) {
f = false;
... | #include <iostream>
#include <vector>
#define EACH(i, a) for (auto(i) = (a).begin(), _END = (a).end(); i != _END; ++i)
std::string S;
std::vector<int> cnt;
int main(void) {
std::cin >> S;
cnt.resize((int)('z' - 'a' + 1), 0);
bool f = true;
EACH(it, S) {
if (++cnt[*it - 'a'] >= 2) {
f = false;
... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,370,315 | 1,370,316 | u514809528 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pb push_back
#define P pair<int, int>
#define PP pair<P, int>
#define fi first
#define se second
#define INF (1 << 30)
#define MOD 1000000007
#define all(a) (a).begin(), (a).end()
signed main() {
string t;
cin >> t;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pb push_back
#define P pair<int, int>
#define PP pair<P, int>
#define fi first
#define se second
#define INF (1 << 30)
#define MOD 1000000007
#define all(a) (a).begin(), (a).end()
signed main() {
string t;
cin >> t;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,328 | 1,370,329 | u437391064 | cpp |
p03698 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | [
"expression.operation.unary.add"
] | 1,370,330 | 1,370,331 | u120810144 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
bool flag[26];
for (int i = 1; i <= s.size(); i++) {
if (flag[s[i - 1] - 'a'] == true) {
cout << "no" << endl;
return 0;
}
flag[s[i - 1] - 'a'] = true;
}
cout << "ye... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string s;
cin >> s;
bool flag[26] = {};
for (int i = 1; i <= s.size(); i++) {
if (flag[s[i - 1] - 'a'] == true) {
cout << "no" << endl;
return 0;
}
flag[s[i - 1] - 'a'] = true;
}
cout <... | [
"variable_declaration.value.change"
] | 1,370,338 | 1,370,339 | u990764614 | cpp |
p03698 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include ... | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,370,340 | 1,370,341 | u422592877 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (i... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (i... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,370,344 | 1,370,345 | u190907730 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
for (int j = 1; j < s.size(); j++) {
if (s.at(i) == s.at(j)) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s.at(i) == s.at(j)) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
}
| [
"control_flow.loop.for.initializer.change"
] | 1,370,346 | 1,370,347 | u392423112 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
bool same = false;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
bool same = false;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,355 | 1,370,357 | u197175300 | cpp |
p03698 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
REP(i, n) {
if (count(ALL(s), s[i]) != 1) {
cout << "no" << endl;
return 0;
}
}
cout << "Yes" ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
REP(i, n) {
if (count(ALL(s), s[i]) != 1) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,358 | 1,370,360 | u856232850 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
string a;
cin >> a;
int flag = 0;
for (int i = 0; i < a.size(); ++i) {
for (int j = 0; j < a.size(); ++j) {
if (a[i] == a[j]) {
flag = 1;
}
}
}
if (flag == 1) {
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
string a;
cin >> a;
int flag = 0;
for (int i = 0; i < a.size(); ++i) {
for (int j = i + 1; j < a.size(); ++j) {
if (a[i] == a[j]) {
flag = 1;
}
}
}
if (flag == 1) {
c... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,370,373 | 1,370,374 | u158620769 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
string ans = "yes";
for (int i = 0; i < n; i++) {
for (int j = i + i; j < n; j++) {
if (s[i] == s[j])
ans = "no";
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
string ans = "yes";
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (s[i] == s[j])
ans = "no";
}
}
cout << ans << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 1,370,379 | 1,370,381 | u953110527 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S.find(S[i]) != string::npos) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S.find(S[i], i + 1) != string::npos) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 1,370,382 | 1,370,384 | u013803727 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s;
char ta[26] = {};
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < i - 1; j++) {
if (s[i] == ta[j]) {
cout << "no" << endl;
return 0;
}
}
ta[i] = s[i];
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s;
char ta[26] = {};
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < i; j++) {
if (s[i] == ta[j]) {
cout << "no" << endl;
return 0;
}
}
ta[i] = s[i];
}
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,370,397 | 1,370,400 | u277153875 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long i = 0; i < n; i++)
#define erep(i, n) for (long i = 1; i <= n; i++)
int main() {
string S;
cin >> S;
string ans = "Yes";
rep(i, S.size() - 1) {
for (long j = i + 1; j < S.size(); j++) {
if (S.at(i) == S.at(j))
ans = "No... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long i = 0; i < n; i++)
#define erep(i, n) for (long i = 1; i <= n; i++)
int main() {
string S;
cin >> S;
string ans = "yes";
rep(i, S.size() - 1) {
for (long j = i + 1; j < S.size(); j++) {
if (S.at(i) == S.at(j))
ans = "no... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,370,411 | 1,370,412 | u362800497 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool x = true;
for (int i = 0; i < S.size() && x; i++) {
for (int j = 0; j < S.size(); j++) {
if (S.at(i) == S.at(j)) {
x = false;
break;
}
}
}
if (x) {
cout << "yes";
} el... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool x = true;
for (int i = 0; i < S.size() && x; i++) {
for (int j = 0; j < S.size(); j++) {
if (S.at(i) == S.at(j) && i != j) {
x = false;
break;
}
}
}
if (x) {
cout << "ye... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,370,415 | 1,370,416 | u235321041 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << endl
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> V;
int main() {
string s;
cin >> s;
int a[26];
for (int i = 0; i < (int)s.size(); i++)
a[s[i] - 'a']++;
bool x = true;
for (int i = 0; i < 26; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << endl
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> V;
int main() {
string s;
cin >> s;
int a[26] = {};
for (int i = 0; i < (int)s.size(); i++)
a[s[i] - 'a']++;
bool x = true;
for (int i = 0; i < 26; i++)... | [
"variable_declaration.value.change"
] | 1,370,426 | 1,370,428 | u572665222 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> st;
for (int i = 0; i < s.size(); i++) {
st.insert(s[i]);
}
if (st.size() == s.size())
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> st;
for (int i = 0; i < s.size(); i++) {
st.insert(s[i]);
}
if (st.size() == s.size())
cout << "yes";
else
cout << "no";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,429 | 1,370,431 | u218757546 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (i = 0; i < n; i++)
#define REPR(i, n) for (i = n; i >= 0; i--)
#define FOR(i, m, n) for (i = m; i < n; i++)
#define MOD 1000000007
using nam... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (i = 0; i < n; i++)
#define REPR(i, n) for (i = n; i >= 0; i--)
#define FOR(i, m, n) for (i = m; i < n; i++)
#define MOD 1000000007
using nam... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,436 | 1,370,438 | u768152935 | cpp |
p03698 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
int main() {
map<char, int> maps;
char s[30];
int t = 1;
scanf("%s", s);
for (int i = 0; i < strlen(s); i++) {
maps[s[i]]++;
if (maps[s[i]] == 2) {
t = 0;
break;
}
}
i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
int main() {
map<char, int> maps;
char s[30];
int t = 1;
scanf("%s", s);
for (int i = 0; i < strlen(s); i++) {
maps[s[i]]++;
if (maps[s[i]] == 2) {
t = 0;
break;
}
}
i... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,370,441 | 1,370,442 | u812003342 | cpp |
p03698 | #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 llong long long... | #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 llong long long... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,370,443 | 1,370,444 | u493750228 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
for (int j = i; j < S.size(); ++j) {
if (S[i] == S[j]) {
cout << "no" << endl;
}
}
}
cout << "ye... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
for (int j = i + 1; j < S.size(); ++j) {
if (S[i] == S[j]) {
cout << "no" << endl;
return 0;
}
... | [
"control_flow.loop.for.initializer.change",
"assignment.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,370,445 | 1,370,447 | u220562677 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main() {
str s;
cin >>... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main() {
str s;
cin >>... | [
"variable_declaration.type.change"
] | 1,370,455 | 1,370,457 | u780950519 | cpp |
p03698 | #include <algorithm>
#include <iostream>
int main(void) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
std::cout << "no" << std::endl;
return 0;
}
}
std::cout << "no" << std::endl;
return 0;
} |
#include <algorithm>
#include <iostream>
int main(void) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
std::cout << "no" << std::endl;
return 0;
}
}
std::cout << "yes" << std::endl;
return 0;
} | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,370,459 | 1,370,461 | u012984696 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <cstring>
#include <string.h>
using namespace std;
int main() {
string moji;
cin >> moji;
int n = moji.size();
int flag = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (moji[i] == moji[j]) {
flag = 1;
}
}
... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <string.h>
using namespace std;
int main() {
string moji;
cin >> moji;
int n = moji.size();
int flag = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (moji[i] == moji[j]) {
flag = 1;
}
}
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,370,462 | 1,370,464 | u945452839 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> cc;
int len = s.size();
bool Yes = true;
for (int i = 0; i < len; i++) {
if (cc.find(s[i]) != cc.end()) {
Yes = false;
break;
} else {
cc.insert(s[i]);
}
}
if (Yes)
cout << "Yes" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> cc;
int len = s.size();
bool Yes = true;
for (int i = 0; i < len; i++) {
if (cc.find(s[i]) != cc.end()) {
Yes = false;
break;
} else {
cc.insert(s[i]);
}
}
if (Yes)
cout << "yes" <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,472 | 1,370,473 | u024333896 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size();
bool ans = true;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
if (i != j && S.at(i) == S.at(j)) {
ans = false;
}
}
}
if (ans)
cout << "Yes" << endl;
el... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size();
bool ans = true;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
if (i != j && S.at(i) == S.at(j)) {
ans = false;
}
}
}
if (ans)
cout << "yes" << endl;
el... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,348 | 1,370,351 | u133391510 | cpp |
p03698 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "No" << endl;
return 0;... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,367 | 1,370,369 | u869009830 | cpp |
p03698 | #include <iostream>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
set<int> Set;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
Set.insert(S[i]);
}
if (Set.size() == S.size())
cout <... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
set<int> Set;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
Set.insert(S[i]);
}
if (Set.size() == S.size())
cout <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,372 | 1,370,375 | u575279726 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | [
"literal.string.change",
"io.output.change",
"control_flow.break.remove"
] | 1,370,377 | 1,370,380 | u846813901 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
int c[26];
bool ans = true;
for (int i = 0; i < s.size(); i++)
c[s[i] - 'a']++;
for (int i = 0; i < 26; i++) {
i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
int main() {
string s;
cin >> s;
int c[26] = {};
bool ans = true;
for (int i = 0; i < s.size(); i++)
c[s[i] - 'a']++;
for (int i = 0; i < 26; i++) {
... | [
"variable_declaration.value.change"
] | 1,370,383 | 1,370,386 | u033620890 | cpp |
p03698 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
bool flag = true;
for (int i = 0; i < S.size() - 1; i++) {
char f = S[i];
for (int j = i; j < S.size(); j++) {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
bool flag = true;
for (int i = 0; i < S.size() - 1; i++) {
char f = S[i];
for (int j = i + 1; j < S.size(); j++... | [
"control_flow.loop.for.initializer.change"
] | 1,370,399 | 1,370,402 | u520129469 | cpp |
p03698 | #include <bits/stdc++.h>
#define REP(i, n) for (long long 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 ll long l... | #include <bits/stdc++.h>
#define REP(i, n) for (long long 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 ll long l... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,422 | 1,370,425 | u179643082 | cpp |
p03698 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(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 ALL(x) (x).begin(), (x).end()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(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 ALL(x) (x).begin(), (x).end()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort... | [
"literal.string.change",
"io.output.change"
] | 1,370,476 | 1,370,477 | u032337012 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "no";
return 0;
}
}
cout << "yes";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,499 | 1,370,500 | u401900157 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length(); i++) {
if (s[i] == s[i + 1]) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "no";
return 0;
}
}
cout << "yes";
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,501 | 1,370,500 | u401900157 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[26];
fill_n(a, 26, 0);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
a[s[i] - '0']++;
}
for (int i = 0; i < 26; i++) {
if (a[i] >= 2) {
cout << "no" << endl;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[26];
fill_n(a, 26, 0);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
a[s[i] - 'a']++;
// cout << s[i]-'a' << endl;
}
for (int i = 0; i < 26; i++) {
if (a[i] >= 2)... | [
"literal.string.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,370,510 | 1,370,511 | u465669072 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool flg = true;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j])
flg = false;
}
}
if (flg)
cout << "yes" << endl;
else
cout << "no" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flg = true;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j])
flg = false;
}
}
if (flg)
cout << "yes" << endl;
else
cout << "no" << endl;
} | [] | 1,370,514 | 1,370,515 | u640800420 | cpp |
p03698 | // This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <utility>
#inc... | // This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <utility>
#inc... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,370,516 | 1,370,517 | u416108811 | cpp |
p03698 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) ... | [
"literal.string.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,370,532 | 1,370,533 | u999803454 | cpp |
p03698 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define PRINT(s) cout << s
#define PRINTS(s) cout << s << ' '
#define PRINTL(s) cout << s << endl
#define INF 2e9
#define ALL(v) v.begin(), v.end()... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define PRINT(s) cout << s
#define PRINTS(s) cout << s << ' '
#define PRINTL(s) cout << s << endl
#define INF 2e9
#define ALL(v) v.begin(), v.end()... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,534 | 1,370,535 | u069035678 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,549 | 1,370,550 | u196798307 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, s[200] = {}, result = 0, lamp = 1, in, ax;
string str;
cin >> str;
for (int i = 0; i < str.length(); i++) {
s[str[i] - 'a']++;
}
for (int i = 0; i < 30; i++) {
if (s[i] > 1) {
cout << "No";
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, s[200] = {}, result = 0, lamp = 1, in, ax;
string str;
cin >> str;
for (int i = 0; i < str.length(); i++) {
s[str[i] - 'a']++;
}
for (int i = 0; i < 30; i++) {
if (s[i] > 1) {
cout << "no";
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,561 | 1,370,562 | u018872912 | cpp |
p03698 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long int ll;
typedef std::numeric_limits<double> dbl;
const long long int LL_INF = 1LL ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long int ll;
typedef std::numeric_limits<double> dbl;
const long long int LL_INF = 1LL ... | [] | 1,370,565 | 1,370,566 | u300752229 | cpp |
p03698 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int len;
char s[100];
bool flag = true;
cin >> s;
len = strlen(s);
for (int i = 0; i < len; i++) {
for (int j = 0; j < len; j++) {
if (s[i] == s[j]) {
flag = false;
break;
}
}
}
if (flag) {
... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int len;
char s[27];
bool flag = true;
cin >> s;
len = strlen(s);
for (int i = 0; i < len; i++) {
for (int j = i + 1; j < len; j++) {
if (s[i] == s[j]) {
flag = false;
// break;
}
}
}
if (fl... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,370,575 | 1,370,576 | u607437307 | cpp |
p03698 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int len;
char s[27];
bool flag = true;
cin >> s;
len = strlen(s);
for (int i = 0; i < len; i++) {
for (int j = 0; j < len; j++) {
if (s[i] == s[j]) {
flag = false;
break;
}
}
}
if (flag) {
... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int len;
char s[27];
bool flag = true;
cin >> s;
len = strlen(s);
for (int i = 0; i < len; i++) {
for (int j = i + 1; j < len; j++) {
if (s[i] == s[j]) {
flag = false;
// break;
}
}
}
if (fl... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,370,577 | 1,370,576 | u607437307 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt[26] = {};
for (int i = 0; i < s.length(); i++)
cnt[s[i] - '0']++;
for (int i = 0; i < 26; i++) {
if (cnt[i] >= 2) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int cnt[26] = {};
for (int i = 0; i < s.length(); i++)
cnt[s[i] - 'a']++;
for (int i = 0; i < 26; i++) {
if (cnt[i] >= 2) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | [
"literal.string.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,370,578 | 1,370,579 | u456611841 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string val;
cin >> val;
int ans[256] = {0};
bool good = true;
for (int i = 0; i < val.length(); i++) {
if (ans[val[i] != 0]) {
good = false;
break;
}
ans[val[i]]++;
}
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string val;
cin >> val;
int ans[256] = {0};
bool good = true;
for (int i = 0; i < val.length(); i++) {
if (ans[val[i]] != 0) {
good = false;
break;
}
ans[val[i]]++;
}
i... | [
"control_flow.branch.if.condition.change"
] | 1,370,586 | 1,370,587 | u713310851 | cpp |
p03698 | #include <bits/stdc++.h>
const long long MOD = 1000000007;
const int INF = INT_MAX / 2;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (int i = (ll)(r); i < (ll)(n); i++)
#define REP(i, n) FOR(i, (0), n)
#define ALL(r) r.begin(), r.end()
#define ll long long int
#define vi vector<ll>
#define vs vector<strin... | #include <bits/stdc++.h>
const long long MOD = 1000000007;
const int INF = INT_MAX / 2;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (int i = (ll)(r); i < (ll)(n); i++)
#define REP(i, n) FOR(i, (0), n)
#define ALL(r) r.begin(), r.end()
#define ll long long int
#define vi vector<ll>
#define vs vector<strin... | [
"literal.string.change",
"io.output.change"
] | 1,370,588 | 1,370,589 | u125046593 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S, ans = "yes";
cin >> S;
for (int i = 1; i <= S.size(); i++) {
for (int j = i + 1; j < S.size(); j++) {
if (S[i] == S[j]) {
ans = "no";
}
}
break;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S, ans = "yes";
cin >> S;
for (int i = 0; i < S.size(); i++) {
for (int j = i + 1; j < S.size(); j++) {
if (S[i] == S[j]) {
ans = "no";
}
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,370,592 | 1,370,591 | u382176401 | cpp |
p03698 | #include <bits/stdc++.h>
#define INF 100000000
#define ABS(a) (a < 0 ? -(a) : a)
#define MIN(a, b) (a > b ? b : a)
#define MAX(a, b) (a > b ? a : b)
#define REP(i, a) for (int i = 0; i < a; i++)
using namespace std;
int main() {
string S;
cin >> S;
int po[26];
REP(i, 26) { po[i] = 0; }
REP(i, S.length()) {
... | #include <bits/stdc++.h>
#define INF 100000000
#define ABS(a) (a < 0 ? -(a) : a)
#define MIN(a, b) (a > b ? b : a)
#define MAX(a, b) (a > b ? a : b)
#define REP(i, a) for (int i = 0; i < a; i++)
using namespace std;
int main() {
string S;
cin >> S;
int po[26];
REP(i, 26) { po[i] = 0; }
REP(i, S.length()) {
... | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change"
] | 1,370,596 | 1,370,597 | u061935128 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
//コメントアウトするとdebug()を実行しない
#define DEBUG
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
//コメントアウトするとdebug()を実行しない
#define DEBUG
using... | [
"call.add"
] | 1,370,600 | 1,370,601 | u389055093 | cpp |
p03698 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
//コメントアウトするとdebug()を実行しない
#define DEBUG
using namespace std;
t... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
//コメントアウトするとdebug()を実行しない
#define DEBUG
using namespace std;
t... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 1,370,602 | 1,370,603 | u389055093 | cpp |
p03698 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
//コメントアウトするとdebug()を実行しない
#define DEBUG
using namespace std;
t... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define WMAX 10000
#define HMAX 10000
//コメントアウトするとdebug()を実行しない
#define DEBUG
using namespace std;
t... | [
"call.add"
] | 1,370,604 | 1,370,603 | u389055093 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
set<char> sajol;
for (int i = 0; i < s.length(); i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
sajol.insert(s[i]);
}
}
if (sajol.size() == s.... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
set<char> sajol;
for (int i = 0; i < s.length(); i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
sajol.insert(s[i]);
}
}
if (sajol.size() == s.... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,370,612 | 1,370,613 | u191512529 | cpp |
p03698 | //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#defi... | //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#defi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,370,619 | 1,370,618 | u333917945 | cpp |
p03698 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
char *str;
int n, count = 0;
cin >> str;
n = strlen(str);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (str[i] == str[j]) {
++count;
}
}
}
if (count > 0) {
cout << "no\n";
}... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
char str[32];
int n, count = 0;
cin >> str;
n = strlen(str);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (str[i] == str[j]) {
++count;
}
}
}
if (count > 0) {
cout << "no\n";
... | [] | 1,370,620 | 1,370,621 | u170025581 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int main() {
string S;
cin >> S;
if (set<char>(S.begin(), S.end()).size() != S.size()) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int main() {
string S;
cin >> S;
if (set<char>(S.begin(), S.end()).size() == S.size()) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,370,622 | 1,370,623 | u524343822 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string n;
int check = 0;
cin >> n;
int f = n.size();
for (int i = 0; i < f; i++) {
for (int j = i + 1; j < f; j++) {
if (n[i] == n[j]) {
check = 1;
}
}
}
if (check == 0) {
cout << "Yes" << endl;
} els... | #include <iostream>
#include <string>
using namespace std;
int main() {
string n;
int check = 0;
cin >> n;
int f = n.size();
for (int i = 0; i < f; i++) {
for (int j = i + 1; j < f; j++) {
if (n[i] == n[j]) {
check = 1;
}
}
}
if (check == 0) {
cout << "yes" << endl;
} els... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,624 | 1,370,625 | u496118739 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int i, j, k;
k = 0;
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (s[i] == s[j]) {
k = 1;
break;
}
}
}
if (k == 1) {
cout << "No";
} else {
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int i, j, k;
k = 0;
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (s[i] == s[j]) {
k = 1;
break;
}
}
}
if (k == 1) {
cout << "no";
} else {
cout <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,634 | 1,370,635 | u272496669 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, m, d = 0, size;
string a;
cin >> a;
size = a.size();
for (n = 0; n <= size; n++) {
for (m = 0; m <= size; m++) {
if (n != m) {
if (a[n] == a[m])
d++;
}
}
}
if (d == 0)
cou... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, m, d = 0, size;
string a;
cin >> a;
size = a.size();
for (n = 0; n <= size; n++) {
for (m = 0; m <= size; m++) {
if (n != m) {
if (a[n] == a[m])
d++;
}
}
}
if (d == 0)
cou... | [
"literal.string.change",
"io.output.change"
] | 1,370,636 | 1,370,637 | u794495044 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) ... | [
"variable_declaration.value.change"
] | 1,370,640 | 1,370,641 | u016572066 | cpp |
p03698 | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int a[27];
int main() {
string s;
cin >> s;
memset(a, 0, sizeof(a));
int flag = 0;
for (int i = 0; i < s.size(); i++) {
a[s[i] - '0']++;
if (a[s[i] - '0'] > 1) {
flag = 1;
break;
}
}
if (flag)
cout <<... | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int a[27];
int main() {
string s;
cin >> s;
memset(a, 0, sizeof(a));
int flag = 0;
for (int i = 0; i < s.size(); i++) {
a[s[i] - '0']++;
if (a[s[i] - '0'] > 1) {
flag = 1;
break;
}
}
if (!flag)
cout <... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 1,370,663 | 1,370,664 | u145484461 | cpp |
p03698 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char a[100];
int i, len;
int b[52];
int num = 0;
scanf("%s", a);
len = strlen(a);
for (i = 0; i < len; i++) {
if (a[i] <= 'Z' && a[i] >= 'A') {
num = a[i] - 65;
b[num]++;
}
if (a[i] <= 'z' && a[i] >= 'a') {
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char a[100];
int i, len;
static int b[52];
int num;
scanf("%s", a);
len = strlen(a);
for (i = 0; i < len; i++) {
if (a[i] <= 'Z' && a[i] >= 'A') {
num = a[i] - 65;
b[num]++;
}
if (a[i] <= 'z' && a[i] >= 'a') {... | [
"variable_declaration.specifier.add"
] | 1,370,667 | 1,370,668 | u678523371 | cpp |
p03698 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char a[100];
int i, len;
int b[52];
int num;
scanf("%s", a);
len = strlen(a);
for (i = 0; i < len; i++) {
if (a[i] <= 'Z' && a[i] >= 'A') {
num = a[i] - 65;
b[num]++;
}
if (a[i] <= 'z' && a[i] >= 'a') {
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char a[100];
int i, len;
static int b[52];
int num;
scanf("%s", a);
len = strlen(a);
for (i = 0; i < len; i++) {
if (a[i] <= 'Z' && a[i] >= 'A') {
num = a[i] - 65;
b[num]++;
}
if (a[i] <= 'z' && a[i] >= 'a') {... | [
"variable_declaration.specifier.add",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 1,370,669 | 1,370,668 | u678523371 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
bool D[26];
char a = 'a';
bool flag;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (D[S[i] - a] == 1) {
cout << "no" << endl;
return 0;
} else
D[S[i] - a] = 1;
}
cout << "yes" << endl;
re... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
bool D[26] = {};
char a = 'a';
bool flag;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (D[(S[i] - a)] == 1) {
cout << "no" << endl;
return 0;
} else
D[S[i] - a] = 1;
}
cout << "yes" << end... | [
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 1,370,676 | 1,370,677 | u118951811 | cpp |
p03698 | #include <bits/stdc++.h>
const int N = 26;
int cnt[N];
char s[N + 10];
int main() {
scanf("%d", s);
int len = strlen(s);
for (int i = 0; i < len; ++i) {
++cnt[s[i] - 'a'];
}
for (int i = 0; i < N; ++i) {
if (cnt[i] >= 2) {
return printf("no\n"), 0;
}
}
return printf("yes\n"), 0;
} | #include <bits/stdc++.h>
const int N = 26;
int cnt[N];
char s[N + 10];
int main() {
scanf("%s", s);
int len = strlen(s);
for (int i = 0; i < len; ++i) {
++cnt[s[i] - 'a'];
}
for (int i = 0; i < N; ++i) {
if (cnt[i] >= 2) {
return printf("no\n"), 0;
}
}
return printf("yes\n"), 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 1,370,682 | 1,370,683 | u981966125 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int count;
std::string str;
std::vector<char> v;
std::cin >> str;
const char *cstr = str.c_str();
for (int i = 0; i < str.size(); i++) {
v.push_back(cstr[i]);
}
std::sort(v.begin(), v.end());
for (int i... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int count = 0;
std::string str;
std::vector<char> v;
std::cin >> str;
const char *cstr = str.c_str();
for (int i = 0; i < str.size(); i++) {
v.push_back(cstr[i]);
}
std::sort(v.begin(), v.end());
for (i... | [
"variable_declaration.value.change"
] | 1,370,684 | 1,370,685 | u200193192 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int l = str.length();
for (int i = 0; i < l - 1; i++) {
for (int j = i + 1; j < l; j++) {
if (str[i] == str[j]) {
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES" << endl... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int l = str.length();
for (int i = 0; i < l - 1; i++) {
for (int j = i + 1; j < l; j++) {
if (str[i] == str[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << e... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,691 | 1,370,692 | u864453204 | cpp |
p03698 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int d, e;
string S;
e = 0;
cin >> S;
d = S.size();
for (int i = 0; i < d; i++) {
for (int j = i + 1; j < d; j++) {
if (S[i] == S[j]) {
e = 1;
break;
}
}
}
if (e == 0) {
cout << "YE... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(void) {
int d, e;
string S;
e = 0;
cin >> S;
d = S.size();
for (int i = 0; i < d; i++) {
for (int j = i + 1; j < d; j++) {
if (S[i] == S[j]) {
e = 1;
break;
}
}
}
if (e == 0) {
cout << "ye... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,717 | 1,370,718 | u514004416 | cpp |
p03698 | /*
ID:greenty2
LANG:C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
int tj[30];
char s[30];
int main() {
cin >> s;
int len = strlen(s);
for (int i = 0; i < len; i++) {
tj[s[i] - 'a']++;
if (tj[s[i]] > 1) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | /*
ID:greenty2
LANG:C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
int tj[30];
char s[30];
int main() {
cin >> s;
int len = strlen(s);
for (int i = 0; i < len; i++) {
tj[s[i] - 'a']++;
if (tj[s[i] - 'a'] > 1) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,370,719 | 1,370,720 | u327400871 | cpp |
p03698 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int target = 0; target < s.size(); target++) {
char c = s[target];
for (int watched = 0; watched < s.size(); watched++) {
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int target = 0; target < s.size(); target++) {
char c = s[target];
for (int watched = 0; watched < s.size(); watched++) {
... | [
"literal.string.change",
"io.output.change"
] | 1,370,741 | 1,370,742 | u012561668 | cpp |
p03698 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int target = 0; target < s.size(); target++) {
char c = s[target];
for (int watched = 0; watched < s.size(); watched++) {
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int target = 0; target < s.size(); target++) {
char c = s[target];
for (int watched = 0; watched < s.size(); watched++) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,743 | 1,370,742 | u012561668 | cpp |
p03698 | #include <cstdio>
using namespace std;
int main() {
int alph[26] = {};
char a[50];
scanf("%s", &a, 50);
for (int i = 0; a[i] != '\0'; i++) {
"%d\n", alph[a[i] - 'a']++;
if (alph[a[i] - 'a'] > 1) {
printf("%s\n", "No");
return 0;
}
}
printf("%s\n", "Yes");
} | #include <cstdio>
using namespace std;
int main() {
int alph[26] = {};
char a[50];
scanf("%s", &a, 50);
for (int i = 0; a[i] != '\0'; i++) {
"%d\n", alph[a[i] - 'a']++;
if (alph[a[i] - 'a'] > 1) {
printf("%s\n", "no");
return 0;
}
}
printf("%s\n", "yes");
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,370,759 | 1,370,760 | u620059302 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.