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 9
values |
|---|---|---|---|---|---|---|---|
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int m = n * (n - 1);
cout << m / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long m = n * (n - 1);
cout << m / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 725,157 | 725,158 | u443971699 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 725,159 | 725,160 | u989306199 | cpp |
p02924 | #include <bits/stdc++.h>
#include <stdlib.h>
#include <string>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
ll r = a % b;
while (r != 0) {
... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <string>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
ll r = a % b;
while (r != 0) {
... | [
"variable_declaration.type.change"
] | 725,161 | 725,162 | u001327021 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
//#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
// cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
typedef long long ll; // long long
typedef pair<int, int> pii; // pair<int,int>
const int MOD = 1000000007; // 10^9+7
const double ... | #include <bits/stdc++.h>
using namespace std;
//#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
// cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
typedef long long ll; // long long
typedef pair<int, int> pii; // pair<int,int>
const int MOD = 1000000007; // 10^9+7
const double ... | [
"variable_declaration.type.change"
] | 725,163 | 725,164 | u783255320 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using... | [
"variable_declaration.type.change"
] | 725,165 | 725,166 | u880221923 | cpp |
p02924 | #include <stdio.h>
int main() {
long long n;
scanf("%llld", &n);
printf("%lld\n", n * (n - 1) / 2);
}
| #include <stdio.h>
int main() {
long long n;
scanf("%lld", &n);
printf("%lld\n", n * (n - 1) / 2);
}
| [
"literal.string.change",
"call.arguments.change"
] | 725,169 | 725,170 | u747390421 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
using str = string;
typedef pair<int, int> P;
typedef vector<int> vi;
ll gcd(ll a, ll b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1.0);
const ll mod = pow(10, 9) + 7;
const ll INF = pow(2, 31) - 1;
using str = string;
typedef pair<int, int> P;
typedef vector<int> vi;
ll gcd(ll a, ll b... | [
"variable_declaration.type.change"
] | 725,171 | 725,172 | u420130252 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans2 = N * (N - 1);
cout << ans2 / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans2 = N * (N - 1);
cout << ans2 / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,175 | 725,176 | u407814609 | cpp |
p02924 | /*
*/
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, a, b) for (int i = a; i < b; i++)
#... | /*
*/
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repb(i, a, b) for (int i = a; i < b; i++)
#... | [
"variable_declaration.type.change"
] | 725,179 | 725,180 | u630664279 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(30);
int n;
cin >> n;
cout << ((n - 1) * n) / 2;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(30);
long long n;
cin >> n;
cout << ((n - 1) * n) / 2;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,181 | 725,182 | u032304450 | cpp |
p02924 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long res = (N - 1) * N / 2;
cout << res << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <string>
#include <vector>
using namespace std;
int main() {
long N;
cin >> N;
long res = (N - 1) * N / 2;
cout << res << endl;
} | [
"variable_declaration.type.primitive.change"
] | 725,189 | 725,190 | u559683797 | cpp |
p02924 | #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
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,194 | 725,195 | u590927341 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | [
"type_conversion.add"
] | 725,207 | 725,208 | u103557284 | cpp |
p02924 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << (ll)(N - 1) * N / 2 << endl;
} | [
"variable_declaration.type.change"
] | 725,209 | 725,210 | u138273120 | cpp |
p02924 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int64_t N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 725,211 | 725,212 | u976833038 | cpp |
p02924 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 725,211 | 725,213 | u976833038 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
unsigned long long n = 0;
cin >> n;
unsigned long long kotae = (n - 1) / 2 * n;
cout << kotae << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
unsigned long long n = 0;
cin >> n;
unsigned long long kotae = (n * (n - 1)) / 2;
cout << kotae << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 725,218 | 725,219 | u567906952 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int Ans = n * (n - 1) / 2;
cout << Ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long Ans = n * (n - 1) / 2;
cout << Ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,227 | 725,228 | u422692699 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template <typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using ... | [
"variable_declaration.type.change"
] | 725,231 | 725,232 | u868099754 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n + 1) / 2 - n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (long long)n * (n + 1) / 2 - n << endl;
} | [
"type_conversion.add"
] | 725,235 | 725,236 | u094191970 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [
"expression.operation.binary.remove"
] | 725,239 | 725,240 | u310790595 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,241 | 725,242 | u826189900 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<i... | [
"variable_declaration.type.change"
] | 725,244 | 725,245 | u720321944 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
cout << (n - 1) * n / 2;
}
| [
"variable_declaration.type.primitive.change"
] | 725,257 | 725,258 | u950901760 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | [
"variable_declaration.type.change"
] | 725,259 | 725,260 | u398437835 | cpp |
p02924 | #include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head,... | #include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head,... | [] | 725,261 | 725,262 | u994307795 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t ans;
ans = (N - 1) * N / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t ans;
ans = (N - 1) * N / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 725,265 | 725,266 | u620626180 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int result;
result = (N - 1) * N / 2;
cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long result;
result = (N - 1) * N / 2;
cout << result << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,274 | 725,275 | u122874387 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = (N - 1) * (N - 1) / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = (N - 1) * N / 2;
cout << ans << endl;
} | [] | 725,278 | 725,279 | u190875453 | cpp |
p02924 | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long int ll;
int main() {
int N;
cin >> N;
cout << ((N - 1) * (N)) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long int ll;
int main() {
ll N;
cin >> N;
cout << ((N - 1) * (N)) / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 725,282 | 725,283 | u276980836 | cpp |
p02924 | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long int ll;
int main() {
int N;
cin >> N;
cout << (N - 1) * (N) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long int ll;
int main() {
ll N;
cin >> N;
cout << ((N - 1) * (N)) / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 725,284 | 725,283 | u276980836 | cpp |
p02924 | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,288 | 725,289 | u230414490 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;... | [
"variable_declaration.type.change"
] | 725,292 | 725,293 | u682395093 | cpp |
p02924 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <... | [
"variable_declaration.type.change"
] | 725,298 | 725,299 | u894275299 | cpp |
p02924 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll ans = ((N - 1) * N) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 725,303 | 725,304 | u891346638 | cpp |
p02924 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 725,305 | 725,304 | u891346638 | cpp |
p02924 | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define FORr(i, k, n) for (int i = (k); i > (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORr(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace st... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define FORr(i, k, n) for (int i = (k); i > (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORr(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace st... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 725,312 | 725,313 | u961136005 | cpp |
p02924 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define INF 100000000
using namespace std;
int main() {
int N;
cin >> N;
// vector<int> A(N);
// for(int i=0; i<N; i++){cin>>A[i];}
// vector<vector<int>> A(N,vector<int>(M));
// for(int i=0; i<N; i++){for(int j=0; j<M; j++){cin>>A[i][j];}}
cout << N * (N ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define INF 100000000
using namespace std;
int main() {
int64_t N;
cin >> N;
// vector<int> A(N);
// for(int i=0; i<N; i++){cin>>A[i];}
// vector<vector<int>> A(N,vector<int>(M));
// for(int i=0; i<N; i++){for(int j=0; j<M; j++){cin>>A[i][j];}}
cout << N *... | [
"variable_declaration.type.primitive.change"
] | 725,314 | 725,315 | u207948013 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
pair<int, int> pii;
vector<int> vec;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
pair<int, int> pii;
vector<int> vec;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << '\n';
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,316 | 725,317 | u430766779 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = N * (N - 1) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = N * (N - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,320 | 725,321 | u777258731 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n + 1) / 2;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int long long n;
cin >> n;
cout << n * (n - 1) / 2;
}
| [
"variable_declaration.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 725,335 | 725,333 | u260907804 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = (n * (n + 1) / 2) - n;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = (n * (n + 1) / 2) - n;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 725,336 | 725,337 | u131625544 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
int n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 725,374 | 725,375 | u423656246 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 725,376 | 725,375 | u423656246 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n == 1)
cout << 0 << endl;
else
cout << n * (n - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
if (n == 1)
cout << 0 << endl;
else
cout << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.change"
] | 725,377 | 725,378 | u796877631 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b) {
while (b != 0) {
a %= b;
swap(a, b);
}
return a;
}
ll kaizyou(ll N) {
ll num = 1;
for (ll i = 1; i <= N; i++) {
num *= i;
}
return num;
}
int dy[] = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b) {
while (b != 0) {
a %= b;
swap(a, b);
}
return a;
}
ll kaizyou(ll N) {
ll num = 1;
for (ll i = 1; i <= N; i++) {
num *= i;
}
return num;
}
int dy[] = ... | [
"variable_declaration.type.change"
] | 725,381 | 725,382 | u584139221 | cpp |
p02924 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<bool> vb... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef vector<bool> vb... | [
"variable_declaration.type.change"
] | 725,383 | 725,384 | u376082984 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main() {
int N;
cin >> N;
ll sum = (N - 1) * N / 2;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main() {
ll N;
cin >> N;
ll sum = (N + 1) * N / 2;
cout << sum - N << endl;
return 0;
} | [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 725,385 | 725,386 | u611777990 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main() {
int N;
cin >> N;
ll sum = (N + 1) * N / 2;
cout << sum - N << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main() {
ll N;
cin >> N;
ll sum = (N + 1) * N / 2;
cout << sum - N << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 725,387 | 725,386 | u611777990 | cpp |
p02924 | #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;
cout << N * (N - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | [
"identifier.change",
"variable_declaration.type.change"
] | 725,388 | 725,389 | u132364782 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (long long)(n - 1) * n / 2 << endl;
return 0;
}
| [
"type_conversion.add"
] | 725,390 | 725,391 | u955202970 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define REP(i, n) for (int... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define REP(i, n) for (int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,394 | 725,395 | u636137609 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | [
"variable_declaration.type.change"
] | 725,399 | 725,400 | u858670323 | cpp |
p02924 | #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;
typedef pair<int, int> pii;
int main() {
ll n;
cin >> n;
cout << (n + 1) * n / 2 << endl;
} | #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;
typedef pair<int, int> pii;
int main() {
ll n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 725,408 | 725,409 | u065456707 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | [
"variable_declaration.type.change"
] | 725,410 | 725,411 | u502772848 | cpp |
p02924 | #include <iostream>
using namespace std;
int N;
int main() {
cin >> N;
cout << int(((N - 1) * N) / 2) << endl;
} | #include <iostream>
using namespace std;
long int N;
int main() {
cin >> N;
cout << ((N - 1) * N) / 2 << endl;
} | [
"variable_declaration.type.widen.change",
"call.remove",
"call.arguments.change"
] | 725,419 | 725,420 | u459294359 | cpp |
p02924 | #include <iostream>
using namespace std;
int N;
int main() {
cin >> N;
cout << (N - 1) * N / 2 << endl;
} | #include <iostream>
using namespace std;
long int N;
int main() {
cin >> N;
cout << ((N - 1) * N) / 2 << endl;
} | [
"variable_declaration.type.widen.change"
] | 725,421 | 725,420 | u459294359 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long llong;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long llong;
int main() {
llong n;
cin >> n;
llong ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 725,422 | 725,423 | u748577909 | cpp |
p02924 | #include <iostream>
int main() {
int n;
std::cin >> n;
std::cout << n * (n - 1) / 2;
return 0;
} | #include <iostream>
int main() {
long long n;
std::cin >> n;
std::cout << n * (n - 1) / 2;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,424 | 725,425 | u649220991 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<in... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<in... | [
"variable_declaration.type.change"
] | 725,426 | 725,427 | u538125576 | cpp |
p02924 | #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(... | #include <bits/stdc++.h>
#define INF 1e18
#define MOD 1000000007
#define PI M_PI
#define ll long long
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define print(... | [
"variable_declaration.type.change"
] | 725,431 | 725,432 | u929199273 | cpp |
p02924 | #define _GLIBCXX_DEBUG
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
... | #define _GLIBCXX_DEBUG
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
... | [
"variable_declaration.type.change"
] | 725,433 | 725,434 | u999989620 | cpp |
p02924 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
long long n;
ci... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,435 | 725,436 | u999989620 | cpp |
p02924 | #include <bits/stdc++.h>
//#pragma GCC optimize "-O3"
typedef unsigned long long ull;
typedef unsigned int ui;
typedef unsigned short us;
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll infll = (1ull << 63) - 1;
const int ... | #include <bits/stdc++.h>
//#pragma GCC optimize "-O3"
typedef unsigned long long ull;
typedef unsigned int ui;
typedef unsigned short us;
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll infll = (1ull << 63) - 1;
const int ... | [
"variable_declaration.type.change"
] | 725,441 | 725,442 | u162126904 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long solve = n * (n - 1) / 2;
// solve -= n;
cout << solve << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
long long solve = n * (n - 1) / 2;
// solve -= n;
cout << solve << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,448 | 725,449 | u156778176 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int solve = n * (n - 1) / 2;
// solve -= n;
cout << solve << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
long long solve = n * (n - 1) / 2;
// solve -= n;
cout << solve << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,450 | 725,449 | u156778176 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using lint = long long;
using namespace std;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
lint res ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using lint = long long;
using namespace std;
const int MOD = 1000000007;
int main() {
lint N;
cin >> N;
lint res... | [
"variable_declaration.type.change"
] | 725,457 | 725,458 | u208844959 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n;
cin >> n;
long long res = (n - 1) / 2 * n;
cout << res;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n;
cin >> n;
long long res = (n - 1) * n / 2;
cout << res;
}
| [
"expression.operation.binary.remove"
] | 725,459 | 725,460 | u975652044 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define out16(X) cout << setprecision(16) << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(... | [
"variable_declaration.type.change"
] | 725,468 | 725,469 | u086672186 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1ll) * n / 2 << endl;
}
| [] | 725,470 | 725,471 | u442485163 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#i... | [
"variable_declaration.type.change"
] | 725,475 | 725,476 | u247679666 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | [
"variable_declaration.type.change"
] | 725,484 | 725,485 | u240685518 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int n, i;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 725,486 | 725,487 | u476054945 | cpp |
p02924 | #define _GLIBCXX_DEBUG
// header {{{
#include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define ASSERT(expr...) assert((expr))
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using ... | #define _GLIBCXX_DEBUG
// header {{{
#include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define ASSERT(expr...) assert((expr))
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using ... | [
"variable_declaration.type.change"
] | 725,497 | 725,498 | u497601987 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,506 | 725,507 | u340494803 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,511 | 725,512 | u615194706 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n + 1) / 2 - n << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << n * (n + 1) / 2 - n << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 725,519 | 725,520 | u343110708 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 1 << endl;
... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << 0 << endl;
... | [
"literal.number.change",
"io.output.change"
] | 725,529 | 725,530 | u538774896 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
usi... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
usi... | [
"variable_declaration.type.change"
] | 725,533 | 725,534 | u007099475 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2;
// int ans = 0;
// for(int i = 1; i < n; i++){
// ans += i % (i + 1);
// }
// cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n - 1) * n / 2;
// int ans = 0;
// for(int i = 1; i < n; i++){
// ans += i % (i + 1);
// }
// cout << ans;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,535 | 725,536 | u024616993 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// {1 + (N - 1)} * (N - 1) / 2
cout << N * (N - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// {1 + (N - 1)} * (N - 1) / 2
cout << N * (N - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 725,539 | 725,540 | u503640463 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n * (n - 1)) / 2;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long ans = (n * (n + 1)) / 2 - n;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 725,541 | 725,542 | u492288342 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n * (n + 1)) / 2 - n;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long ans = (n * (n + 1)) / 2 - n;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 725,543 | 725,542 | u492288342 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n * (n - 1)) / 2;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
long ans = n * (n - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 725,541 | 725,544 | u492288342 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n * (n - 1)) / 2;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,541 | 725,545 | u492288342 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,550 | 725,551 | u886790158 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,552 | 725,551 | u886790158 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,552 | 725,554 | u886790158 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// int N;
long int N;
cin >> N;
cout << N * (N - 1) / 2;
}
| [
"variable_declaration.type.widen.change"
] | 725,560 | 725,561 | u476435125 | cpp |
p02924 | #include <math.h>
#include <stdio.h>
int main(void) {
long int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2);
return 0;
}
| #include <math.h>
#include <stdio.h>
int main(void) {
long n;
scanf("%ld", &n);
printf("%ld\n", n * (n - 1) / 2);
return 0;
}
| [
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 725,562 | 725,563 | u090091127 | cpp |
p02924 | #include <math.h>
#include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2);
return 0;
}
| #include <math.h>
#include <stdio.h>
int main(void) {
long n;
scanf("%ld", &n);
printf("%ld\n", n * (n - 1) / 2);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 725,564 | 725,563 | u090091127 | cpp |
p02924 | #include <iostream>
int main() {
int n;
std::cin >> n;
std::cout << n * (n - 1) / 2 << "\n";
} | #include <iostream>
int main() {
long long n;
std::cin >> n;
std::cout << n * (n - 1) / 2 << "\n";
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,572 | 725,573 | u854175276 | cpp |
p02924 | #include <iostream>
using namespace std;
#include <string>
typedef long long int ll;
int main() {
int N;
cin >> N;
cout << (N - 1) * N / 2;
return 0;
}
| #include <iostream>
using namespace std;
#include <string>
typedef long long int ll;
int main() {
ll N;
cin >> N;
cout << (N - 1) * N / 2;
return 0;
}
| [
"variable_declaration.type.change"
] | 725,576 | 725,577 | u720384347 | cpp |
p02924 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int ans;
ans = n * (n - 1) / 2;
cout << ans;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
long n;
cin >> n;
long ans;
ans = n * (n - 1) / 2;
cout << ans;
}
| [
"variable_declaration.type.primitive.change"
] | 725,578 | 725,579 | u893907405 | cpp |
p02924 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int ans;
ans = n * (n - 1) / 2;
cout << ans;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
long n;
cin >> n;
long ans;
ans = n * (n - 1) / 2;
cout << ans;
} | [
"variable_declaration.type.primitive.change"
] | 725,578 | 725,580 | u893907405 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
int a[maxn];
int main() {
ll n;
scanf("%lld", &n);
if (n == 1)
printf("0");
else if (n == 2)
printf("1");
else {
ll ans = n & 1;
ans += (n - 1 + 1) * (n - 1) / 2 - 1;
printf("%lld", ans);
}... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
int a[maxn];
int main() {
ll n;
scanf("%lld", &n);
if (n == 1)
printf("0");
else if (n == 2)
printf("1");
else {
ll ans = 1;
ans += (n - 1 + 1) * (n - 1) / 2 - 1;
printf("%lld", ans);
}
r... | [
"expression.operation.binary.remove"
] | 725,589 | 725,590 | u011492570 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cout << setprecision(30);
cout << n * (n - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << setprecision(30);
cout << n * (n - 1) / 2 << endl;
}
| [] | 725,591 | 725,592 | u882039496 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define i64 int64_t
#define tos(x) to_string(x)
int main() {
int n;
cin >> n;
i64 ans = n... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define i64 int64_t
#define tos(x) to_string(x)
int main() {
i64 n;
cin >> n;
i64 ans = n... | [
"variable_declaration.type.change"
] | 725,593 | 725,594 | u771541325 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, y;
cin >> n;
y = (n * (n - 1)) / 2;
cout << y << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, y;
cin >> n;
y = (n * (n - 1)) / 2;
cout << y << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,599 | 725,600 | u305141544 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
cout << setprecision(20) << N * (N - 1) * 0.5 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
cout << setprecision(20) << N * (N - 1) / 2 << endl;
} | [] | 725,601 | 725,602 | u702468315 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.