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>
#define ll long long int
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vii vector<pair<int, int>>
#define vll vector<pair<ll, ll>>
#define pb push_back
#define el '\n'
#define N 1000000007
#define re return
#define PI 3.14159265
#define take(a, n) ... | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vii vector<pair<int, int>>
#define vll vector<pair<ll, ll>>
#define pb push_back
#define el '\n'
#define N 1000000007
#define re return
#define PI 3.14159265
#define take(a, n) ... | [
"variable_declaration.type.change",
"variable_declaration.value.change"
] | 727,195 | 727,194 | u093730269 | cpp |
p02924 | /*
Sharif Hasan - CSE, PUST
Sep 01,2019 06:05 PM
*/
#include <bits/stdc++.h>
#define br cout << "\n"
#define FOR(i, n) for (i = 0; i < n; i++)
#define FROM(a, i, n) for (i = a; i < n; i++)
#define IOS \
ios_base::sync_with_stdio(0); ... | /*
Sharif Hasan - CSE, PUST
Sep 01,2019 06:05 PM
*/
#include <bits/stdc++.h>
#define br cout << "\n"
#define FOR(i, n) for (i = 0; i < n; i++)
#define FROM(a, i, n) for (i = a; i < n; i++)
#define IOS \
ios_base::sync_with_stdio(0); ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 727,207 | 727,206 | u387181625 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
cout << (N * (N - 1) / 2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long N;
cin >> N;
cout << (N * (N - 1) / 2);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,233 | 727,234 | u951665306 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int ans;
ans = ((n) * (n - 1)) / 2;
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int ans;
ans = ((n) * (n - 1)) / 2;
cout << ans;
}
| [
"variable_declaration.type.widen.change"
] | 727,237 | 727,238 | u664869141 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
while (cin >> n) {
n--;
cout << (n * n + n) / 2 << endl;
}
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
ll n;
while (cin >> n) {
n--;
cout << (n * n + n) / 2 << e... | [
"import.add",
"variable_declaration.type.change"
] | 727,239 | 727,240 | u292961741 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
cin >> a;
int ans = a * (a - 1) / 2;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t a;
cin >> a;
int64_t ans = a * (a - 1) / 2;
cout << ans;
}
| [
"variable_declaration.type.primitive.change"
] | 727,249 | 727,250 | u424602097 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double ans = 0;
if (n > 2) {
ans = (n - 1) * n / 2;
cout << ans;
} else if (n == 2) {
cout << 1;
} else {
cout << 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int n;
cin >> n;
unsigned long int ans = 0;
if (n > 2) {
ans = (n - 1) * n / 2;
cout << ans;
} else if (n == 2) {
cout << 1;
} else {
cout << 0;
}
} | [
"variable_declaration.type.primitive.change"
] | 727,253 | 727,254 | u434746933 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 727,257 | 727,258 | u978109511 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
double N;
cin >> N;
cout << (N * N - N) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int N;
cin >> N;
cout << (N * N - N) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 727,263 | 727,264 | u537852947 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
printf("%lld\n", n * (n - 1) / 2);
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 727,265 | 727,266 | u083800325 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int ar[100003];
int main() {
int i = 1, ev, k, od, j, n;
scanf("%d", &n);
n = n - 1;
if (n % 2 == 0) {
ev = n;
od = n + 1;
} else {
od = n;
ev = n + 1;
}
j = od * (ev / 2);
cout << j << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int ar[100003];
int main() {
long long int i = 1, ev, k, od, j, n;
scanf("%lld", &n);
n = n - 1;
if (n % 2 == 0) {
ev = n;
od = n + 1;
} else {
od = n;
ev = n + 1;
}
j = od * (ev / 2);
cout << j << '\n';
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 727,271 | 727,272 | u023774715 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
if (N == 1) {
ans = 0;
} else {
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 = 0;
if (N == 1) {
ans = 0;
} else {
ans = (N - 1) * (N) / 2;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 727,273 | 727,274 | u270812683 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ll ll=0;
// cout << ll;
ll n;
cin >> n;
cout << (n - 1) * ((n - 1) / 2) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ll ll=0;
// cout << ll;
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [] | 727,279 | 727,280 | u852839243 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ll ll=0;
// cout << ll;
ll n;
cin >> n;
cout << n * (n / 2) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ll ll=0;
// cout << ll;
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [] | 727,281 | 727,280 | u852839243 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ll ll=0;
// cout << ll;
int n;
cin >> n;
cout << n * (n / 2) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ll ll=0;
// cout << ll;
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 727,282 | 727,280 | u852839243 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define MAXN (int)1e+9
typedef long long ll;
int main() {
ll ans;
int N;
cin >> N;
ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MAXN (int)1e+9
typedef long long ll;
int main() {
ll ans;
ll N;
cin >> N;
ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 727,292 | 727,293 | u776086908 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// int64_t ans = 0;
// for( int i=1; i<N; ++i) {
// ans += i % (i+1);
// }
// cout << ans << endl;
cout << (N - 1) * (N) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// int64_t ans = 0;
// for( int i=1; i<N; ++i) {
// ans += i % (i+1);
// }
// cout << ans << endl;
cout << (N - 1) * (N) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 727,303 | 727,304 | u107091170 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <set>
#include <stdint.h>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
// vector<int> P(N);
// set<int, greater<int>> Q;
// for (int ii=0; ii<N; ++ii) {
// Q.insert(ii+1);
// }
// uint64_t sumMod = 0;
//... | #include <algorithm>
#include <iostream>
#include <set>
#include <stdint.h>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
// vector<int> P(N);
// set<int, greater<int>> Q;
// for (int ii=0; ii<N; ++ii) {
// Q.insert(ii+1);
// }
// uint64_t sumMod = 0;
//... | [
"type_conversion.add"
] | 727,313 | 727,314 | u843070415 | cpp |
p02924 | #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define write_to_file() freopen("output.txt", "w", stdout)
#define read_from_file() freopen("input.txt", "r", stdin)
#define GeoOutputFix(VV) cout << fixed << setprecision(VV)
#define MAX_V 1e9
#define MIN_V -1e9
template <c... | #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define write_to_file() freopen("output.txt", "w", stdout)
#define read_from_file() freopen("input.txt", "r", stdin)
#define GeoOutputFix(VV) cout << fixed << setprecision(VV)
#define MAX_V 1e9
#define MIN_V -1e9
template <c... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 727,317 | 727,318 | u251309505 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = (1 + n - 1) * (n - 1) / 2;
cout << ans;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int n, ans;
cin >> n;
ans = (1 + n - 1) * (n - 1) / 2;
cout << ans;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 727,319 | 727,320 | u709752172 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long answer = (N * (N - 1)) / 2;
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long M = (N * (N - 1)) / 2;
cout << M << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.name.change",
"identifier.change",
"io.output.change"
] | 727,325 | 727,326 | u732546570 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | [
"variable_declaration.type.change"
] | 727,327 | 727,328 | u656929062 | cpp |
p02924 | #include <iostream>
using namespace std;
int N;
int main() {
cin >> N;
int n = N - 1;
long long ans = (n * n + n) / 2;
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int N;
int main() {
cin >> N;
long long n = N - 1;
long long ans = (n * n + n) / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,331 | 727,332 | u647974562 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N;
scanf("%d", &N);
printf("%d", N * (N - 1) / 2);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
long N;
scanf("%ld", &N);
printf("%ld", N * (N - 1) / 2);
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 727,333 | 727,334 | u256459711 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N;
scanf("%d", &N);
printf("%d", N * (N + 1) / 2);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
long N;
scanf("%ld", &N);
printf("%ld", N * (N - 1) / 2);
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 727,335 | 727,334 | u256459711 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << "\n";
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
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"
] | 727,336 | 727,337 | u827355772 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
} | #include <bits/stdc++.h>
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"
] | 727,338 | 727,339 | u265392294 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long ans = n * (n - 1) / 2;
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
long long ans = n * (n - 1) / 2;
printf("%lld\n", ans);
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 727,342 | 727,343 | u737168568 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll ans = 0;
ans = n * (n - 1) / 2;
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll ans = 0;
ans = n * (n - 1) / 2;
cout << ans << "\n";
}
| [
"variable_declaration.type.change"
] | 727,344 | 727,345 | u108648546 | cpp |
p02924 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
io... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
io... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,348 | 727,349 | u347588083 | cpp |
p02924 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
typedef long long ll;
using namespace std;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const int N = 1e5 + 5;
// int a[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
typedef long long ll;
using namespace std;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const int N = 1e5 + 5;
// int a[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 727,352 | 727,353 | u409343817 | cpp |
p02924 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int64_t ans;
ans = N * (N - 1) / 2;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t ans;
ans = N * (N - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 727,356 | 727,357 | u994910167 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
int main() {
// ここに処理を記述
int N;
cin >> N;
int ans = N * (N - 1) / 2;
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
int main() {
// ここに処理を記述
ll N;
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << "\n";
return 0;
} | [
"variable_declaration.type.change"
] | 727,364 | 727,365 | u633451629 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
unsigned long long int N;
cin >> N;
unsigned long long int out = 0;
if (N == 1)
out = 0;
if (N == 2)
out = 0;
if (N >= 3) {
out = (N - 1) * N / 2;
// out += max(N%2,1%2);
}
cout << out << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
unsigned long long int N;
cin >> N;
unsigned long long int out = 0;
if (N == 1)
out = 0;
if (N == 2)
out = 1;
if (N >= 3) {
out = (N - 1) * N / 2;
// out += max(N%2,1%2);
}
cout << out << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 727,368 | 727,369 | u198979194 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << "0" << endl;
else
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
if (n == 1)
cout << "0" << endl;
else
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 727,372 | 727,373 | u781638903 | cpp |
p02924 | #include <iostream>
using namespace std;
int n;
int main() {
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
long long n;
int main() {
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,374 | 727,375 | u597243424 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0);
int main() {
ios;
int n;
cin >> n;
cout ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0);
int main() {
ios;
long long int n;
cin >> ... | [
"variable_declaration.type.widen.change"
] | 727,378 | 727,379 | u734308503 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
uint64_t answer = N * (N - 1) / 2;
cout << answer << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <iterator>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
uint64_t N;
cin >> N;
uint64_t answer = N * (N - 1) / 2;
cout << answer << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 727,380 | 727,381 | u762677575 | cpp |
p02924 | /* 実行時間1s制限の場合
10^6 1,000,000 : 余裕をもって間に合う
10^7 10,000,000 : おそらく間に合う
10^8 100,000,000 : 非常にシンプルな処理でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // long longはデータモデル(... | /* 実行時間1s制限の場合
10^6 1,000,000 : 余裕をもって間に合う
10^7 10,000,000 : おそらく間に合う
10^8 100,000,000 : 非常にシンプルな処理でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // long longはデータモデル(... | [
"variable_declaration.type.change"
] | 727,382 | 727,383 | u234248338 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = a; i < n; i++)
#define RREP(i, a, n) for (ll i = n - 1; i >= a; i--)
typedef long long ll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = a; i < n; i++)
#define RREP(i, a, n) for (ll i = n - 1; i >= a; i--)
typedef long long ll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
using namespace std;
int main() {
ll n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 727,391 | 727,392 | u204337666 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
n = n - 1;
int sum = ((n) * (n + 1) / 2);
cout << sum;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
n = n - 1;
long long int sum = ((n) * (n + 1) / 2);
cout << sum;
}
| [
"variable_declaration.type.widen.change"
] | 727,397 | 727,398 | u418816318 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long int s = ((n - 1) * (n)) / 2;
cout << s;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
unsigned long long int s = ((n - 1) * (n)) / 2;
cout << s;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 727,404 | 727,405 | u026135188 | cpp |
p02924 | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
long long tmp;
tmp = n * (n - 1) / 2;
printf("%lld", tmp);
return 0;
}
| #include <stdio.h>
int main(void) {
long long n;
scanf("%lld", &n);
long long tmp;
tmp = n * (n - 1) / 2;
printf("%lld", tmp);
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 727,408 | 727,409 | u085767701 | cpp |
p02924 | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
int tmp;
tmp = n * (n - 1) / 2;
printf("%d", tmp);
return 0;
}
| #include <stdio.h>
int main(void) {
long long n;
scanf("%lld", &n);
long long tmp;
tmp = n * (n - 1) / 2;
printf("%lld", tmp);
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 727,410 | 727,409 | u085767701 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
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"
] | 727,415 | 727,416 | u745852541 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = (n - 1) * n / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = (n - 1) * n / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,417 | 727,418 | u192744126 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 727,423 | 727,424 | u917152735 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
int n;
cin >> n;
cout << (n - 1) / 2 * n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
} | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 727,425 | 727,424 | u917152735 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
a = a - 1;
cout << a * (a + 1) / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long a;
cin >> a;
a = a - 1;
cout << (long long)a * (a + 1) / 2;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,428 | 727,429 | u824956430 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
}
| [
"variable_declaration.type.widen.change"
] | 727,430 | 727,431 | u817769480 | cpp |
p02924 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0;... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 727,432 | 727,433 | u310228685 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sw;
sw = N * (N - 1) / 2;
cout << sw << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long sw;
sw = N * (N - 1) / 2;
cout << sw << endl;
} | [
"variable_declaration.type.primitive.change"
] | 727,436 | 727,437 | u446895139 | cpp |
p02924 | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | [
"variable_declaration.type.change"
] | 727,438 | 727,439 | u300866293 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int res = N * (N - 1) / 2;
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int res = N * (N - 1) / 2;
cout << res << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 727,454 | 727,455 | u898714404 | cpp |
p02924 | #include <algorithm>
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n + 1) / 2) - n << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n + 1) / 2) - n << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,476 | 727,477 | u524142273 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n - 1) * (n - 2) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | [
"literal.number.change",
"io.output.change"
] | 727,497 | 727,498 | u621509943 | cpp |
p02924 | #include <cmath>
#include <fstream>
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
long long int ans;
ans = ((N - 1) * N) / 2;
cout << ans << endl;
return 0;
} | #include <cmath>
#include <fstream>
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
using namespace std;
int main() {
long N;
cin >> N;
long long int ans;
ans = ((N - 1) * N) / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 727,499 | 727,500 | u983681697 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.widen.change"
] | 727,501 | 727,502 | u755310927 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using sl = signed long;
using sll = signed long long;
int main() {
sl n;
sll sum = 0;
// sl tmp= 1;
// vector<sl> p;
cin >> n;
sum = 1 / 2 * n * (n - 1);
cout << sum;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using sl = signed long;
using sll = signed long long;
int main() {
sl n;
sll sum = 0;
// sl tmp= 1;
// vector<sl> p;
cin >> n;
sum = n * (n - 1) / 2;
cout << sum;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 727,513 | 727,514 | u515047101 | cpp |
p02924 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,515 | 727,516 | u536221891 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int max = 0;
max = (n - 1) * (n) / 2;
cout << max << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
long int max = 0;
max = (n - 1) * (n) / 2;
cout << max << endl;
} | [
"variable_declaration.type.widen.change"
] | 727,532 | 727,533 | u444657417 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "0" << endl;
} else {
cout << (N - 1) * N / 2;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
if (N == 1) {
cout << "0" << endl;
} else {
cout << (N - 1) * N / 2;
}
}
| [
"variable_declaration.type.primitive.change"
] | 727,538 | 727,539 | u363369454 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, z;
cin >> n;
z = (((n - 1) * n) / 2);
cout << z;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, z;
cin >> n;
z = (((n - 1) * n) / 2);
cout << z;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,544 | 727,545 | u633140979 | cpp |
p02924 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, ans, tmp;
cin >> n;
tmp = n - 1;
ans = (tmp * (tmp + 1)) / 2;
if (n == 1)
ans = 0;
if (n == 2)
ans = 1;
cout << ans;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
unsigned long long int n, ans, tmp;
cin >> n;
tmp = n - 1;
ans = (tmp * (tmp + 1)) / 2;
if (n == 1)
ans = 0;
if (n == 2)
ans = 1;
cout << ans;
}
| [
"variable_declaration.type.widen.change"
] | 727,557 | 727,558 | u468823225 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unsigned long long ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long N;
cin >> N;
unsigned long long ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 727,559 | 727,560 | u541263126 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long N;
cin >> N;
unsigned long long ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,561 | 727,560 | u541263126 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t;
cin >> n;
t = n / 2 * (n - 1);
cout << t << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t;
cin >> n;
t = n * (n - 1) / 2;
cout << t << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 727,573 | 727,574 | u072080927 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
int main() {
int n;
cin >> n;
cout << ((n - 1) * n) / 2;
} | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
int main() {
long long n;
cin >> n;
cout << ((n - 1) * n) / 2;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,579 | 727,580 | u544532249 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
n = n - 1;
ans = n * (n + 1) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
long n;
cin >> n;
long long ans = 0;
n = n - 1;
ans = n * (n + 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 727,581 | 727,582 | u323327162 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
// マクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// 型エイリアス
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vvs = vector<vs>;
int main() {
int n;
cin >> n;
int ans = 0;
ans += (n - 1) * n / 2;
cout ... | #include <bits/stdc++.h>
using namespace std;
// マクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// 型エイリアス
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vvs = vector<vs>;
int main() {
ll n;
cin >> n;
ll ans = 0;
ans += (n - 1) * n / 2;
cout <<... | [
"variable_declaration.type.change"
] | 727,591 | 727,592 | u629314247 | cpp |
p02924 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
ans = N / 2 * (N - 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
ans = N * (N - 1) / 2;
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 727,593 | 727,594 | u127314985 | cpp |
p02924 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = N * (N - 1) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
ans = N * (N - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.add"
] | 727,595 | 727,594 | u127314985 | cpp |
p02924 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#de... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#de... | [] | 727,596 | 727,597 | u643747754 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long ans = 0;
ans = ((N - 1) * N) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
long ans = 0;
ans = ((N - 1) * N) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 727,598 | 727,599 | u748757847 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,600 | 727,601 | u377547585 | cpp |
p02924 | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::cout << (n * (n - 1)) / 2;
return 0;
}
| #include <iostream>
#include <vector>
int main(void) {
long long n;
std::cin >> n;
std::cout << (n * (n - 1)) / 2;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,602 | 727,603 | u517389396 | 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"
] | 727,604 | 727,605 | u346214077 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unsigned long long ans = 0;
// for(int i = 1;i < N;i++){
// ans += i;
//}
if (N != 1) {
ans = N * (N - 1) / 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
unsigned long ans = 0;
// for(int i = 1;i < N;i++){
// ans += i;
//}
if (N != 1) {
ans = N * (N - 1) / 2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 727,625 | 727,626 | u518306604 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unsigned long ans = 0;
// for(int i = 1;i < N;i++){
// ans += i;
//}
if (N != 1) {
ans = N * (N - 1) / 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
unsigned long ans = 0;
// for(int i = 1;i < N;i++){
// ans += i;
//}
if (N != 1) {
ans = N * (N - 1) / 2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 727,627 | 727,626 | u518306604 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unsigned int ans = 0;
// for(int i = 1;i < N;i++){
// ans += i;
//}
if (N != 1) {
ans = N * (N - 1) / 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
unsigned long ans = 0;
// for(int i = 1;i < N;i++){
// ans += i;
//}
if (N != 1) {
ans = N * (N - 1) / 2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 727,628 | 727,626 | u518306604 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = (n / 2) * (n - 1);
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = (n * (n - 1)) / 2;
cout << ans;
} | [
"assignment.change"
] | 727,635 | 727,636 | u262602763 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n * (n - 1)) / 2;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = (n * (n - 1)) / 2;
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,637 | 727,636 | u262602763 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) rep(i, 0, n)
int main() {
int N;
cin >> N;
int out = (N - 1) * N / 2;
cout << out << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) rep(i, 0, n)
int main() {
long long int N;
cin >> N;
long long int out = (N - 1) * N / 2;
cout << out << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 727,645 | 727,646 | u062014714 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
int M = (N - 1) * N / 2;
cout << M << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long N;
cin >> N;
long long M = (N - 1) * N / 2;
cout << M << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,658 | 727,659 | u390901183 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vin... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vin... | [
"variable_declaration.type.change"
] | 727,662 | 727,663 | u547748135 | cpp |
p02924 | #include <cstdio>
inline int in();
typedef long long ll;
inline void wr(ll);
int main(int argc, char **argv) {
register int n = in();
wr((n - 1) * 1ll * (n - 2) / 2), putchar('\n');
}
inline int in() {
register char c = getchar();
register int x = 0, f = 1;
for (; c < '0' || c > '9'; c = getchar())
if (c ... | #include <cstdio>
inline int in();
typedef long long ll;
inline void wr(ll);
int main(int argc, char **argv) {
register int n = in();
wr(n * 1ll * (n - 1) / 2), putchar('\n');
}
inline int in() {
register char c = getchar();
register int x = 0, f = 1;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-'... | [
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 727,664 | 727,665 | u309502988 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t ans;
ans = N * (N - 1) / 2;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t ans;
ans = N * (N - 1) / 2;
cout << ans;
} | [
"variable_declaration.type.primitive.change"
] | 727,668 | 727,669 | u282835662 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll sum = 0;
sum = N * (N - 1) / 2;
cout << sum << endl;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll sum = 0;
sum = (ll)N * (N - 1) / 2;
cout << sum << endl;
} | [
"type_conversion.add"
] | 727,674 | 727,675 | u615887401 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define maxi 1e18
#define pll pair<ll, ll>
map<ll, ll> pos, pos1;
int main() {
/*ll a,b;
cin>>a>>b; //ll giv=a;
//ll ans;
ll ans=0,giv=0;
while(giv+a<b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define maxi 1e18
#define pll pair<ll, ll>
map<ll, ll> pos, pos1;
int main() {
/*ll a,b;
cin>>a>>b; //ll giv=a;
//ll ans;
ll ans=0,giv=0;
while(giv+a<b... | [] | 727,686 | 727,687 | u356245733 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 727,688 | 727,689 | u018434698 | cpp |
p02924 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
int inputValue() {
int a;
cin >> a;
return a;
};
void inputArray(int *p, int a){rep(i, a){cin >> p[i];
}
}
;
void inputVector(vector<int> *p, int a) {
re... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
int inputValue() {
int a;
cin >> a;
return a;
};
void inputArray(int *p, int a){rep(i, a){cin >> p[i];
}
}
;
void inputVector(vector<int> *p, int a) {
re... | [
"variable_declaration.type.change"
] | 727,690 | 727,691 | u647592933 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n, a;
cin >> n;
a = n * (n - 1) / 2;
cout << a;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n, a;
cin >> n;
a = n * (n - 1) / 2;
cout << a;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,695 | 727,696 | u917909548 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define mii map<int, int>
#define io \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define mii map<int, int>
#define io \
ios_base::sync_with_stdio(0); ... | [] | 727,697 | 727,698 | u629420046 | cpp |
p02924 | // ModSum
#include <algorithm>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int ... | // ModSum
#include <algorithm>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
LL N... | [
"variable_declaration.type.change"
] | 727,713 | 727,714 | u362209280 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
int ans;
ans = (1 + n - 1) * (n - 1) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long n;
cin >> n;
long ans;
ans = (1 + n - 1) * (n - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 727,719 | 727,720 | u741134767 | 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;
#define ll long long
int main() {
ll n;
cin >> n;
cout << (n * (n - 1)) / 2;
return 0;
} | [
"variable_declaration.type.change"
] | 727,726 | 727,727 | u696044072 | 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"
] | 727,730 | 727,731 | u233745357 | cpp |
p02924 | #include <bits/stdc++.h>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
int main() {
int N;
cin >> N;
// P_N = 1 としたら残りは P_k = k + 1とすればよく... | #include <bits/stdc++.h>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
int main() {
// おっと
unsigned long long N;
cin >> N;
// P_N = 1 と... | [
"variable_declaration.type.primitive.change"
] | 727,732 | 727,733 | u355758478 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long int ans;
ans = (N - 1) * N / 2;
cout << ans;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int ans;
ans = (N - 1) * N / 2;
cout << ans;
} | [
"variable_declaration.type.widen.change"
] | 727,743 | 727,744 | u600118696 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long n;
cin >> n;
/*
vectr<int> a(n);
for(int i = 0;i < n;i++)
a[i] = i + 1;
*/
cout << (n - 1) * n / 2 - 1 + n << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long n;
cin >> n;
/*
vectr<int> a(n);
for(int i = 0;i < n;i++)
a[i] = i + 1;
*/
cout << (n - 1) * n / 2 << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 727,745 | 727,746 | u864698760 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.