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 <cstring>
#include <fstream>
#include <iostream>
using namespace std;
int n, i, j, a, b, fr[30], l, ok;
char s[100001];
int main() {
cin >> s;
l = strlen(s);
ok = 1;
for (i = 0; i < l; i++) {
fr[s[i] - 'a']++;
if (fr[s[i]] - 'a' > 1)
ok = 0;
}
if (ok)
cout << "yes\n";
else
... | #include <cstring>
#include <fstream>
#include <iostream>
using namespace std;
int n, i, j, a, b, fr[30], l, ok;
char s[100001];
int main() {
cin >> s;
l = strlen(s);
ok = 1;
for (i = 0; i < l; i++) {
fr[s[i] - 'a']++;
if (fr[s[i] - 'a'] > 1)
ok = 0;
}
if (ok)
cout << "yes\n";
else
... | [
"control_flow.branch.if.condition.change"
] | 1,370,777 | 1,370,778 | u479429581 | cpp |
p03699 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, s = 0;
scanf("%d", &n);
priority_queue<int, vector<int>, greater<int>> p;
rep(i, n) {
int a;
scanf("%d", &a);
s += a;
if (s % 10 != 0)
p.push(a);
}
if (s % 10 == 0) {
if... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, s = 0;
scanf("%d", &n);
priority_queue<int, vector<int>, greater<int>> p;
rep(i, n) {
int a;
scanf("%d", &a);
s += a;
if (a % 10 != 0)
p.push(a);
}
if (s % 10 == 0) {
if... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,370,797 | 1,370,796 | u757584836 | cpp |
p03699 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); \
i += 1 - 2 * ((begin) > ... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); \
i += 1 - 2 * ((begin) > ... | [
"control_flow.branch.if.condition.change"
] | 1,370,806 | 1,370,807 | u494904817 | cpp |
p03699 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <stdio.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll = long long;
using ull = unsigned long long;
const ll INF = 1001001001;
// 10億7。 100000007
//最大公約数
ll gcd... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <stdio.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll = long long;
using ull = unsigned long long;
const ll INF = 1001001001;
// 10億7。 100000007
//最大公約数
ll gcd... | [
"expression.operation.binary.add"
] | 1,370,808 | 1,370,809 | u762502257 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<int> s(n);... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<int> s(n);... | [] | 1,370,812 | 1,370,813 | u443971699 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int N;
cin >> N;
int ans = 0;
vector<int> vec(N);
REP(i, N) {
cin >> vec[i];
ans += vec[i];
}
sort(vec.begin(), vec.end());... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
signed main() {
int N;
cin >> N;
int ans = 0;
vector<int> vec(N);
REP(i, N) {
cin >> vec[i];
ans += vec[i];
}
sort(vec.begin(), vec.end());... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,370,823 | 1,370,824 | u342075214 | cpp |
p03699 | #include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(int argc, char const *argv[]) {
int N;
int sum = 0;
scanf("%d", &N);
int s[N];
int a[N];
for (int i = 0; i < N; i++) {
scanf("%d", s + i);
sum += s[i];
if (s[i] % 1... | #include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(int argc, char const *argv[]) {
int N;
int sum = 0;
scanf("%d", &N);
int s[N];
int a[N];
for (int i = 0; i < N; i++) {
scanf("%d", s + i);
sum += s[i];
if (s[i] % 1... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 1,370,828 | 1,370,829 | u912952979 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, c = 0;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
c += s[i];
}
bool f = false;
sort(s.begin(), s.end());
for (int i = 0; i < N; i++) {
if (c % 10 != 0) {
break;
f = true;
}
if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, c = 0;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
c += s[i];
}
bool f = false;
sort(s.begin(), s.end());
for (int i = 0; i < N; i++) {
if (c % 10 != 0) {
f = true;
break;
}
if (... | [
"control_flow.break.add"
] | 1,370,834 | 1,370,835 | u890758760 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long total = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
total += a[i];
}
if (total % 10 == 0) {
int Min = 101;
for (int i = 0; i < n; i++) {
if (a[i] % 10 != 0)
Min = min... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long total = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
total += a[i];
}
if (total % 10 == 0) {
int Min = 100;
for (int i = 0; i < n; i++) {
if (a[i] % 10 != 0)
Min = min... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,370,840 | 1,370,841 | u028906014 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int s[n];
int sum = 0, t = 0;
int cnt = 101;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
if (s[i] != 0) {
t = 1;
}
if (s[i] != 0) {
cnt = min(cnt, s[i]);
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int s[n];
int sum = 0;
int t = 0;
int cnt = 101;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
if (s[i] % 10 != 0) {
t = 1;
}
if (s[i] % 10 != 0) {
cnt = min(cnt, s[... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,370,846 | 1,370,845 | u883323885 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s.begin(), s.end());
int ans = 0;
for (int i = 0; i < n; i++)
ans += s[i];
if (ans % 10 != 0)
cout << ans << endl;
else {
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s.begin(), s.end());
int ans = 0;
for (int i = 0; i < n; i++)
ans += s[i];
if (ans % 10 != 0)
cout << ans << endl;
else {
for (int i = 0; i < n; ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,370,849 | 1,370,850 | u105533331 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s.begin(), s.end());
int ans = 0;
for (int i = 0; i < n; i++)
ans += s[i];
if (ans % 10 != 0)
cout << ans << endl;
else {
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s.begin(), s.end());
int ans = 0;
for (int i = 0; i < n; i++)
ans += s[i];
if (ans % 10 != 0)
cout << ans << endl;
else {
for (int i = 0; i < n; ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,370,851 | 1,370,850 | u105533331 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++... | [
"expression.operation.binary.add"
] | 1,370,854 | 1,370,855 | u809967037 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
int m = 105;
int count = 0;
rep(i, n) {
int s;
cin >> s;
if (m % 10 != 0)
m = min(m, s);
else
count++;
ans += s;
}
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
int m = 105;
int count = 0;
rep(i, n) {
int s;
cin >> s;
if (s % 10 != 0)
m = min(m, s);
else
count++;
ans += s;
}
i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,370,858 | 1,370,859 | u854161810 | cpp |
p03699 | //大文字->小文字 tolower(),逆はtoupper()
// int a = stoi(c); 文字列をintへ
//途中の出力をそのまま残さない
//数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
//絶対値 abs()
//入力は空白で切れる
//大文字判定 isupper(文字) 小文字判定 islow... | //大文字->小文字 tolower(),逆はtoupper()
// int a = stoi(c); 文字列をintへ
//途中の出力をそのまま残さない
//数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
//絶対値 abs()
//入力は空白で切れる
//大文字判定 isupper(文字) 小文字判定 islow... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,370,860 | 1,370,861 | u565692645 | cpp |
p03699 | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,370,862 | 1,370,863 | u704625420 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> nos(n, 0);
for (int i = 0; i < n; i++)
cin >> nos[i];
sort(nos.begin(), nos.end());
int sumi = 0;
for (int i = 0; i < n; i++)
sumi += nos[i];
if (sumi % 10 != 0)
cout << sumi;
else {
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> nos(n, 0);
for (int i = 0; i < n; i++)
cin >> nos[i];
sort(nos.begin(), nos.end());
int sumi = 0;
for (int i = 0; i < n; i++)
sumi += nos[i];
if (sumi % 10 != 0)
cout << sumi;
else {
for (int i = 0;... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,370,871 | 1,370,872 | u004676431 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<int> s(N, 0);
int sum = 0;
for (int i = 0; i < N; ++i) {
cin >> s[i];
sum += s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < N; ++i) {
if (sum % 10 == 0) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<int> s(N, 0);
int sum = 0;
for (int i = 0; i < N; ++i) {
cin >> s[i];
sum += s[i];
}
sort(s.begin(), s.end());
for (int i = 0; i < N; ++i) {
if (sum % 10 == 0) {... | [
"call.add",
"call.exit0.add"
] | 1,370,873 | 1,370,874 | u701527888 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int a, n, ans = 0, min5 = 105, all10 = 0;
cin >> n;
rep(i, n) {
cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int a, n, ans = 0, min5 = 105, all10 = 0;
cin >> n;
rep(i, n) {
cin >... | [] | 1,370,877 | 1,370,878 | u277956366 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int a, n, ans = 0, min5 = 95, all10 = 0;
cin >> n;
rep(i, n) {
cin >>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int a, n, ans = 0, min5 = 105, all10 = 0;
cin >> n;
rep(i, n) {
cin >... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,370,879 | 1,370,878 | u277956366 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int a, n, ans = 0, min5 = 95, all10 = 0;
cin >> n;
rep(i, n) {
cin >>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int a, n, ans = 0, min5 = 105, all10 = 0;
cin >> n;
rep(i, n) {
cin >... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,370,880 | 1,370,878 | u277956366 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = 0;
int s = 100000;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
k += x;
if (x % 10 != 0)
s = min(s, x);
}
if (k % 10 != 0)
cout << k << endl;
else if (s = !100000)
cout << k - s << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = 0;
int s = 100000;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
k += x;
if (x % 10 != 0)
s = min(s, x);
}
if (k % 10 != 0)
cout << k << endl;
else if (s != 100000)
cout << k - s << endl;
... | [
"control_flow.branch.if.condition.change",
"expression.operation.unary.logical.remove"
] | 1,370,888 | 1,370,889 | u247123590 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], k = 0, l = 999999999;
for (int i = 0; i < n; i++) {
cin >> a[i];
k += a[i];
if (l > a[i] && a[i] % 10 != 0)
l = a[i];
}
if (l = 999999999)
l = k;
if (k % 10 == 0)
k -= l;
cout << k;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], k = 0, l = 999999999;
for (int i = 0; i < n; i++) {
cin >> a[i];
k += a[i];
if (l > a[i] && a[i] % 10 != 0)
l = a[i];
}
if (l == 999999999)
l = k;
if (k % 10 == 0)
k -= l;
cout << k;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,370,898 | 1,370,899 | u222643545 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], k = 0, l = 999999999;
for (int i = 0; i < n; i++) {
cin >> a[i];
k += a[i];
if (l > a[i] && a[i] % 10 == 0)
l = a[i];
}
if (l = 999999999)
l = k;
if (k % 10 == 0)
k -= l;
cout << k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], k = 0, l = 999999999;
for (int i = 0; i < n; i++) {
cin >> a[i];
k += a[i];
if (l > a[i] && a[i] % 10 != 0)
l = a[i];
}
if (l == 999999999)
l = k;
if (k % 10 == 0)
k -= l;
cout << k;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,370,900 | 1,370,899 | u222643545 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#defin... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 1,370,910 | 1,370,911 | u790461875 | cpp |
p03699 | #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>;
#include <math.h>
const int INF = 1001001001;
main() {
int N;
cin >> N;
vector<int> S(N + 10);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.e... | #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>;
#include <math.h>
const int INF = 1001001001;
main() {
int N;
cin >> N;
vector<int> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end())... | [
"expression.operation.binary.remove"
] | 1,370,916 | 1,370,917 | u209457657 | cpp |
p03699 | #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>;
#include <math.h>
const int INF = 1001001001;
main() {
int N;
cin >> N;
vector<int> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end())... | #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>;
#include <math.h>
const int INF = 1001001001;
main() {
int N;
cin >> N;
vector<int> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end())... | [] | 1,370,918 | 1,370,917 | u209457657 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> s;
rep... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> s;
rep... | [
"call.add"
] | 1,370,921 | 1,370,922 | u596311864 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
int n;
vector<int> s(n);
int ans = 0;
int tmp = mod;
for (int i = 0; i < n; i++) {
cin >> s[i];
ans += s[i];
if (tmp > s[i] && s[i] % 10 != 0)
tmp = s[i];
}
if (ans % 10 != 0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> s(n);
int ans = 0;
int tmp = mod;
for (int i = 0; i < n; i++) {
cin >> s[i];
ans += s[i];
if (tmp > s[i] && s[i] % 10 != 0)
tmp = s[i];
}
if (ans %... | [] | 1,370,928 | 1,370,929 | u191484928 | cpp |
p03699 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#def... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 1,370,930 | 1,370,931 | u932275750 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(c) (ll)((c).siz... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(c) (ll)((c).siz... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,370,934 | 1,370,935 | u073139376 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<ll, ll>> prime_factorize(ll n) { //素因数分解と各素数の個数
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0) {
continue;
}
int num = 0;
while... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<ll, ll>> prime_factorize(ll n) { //素因数分解と各素数の個数
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0) {
continue;
}
int num = 0;
while... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,370,951 | 1,370,952 | u109191542 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
sort(data.begin(), data.end());
int ans = 0;
for (int i = 0; i < n; i++) {
ans += data.at(i);
}
if (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
sort(data.begin(), data.end());
int ans = 0;
for (int i = 0; i < n; i++) {
ans += data.at(i);
}
if (... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,370,953 | 1,370,954 | u643145482 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
long long sum = accumulate(s.begin(), s.end(), 0LL);
sort(s.begin(), s.end());
if (sum % 10 != 0)
cout << sum... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
long long sum = accumulate(s.begin(), s.end(), 0LL);
sort(s.begin(), s.end());
if (sum % 10 != 0)
cout << sum... | [] | 1,370,967 | 1,370,968 | u936558609 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp, -1, sizeof(dp))
const ll mod = 1e9 + 7;
void _IOS() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(0);
}
#define PI 3.14159265359
int sx, sy, tx, ty;
struct threeElemen... | #include <bits/stdc++.h>
using namespace std;
#define oo (long long)1e18
#define ll long long
#define setdp memset(dp, -1, sizeof(dp))
const ll mod = 1e9 + 7;
void _IOS() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(0);
}
#define PI 3.14159265359
int sx, sy, tx, ty;
struct threeElemen... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,370,988 | 1,370,989 | u993904785 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for (int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> score;
int ans = 0;
int ten;
rep(i, n) {
int x;
cin >> x;
score.push_back(x);
ans += score[i];
if (score[i] % 10 == ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for (int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> score;
int ans = 0;
int ten = 0;
rep(i, n) {
int x;
cin >> x;
score.push_back(x);
ans += score[i];
if (score[i] % 10... | [
"variable_declaration.value.change"
] | 1,371,002 | 1,371,003 | u798093965 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n;
scanf("%d", &n);
vector<int> s(n);
int sum = 0;
rep(i, n) {
scanf("%d", &s[i]);
sum += s[i];
}
if (sum % 10 == 0) {
sort(s.begin(), s.end());
rep(i, n) {
if (s[i] % 10... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n;
scanf("%d", &n);
vector<int> s(n);
int sum = 0;
rep(i, n) {
scanf("%d", &s[i]);
sum += s[i];
}
if (sum % 10 == 0) {
sort(s.begin(), s.end());
rep(i, n) {
if (s[i] % 10... | [
"control_flow.break.add"
] | 1,371,006 | 1,371,007 | u381860804 | cpp |
p03699 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int, int>;
int main() {
int N, a;
cin >> N;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int, int>;
int main() {
int N, a;
cin >> N;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,371,008 | 1,371,009 | u390997234 | cpp |
p03699 | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int, int>;
int main() {
int N, a;
cin >> N;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int, int>;
int main() {
int N, a;
cin >> N;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,371,010 | 1,371,009 | u390997234 | cpp |
p03699 | /** "Ever tried.
Ever failed.
No matter.
Try Again.
Fail again.
Fail better.**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#defin... | /** "Ever tried.
Ever failed.
No matter.
Try Again.
Fail again.
Fail better.**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#defin... | [
"control_flow.branch.if.condition.change"
] | 1,371,019 | 1,371,020 | u973466769 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
bool F = false;
long long M = 0;
long long L = 100;
cin >> N;
vector<int> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
M += vec.at(X);
if (vec.at(X) % 10 != 0 && L > vec.at(X)) {
L = vec.at(X);
bool F = t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
bool F = false;
long long M = 0;
long long L = 100;
cin >> N;
vector<int> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
M += vec.at(X);
if (vec.at(X) % 10 != 0 && L > vec.at(X)) {
L = vec.at(X);
F = true;
... | [] | 1,371,039 | 1,371,040 | u740002394 | cpp |
p03699 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, sum = 0, cnt = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v.at(i);
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
sum += v.at(i);
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, sum = 0, cnt = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v.at(i);
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
sum += v.at(i);
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,371,049 | 1,371,050 | u573909039 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,371,055 | 1,371,056 | u917049698 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
int ans = 0;
for (int i = 0; i < N; i++) {
ans += s[i];
}
if (ans % 10 != 0)
cout << ans... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
int ans = 0;
for (int i = 0; i < N; i++) {
ans += s[i];
}
if (ans % 10 != 0)
cout << ans... | [] | 1,371,065 | 1,371,066 | u665871498 | cpp |
p03699 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = 1e9;
const L... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = 1e9;
const L... | [
"control_flow.break.remove",
"control_flow.return.add"
] | 1,371,075 | 1,371,076 | u938389536 | cpp |
p03699 | #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
... | [
"assignment.add"
] | 1,371,079 | 1,371,080 | u590927341 | cpp |
p03699 | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | // include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// container util
//------------------... | [] | 1,371,100 | 1,371,101 | u150376070 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
using namespace std;
int main() {
int n, m = 100, a, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
s += a;
m = min(m, a);
}
if (s % 10 == 0)
s -= m;
cout << (s % 10 ? s : 0) << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
using namespace std;
int main() {
int n, m = 100, a, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
s += a;
if (a % 10)
m = min(m, a);
}
if (s % 10 == 0)
s -= m;
cout << (s % 10 ? s : 0) << endl;
} | [
"control_flow.branch.if.add"
] | 1,371,135 | 1,371,136 | u601082779 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
long long N, M, K, ans;
int main() {
cin >> N;
ans = 0;
vector<long long> a;
for (int i = 0; i < N; i++) {
cin >> M;
a.push_back(M);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
long long N, M, K, ans;
int main() {
cin >> N;
ans = 0;
vector<long long> a;
for (int i = 0; i < N; i++) {
cin >> M;
a.push_back(M);
... | [
"assignment.add"
] | 1,371,172 | 1,371,173 | u568682546 | cpp |
p03699 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int s[111];
cin >> N;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
sum += s[i];
}
sort(s, s + N);
if (sum % 10 == 0) {
int tmp = -1;
for (int i = 0; i < N; i++) {
if (s[i] % 10 != 10) ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int s[111];
cin >> N;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
sum += s[i];
}
sort(s, s + N);
if (sum % 10 == 0) {
int tmp = -1;
for (int i = 0; i < N; i++) {
if (s[i] % 10 != 0) {... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,371,189 | 1,371,190 | u973997867 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, ans = 0, min = 101;
cin >> n;
vector<int> dp(n);
for (int i = 0; i < n; i++) {
cin >> s;
ans += s;
if (s % 10 != 0)
min = s;
}
if (ans % 10 != 0)
cout << ans << endl;
else if (min == 101)
cout << 0 << endl;
el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, ans = 0, min = 101;
cin >> n;
vector<int> dp(n);
for (int i = 0; i < n; i++) {
cin >> s;
ans += s;
if (s % 10 != 0 && min > s)
min = s;
}
if (ans % 10 != 0)
cout << ans << endl;
else if (min == 101)
cout << 0 <<... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,371,193 | 1,371,194 | u947750088 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a[100], cnt = 0, b = 99, c_nt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt += a[i];
if (a[i] % 10 == 0) {
c_nt++;
}
if (a[i] % 10 != 0) {
b = min(b, a[i]);
}
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a[100], cnt = 0, b = 1000, c_nt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt += a[i];
if (a[i] % 10 == 0) {
c_nt++;
}
if (a[i] % 10 != 0) {
b = min(b, a[i]);
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,371,207 | 1,371,206 | u401900157 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long MOD = 998244353;
const long long INF = 1LL << 60;
const int inf = pow(10, 9) + 7;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(... | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long MOD = 998244353;
const long long INF = 1LL << 60;
const int inf = pow(10, 9) + 7;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,371,208 | 1,371,209 | u811472478 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> da(n);
for (int i = 0; i < n; i++) {
cin >> da[i];
ans += da[i];
}
if (ans % 10 == 0) {
cout << ans << endl;
return 0;
}
sort(da.begin(), da.end());
int i = 0;
while (da[i] % 10 == 0 && i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> da(n);
for (int i = 0; i < n; i++) {
cin >> da[i];
ans += da[i];
}
if (ans % 10 != 0) {
cout << ans << endl;
return 0;
}
sort(da.begin(), da.end());
int i = 0;
while (da[i] % 10 == 0 && i... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,371,212 | 1,371,213 | u057079894 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | [
"control_flow.branch.if.condition.change"
] | 1,371,221 | 1,371,222 | u128676584 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> V(N);
int x, sum, count, m;
sum = 0;
m = 0;
count = 0;
for (int i = 0; i < N; i++) {
cin >> x;
sum += x;
if (x % 10 != 0) {
m = min(m, x);
count++;
}
}
if (sum % 10 != 0)
cout ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> V(N);
int x, sum, count, m;
sum = 0;
m = 100;
count = 0;
for (int i = 0; i < N; i++) {
cin >> x;
sum += x;
if (x % 10 != 0) {
m = min(m, x);
count++;
}
}
if (sum % 10 != 0)
cou... | [
"literal.number.change",
"assignment.value.change"
] | 1,371,223 | 1,371,224 | u503870829 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> s(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
sum += s[i];
}
if (sum % 10 == 0) {
int sum_c = sum;
sort(s.begin(), s.end());
for (int i = 0; i < ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> s(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> s[i];
sum += s[i];
}
if (sum % 10 == 0) {
int sum_c = sum;
sort(s.begin(), s.end());
for (int i = 0; i < ... | [] | 1,371,251 | 1,371,252 | u010708243 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int s[n], sum = 0;
bool b[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
if (s[i] % 10 == 0)
b[i] = true;
else
b[i] = false;
}
bool te... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int s[n], sum = 0;
bool b[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
if (s[i] % 10 == 0)
b[i] = true;
else
b[i] = false;
}
bool te... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 1,371,253 | 1,371,254 | u513726585 | cpp |
p03699 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
vector<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> ... | [] | 1,371,273 | 1,371,274 | u732817215 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n;
cin >> n;
ll ans = 0;
ll ans2 = INF;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
ans += x;
if (x != 10) {
ans2 = min(ans2, x);
}
}
cout << (ans %... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n;
cin >> n;
ll ans = 0, ans2 = INF;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
ans += x;
if (x % 10 != 0) {
ans2 = min(ans2, x);
}
}
cout << (ans % 1... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,371,282 | 1,371,283 | u166378830 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n;
cin >> n;
ll ans = 0;
ll ans2 = INF;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
ans += x;
if (x != 10) {
ans2 = min(ans2, x);
}
}
cout << (ans %... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
ll n;
cin >> n;
ll ans = 0;
ll ans2 = INF;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
ans += x;
if (x % 10 != 0) {
ans2 = min(ans2, x);
}
}
cout << (a... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,371,282 | 1,371,284 | u166378830 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>; // vi <=> vl
using P = pair<int, int>; // int <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>; // vi <=> vl
using P = pair<int, int>; // int <... | [
"variable_declaration.remove",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 1,371,289 | 1,371,290 | u104057163 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
#de... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
#de... | [
"control_flow.break.add"
] | 1,371,303 | 1,371,304 | u757628628 | cpp |
p03699 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#endif
#define int long long
#define FILE_I... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#endif
#define int long long
#define FILE_I... | [
"control_flow.branch.if.condition.change"
] | 1,371,311 | 1,371,312 | u572138437 | cpp |
p03699 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
// int ans = 0;
// int p;
// for(int bit = 0; bit < (1<<N); bit++){
// p = 0;
// for(int i = 0; i < N; i++){
... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
// int ans = 0;
// int p;
// for(int bit = 0; bit < (1<<N); bit++){
// p = 0;
// for(int i = 0; i < N; i++){
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,371,315 | 1,371,316 | u289709148 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,371,325 | 1,371,326 | u155416173 | cpp |
p03699 | #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 ... | [] | 1,371,329 | 1,371,330 | u824337972 | cpp |
p03699 | #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 ... | [] | 1,371,331 | 1,371,330 | u824337972 | cpp |
p03699 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1,... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1,... | [
"variable_declaration.value.change"
] | 1,371,334 | 1,371,335 | u845000384 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 1; i <= (n); i++)
#define rep0(i, n) for (int i = 0; i < (n); i++)
const ll INF = 1e9 + 7;
int n, k = 1, g, a[101];
int main() {
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
cin >> n;
re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 1; i <= (n); i++)
#define rep0(i, n) for (int i = 0; i < (n); i++)
const ll INF = 1e9 + 7;
int n, k = 1, g, a[101];
int main() {
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
cin >> n;
re... | [
"control_flow.loop.condition.change"
] | 1,371,345 | 1,371,346 | u698284709 | cpp |
p03699 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) ... | [
"identifier.change",
"call.arguments.change"
] | 1,371,353 | 1,371,354 | u999803454 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> vec;
int main(void) {
int n, t, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
sum += t;
vec.push_back(t);
}
sort(vec.begin(), vec.end());
if (sum % 10)
cout << sum << endl;
else {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> vec;
int main(void) {
int n, t, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
sum += t;
vec.push_back(t);
}
sort(vec.begin(), vec.end());
if (sum % 10)
cout << sum << endl;
else {
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,371,369 | 1,371,370 | u001566280 | cpp |
p03699 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
const int INF = 1 << 21;
using pii = std::pair<int, in... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
const int INF = 1 << 21;
using pii = std::pair<int, in... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,371,383 | 1,371,384 | u199371251 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[107], b[107];
int main() {
while (cin >> n) {
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
int ans = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
ans += a[i];
if (ans % 10 == 0) {
in... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[107], b[107];
int main() {
while (cin >> n) {
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
int ans = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
ans += a[i];
if (ans % 10 == 0) {
in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,371,397 | 1,371,398 | u817240026 | cpp |
p03699 |
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (... |
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,371,409 | 1,371,410 | u859396346 | cpp |
p03699 |
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (... |
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (... | [
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,371,412 | 1,371,410 | u859396346 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define rp(i, n) for (int i = 0; i < n; i++)
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define lrp(i, n) for (long long i = 0; i < n; i++)
#define lrep(i, m, n) for (long long i = m; i <= n; i++)
#define all(a) a.begin(), a.end()
#define pb push_back
typedef vecto... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, n) for (int i = 0; i < n; i++)
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define lrp(i, n) for (long long i = 0; i < n; i++)
#define lrep(i, m, n) for (long long i = m; i <= n; i++)
#define all(a) a.begin(), a.end()
#define pb push_back
typedef vecto... | [
"variable_declaration.value.change"
] | 1,371,417 | 1,371,418 | u050138914 | cpp |
p03699 | // A.cpp
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, A;
int s[110];
cin >> N;
int total = 0;
int cnt = 0;
for (int i = 0; i < N; i++) {
cin >> A;
if (A % 10 != 0)
s[cnt] = A, ++cnt;
total += A;
}
sort(s, s + N);
if (total % 1... | // A.cpp
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, A;
int s[110];
cin >> N;
int total = 0;
int cnt = 0;
for (int i = 0; i < N; i++) {
cin >> A;
if (A % 10 != 0)
s[cnt] = A, ++cnt;
total += A;
}
sort(s, s + cnt);
// for(int i... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,371,419 | 1,371,420 | u837654535 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 1,371,421 | 1,371,422 | u824327013 | cpp |
p03699 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main() {
int n;
cin >> n;
int s[110] = {0};
int val = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
val += s[i];
}
sort(s, s + n);
int ans = val;
for (int i = 1; i ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main() {
int n;
cin >> n;
int s[110] = {0};
int val = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
val += s[i];
}
sort(s, s + n);
int ans = val;
for (int i = 1; i ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,371,438 | 1,371,439 | u197175300 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int s[110];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
sort(s, s + n);
if (sum % 10 == 0) {
for (int i = 0; i < n; i++) {
if (s[i]... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int s[110];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
sort(s, s + n);
if (sum % 10 == 0) {
for (int i = 0; i < n; i++) {
if (s[i]... | [] | 1,371,440 | 1,371,441 | u075865455 | cpp |
p03699 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef long long int lli;
typedef pair<int, int> ii;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T ... | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef long long int lli;
typedef pair<int, int> ii;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T ... | [
"control_flow.break.add"
] | 1,371,442 | 1,371,443 | u576106056 | cpp |
p03690 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int N = 1e5 + 5;
int a[N], b[N], n, X, Y, cnt, tot, head[N], ans;
bool vis[N];
map<int, int> id;
vector<int> va, vb;
struct edge {
int to, nxt;
} e[N];
inline int get(int x) { return id.count(x) ? i... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int N = 1e5 + 5;
int a[N], b[N], n, X, Y, cnt, tot, head[N], ans;
bool vis[N];
map<int, int> id;
vector<int> va, vb;
struct edge {
int to, nxt;
} e[N];
inline int get(int x) { return id.count(x) ? i... | [
"expression.unary.arithmetic.remove"
] | 1,371,446 | 1,371,447 | u325348815 | cpp |
p03690 | #include <bits/stdc++.h>
typedef long long ll;
ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int A[100010], B[100010], u[200010], U;
std::vector<int> a, b;
int fa[2000... | #include <bits/stdc++.h>
typedef long long ll;
ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int A[100010], B[100010], u[200010], U;
std::vector<int> a, b;
int fa[2000... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 1,371,450 | 1,371,451 | u713368169 | cpp |
p03690 | #include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
#define dibs reserv... | #include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
#define dibs reserv... | [
"control_flow.branch.if.condition.change"
] | 1,371,456 | 1,371,457 | u642082255 | cpp |
p03690 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int S[100005], T[100005], n, ans, sum;
int A[100005], B[100005], sa, sb;
int fa[100005], Do[200005];
int gg() {
printf("-1");
return 0;
}
int ask(int x) {
if (fa[x] == x)
return x;
return fa[x] = ask(fa[x]);
}
void unite(int x, i... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int S[100005], T[100005], n, ans, sum;
int A[100005], B[100005], sa, sb;
int fa[100005], Do[200005];
int gg() {
printf("-1");
return 0;
}
int ask(int x) {
if (fa[x] == x)
return x;
return fa[x] = ask(fa[x]);
}
void unite(int x, i... | [
"expression.operation.binary.remove"
] | 1,371,464 | 1,371,465 | u782062071 | cpp |
p03690 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
struct node {
int x, id;
};
node s1[MAXN], s2[MAXN];
int a[MAXN], b[MAXN];
int n, sum, cnt;
map<int, int> fa;
map<int, int> mp;
int getfather(int x) {
if (fa[x] == x)
return x;
fa[x] = getfather(fa[x]);
return fa[x];
}
bool cmp(node x,... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
struct node {
int x, id;
};
node s1[MAXN], s2[MAXN];
int a[MAXN], b[MAXN];
int n, sum, cnt;
map<int, int> fa;
map<int, int> mp;
int getfather(int x) {
if (fa[x] == x)
return x;
fa[x] = getfather(fa[x]);
return fa[x];
}
bool cmp(node x,... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,371,468 | 1,371,469 | u259652259 | cpp |
p03690 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | [] | 1,371,494 | 1,371,495 | u670220889 | cpp |
p03690 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 1,371,496 | 1,371,495 | u670220889 | cpp |
p03690 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, a[maxn], b[maxn], t[maxn], t0[maxn], Ans;
int tote, FIR[maxn], TO[maxn << 1], NEXT[maxn << 1];
bool exist[maxn], vis[maxn];
void addedge(int u, int v) {
TO[++tote] = v;
NEXT[tote] = FIR[u];
FIR[u] = tote;
}
void dfs(int u) {
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, a[maxn], b[maxn], t[maxn], t0[maxn], Ans;
int tote, FIR[maxn], TO[maxn << 1], NEXT[maxn << 1];
bool exist[maxn], vis[maxn];
void addedge(int u, int v) {
TO[++tote] = v;
NEXT[tote] = FIR[u];
FIR[u] = tote;
}
void dfs(int u) {
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,371,501 | 1,371,502 | u026245891 | cpp |
p03690 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, a[maxn], b[maxn], t[maxn], t0[maxn], Ans;
int tote, FIR[maxn], TO[maxn << 1], NEXT[maxn << 1];
bool exist[maxn], vis[maxn];
void addedge(int u, int v) {
TO[++tote] = v;
NEXT[tote] = FIR[u];
FIR[u] = tote;
}
void dfs(int u) {
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, a[maxn], b[maxn], t[maxn], t0[maxn], Ans;
int tote, FIR[maxn], TO[maxn << 1], NEXT[maxn << 1];
bool exist[maxn], vis[maxn];
void addedge(int u, int v) {
TO[++tote] = v;
NEXT[tote] = FIR[u];
FIR[u] = tote;
}
void dfs(int u) {
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,371,503 | 1,371,502 | u026245891 | cpp |
p03690 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, a[maxn], b[maxn], t[maxn], t0[maxn], Ans;
int tote, FIR[maxn], TO[maxn << 1], NEXT[maxn << 1];
bool exist[maxn], vis[maxn];
void addedge(int u, int v) {
TO[++tote] = v;
NEXT[tote] = FIR[u];
FIR[u] = tote;
}
void dfs(int u) {
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, a[maxn], b[maxn], t[maxn], t0[maxn], Ans;
int tote, FIR[maxn], TO[maxn << 1], NEXT[maxn << 1];
bool exist[maxn], vis[maxn];
void addedge(int u, int v) {
TO[++tote] = v;
NEXT[tote] = FIR[u];
FIR[u] = tote;
}
void dfs(int u) {
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,371,504 | 1,371,502 | u026245891 | cpp |
p03690 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,371,510 | 1,371,511 | u321141651 | cpp |
p03690 | // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | [
"call.arguments.add",
"call.arguments.change"
] | 1,371,512 | 1,371,513 | u149667584 | cpp |
p03690 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(... | [
"identifier.change",
"io.output.change",
"literal.number.change"
] | 1,371,528 | 1,371,529 | u309470177 | cpp |
p03699 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
int sum = 0, mini = INF;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
sum += a;
if (a % 10)
mini = min(mini, a);
}
if (sum % 10 == 0)
sum -= mini;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
int sum = 0, mini = INF;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
sum += a;
if (a % 10)
mini = min(mini, a);
}
if (sum % 10 == 0)
sum -= mini;... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove"
] | 1,371,540 | 1,371,541 | u157322125 | cpp |
p03699 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
int sum = 0, mini = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
sum += a;
if (a % 10)
mini = min(mini, a);
}
if (sum % 10 == 0)
sum -= mini;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
int sum = 0, mini = INF;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
sum += a;
if (a % 10)
mini = min(mini, a);
}
if (sum % 10 == 0)
sum -= mini;... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,371,542 | 1,371,541 | u157322125 | cpp |
p03699 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
typed... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
typed... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,371,546 | 1,371,547 | u732285858 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vi = vector<int>;
#define pb push_back
int n, s, mind;
int main() {
cin >> n;
int ans = 0, maxd = 1000000000;
for (int i = 1; i <= n; ++i) {
cin >> s;
ans += s;
if (s % 10 != 0)
mind = min(mind, s);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vi = vector<int>;
#define pb push_back
int n, s;
int main() {
cin >> n;
int ans = 0, mind = 1000000000;
for (int i = 1; i <= n; ++i) {
cin >> s;
ans += s;
if (s % 10 != 0)
mind = min(mind, s);
}
... | [
"variable_declaration.remove",
"variable_declaration.name.change",
"identifier.change"
] | 1,371,562 | 1,371,563 | u089230684 | cpp |
p03699 | #include <stdio.h>
int main(void) {
int n, s[101], i, j, x, sum;
scanf("%d", &n);
sum = 0;
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
sum += s[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (s[i] > s[j]) {
x = s[i];
s[i] = s[j];
s[j] = x;
}
... | #include <stdio.h>
int main(void) {
int n, s[101], i, j, x, sum;
scanf("%d", &n);
sum = 0;
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
sum += s[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (s[i] < s[j]) {
x = s[i];
s[i] = s[j];
s[j] = x;
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,371,582 | 1,371,583 | u399080687 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.