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 <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (S[i] == S[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
if (S[i] == S[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,369,712 | 1,369,713 | u531523517 | cpp |
p03698 | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
using namespace std;
string s;
int main() {
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
if (s[i] == s[i + 1]) {
cout << "NO";
return 0;
}
}
cout << "YES";
retur... | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define pi pair<int, int>
using namespace std;
string s;
int main() {
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
if (s[i] == s[i + 1]) {
cout << "no";
return 0;
}
}
cout << "yes";
retur... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,720 | 1,369,721 | u915011497 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<char> L(S.size());
for (int i = 0; i < S.size(); i++) {
S.at(i) = S.at(i);
}
sort(L.begin(), L.end());
for (int i = 1; i < L.size(); i++) {
if (L.at(i - 1) == L.at(i)) {
cout << "no" << endl;
bre... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<char> L(S.size());
for (int i = 0; i < S.size(); i++) {
L.at(i) = S.at(i);
}
sort(L.begin(), L.end());
// for(int i = 0; i < S.size(); i++){
// cout << L.at(i) << endl;
//}
for (int i = 1; i < L.size(); i... | [
"assignment.variable.change",
"identifier.change"
] | 1,369,722 | 1,369,723 | u328008034 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
rep(i, s.size() - 1) {
if (s.at(i + 1) == s.at(i)) {
cout << "no" << endl;
} else if (i == s.size() - 2) {
cout << "yes" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
rep(i, s.size() - 1) {
if (s.at(i + 1) == s.at(i)) {
cout << "no" << endl;
break;
} else if (i == s.size() - 2) {
cout << "yes" ... | [
"control_flow.break.add"
] | 1,369,724 | 1,369,725 | u116233709 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
bool single = true;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s[i] == s[j] && i != j)
single = false;
}
}
if (single)
cout << "yes" << endl;
else
cout << "no" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool single = true;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s[i] == s[j] && i != j)
single = false;
}
}
if (single)
cout << "yes" << endl;
else
cout << "no" <<... | [] | 1,369,732 | 1,369,733 | u962609087 | 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() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int bucket[26] = {0};
rep(i, s.length()) { ++bucket[s[i] - 'a']; }
rep(i, 26) {
if (bucket[i] > 1) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int bucket[26] = {0};
rep(i, s.length()) { ++bucket[s[i] - 'a']; }
rep(i, 26) {
if (bucket[i] > 1) {
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,369,736 | 1,369,737 | u374051158 | cpp |
p03698 | #include <iostream>
#include <set>
using namespace std;
int main() {
string s;
cin >> s;
set<char> p;
for (int i = 0; i < s.length(); i++) {
p.insert(s[i]);
}
if (p.size() == s.length()) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <set>
using namespace std;
int main() {
string s;
cin >> s;
set<char> p;
for (int i = 0; i < s.length(); i++) {
p.insert(s[i]);
}
if (p.size() == s.length()) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,747 | 1,369,748 | u720483676 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "YES";
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;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = "yes";
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.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,369,751 | 1,369,752 | u853580735 | cpp |
p03698 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change",
"misc.opposites",
"call.arguments.change"
] | 1,369,753 | 1,369,754 | u043443359 | cpp |
p03698 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,755 | 1,369,754 | u043443359 | cpp |
p03698 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int my_abs(int num) {
if (num > 0)
return num;
else
return -num;
}
int main() {
string S;
cin >> S;
string ans = "yes";
vector<char> SS(S.size());
for (int i = 0; i < S.size()... | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int my_abs(int num) {
if (num > 0)
return num;
else
return -num;
}
int main() {
string S;
cin >> S;
string ans = "yes";
vector<char> SS(S.size());
for (int i = 0; i < S.size()... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,369,756 | 1,369,757 | u590927341 | cpp |
p03698 | #include <bits/stdc++.h>
#define ll long long
#define dbg(x) cout << #x << "=" << x
#define nl cout << "\n"
#define frn(i, n) for (int i = 0; i < n; i++)
#define fr(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define trav(x, c) for (auto &x : c)
using namespace std;
int toint(string s) {
int ans = 0;
... | #include <bits/stdc++.h>
#define ll long long
#define dbg(x) cout << #x << "=" << x
#define nl cout << "\n"
#define frn(i, n) for (int i = 0; i < n; i++)
#define fr(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define trav(x, c) for (auto &x : c)
using namespace std;
int toint(string s) {
int ans = 0;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,761 | 1,369,762 | u651593570 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,369,767 | 1,369,768 | u342809635 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
cons... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
cons... | [
"io.output.change"
] | 1,369,771 | 1,369,772 | u963903527 | 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 = i + 1; j < S.size(); ++j) {
if (!(S[i] == S[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[i] == S[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
}
| [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 1,369,778 | 1,369,779 | u091026689 | cpp |
p03698 | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
string s;
cin >> s;
set<char> pasts;
for (int i = 0; i < s.size(); ++i) {
if (pasts.find(s[i]) == pasts.end())
pasts.insert(s[i]);
else {
cout << "No" << endl;
return 0;
... | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
string s;
cin >> s;
set<char> pasts;
for (int i = 0; i < s.size(); ++i) {
if (pasts.find(s[i]) == pasts.end())
pasts.insert(s[i]);
else {
cout << "no" << endl;
return 0;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,852 | 1,369,853 | u894471318 | cpp |
p03698 | #include <algorithm> //next_permutation
#include <iostream>
#include <set>
#include <stdio.h> //printf("%.*f\n",*********);
#include <string> //char('a'=32+'A')
#include <vector> //s.erase(n),vector
// to_string,string,substr
#include <cmath> //min,max
#include <complex>
#include <iomanip>
#include <locale>
#include ... | //解法②
#include <algorithm> //next_permutation
#include <iostream>
#include <set>
#include <stdio.h> //printf("%.*f\n",*********);
#include <string> //char('a'=32+'A')
#include <vector> //s.erase(n),vector
// to_string,string,substr
#include <cmath> //min,max
#include <complex>
#include <iomanip>
#include <locale>
#i... | [
"call.add"
] | 1,369,854 | 1,369,855 | u742306624 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string S;
cin >> S;
int N = S.size();
string ans = "yes";
for (int i = 1; i < N; i++) {
rep(j, i - 1) {
if (S[i] == S[j]) {
ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string S;
cin >> S;
int N = S.size();
string ans = "yes";
for (int i = 1; i < N; i++) {
rep(j, i) {
if (S[i] == S[j]) {
ans = "... | [
"expression.operation.binary.remove"
] | 1,369,866 | 1,369,867 | u093973314 | cpp |
p03698 | #include <stdio.h>
int main() {
char S[27];
int flag, i, n;
i = 0;
n = 0;
flag = 0;
scanf("%s\n", S);
while (S[i]) {
if (i > 0)
n = i - 1;
while (n >= 0) {
if (S[i] == S[n])
flag = 1;
n--;
}
i++;
}
if (flag)
printf("no\n");
else
printf("yes\n");
... | #include <stdio.h>
int main() {
char S[27];
int flag, i, n;
i = 0;
n = -1;
flag = 0;
scanf("%s\n", S);
while (S[i]) {
if (i > 0)
n = i - 1;
while (n >= 0) {
if (S[i] == S[n])
flag = 1;
n--;
}
i++;
}
if (flag)
printf("no\n");
else
printf("yes\n");
... | [
"literal.number.change",
"assignment.value.change"
] | 1,369,870 | 1,369,871 | u662185644 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<int> lis(26, 0);
for (int i = 0; i < str.size(); i++) {
lis[str[i] - 'a']++;
}
bool ex = true;
for (int i = 0; i < 26; i++) {
if (lis[i] >= 2) {
ex = false;
break;
}
}
if (ex)
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<int> lis(26, 0);
for (int i = 0; i < str.size(); i++) {
lis[str[i] - 'a']++;
}
bool ex = true;
for (int i = 0; i < 26; i++) {
if (lis[i] >= 2) {
ex = false;
break;
}
}
if (ex)
cout... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,881 | 1,369,882 | u147762850 | cpp |
p03698 | // When you are hungry for something and you're determined and you're focused
// and you're committed to something it's hard to surrender, isn't it?
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define ll long long
#define int ll
#define mod 1000000007
#define m... | // When you are hungry for something and you're determined and you're focused
// and you're committed to something it's hard to surrender, isn't it?
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define ll long long
#define int ll
#define mod 1000000007
#define m... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,883 | 1,369,884 | u070488164 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
bool can = true;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1]) {
can = false;
break;
}
}
cout << (can ? "Yes" : "No");
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
bool can = true;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1]) {
can = false;
break;
}
}
cout << (can ? "yes" : "no");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,887 | 1,369,886 | u873762144 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
map<char, int> mp;
bool ok = true;
rep(i, s.size()) {
if (mp[s[i]] != 0)
ok = false;
mp[s[i]]++;
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
string s;
cin >> s;
map<char, int> mp;
bool ok = true;
rep(i, s.size()) {
if (mp[s[i]] != 0)
ok = false;
mp[s[i]]++;
}... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,892 | 1,369,893 | u024191315 | 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; j < n; i++) {
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;
} | [
"control_flow.loop.for.initializer.change",
"identifier.change"
] | 1,369,902 | 1,369,903 | u016183710 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int x = 0, a[100] = {};
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (a[s[i] - 'a'] == 0)
a[s[i] - 'a']++;
else {
cout << "No" << endl;
return (0);
}
}
cout << "Yes" << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int x = 0, a[100] = {};
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (a[s[i] - 'a'] == 0)
a[s[i] - 'a']++;
else {
cout << "no" << endl;
return (0);
}
}
cout << "yes" << endl;
return (0);
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,910 | 1,369,911 | u490965711 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end());
#define vecmin(A) *min_element(A.begin(), A.end());
#define vecmax(A) *max_element(A.beg... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end());
#define vecmin(A) *min_element(A.begin(), A.end());
#define vecmax(A) *max_element(A.beg... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,369,912 | 1,369,913 | u132364782 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
void solve() {
string s;
cin >> s;
int n = s.size();
set<char> st;
for (int i = 0; i < n; i++) {
st.insert(s[i]);
}
if (st.size() == n)
cout << "Yes\n"... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
void solve() {
string s;
cin >> s;
int n = s.size();
set<char> st;
for (int i = 0; i < n; i++) {
st.insert(s[i]);
}
if (st.size() == n)
cout << "yes\n"... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,917 | 1,369,918 | u489302942 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vec1;
typedef vector<string> vec2;
typedef vector<double> vec3;
int main() {
string s;
cin >> s;
vector<char> a(1);
a.at(0) = s.at(0);
for (int i = 1; i < s.size() - 1; i++) {
for (int j = 0; j < a.size(); j++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vec1;
typedef vector<string> vec2;
typedef vector<double> vec3;
int main() {
string s;
cin >> s;
vector<char> a(1);
a.at(0) = s.at(0);
for (int i = 1; i < s.size(); i++) {
for (int j = 0; j < a.size(); j++) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,923 | 1,369,922 | u316226687 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"literal.string.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,369,928 | 1,369,929 | u454081619 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a, ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a, ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,930 | 1,369,931 | u497860952 | cpp |
p03698 | #include <iostream>
using namespace std;
int main() {
char s;
int al[26] = {};
bool ok = true;
while (cin >> s) {
if (al[s - 'a']) {
ok = true;
break;
} else
al[s - 'a']++;
}
cout << ((ok) ? "yes" : "no") << endl;
} | #include <iostream>
using namespace std;
int main() {
char s;
int al[26] = {};
bool ok = true;
while (cin >> s) {
if (al[s - 'a']) {
ok = false;
break;
} else
al[s - 'a']++;
}
cout << ((ok) ? "yes" : "no") << endl;
}
| [
"misc.opposites",
"assignment.value.change"
] | 1,369,932 | 1,369,933 | u881116515 | cpp |
p03698 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
string s;
set<char> hoge;
string ans = "yes";
for (auto a : s) {
int pre = hoge.size();
hoge.insert(a);
if (pre == hoge.size()) {
ans = "no";
break;
}
}
cout << ans << endl;
re... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
string s;
cin >> s;
set<char> hoge;
string ans = "yes";
for (auto a : s) {
int pre = hoge.size();
hoge.insert(a);
if (pre == hoge.size()) {
ans = "no";
break;
}
}
cout << ans <<... | [] | 1,369,938 | 1,369,939 | u616998927 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int al[26];
bool ans = true;
for (int i = 0; i < S.size(); i++) {
al[S[i] - 97]++;
}
for (int i = 0; i < 26; i++) {
if (al[i] >= 2)
ans = false;
}
if (ans)
cout << "yes" << endl;
else
cout << "no" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> al(26);
bool ans = true;
for (int i = 0; i < S.size(); i++) {
al[S[i] - 97]++;
}
for (int i = 0; i < 26; i++) {
if (al[i] >= 2)
ans = false;
}
if (ans)
cout << "yes" << endl;
else
cout <<... | [] | 1,369,953 | 1,369,954 | u083494782 | cpp |
p03698 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <ios... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <ios... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,369,955 | 1,369,956 | u917972976 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
j++;
if (s.at(i) == s.at(j)) {
a++;
break;
}
}
}
if (a == 0) {
cout << "yes" << endl;
} els... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s.at(i) == s.at(j)) {
a++;
break;
}
}
}
if (a == 0) {
cout << "yes" << endl;
} else {
cou... | [
"expression.unary.arithmetic.remove"
] | 1,369,964 | 1,369,965 | u457196771 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < s.size() - 1; i++) {
for (int j = 1; j < s.size(); j++) {
if (s.at(i) == s.at(j)) {
a++;
break;
}
}
}
if (a == 0) {
cout << "yes" << endl;
} else {
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s.at(i) == s.at(j)) {
a++;
break;
}
}
}
if (a == 0) {
cout << "yes" << endl;
} else {
cou... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.initializer.change"
] | 1,369,966 | 1,369,965 | u457196771 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
map<char, int> mp;
rep(i, s.size()) { mp[s[i]]++; }
if (mp.size() == s.size())
puts("yes");
else
p... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
map<char, int> mp;
rep(i, s.size()) { mp[s[i]]++; }
if (mp.size() == s.size())
puts("yes");
... | [] | 1,369,967 | 1,369,968 | u027208253 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 40;
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define all(x) ((x).begin(), (x).end())
int main() {
string s;
cin >> s;
bool f = true;
FOR(i, 0, s.size()) {
FOR(j, 0, s.size()) {
if (i != j && s[i] == ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 40;
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define all(x) ((x).begin(), (x).end())
int main() {
string s;
cin >> s;
bool f = true;
FOR(i, 0, s.size()) {
FOR(j, 0, s.size()) {
if (i != j && s[i] == ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,984 | 1,369,985 | u434282696 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
sort(s.begin(), s.end());
REP(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
cout << "no";
return 0;
}
}
cout << "yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
REP(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
cout << "no";
return 0;
}
}
cout << "yes";
return 0;
}
| [] | 1,369,986 | 1,369,987 | u469451657 | cpp |
p03698 | #include <iostream>
using namespace std;
int main() {
// your code goes here
string s;
cin >> s;
bool vis[26];
for (int i = 0; i < s.size(); ++i) {
for (int j = 0; j < s.size(); ++j) {
if (j == i)
continue;
if (s[i] == s[j]) {
cout << "No" << endl;
return 0;
}
... | #include <iostream>
using namespace std;
int main() {
// your code goes here
string s;
cin >> s;
bool vis[26];
for (int i = 0; i < s.size(); ++i) {
for (int j = 0; j < s.size(); ++j) {
if (j == i)
continue;
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,369,992 | 1,369,993 | u165709298 | cpp |
p03698 | #include <iostream>
#include <string>
#define N 1000
using namespace std;
int main(void) {
int i;
int hash[N];
char c;
string S, ans;
cin >> S;
for (i = 0; i < N; i++) {
hash[i] = 0;
}
for (i = 0; i < S.size(); i++) {
c = S[i];
hash[(unsigned char)c]++;
}
ans = "yes";
for (i = 0; i ... | #include <iostream>
#include <string>
#define N 1000
using namespace std;
int main(void) {
int i;
int hash[N];
char c;
string S, ans;
cin >> S;
for (i = 0; i < N; i++) {
hash[i] = 0;
}
for (i = 0; i < S.size(); i++) {
c = S[i];
hash[(unsigned char)c]++;
}
ans = "yes";
for (i = 0; i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,994 | 1,369,995 | u989110852 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b); (i) >= (a); --(i)) // Reversi ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.remove"
] | 1,369,996 | 1,369,997 | u801513186 | 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(); j++) {
if (S[i] == S[j]) {
cout << "No" << endl;
return 0;
}
}
}
cout << "yes" << endl;
} | #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(); 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,369,998 | 1,369,999 | u077051605 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
vector<string> s(N + 1);
for (int i = 0; i < N + 1; i++) {
s.at(i) = S.substr(i, 1);
}
sort(s.begin(), s.end());
int count = 0;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == S.at(i + 1))... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
vector<string> s(N + 1);
for (int i = 0; i < N + 1; i++) {
s.at(i) = S.substr(i, 1);
}
sort(s.begin(), s.end());
int count = 0;
for (int i = 0; i < N; i++) {
if (s.at(i) == s.at(i + 1)) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.typo",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,370,002 | 1,370,001 | u273355214 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#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++)
typedef long long ll;
int main() {
string S;
cin >> S;
bool flag = true;
for (int i = 0; i < S.length(); i++) {
for (int j = i + 1; j < S.length(); j... | #include <bits/stdc++.h>
using namespace std;
#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++)
typedef long long ll;
int main() {
string S;
cin >> S;
bool flag = true;
for (int i = 0; i < S.length(); i++) {
for (int j = i + 1; j < S.length(); j... | [
"literal.string.change",
"io.output.change"
] | 1,370,011 | 1,370,012 | u552357043 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define REPC(i, x) for (int i{0}; i <= (int)(x); i++)
#define RR... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define REPC(i, x) for (int i{0}; i <= (int)(x); i++)
#define RR... | [] | 1,370,015 | 1,370,016 | u815659544 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,370,020 | 1,370,021 | u332153950 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s.at(i) == s.at(j) && i < j) {
a++;
}
}
}
if (a == 0) {
cout << "YES" << endl;
} else {
cout << "NO" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s.at(i) == s.at(j) && i < j) {
a++;
}
}
}
if (a == 0) {
cout << "yes" << endl;
} else {
cout << "no" <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,022 | 1,370,023 | u330025192 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); i++) {
if (s.at(i) == s.at(j) && i < j) {
a++;
}
}
}
if (a == 0) {
cout << "YES" << endl;
} else {
cout << "NO" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int a = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < s.size(); j++) {
if (s.at(i) == s.at(j) && i < j) {
a++;
}
}
}
if (a == 0) {
cout << "yes" << endl;
} else {
cout << "no" <... | [
"identifier.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,024 | 1,370,023 | u330025192 | cpp |
p03698 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,370,041 | 1,370,042 | u852449189 | cpp |
p03698 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,370,045 | 1,370,046 | u824337972 | cpp |
p03697 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
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,792 | 1,369,793 | u293745895 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10) {
cout << "error" << endl;
} else
cout << a + b << endl;
} | #include <iostream>
using namespace std;
int main() {
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,801 | 1,369,802 | u495386448 | cpp |
p03697 | #include <iostream> // 入出力
#include <math.h> // 数学の関数
#include <queue> // キュー
#include <stack> // スタック
#include <string> // 文字列
#include <vector> // 配列
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B > 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}... | #include <iostream> // 入出力
#include <math.h> // 数学の関数
#include <queue> // キュー
#include <stack> // スタック
#include <string> // 文字列
#include <vector> // 配列
using namespace std;
int main() {
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,809 | 1,369,810 | u765606693 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
int c = a + b;
if (c == 10)
cout << "error" << endl;
else
cout << c << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
int c = a + b;
if (c >= 10)
cout << "error" << endl;
else
cout << c << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,817 | 1,369,818 | u823032699 | cpp |
p03697 | #include <cstring>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
#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() {
int a, b;
scanf("%d%d... | #include <cstring>
#include <map>
#include <math.h>
#include <stdio.h>
#include <vector>
#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() {
int a, b;
scanf("%d%d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,825 | 1,369,826 | u061935128 | cpp |
p03697 |
#define TESTING
// INCLUDE
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <uno... |
#define TESTING
// INCLUDE
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <uno... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,369,829 | 1,369,830 | u513683999 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
int prtn;
cin >> a >> b;
prtn = a + b;
if (prtn < 10) {
cout << prtn << "\n";
} else {
cout << "erorr\n";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
int prtn;
cin >> a >> b;
prtn = a + b;
if (prtn < 10) {
cout << prtn << "\n";
} else {
cout << "error";
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,369,833 | 1,369,834 | u170025581 | cpp |
p03697 | #include <stdio.h>
int main() {
int A, B;
scanf("%d%d", A, B);
if (A + B >= 10) {
printf("error");
} else {
printf("%d", A + B);
}
return 0;
} | #include <stdio.h>
int main() {
int A, B;
scanf("%d%d", &A, &B);
if (A + B >= 10) {
printf("error");
} else {
printf("%d", A + B);
}
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 1,369,839 | 1,369,840 | u603067482 | cpp |
p03697 | #include <stdio.h>
int main() {
int A, B;
scanf("%d%d", A, B);
if (A + B >= 10) {
printf("error");
} else {
printf("%d", A + B);
}
}
| #include <stdio.h>
int main() {
int A, B;
scanf("%d%d", &A, &B);
if (A + B >= 10) {
printf("error");
} else {
printf("%d", A + B);
}
return 0;
}
| [
"expression.operation.unary.reference.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,369,841 | 1,369,840 | u603067482 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int A;
cin >> A;
int B;
cin >> B;
if ((A + B) <= 10) {
cout << (A + B);
} else {
cout << "error";
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A;
cin >> A;
int B;
cin >> B;
if ((A + B) < 10) {
cout << (A + B);
} else {
cout << "error";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,847 | 1,369,971 | u229632297 | 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;
}
return 0;
} | #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;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,370,051 | 1,370,052 | u478191863 | cpp |
p03697 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functional>
typedef long... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functional>
typedef long... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,059 | 1,370,060 | u378419207 | cpp |
p03697 | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf \
if (false) \
fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) ... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf \
if (false) \
fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,370,061 | 1,370,062 | u904666233 | cpp |
p03697 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 01)
cout << a + b << endl;
else
cout << "error" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b << endl;
else
cout << "error" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,370,065 | 1,370,066 | u294642518 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
using namespace std;
int main() {
string s;
cin >> s;
vector<char> vec(s.length());
rep(i, s.length()) vec[i] = s[i];
for (char c = 'a'; c <= 'z'; c+... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
using namespace std;
int main() {
string s;
cin >> s;
vector<char> vec(s.length());
rep(i, s.length()) vec[i] = s[i];
for (char c = 'a'; c <= 'z'; c+... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,081 | 1,370,082 | u975481854 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
bool b = true;
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;
b = false;
}
}
if (b)
cout << "yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
bool b = true;
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;
b = false;
break;
}
}
if (b)
cout << "yes" << endl;
}
| [
"control_flow.break.add"
] | 1,370,099 | 1,370,100 | u322177979 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SREP(i, s) for (int i = 0; i < (s.size()); i++)
#define SORT(v, n) sort(v, v + n);
#define GSORT(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VGSO... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SREP(i, s) for (int i = 0; i < (s.size()); i++)
#define SORT(v, n) sort(v, v + n);
#define GSORT(v, n) sort(v, v + n, greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VGSO... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,103 | 1,370,104 | u398211442 | cpp |
p03698 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,370,105 | 1,370,106 | u041282550 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (count(s.begin(), s.end(), s[i]) > 1) {
cout << 'no' << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (count(s.begin(), s.end(), s[i]) > 1) {
cout << "no" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 1,370,107 | 1,370,108 | u440032761 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | [] | 1,370,109 | 1,370,110 | u069450081 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int a[26] = {};
for (int i = 0; i < S.length(); i++) {
a[S[i] - 'a']++;
}
bool ans = true;
for (int i = 0; i < 26; i++) {
if (a[i] > 1) {
ans = false;
break;
}
}
if (ans)
cout << "yes";
else
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int a[26] = {};
for (int i = 0; i < S.length(); i++) {
a[S[i] - 'a']++;
}
bool ans = true;
for (int i = 0; i < 26; i++) {
if (a[i] > 1) {
ans = false;
break;
}
}
if (ans)
cout << "yes";
else
... | [] | 1,370,113 | 1,370,114 | u593555034 | cpp |
p03698 | #include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
// Sを定義
cin >> S;
//標準入力
string ans = "yes";
//出力用の文字列変数ansを定義
for (int i = 0; i < S.length() - 1;
i++) { // S.length()-1;末尾の文字を基準にチェックする必要はないため
for (int j = i + 1; j < S.length();
j++) { // j = i + 1;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
// Sを定義
cin >> S;
//標準入力
string ans = "yes";
//出力用の文字列変数ansを定義
for (int i = 0; i < S.length() - 1;
i++) { // S.length()-1;末尾の文字を基準にチェックする必要はないため
for (int j = i + 1; j < S.length();
j++) { // j = i + 1;
... | [
"expression.operation.binary.remove"
] | 1,370,115 | 1,370,116 | u600215903 | cpp |
p03698 | #include <iostream>
using namespace std;
int main() {
string S;
// Sを定義
cin >> S;
//標準入力
string ans = "yes";
//出力用の文字列変数ansを定義
for (int i = 0; i < S.length() - 1; i++) {
for (int j = i + 1; j < S.length(); j++) {
if (S[i] == S[j]) {
ans = "no";
}
cout << ans << endl;
}
... | #include <iostream>
using namespace std;
int main() {
string S;
// Sを定義
cin >> S;
//標準入力
string ans = "yes";
//出力用の文字列変数ansを定義
for (int i = 0; i < S.length() - 1; i++) {
for (int j = i + 1; j < S.length(); j++) {
if (S[i] == S[j]) {
ans = "no";
}
}
}
cout << ans << endl;
... | [] | 1,370,117 | 1,370,118 | u600215903 | cpp |
p03698 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
int n = s.size();
sort(all(s));
int m = unique(all(... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
sort(all(s));
int m =... | [] | 1,370,121 | 1,370,122 | u562319622 | cpp |
p03698 | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
template <typename T> void output(T, int);
int gcd(int a, int b);
void prime_map(map<ll, ll> &, ll);
int main() {
// source
string s;
cin >> s;
int num[26]... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
template <typename T> void output(T, int);
int gcd(int a, int b);
void prime_map(map<ll, ll> &, ll);
int main() {
// source
string s;
cin >> s;
int num[26]... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,125 | 1,370,126 | u030992242 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
string s;
cin >> s;
n = s.size();
x = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (s.at(i) = s.at(j)) {
x++;
cout << "no" << endl;
break;
}
}
if (x > 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
string s;
cin >> s;
n = s.size();
x = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (s.at(i) == s.at(j)) {
x++;
cout << "no" << endl;
break;
}
}
if (x > 0) {
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,370,127 | 1,370,128 | u646051775 | cpp |
p03698 | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++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 all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++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 all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeo... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,370,133 | 1,370,134 | u535810324 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> A(s.size());
for (int i = 0; i < s.size(); i++) {
A[i] = s[i];
}
sort(A.begin(), A.end());
int yes = 0;
for (int i = 0; i < s.size(); i++) {
if (A[i] == A[i + 1]) {
yes = 1;
break;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> A(s.size());
for (int i = 0; i < s.size(); i++) {
A[i] = s[i];
}
sort(A.begin(), A.end());
int yes = 0;
for (int i = 0; i < s.size(); i++) {
if (A[i] == A[i + 1]) {
yes = 1;
break;
}
}
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,137 | 1,370,138 | u371149954 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int count[26] = {0};
for (int i = 0; i < S.length(); i++) {
for (int j = 0; j < 26; j++) {
if (S[i] == 'a' + j)
count[j]++;
}
}
for (int i = 0; i < 26; i++) {
if (count[i] > 1) {
cout << "No"... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int count[26] = {0};
for (int i = 0; i < S.length(); i++) {
for (int j = 0; j < 26; j++) {
if (S[i] == 'a' + j)
count[j]++;
}
}
for (int i = 0; i < 26; i++) {
if (count[i] > 1) {
cout << "no"... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,145 | 1,370,146 | u965730380 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int alphabet[30] = {0};
for (int i = 0; i < S.size(); i++) {
int c = S[i] - '0';
if (alphabet[c] != 0) {
cout << "no" << endl;
return 0;
}
alphabet[c]++;
}
cout << "yes" << endl;
retu... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int alphabet[30] = {0};
for (int i = 0; i < S.size(); i++) {
int c = S[i] - 'a';
if (alphabet[c] != 0) {
cout << "no" << endl;
return 0;
}
alphabet[c]++;
}
cout << "yes" << endl;
retu... | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,370,150 | 1,370,151 | u904123392 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int alphabet[30] = {0};
for (int i = 0; i < S.size(); i++) {
int c = S[i] - '0';
if (alphabet[c] != 0) {
cout << "No" << endl;
return 0;
}
alphabet[c]++;
}
cout << "Yes" << endl;
retu... | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int alphabet[30] = {0};
for (int i = 0; i < S.size(); i++) {
int c = S[i] - 'a';
if (alphabet[c] != 0) {
cout << "no" << endl;
return 0;
}
alphabet[c]++;
}
cout << "yes" << endl;
retu... | [
"literal.string.change",
"expression.operation.binary.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,152 | 1,370,151 | u904123392 | 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], i + 1) < 100) {
cout << "yes" << endl;
return 0;
}
}
cout << "no" << 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) < 100) {
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,370,153 | 1,370,154 | u202496605 | cpp |
p03698 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
bool can = true;
for (char c = 'a'; c <= 'z'; c++) {
int cnt = count(s.begin(), s.end(), c);
if (1 <= cnt && cnt <= s.size())
can = false;
}
if (can)
cout << "ye... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string s;
cin >> s;
bool can = true;
for (char c = 'a'; c <= 'z'; c++) {
int cnt = count(s.begin(), s.end(), c);
if (2 <= cnt && cnt <= s.size())
can = false;
}
if (can)
cout << "ye... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,370,155 | 1,370,156 | u095756391 | cpp |
p03698 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
int main() {
string S;
cin >> S;
bool ok = true;
for (int i = 0; i < S.size() - 1; i++) {
for (int j = i + 1; j < S.size(); j++) {
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
int main() {
string S;
cin >> S;
bool ok = true;
for (int i = 0; i < S.size() - 1; i++) {
for (int j = i + 1; j < S.size(); j++) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,161 | 1,370,162 | u314008046 | cpp |
p03698 | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
set<char> s;
bool isdup = false;
for (char c : s) {
auto r = s.insert(c);
isdup = !r.second;
if (isdup) {
break;
}
}
cout << (!isdup ? "yes" : "no") << endl;
return 0;... | #include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
set<char> s;
bool isdup = false;
for (char c : str) {
auto r = s.insert(c);
isdup = !r.second;
if (isdup) {
break;
}
}
cout << (!isdup ? "yes" : "no") << endl;
return ... | [
"identifier.change"
] | 1,370,171 | 1,370,172 | u408023666 | cpp |
p03698 | #include <iostream>
#include <set>
#include <string>
int main() {
std::string str;
std::cin >> str;
std::set<char> s;
bool isdup = false;
for (int i = 0; i < str.size(); i++) {
auto r = s.insert(str[i]);
isdup = !r.second;
if (isdup) {
break;
}
}
std::cout << (isdup ? "yes" : "no"... | #include <iostream>
#include <set>
#include <string>
int main() {
std::string str;
std::cin >> str;
std::set<char> s;
bool isdup = false;
for (int i = 0; i < str.size(); i++) {
auto r = s.insert(str[i]);
isdup = !r.second;
if (isdup) {
break;
}
}
std::cout << (!isdup ? "yes" : "no... | [
"expression.operation.unary.add"
] | 1,370,173 | 1,370,174 | u408023666 | 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 = i + 1; j < s.size() - i; j++) {
if (s[i] == s[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(); i++) {
for (int j = i + 1; j < s.size(); j++) {
if (s[i] == s[j]) {
cout << "no" << endl;
return 0;
}
}
}
cout << "yes" << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,370,177 | 1,370,176 | u876386943 | cpp |
p03698 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) ... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) ... | [
"expression.operation.binary.add"
] | 1,370,178 | 1,370,179 | u239493918 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
set<char> s;
int main() {
string t;
cin >> t;
for (char c : t)
s.insert(c);
if (t.size() == s.size())
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
set<char> s;
int main() {
string t;
cin >> t;
for (char c : t)
s.insert(c);
if (t.size() == s.size())
cout << "yes";
else
cout << "no";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,182 | 1,370,183 | u506302470 | cpp |
p03698 | #include <iostream>
using namespace std;
int main() {
string S;
bool t = false;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
for (int j = i + 1; j < S.size(); ++j) {
if (S[i] == S[j]) {
t = true;
}
}
}
if (t) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
... | #include <iostream>
using namespace std;
int main() {
string S;
bool t = false;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
for (int j = i + 1; j < S.size(); ++j) {
if (S[i] == S[j]) {
t = true;
}
}
}
if (t) {
cout << "no" << endl;
} else {
cout << "yes" << endl;
... | [
"literal.string.change",
"io.output.change"
] | 1,370,186 | 1,370,187 | u722183882 | cpp |
p03698 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
size_t n = s.size();
bool diff = true;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i >= j)
continue;
if (s[i] == s[j])
diff = false;
}
}
if (diff)
cout <... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
size_t n = s.size();
bool diff = true;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i >= j)
continue;
if (s[i] == s[j])
diff = false;
}
}
if (diff)
cout <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,188 | 1,370,189 | u984529214 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool is_yes = false;
for (int i = 0; i < s.size() - 1; i++) {
for (int t = i + 1; t < s.size(); t++) {
if (s.at(i) == s.at(t)) {
is_yes = true;
}
}
}
if (is_yes) {
cout << "yes" << endl;
} else {... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool is_yes = false;
for (int i = 0; i < s.size() - 1; i++) {
for (int t = i + 1; t < s.size(); t++) {
if (s.at(i) == s.at(t)) {
is_yes = true;
}
}
}
if (is_yes) {
cout << "no" << endl;
} else {
... | [
"literal.string.change",
"io.output.change"
] | 1,370,190 | 1,370,191 | u604231488 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
bool x = true;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size() - i; j++) {
if (a.at(i) == a.at(j))
x = false;
}
}
if (x == true)
cout << "yes" << endl;
else
cout << "no" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
bool x = true;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
if (a.at(i) == a.at(j))
x = false;
}
}
if (x == true)
cout << "yes" << endl;
else
cout << "no" << e... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,370,192 | 1,370,193 | u513726585 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
bool x = true;
for (int i = 0; i < a.size(); i++) {
for (int j = i + 1; j < a.size() - i - 1; j++) {
if (a.at(i) == a.at(j))
x = false;
}
}
if (x == true)
cout << "yes" << endl;
else
cout << "no" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
bool x = true;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
if (a.at(i) == a.at(j))
x = false;
}
}
if (x == true)
cout << "yes" << endl;
else
cout << "no" << e... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 1,370,194 | 1,370,193 | u513726585 | cpp |
p03698 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
bool x = true;
for (int i = 0; i < a.size(); i++) {
for (int j = i + 1; j < a.size() - i; j++) {
if (a.at(i) == a.at(j))
x = false;
}
}
if (x == true)
cout << "yes" << endl;
else
cout << "no" << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
bool x = true;
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
if (a.at(i) == a.at(j))
x = false;
}
}
if (x == true)
cout << "yes" << endl;
else
cout << "no" << e... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 1,370,195 | 1,370,193 | u513726585 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <iostream>
#define REP(i, N) for (int i = 0; i < (N); i++)
using namespace std;
string s;
bool ck[26];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> s;
REP(i, 26) ck[i] = true;
REP(i, 26) {
int index = (int)s[i] % 26;
if (ck[index]) {... | #include <algorithm>
#include <cmath>
#include <iostream>
#define REP(i, N) for (int i = 0; i < (N); i++)
using namespace std;
string s;
bool ck[26];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> s;
REP(i, 26) ck[i] = true;
REP(i, s.length()) {
int index = (int)s[i] % 26;
if (ck[i... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"call.add"
] | 1,370,200 | 1,370,201 | u811202694 | cpp |
p03698 | /*
平面上に N 個の点があり、それぞれ 0 から N−1 までの番号が付けられており、
それぞれの点について x 座標と y 座標が与えられています。
その N 点のうち 2
点を選び結んで得られる線分のうち、最も長くなる線分の長さを求めてください。
*/
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = true;
for (int i = 0; i < s.length(); ++i) {
for (int... | /*
平面上に N 個の点があり、それぞれ 0 から N−1 までの番号が付けられており、
それぞれの点について x 座標と y 座標が与えられています。
その N 点のうち 2
点を選び結んで得られる線分のうち、最も長くなる線分の長さを求めてください。
*/
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = true;
for (int i = 0; i < s.length(); ++i) {
for (int... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,370,210 | 1,370,211 | u757738907 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[27] = {};
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
a[s[i] - 'a']++;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[27] = {};
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
a[s[i] - 'a']++;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,370,218 | 1,370,219 | u517700219 | cpp |
p03698 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[26] = {};
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
a[s[i] - 'a']++;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int a[27] = {};
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
a[s[i] - 'a']++;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 1,370,221 | 1,370,219 | u517700219 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.