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 |
|---|---|---|---|---|---|---|---|
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = a + b;
if (sum <= 10) {
cout << sum << endl;
} else {
cout << "error" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = a + b;
if (sum < 10) {
cout << sum << endl;
} else {
cout << "error" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,233 | 1,369,234 | u996047857 | cpp |
p03697 | #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a + b > +10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
}
| #include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,237 | 1,369,238 | u970831327 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error" << endl;
}
cout << a + b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 9) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | [
"control_flow.branch.else.add"
] | 1,369,248 | 1,369,249 | u042039774 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 9) {
cout << "error" << endl;
}
cout << a + b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 9) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | [
"control_flow.branch.else.add"
] | 1,369,251 | 1,369,249 | u042039774 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 9)
cout << "error" << endl;
cout << a + b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 9) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | [
"control_flow.branch.else.add"
] | 1,369,252 | 1,369,249 | u042039774 | cpp |
p03697 | #include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a + b) {
return printf("error\n"), 0;
}
printf("%d\n", a + b);
return 0;
} | #include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a + b >= 10) {
return printf("error\n"), 0;
}
printf("%d\n", a + b);
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,369,255 | 1,369,256 | u981966125 | cpp |
p03697 | #include "bits/stdc++.h"
#define lp(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "Error";
else
cout << a + b;
} | #include "bits/stdc++.h"
#define lp(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error";
else
cout << a + b;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,260 | 1,369,261 | u235229719 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (A + B > 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,264 | 1,369,265 | u277971517 | cpp |
p03697 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,266 | 1,369,267 | u699193595 | cpp |
p03697 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
printf("error¥n");
else
printf("%d¥n", a + b);
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
printf("error");
else
printf("%d", a + b);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,369,281 | 1,369,282 | u084871864 | cpp |
p03697 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#include <stdio.h>
#in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#include <stdio.h>
#in... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 1,369,295 | 1,369,296 | u335104842 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error\n";
cout << a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error\n";
else
cout << a + b << endl;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,369,297 | 1,369,298 | u201263279 | cpp |
p03697 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,369,301 | 1,369,302 | u549743442 | cpp |
p03697 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a + b > 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,307 | 1,369,308 | u159043787 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int n, a, k, i;
int main() {
cin >> n >> a;
if (a + n > 10)
cout << "error";
else
cout << a + n;
} | #include <bits/stdc++.h>
using namespace std;
int n, a, k, i;
int main() {
cin >> n >> a;
if (a + n >= 10)
cout << "error";
else
cout << a + n;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,313 | 1,369,314 | u030094335 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
int c = a + b;
if (c > 10) {
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
int c = a + b;
if (c >= 10) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,317 | 1,369,318 | u015747312 | cpp |
p03697 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (ll i = 0; i ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (ll i = 0; i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,322 | 1,369,323 | u642720199 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error";
else
cout << a + b;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error";
else
cout << a + b;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,324 | 1,369,325 | u190449731 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
string S;
cin >> S;
int n = S.size();
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (S[i] == S[j])
count++;
if (count == 1)
goto RESULT;
}
}
RESULT:
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
string S;
cin >> S;
int n = S.size();
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (S[i] == S[j])
count++;
if (count == 1)
goto RESULT;
}
}
RESULT:
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,328 | 1,369,329 | u269786286 | cpp |
p03698 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,332 | 1,369,333 | u151236434 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool r = false;
sort(s.begin(), s.end());
for (int i = 1; i < s.size(); i++) {
if (s.at(i - 1) == s.at(i))
r = true;
}
if (r) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool r = false;
sort(s.begin(), s.end());
for (int i = 1; i < s.size(); i++) {
if (s.at(i - 1) == s.at(i))
r = true;
}
if (r) {
cout << "no" << endl;
} else {
cout << "yes" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,341 | 1,369,342 | u442714890 | cpp |
p03698 | // ＿＿
// ／ <＠ﾌ
// ｜(ﾉﾉハ))
// ﾉ从ﾟヮﾟ从
// ﾉ｜ｿﾉГ|つ author:hotarunx
// 〈_ﾉ^^^ヽ|
// ~~tｧtｧ~
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.ti... | // ＿＿
// ／ <＠ﾌ
// ｜(ﾉﾉハ))
// ﾉ从ﾟヮﾟ从
// ﾉ｜ｿﾉГ|つ author:hotarunx
// 〈_ﾉ^^^ヽ|
// ~~tｧtｧ~
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.ti... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,349 | 1,369,350 | u076506345 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans = "Yes";
cin >> s;
char c = s[0];
for (int i = 0; i < s.size(); i++) {
int t = i;
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
ans = "No";
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans = "yes";
cin >> s;
char c = s[0];
for (int i = 0; i < s.size(); i++) {
int t = i;
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
ans = "no";
}
}
}
cout << ans << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,369,351 | 1,369,352 | u899705970 | cpp |
p03698 | // This is free and unencumbered software released into the public domain.
// Anyone is free to copy, modify, publish, use, compile, sell, or
// distribute this software, either in source code form or as a compiled
// binary, for any purpose, commercial or non-commercial, and by any
// means.
// In jurisdictions that... | // This is free and unencumbered software released into the public domain.
// Anyone is free to copy, modify, publish, use, compile, sell, or
// distribute this software, either in source code form or as a compiled
// binary, for any purpose, commercial or non-commercial, and by any
// means.
// In jurisdictions that... | [
"call.add"
] | 1,369,355 | 1,369,356 | u828706986 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(), (x).end()
#define SUM(x) accumulate(x.be... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(), (x).end()
#define SUM(x) accumulate(x.be... | [
"control_flow.branch.if.condition.change"
] | 1,369,363 | 1,369,364 | u379928983 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
sort(a.begin(), a.end());
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == a.at(i + 1)) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
sort(a.begin(), a.end());
for (int i = 0; i < a.size() - 1; i++) {
if (a.at(i) == a.at(i + 1)) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,369,371 | 1,369,370 | u751515087 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
sort(a.begin(), a.end());
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == a.at(i + 1)) {
cout << "no" << endl;
}
}
cout << "yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
sort(a.begin(), a.end());
for (int i = 0; i < a.size() - 1; i++) {
if (a.at(i) == a.at(i + 1)) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,369,372 | 1,369,370 | u751515087 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
const int n = 26;
vector<int> num(n, 0);
for (int i = 0; i < s.size(); i++)
num[(int)(s.at(i) - 'a')] = 1;
int cnt = 0;
for (int i = 0; i < n; i++)
cnt += num[i];
string ans = "No";
if (cnt == s.size())
ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
const int n = 26;
vector<int> num(n, 0);
for (int i = 0; i < s.size(); i++)
num[(int)(s.at(i) - 'a')] = 1;
int cnt = 0;
for (int i = 0; i < n; i++)
cnt += num[i];
string ans = "no";
if (cnt == s.size())
ans... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,369,373 | 1,369,374 | u221391729 | cpp |
p03698 | #include <iostream>
#include <set>
#include <string>
int main() {
std::string s;
std::cin >> s;
std::set<int> ss;
for (int i = 0; i < s.size(); i++) {
ss.insert(s[i]);
}
std::string ans = ss.size() == s.size() ? "Yes" : "No";
std::cout << ans << "\n";
} | #include <iostream>
#include <set>
#include <string>
int main() {
std::string s;
std::cin >> s;
std::set<int> ss;
for (int i = 0; i < s.size(); i++) {
ss.insert(s[i]);
}
std::string ans = ss.size() == s.size() ? "yes" : "no";
std::cout << ans << "\n";
} | [
"literal.string.change",
"literal.string.case.change"
] | 1,369,376 | 1,369,377 | u825343780 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
unsigned moto = s.size();
set<char> S;
for (unsigned i = 0; i < moto; i++) {
S.insert(s[i]);
}
if (S.size() == moto)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
unsigned moto = s.size();
set<char> S;
for (unsigned i = 0; i < moto; i++) {
S.insert(s[i]);
}
if (S.size() == moto)
cout << "yes" << endl;
else
cout << "no" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,378 | 1,369,379 | u679419784 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
unsigned moto = s.size();
set<char> S;
for (int i = 0; i < moto; i++) {
S.insert(s[i]);
}
if (S.size() == moto)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
unsigned moto = s.size();
set<char> S;
for (unsigned i = 0; i < moto; i++) {
S.insert(s[i]);
}
if (S.size() == moto)
cout << "yes" << endl;
else
cout << "no" << endl;
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,380 | 1,369,379 | u679419784 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long unsigned int moto = s.size();
set<char> S;
for (int i = 0; i < moto; i++) {
S.insert(s[i]);
}
if (S.size() == moto)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
unsigned moto = s.size();
set<char> S;
for (unsigned i = 0; i < moto; i++) {
S.insert(s[i]);
}
if (S.size() == moto)
cout << "yes" << endl;
else
cout << "no" << endl;
} | [
"variable_declaration.type.narrow.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,381 | 1,369,379 | u679419784 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int moto = s.size();
set<char> S;
for (int i = 0; i < moto; i++) {
S.insert(s[i]);
}
if (S.size() == moto)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
unsigned moto = s.size();
set<char> S;
for (unsigned i = 0; i < moto; i++) {
S.insert(s[i]);
}
if (S.size() == moto)
cout << "yes" << endl;
else
cout << "no" << endl;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,382 | 1,369,379 | u679419784 | cpp |
p03698 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,369,385 | 1,369,386 | u580593895 | cpp |
p03698 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,369,387 | 1,369,386 | u580593895 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (long long i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define rrep(i, n) for (long long i = int(n); i > 0; i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbe... | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (long long i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define rrep(i, n) for (long long i = int(n); i > 0; i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbe... | [] | 1,369,388 | 1,369,389 | u395287054 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool d = true;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] = s[j]) {
d = false;
}
}
}
if (d) {
cout << "yes" << endl;
} else {
cout << "no" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool d = true;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
d = false;
}
}
}
if (d) {
cout << "yes" << endl;
} else {
cout << "no" << endl... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,369,391 | 1,369,392 | u244626757 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
typedef long long ll;
using namespace std;
int main() {
string s;
rep(i, 0, s.size()) {
rep(j, i + 1, s.size()) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << e... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
rep(i, 0, s.size()) {
rep(j, i + 1, s.size()) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout <... | [] | 1,369,393 | 1,369,395 | u129134470 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
string s;
cin >> s;
string ans = "Yes";
bool b[26];
rep(i, 26) b[i] = false;
rep(i, s.si... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
string s;
cin >> s;
string ans = "yes";
bool b[26];
rep(i, 26) b[i] = false;
rep(i, s.si... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,369,397 | 1,369,398 | u534923072 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
vector<char> a(s.size());
rep(i, s.size()) { a.at(i) = a.at(i); }
sort(a.begin(), a.end());
bool flag = true;
rep(i, s.size() - 1)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
vector<char> a(s.size());
rep(i, s.size()) { a.at(i) = s.at(i); }
sort(a.begin(), a.end());
bool flag = true;
rep(i, s.size() - 1)... | [
"assignment.value.change",
"identifier.change"
] | 1,369,436 | 1,369,438 | u021657949 | cpp |
p03698 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,440 | 1,369,443 | u924935170 | cpp |
p03698 | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <climits> //long long型の最大値(LLONG_MAX)など
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,447 | 1,369,443 | u924935170 | cpp |
p03698 | // Created by ...Lusifer
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret re... | // Created by ...Lusifer
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret re... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,448 | 1,369,450 | u168216888 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define pow(x, y) modpow(x, y)
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,459 | 1,369,461 | u017078415 | cpp |
p03698 | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll>... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll>... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,467 | 1,369,472 | u798339690 | cpp |
p03698 | #include <algorithm>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define PI 3.14159265358979323846264338327950L
string res;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio... | #include <algorithm>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define PI 3.14159265358979323846264338327950L
string res;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,369,475 | 1,369,477 | u375948148 | cpp |
p03698 | #include <iostream>
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[i] != s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
} | #include <iostream>
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[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,479 | 1,369,481 | u234365185 | cpp |
p03698 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string n;
bool ans = true;
cin >> n;
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string n;
bool ans = true;
cin >> n;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,483 | 1,369,485 | u730499268 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// // for getting input from input.txt
// freopen("input.txt", "r", stdin);
// // for writing output to output.txt
// freopen("output.txt", "w", stdout);
// #endif
string s, t;
cin >> s;
s = t;
sort(t.begin(), t.e... | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// // for getting input from input.txt
// freopen("input.txt", "r", stdin);
// // for writing output to output.txt
// freopen("output.txt", "w", stdout);
// #endif
string s, t;
cin >> s;
t = s;
sort(t.begin(), t.e... | [
"assignment.change"
] | 1,369,492 | 1,369,495 | u219987462 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
vector<bool> a(26, false);
bool flag = true;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (a[s[i] - 'a'])
flag = true;
else
a[s[i] - 'a'] = true;
}
cout << (flag ? "no" : "yes") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
vector<bool> a(26, false);
bool flag = false;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (a[s[i] - 'a'])
flag = true;
else
a[s[i] - 'a'] = true;
}
cout << (flag ? "no" : "yes") << endl;
} | [
"misc.opposites",
"variable_declaration.value.change"
] | 1,369,403 | 1,369,405 | u652660628 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
#define print(x) cout << (x) << endl
#define prints(x, y) cout << (x) << " " << (y) << endl
#define rep(i, ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
#define print(x) cout << (x) << endl
#define prints(x, y) cout << (x) << " " << (y) << endl
#define rep(i, ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,369,432 | 1,369,435 | u662852612 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define cinsc \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define all(con... | #include <bits/stdc++.h>
using namespace std;
#define cinsc \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define all(con... | [
"call.remove"
] | 1,369,444 | 1,369,446 | u106491311 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define go \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define go \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,451 | 1,369,453 | u554080150 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ad = false;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
ad = true;
break;
}
}
}
if (ad)
cout << "yes" << endl;
else
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ad = false;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
ad = true;
break;
}
}
}
if (ad)
cout << "no" << endl;
else
cout << ... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,369,465 | 1,369,466 | u834753207 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<int> c(str.size());
for (int i = 0; i < str.size(); i++) {
c.at(i) = (int)str.at(i);
}
sort(c.begin(), c.end());
bool A = 1;
for (int i = 0; i < str.size() - 1; i++) {
if (c.at(i) == c.at(i + 1)) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<int> c(str.size());
for (int i = 0; i < str.size(); i++) {
c.at(i) = (int)str.at(i);
}
sort(c.begin(), c.end());
bool A = 1;
for (int i = 0; i < str.size() - 1; i++) {
if (c.at(i) == c.at(i + 1)) {
c... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,470 | 1,369,471 | u669315378 | cpp |
p03698 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
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>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
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,369,473 | 1,369,474 | u109191542 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int INF = 100100101;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
vector<int> a(260, 0);
rep(i, s.length()) {
int tmp = (int)s[i];
a[tm... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int INF = 100100101;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
vector<int> a(260, 0);
rep(i, s.length()) {
int tmp = (int)s[i];
a[tm... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,484 | 1,369,486 | u415671616 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> c;
bool different = true;
for (int i = 0; i < s.size(); i++) {
if (c.count(s[i]))
different = false;
c.insert(s[i]);
}
cout << (different ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> c;
bool different = true;
for (int i = 0; i < s.size(); i++) {
if (c.count(s[i]))
different = false;
c.insert(s[i]);
}
cout << (different ? "yes" : "no") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,506 | 1,369,507 | u578969098 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> dic;
char tmp;
int cnt = 0;
while (cin >> tmp) {
dic[tmp]++;
cnt++;
}
if (cnt == dic.size())
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> dic;
char tmp;
int cnt = 0;
while (cin >> tmp) {
dic[tmp]++;
cnt++;
}
if (cnt == dic.size())
cout << "yes" << endl;
else
cout << "no" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,526 | 1,369,527 | u053429210 | cpp |
p03698 | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
// vector<vector<ll>> piyo(tate,vector<ll> (yoko));
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1000000000
#define ll long long
#define ln cout << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define double long double
#define REP... | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
// vector<vector<ll>> piyo(tate,vector<ll> (yoko));
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1000000000
#define ll long long
#define ln cout << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define double long double
#define REP... | [
"call.arguments.change",
"call.add"
] | 1,369,530 | 1,369,531 | u683769494 | cpp |
p03698 | #include <iostream>
#include <map>
using namespace std;
int main() {
map<char, int> mp;
string str;
cin >> str;
bool flag = true;
for (int i = 0; i < str.size(); i++) {
mp[str[i]]++;
if (mp[str[i]] > 1) {
flag = false;
break;
}
}
if (flag) {
cout << "yes" << endl;
} else {... | #include <iostream>
#include <map>
using namespace std;
int main() {
map<char, int> mp;
string str;
cin >> str;
bool flag = true;
for (int i = 0; i < str.size(); i++) {
mp[str[i]]++;
if (mp[str[i]] > 1) {
flag = false;
break;
}
}
if (flag) {
cout << "yes" << endl;
} else {... | [
"literal.string.change",
"io.output.change"
] | 1,369,532 | 1,369,533 | u806657856 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s.at(i) == s.at(j)) {
count++;
}
}
}
if (count > 0) {
cout << "no" << endl;
} else {
cout << "ye... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s.at(i) == s.at(j)) {
count++;
}
}
}
if (count > s.size()) {
cout << "no" << endl;
} else {
cout... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"call.add"
] | 1,369,534 | 1,369,535 | u039537827 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
string S;
cin >> S;
bool judge = true;
for (int i = 0; i < S.length(); i++) {
for (int j = 0; j < S.length(); j++) {
if (i == j) {
continue;
}
i... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
int main() {
string S;
cin >> S;
bool judge = true;
for (int i = 0; i < S.length(); i++) {
for (int j = 0; j < S.length(); j++) {
if (i == j) {
continue;
}
i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,536 | 1,369,537 | u497004546 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
map<char, int> alphabet;
for (char a : s) {
if (alphabet.count(a)) {
cout << "no" << endl;
return 0;
} else
alphabet[a] = 1;
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
map<char, int> alphabet;
for (char a : s) {
if (alphabet.count(a)) {
cout << "no" << endl;
return 0;
} else
alphabet[a] = 1;
}
cout << "yes" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,541 | 1,369,542 | u732578115 | cpp |
p03697 | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error";
else
cout << a + b;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error";
else
cout << a + b;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,547 | 1,369,548 | u400235146 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count[27] = {0};
int flag = 0;
for (int i = 0; i < s.length(); i++) {
count[s[i] - 'a' + 1]++;
}
for (int i = 0; i < 27; i++) {
if (count[i] > 1) {
flag = 1;
break;
}
}
if (!flag)
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count[27] = {0};
int flag = 0;
for (int i = 0; i < s.length(); i++) {
count[s[i] - 'a' + 1]++;
}
for (int i = 0; i < 27; i++) {
if (count[i] > 1) {
flag = 1;
break;
}
}
if (!flag)
... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,369,560 | 1,369,561 | u089230684 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a[26];
string t;
cin >> t;
int count = 0;
for (int i = 0; i < 26; i++) {
a[i] = 0;
}
for (int i = 0; i < t.size(); i++) {
a[t[i] - 97] = 1;
}
for (int i = 0; i < 26; i++) {
if (a[i] == 1)
count++;
}
i... |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a[26];
string t;
cin >> t;
int count = 0;
for (int i = 0; i < 26; i++) {
a[i] = 0;
}
for (int i = 0; i < t.size(); i++) {
a[t[i] - 97] = 1;
}
for (int i = 0; i < 26; i++) {
if (a[i] == 1)
count++;
}
... | [
"literal.string.change",
"io.output.change"
] | 1,369,562 | 1,369,563 | u089230684 | cpp |
p03698 | #include <iostream>
#include <string>
int main() {
bool s['z' - 'a' + 1];
std::string str;
std::cin >> str;
for (auto c : str) {
int i = c - 'a';
if (s[i]) {
std::cout << "no" << std::endl;
return 0;
}
s[i] = true;
}
std::cout << "yes" << std::endl;
return 0;
} | #include <iostream>
#include <string>
int main() {
auto s = new bool['z' - 'a' + 1];
std::string str;
std::cin >> str;
for (auto c : str) {
int i = c - 'a';
if (s[i]) {
std::cout << "no" << std::endl;
return 0;
}
s[i] = true;
}
std::cout << "yes" << std::endl;
return 0;
} | [
"variable_declaration.value.change"
] | 1,369,564 | 1,369,565 | u089230684 | cpp |
p03698 | #include <iostream>
#include <string>
int main() {
bool s['z' - 'a' + 1];
std::string str;
std::cin >> str;
for (auto c : str) {
int i = c - 'a';
if (s[i]) {
std::cout << "no" << std::endl;
return 0;
}
s[i] = true;
}
std::cout << "yes" << std::endl;
return 0;
} | #include <iostream>
#include <string>
int main() {
bool s['z' - 'a' + 1] = {};
std::string str;
std::cin >> str;
for (auto c : str) {
int i = c - 'a';
if (s[i]) {
std::cout << "no" << std::endl;
return 0;
}
s[i] = true;
}
std::cout << "yes" << std::endl;
return 0;
} | [
"variable_declaration.value.change"
] | 1,369,564 | 1,369,566 | u089230684 | cpp |
p03698 | #include <iostream>
#include <map>
int main(void) {
std::string S, ans = "Yes";
std::cin >> S;
std::map<char, int> mp;
for (char c : S) {
if (mp.find(c) == mp.end()) {
mp[c] = 0;
} else {
ans = "No";
break;
}
}
std::cout << ans << std::endl;
return 0;
}
| #include <iostream>
#include <map>
int main(void) {
std::string S, ans = "yes";
std::cin >> S;
std::map<char, int> mp;
for (char c : S) {
if (mp.find(c) == mp.end()) {
mp[c] = 0;
} else {
ans = "no";
break;
}
}
std::cout << ans << std::endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,369,569 | 1,369,570 | u301302814 | cpp |
p03698 | // include
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
// using
using namespace std;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using ... | // include
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
// using
using namespace std;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using ... | [
"expression.operation.binary.remove"
] | 1,369,571 | 1,369,572 | u274201725 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
int n = s.size();
string ans = "yes";
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (s[i] == s[j])
ans = "no";
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
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.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,369,576 | 1,369,577 | u516876944 | cpp |
p03698 | #include <bits/stdc++.h>
#define arep(a, i, n) for (ll i = (a); i < (n); i++)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define cinf(x, n) \
for (ll i = 0; i < (n); i++) \
cin >> x[i];
#define coutf(x,... | #include <bits/stdc++.h>
#define arep(a, i, n) for (ll i = (a); i < (n); i++)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define cinf(x, n) \
for (ll i = 0; i < (n); i++) \
cin >> x[i];
#define coutf(x,... | [] | 1,369,586 | 1,369,587 | u067797863 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
bool finished = false;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
if (S.at(i) == S.at(j)) {
finished = true;
break;
}
}
if (finished) {
break;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
bool finished = false;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
if (S.at(i) == S.at(j)) {
finished = true;
break;
}
}
if (finished) {
break;... | [
"literal.string.change",
"io.output.change"
] | 1,369,596 | 1,369,597 | u754435899 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
int n = s.size();
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "yes" << endl;
return 0;
}
}
cout << "no" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
int n = s.size();
for (int i = 0; i < n - 1; i++) {
if (s[i] == s[i + 1]) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 1,369,602 | 1,369,603 | u184929210 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,604 | 1,369,605 | u711997425 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = 0;
for (int i = 1; i <= (int)(S.length() - 1); i++) {
for (int j = 0; j <= i - 1; j++) {
if (S[j] == S[i]) {
flag = 1;
break;
}
}
if (flag == 1)
break;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = 0;
for (int i = 1; i <= (int)(S.length() - 1); i++) {
for (int j = 0; j <= i - 1; j++) {
if (S[j] == S[i]) {
flag = 1;
break;
}
}
if (flag == 1)
break;
}
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,606 | 1,369,607 | u328530240 | cpp |
p03698 | #include <iostream>
#include <string>
int main() {
std::string S, result = "yes";
std::cin >> S;
for (int i = 0; S[i] != NULL; i++) {
for (int k = i; S[k] != NULL; k++) {
if (S[i] == S[k]) {
result = "no";
}
}
}
std::cout << result;
return 0;
} | #include <iostream>
#include <string>
int main() {
std::string S, result = "yes";
std::cin >> S;
for (int i = 0; S[i] != NULL; i++) {
for (int k = i + 1; S[k] != NULL; k++) {
if (S[i] == S[k]) {
result = "no";
}
}
}
std::cout << result;
return 0;
} | [
"control_flow.loop.for.initializer.change"
] | 1,369,608 | 1,369,609 | u801151641 | cpp |
p03698 | #include <bits/stdc++.h>
#define ll long long
#define lu long unsigned
#define ull unsigned long long
using namespace std;
bool sortbysec(const pair<string, int> &a, const pair<string, int> &b) {
return (a.second < b.second);
}
bool sortpair(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first == b.firs... | #include <bits/stdc++.h>
#define ll long long
#define lu long unsigned
#define ull unsigned long long
using namespace std;
bool sortbysec(const pair<string, int> &a, const pair<string, int> &b) {
return (a.second < b.second);
}
bool sortpair(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first == b.firs... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,369,624 | 1,369,625 | u063089017 | cpp |
p03698 | #pragma GCC optimize("Ofast")
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <complex> // complex
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include... | #pragma GCC optimize("Ofast")
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <complex> // complex
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,369,626 | 1,369,627 | u550014122 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
rep(i, S.length()) {
rep(j, i) {
if (S[i] == S[j]) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
rep(i, S.length()) {
rep(j, i) {
if (S[i] == S[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,631 | 1,369,632 | u818755983 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [] | 1,369,633 | 1,369,634 | u946082956 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(124, 0);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
p[(int)(s.at(i))]++;
}
for (int i = 0; i < 125; i++) {
if (p[i] > 2) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(124, 0);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
p[(int)(s.at(i))]++;
}
for (int i = 0; i < 125; i++) {
if (p[i] >= 2) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,635 | 1,369,636 | u946082956 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(123, 0);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
p[(int)s.at(i)]++;
}
for (int i = 0; i < 124; i++) {
if (p[i] > 2) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(124, 0);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
p[(int)(s.at(i))]++;
}
for (int i = 0; i < 125; i++) {
if (p[i] >= 2) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,637 | 1,369,636 | u946082956 | cpp |
p03698 | /*
author : nishi5451
created : 14.08.2020 13:11:10
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int> dp(26);
rep(i, int(s.size())) { dp[s[i] - 'a']++; }
rep(i, 26) {
if (dp[i] > ... | /*
author : nishi5451
created : 14.08.2020 13:11:10
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int> dp(26);
rep(i, int(s.size())) { dp[s[i] - 'a']++; }
rep(i, 26) {
if (dp[i] > ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,369,638 | 1,369,639 | u033937898 | cpp |
p03698 | /*
author : nishi5451
created : 14.08.2020 13:11:10
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int> dp(26);
rep(i, int(s.size())) { dp[s[i] - 'a']++; }
rep(i, 26) {
if (dp[i] !=... | /*
author : nishi5451
created : 14.08.2020 13:11:10
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int> dp(26);
rep(i, int(s.size())) { dp[s[i] - 'a']++; }
rep(i, 26) {
if (dp[i] > ... | [] | 1,369,640 | 1,369,639 | u033937898 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << "; " << x << endl
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) && i < S.size() - 2) {
continue;
} else if (S.at(i) != S... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << "; " << x << endl
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) && i < S.size() - 2) {
continue;
} else if (S.at(i) != S... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,643 | 1,369,644 | u163072432 | cpp |
p03698 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
// const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const ... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
// const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,645 | 1,369,646 | u616794313 | cpp |
p03698 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
// const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const ... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
// const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,647 | 1,369,646 | u616794313 | cpp |
p03698 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
// const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const ... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
// const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,648 | 1,369,646 | u616794313 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n';
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int a[300] = {};
for (int i = 0; i < s.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n';
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int a[300] = {};
for (int i = 0; i < s.size(); i++) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,649 | 1,369,650 | u441292535 | cpp |
p03698 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
string s;
int a[26] = {};
int ok = 1;
... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
ll gcd(ll a, ll b);
ll power(ll n, ll k);
ll inv(ll n);
ll genfact(ll n, ll k);
ll fact(ll n);
ll nck(ll n, ll k);
int main(void) {
string s;
cin >> s;
int a[26] = {};
i... | [] | 1,369,666 | 1,369,667 | u755121033 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, ans = "yes";
cin >> S;
vector<bool> a(26, false);
for (int i = 0; i < S.size(); i++) {
if (a[S[i] - 'a']) {
ans = "no";
break;
}
a[S[i]] = true;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, ans = "yes";
cin >> S;
vector<bool> a(26, false);
for (int i = 0; i < S.size(); i++) {
if (a[S[i] - 'a']) {
ans = "no";
break;
}
a[S[i] - 'a'] = true;
}
cout << ans << endl;
} | [
"assignment.change"
] | 1,369,668 | 1,369,669 | u217508499 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c[26];
bool ok = true;
for (int i = 0; i < s.size(); i++) {
int k = s.at(i) - 'a';
c[k]++;
if (c[k] == 2) {
ok = false;
break;
}
}
if (ok)
cout << "yes" << endl;
else
cout << "no" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> c(26);
bool ok = true;
for (int i = 0; i < s.size(); i++) {
int k = s.at(i) - 'a';
c[k]++;
if (c[k] == 2) {
ok = false;
break;
}
}
if (ok)
cout << "yes" << endl;
else
cout <<... | [] | 1,369,670 | 1,369,671 | u412837450 | cpp |
p03698 | #include <iostream>
#include <string>
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() - i; ++j) {
if (s[i] == s[i + j]) {
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.size() - 1; ++i) {
for (int j = 1; j < s.size() - i; ++j) {
if (s[i] == s[i + j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 1,369,672 | 1,369,673 | u698883164 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
for (int j = 0; j < s.size() - i; ++j) {
if (s[i] != s[i + j]) {
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.size() - 1; ++i) {
for (int j = 1; j < s.size() - i; ++j) {
if (s[i] == s[i + j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,674 | 1,369,673 | u698883164 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
string s;
cin >> s;
bool ans = true;
for (char a = 'a'; a <= 'z'; ++a) {
int count = 0;
rep(i, s.length()) {
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
string s;
cin >> s;
bool ans = true;
for (char a = 'a'; a <= 'z'; ++a) {
int count = 0;
rep(i, s.length()) {
i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,679 | 1,369,680 | u239409893 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
string s;
set<int> d;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++)
d.insert(s[i]);
if (d.size() == s.size())
printf("Yes\n");
else
printf("No\n");
} | #include <bits/stdc++.h>
using namespace std;
string s;
set<char> d;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++)
d.insert(s[i]);
if (d.size() == s.size())
printf("yes\n");
else
printf("no\n");
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,369,685 | 1,369,686 | u047685308 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int m[26] = {0};
for (int i = 0; i < a.length(); i++)
m[a[i] - 'a']++;
int flag = 0;
for (int i = 0; i < 26; i++) {
if (a[i] > 1) {
flag = 1;
break;
}
}
if (flag)
cout << "no";
else
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
int m[26] = {0};
for (int i = 0; i < a.length(); i++)
m[a[i] - 'a']++;
int flag = 0;
for (int i = 0; i < 26; i++) {
if (m[i] > 1) {
flag = 1;
break;
}
}
if (flag == 1)
cout << "no";
else
cou... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,369,700 | 1,369,701 | u619613160 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | [
"misc.opposites",
"variable_declaration.value.change"
] | 1,369,706 | 1,369,707 | u355424600 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.