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 < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
ll ans = (n - 1) * n / 2;
cout << ans << endl;
}
|
#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 < b) {
a = b;
return true;
}
return false;
}
int main() {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
}
|
[
"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) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int n;
cin >> n;
n--;
cout << n * (n + 1) / 2 << endl;
return 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) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll n;
cin >> n;
n--;
cout << n * (n + 1) / 2 << endl;
return 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 PI = 3.1415926535;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#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 PI = 3.1415926535;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"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 namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#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 namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void) {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"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) {
ll v0 = a, v1 = b, v2 = a % b;
while (v2 != 0) {
v0 = v1;
v1 = v2;
v2 = v0 % v1;
}
return v1;
}
ll lcm(ll a, ll b) { return (a * b / gcd(a, b)); }
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
cout << n * (n - 1) / 2 << 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;
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) {
ll v0 = a, v1 = b, v2 = a % b;
while (v2 != 0) {
v0 = v1;
v1 = v2;
v2 = v0 % v1;
}
return v1;
}
ll lcm(ll a, ll b) { return (a * b / gcd(a, b)); }
int main() {
ios::sync_with_stdio(false);
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
[
"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++)
#define MAX_N 10000
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
const int INF = 1 << 30;
const ll MOD = ll(1e9 + 7);
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
// system("read -n 1 -s -p \"Press any key to continue...\"");
}
|
/*
*/
#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++)
#define MAX_N 10000
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
const int INF = 1 << 30;
const ll MOD = ll(1e9 + 7);
int main() {
ll n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
// system("read -n 1 -s -p \"Press any key to continue...\"");
}
|
[
"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 <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <stdio.h>
#include <stdlib.h>
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
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 < b) {
a = b;
return true;
}
return false;
}
int abs_A(int num) {
if (num > 0)
return num;
else
return -num;
}
int abs_B(long long num, long long numb) {
if (num - numb >= 0)
return num - numb;
else
return -1 * (num - numb);
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
bool permutation(vector<int> &vec, vector<int> &P) {
bool ok = true;
for (int i = 0; i < vec.size(); i++) {
// cout << vec.at(i);
if (vec.at(i) != P.at(i)) {
ok = false;
}
}
return ok;
}
/*bool nibu(vector<int>& retu,int key) {
}*/
const long long MOD = 1000000007;
const int INF = 1001001001;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#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 <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <stdio.h>
#include <stdlib.h>
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
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 < b) {
a = b;
return true;
}
return false;
}
int abs_A(int num) {
if (num > 0)
return num;
else
return -num;
}
int abs_B(long long num, long long numb) {
if (num - numb >= 0)
return num - numb;
else
return -1 * (num - numb);
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
bool permutation(vector<int> &vec, vector<int> &P) {
bool ok = true;
for (int i = 0; i < vec.size(); i++) {
// cout << vec.at(i);
if (vec.at(i) != P.at(i)) {
ok = false;
}
}
return ok;
}
/*bool nibu(vector<int>& retu,int key) {
}*/
const long long MOD = 1000000007;
const int INF = 1001001001;
int main() {
long long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"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
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;
void Main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
|
#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
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;
void Main() {
int n;
cin >> n;
cout << (ll)n * (n - 1) / 2 << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
|
[
"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 Pll = P<ll, ll>;
using Pdd = P<double, double>;
template <typename T1, typename T2> using M = std::map<T1, T2>;
using Mii = M<int, int>;
using Msi = M<string, int>;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define RREP(i, s, e) for (int i = (int)(s); i >= (int)(e); --i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(), ie = (c).end(); i != ie; ++i)
#define ALL(c) (c).begin(), (c).end()
const double PI = acos(-1);
const ll MOD = 1e9 + 7;
int n;
string s;
int main() {
cin >> n;
std::cout << n * (n - 1) / 2 << '\n';
return 0;
}
|
#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 Pll = P<ll, ll>;
using Pdd = P<double, double>;
template <typename T1, typename T2> using M = std::map<T1, T2>;
using Mii = M<int, int>;
using Msi = M<string, int>;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define RREP(i, s, e) for (int i = (int)(s); i >= (int)(e); --i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(), ie = (c).end(); i != ie; ++i)
#define ALL(c) (c).begin(), (c).end()
const double PI = acos(-1);
const ll MOD = 1e9 + 7;
ll n;
string s;
int main() {
cin >> n;
std::cout << n * (n - 1) / 2 << '\n';
return 0;
}
|
[
"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 <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
if (N == 2) {
cout << 1 << endl;
} else {
cout << (N - 1) / 2 * N << endl;
}
}
|
#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 <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
if (N == 2) {
cout << 1 << endl;
} else {
cout << (N - 1) * N / 2 << endl;
}
}
|
[
"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<int, int>>
#define vv vector<vector<int>>
using namespace std;
main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#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<int, int>>
#define vv vector<vector<int>>
using namespace std;
main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"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, __VA_ARGS__)
#else
#define debug(...) 42
#endif
using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> T gcd(T &a, T &b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
debug("debug test\n");
int n, m;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
#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, __VA_ARGS__)
#else
#define debug(...) 42
#endif
using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> T gcd(T &a, T &b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
debug("debug test\n");
ll n, m;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
[
"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, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
for (int i = 0; i < n; ++i) \
cin >> xs[i]
void Main();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
Main();
return 0;
}
void Main() {
Cin(int, n);
cout << n * (n - 1) / 2 << endl;
}
|
#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, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
for (int i = 0; i < n; ++i) \
cin >> xs[i]
void Main();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
Main();
return 0;
}
void Main() {
Cin(ll, n);
cout << n * (n - 1) / 2 << endl;
}
|
[] | 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 INF 1e9
#define MOD 1000000007; // 1e9+7
void solve() {
int N;
cin >> N;
cout << (N - 1) * N / 2;
}
int main() {
solve();
return 0;
}
|
#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 INF 1e9
#define MOD 1000000007; // 1e9+7
void solve() {
long long N;
cin >> N;
cout << (N - 1) * N / 2;
}
int main() {
solve();
return 0;
}
|
[
"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>;
using vvd = vector<vector<double>>;
using vvvd = vector<vector<vector<double>>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pint = pair<int, int>;
using Graph = vvi;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
bool cmp(pint a, pint b) { return a.second < b.second; }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << '\n'; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << '\n'; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << '\n'; }
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;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
}
|
#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>;
using vvd = vector<vector<double>>;
using vvvd = vector<vector<vector<double>>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pint = pair<int, int>;
using Graph = vvi;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
bool cmp(pint a, pint b) { return a.second < b.second; }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << '\n'; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << '\n'; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << '\n'; }
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() {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
}
|
[
"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 <sstream>
#include <stack>
#include <vector>
using namespace std;
/*freopen{"input.txt","r",stdin};
freopen{"output.txt","w",stdout};*/
#define mp make_pair
#define pb push_back
const int INF = 1000 * 1000 * 1000;
const int maxn = 2e5;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
// priority_queue <int,vector<int>,greater<int> > q1; //从小到大
// priority_queue <int,vector<int>,less<int> >q2; //从大到小
// set multiset vector queue priority_queue map multimap pair string structure
//枚举 思维 贪心 搜索 模拟 预处理 二分 排序
int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
|
#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 <sstream>
#include <stack>
#include <vector>
using namespace std;
/*freopen{"input.txt","r",stdin};
freopen{"output.txt","w",stdout};*/
#define mp make_pair
#define pb push_back
const int INF = 1000 * 1000 * 1000;
const int maxn = 2e5;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
// priority_queue <int,vector<int>,greater<int> > q1; //从小到大
// priority_queue <int,vector<int>,less<int> >q2; //从大到小
// set multiset vector queue priority_queue map multimap pair string structure
//枚举 思维 贪心 搜索 模拟 预处理 二分 排序
int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
ll n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
|
[
"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 std;
using ll = long long;
int main(void) {
int n;
cin >> n;
ll ans = (ll)n * (n + 1) / 2;
cout << ans << endl;
}
|
#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 std;
using ll = long long;
int main(void) {
int n;
cin >> n;
ll ans = (ll)n * (n - 1) / 2;
cout << ans << endl;
}
|
[
"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 - 1) / 2 << endl;
}
|
#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 * (N - 1) / 2 << endl;
}
|
[
"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[] = {-1, 0, 1, 0};
int dx[] = {0, -1, 0, 1};
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#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[] = {-1, 0, 1, 0};
int dx[] = {0, -1, 0, 1};
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"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> vbool;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<llint> vllint;
typedef vector<vllint> vvllint;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vpint> vvpint;
typedef vector<vpllint> vvpllint;
#define rep(i, n) for (int i = 0; i < n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << endl; \
else \
cout << "no" << endl;
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define POSSIBLE(ans) \
if (ans) \
cout << "POSSIBLE" << endl; \
else \
cout << "IMPOSSIBLE" << endl;
#define Pi 3.1415926535897932384626
#define coutans rep(i, ans.size()) cout << ans[i] << endl;
#define mod (llint)1000000007
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
// aとbの最大公約数を求めるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
bool check(llint a, llint b) { return a > b; }
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
bool IsPrime(llint num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (llint i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
// aのb乗を求める(1000000007で割った余りやで)
llint modpow(llint a, llint b) {
if (b == 0)
return 1;
if (b == 1)
return a;
llint tmp = modpow(a, b / 2);
tmp %= mod;
tmp = tmp * tmp % mod;
if (b % 2)
return tmp * a % mod;
else
return tmp;
}
// aCbを1000000007で割った余りを求める
llint convination(llint a, llint b) {
llint ans = 1;
for (llint i = 0; i < b; i++) {
ans *= a - i;
ans %= mod;
}
for (llint i = 1; i <= b; i++) {
ans *= modinv(i, mod);
ans %= mod;
}
return ans;
}
void dijkstra(vvpint &a, int p, vint &cost) {
//コスト、位置
priority_queue<pint, vpint, greater<pint>> que;
vbool visited(a.size(), false);
que.push({0, p});
int tmp = 0;
while (que.size() != 0) {
auto top = que.top();
que.pop();
if (visited[top.second])
continue;
visited[top.first] = true;
tmp++;
if (tmp == a.size())
break;
cost[top.second] = top.first;
rep(i, a[top.second].size()) {
que.push({top.first + a[top.second][i].second, a[top.second][i].first});
}
}
return;
}
int main() {
int n;
cin >> n;
// 1~n-1までの和
cout << (n - 1) * n / 2 << endl;
return 0;
}
|
#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> vbool;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<llint> vllint;
typedef vector<vllint> vvllint;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vpint> vvpint;
typedef vector<vpllint> vvpllint;
#define rep(i, n) for (int i = 0; i < n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << endl; \
else \
cout << "no" << endl;
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define POSSIBLE(ans) \
if (ans) \
cout << "POSSIBLE" << endl; \
else \
cout << "IMPOSSIBLE" << endl;
#define Pi 3.1415926535897932384626
#define coutans rep(i, ans.size()) cout << ans[i] << endl;
#define mod (llint)1000000007
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
// aとbの最大公約数を求めるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
bool check(llint a, llint b) { return a > b; }
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
bool IsPrime(llint num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (llint i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
// aのb乗を求める(1000000007で割った余りやで)
llint modpow(llint a, llint b) {
if (b == 0)
return 1;
if (b == 1)
return a;
llint tmp = modpow(a, b / 2);
tmp %= mod;
tmp = tmp * tmp % mod;
if (b % 2)
return tmp * a % mod;
else
return tmp;
}
// aCbを1000000007で割った余りを求める
llint convination(llint a, llint b) {
llint ans = 1;
for (llint i = 0; i < b; i++) {
ans *= a - i;
ans %= mod;
}
for (llint i = 1; i <= b; i++) {
ans *= modinv(i, mod);
ans %= mod;
}
return ans;
}
void dijkstra(vvpint &a, int p, vint &cost) {
//コスト、位置
priority_queue<pint, vpint, greater<pint>> que;
vbool visited(a.size(), false);
que.push({0, p});
int tmp = 0;
while (que.size() != 0) {
auto top = que.top();
que.pop();
if (visited[top.second])
continue;
visited[top.first] = true;
tmp++;
if (tmp == a.size())
break;
cost[top.second] = top.first;
rep(i, a[top.second].size()) {
que.push({top.first + a[top.second][i].second, a[top.second][i].first});
}
}
return;
}
int main() {
llint n;
cin >> n;
// 1~n-1までの和
cout << (n - 1) * n / 2 << endl;
return 0;
}
|
[
"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 i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
int main(void) {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#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 i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define YES(j) cout << (j ? "YES" : "NO") << endl;
#define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
#define yes(j) std::cout << (j ? "yes" : "no") << endl;
int main(void) {
long long n;
cin >> n;
cout << (long long)n * (n - 1) / 2 << endl;
}
|
[
"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(v.begin(), v.end(), greater<int>());
#define INF 999999999
#define MOD 1000000007
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(), (X).end()
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
// 愚直に実装したら間に合わないので工夫した。
// 実際はpriority_queueを使えばよかった。
// 以下のは、途中の計算を二分探索で簡略化してる。
int N;
void input() {
#ifdef __LOCAL
fs::path p = __FILE__;
fs::path input, output;
input = output = p.parent_path();
input += string("/input/") + string(p.stem()) + string(".txt");
output += string("/output/") + string(p.stem()) + string(".txt");
freopen(input.c_str(), "r", stdin);
freopen(output.c_str(), "w", stdout);
#endif
cin >> N;
}
int solve() {
input();
ll sum;
sum = N * (N - 1) / 2;
cout << sum << endl;
return 0;
}
int main() {
solve();
return 0;
}
|
#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(v.begin(), v.end(), greater<int>());
#define INF 999999999
#define MOD 1000000007
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(), (X).end()
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#else
#define DBG(X)
#define SAY(X)
#endif
#ifdef __LOCAL
#include <filesystem>
namespace fs = std::filesystem;
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
// 愚直に実装したら間に合わないので工夫した。
// 実際はpriority_queueを使えばよかった。
// 以下のは、途中の計算を二分探索で簡略化してる。
ll N;
void input() {
#ifdef __LOCAL
fs::path p = __FILE__;
fs::path input, output;
input = output = p.parent_path();
input += string("/input/") + string(p.stem()) + string(".txt");
output += string("/output/") + string(p.stem()) + string(".txt");
freopen(input.c_str(), "r", stdin);
freopen(output.c_str(), "w", stdout);
#endif
cin >> N;
}
int solve() {
input();
ll sum;
sum = N * (N - 1) / 2;
cout << sum << endl;
return 0;
}
int main() {
solve();
return 0;
}
|
[
"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 = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// --------------------------------------
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cout << (((n - 1) * (n - 1) + n) / 2) << endl;
}
|
#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 = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(i, n) (i), (i + n)
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, -1, 0, 1};
int dx8[8] = {1, 0, -1, 1, -1, 1, 0, -1};
int dy8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6 + 1;
const ll mod = 1000000007;
// --------------------------------------
ll n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cout << (((n - 1) * (n - 1) + n) / 2) << endl;
}
|
[
"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<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
// cout << ans << endl;
return 0;
}
|
#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<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
// cout << ans << endl;
return 0;
}
|
[
"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(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
using namespace std;
void solve() {
int N;
cin >> N;
ll ans = N * (N - 1) / 2;
print(ans);
}
int main() {
solve();
return 0;
}
|
#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(x) cout << x << endl;
#define debug(x) cout << #x << " = " << endl;
using namespace std;
void solve() {
ll N;
cin >> N;
ll ans = N * (N - 1) / 2;
print(ans);
}
int main() {
solve();
return 0;
}
|
[
"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;
return 1;
}
return 0;
}
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y) {
swap(x, y);
}
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> bool isPrime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binarySearchJudge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binarySearch(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binarySearchJudge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
double dist(vector<int> x, vector<int> y, int i, int j) {
return sqrt(pow(x[i] - x[j], 2) + pow(y[i] - y[j], 2));
}
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#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;
return 1;
}
return 0;
}
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y) {
swap(x, y);
}
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> bool isPrime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binarySearchJudge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binarySearch(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binarySearchJudge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
double dist(vector<int> x, vector<int> y, int i, int j) {
return sqrt(pow(x[i] - x[j], 2) + pow(y[i] - y[j], 2));
}
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"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;
cout << (n - 1) * n / 2 << endl;
}
|
#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;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
|
[
"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 inf = (1ull << 31) - 1;
int n;
int main() {
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(18);
cin >> n;
cout << (n * (n - 1) >> 1);
return 0;
}
|
#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 inf = (1ull << 31) - 1;
ll n;
int main() {
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(18);
cin >> n;
cout << (n * (n - 1) >> 1);
return 0;
}
|
[
"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 = N * (N - 1) / 2;
cout << res << endl;
return 0;
}
|
#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 = N * (N - 1) / 2;
cout << res << endl;
return 0;
}
|
[
"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(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), A.end())
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vd = std::vector<double>;
using vvd = std::vector<std::vector<double>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using namespace std;
#define MOD 1000000007
#define INF 1000000001
#define LL_INF 1001001001001001001
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
bool bfs(vector<vector<int>> g, vector<int> &dist, int sv) {
queue<int> q;
q.push(sv);
dist[sv] = 0;
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto v : g[now]) {
if (dist[v] != -1)
continue;
dist[v] = dist[now] + 1;
q.push(v);
}
}
}
int main(void) {
int n;
cin >> n;
int ans = (n) * (n - 1) / 2;
out(ans);
}
|
#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(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), A.end())
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vd = std::vector<double>;
using vvd = std::vector<std::vector<double>>;
using vll = std::vector<ll>;
using vvll = std::vector<std::vector<ll>>;
using namespace std;
#define MOD 1000000007
#define INF 1000000001
#define LL_INF 1001001001001001001
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
bool bfs(vector<vector<int>> g, vector<int> &dist, int sv) {
queue<int> q;
q.push(sv);
dist[sv] = 0;
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto v : g[now]) {
if (dist[v] != -1)
continue;
dist[v] = dist[now] + 1;
q.push(v);
}
}
}
int main(void) {
ll n;
cin >> n;
ll ans = (n) * (n - 1) / 2;
out(ans);
}
|
[
"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>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int lint;
typedef pair<int, int> P;
typedef pair<lint, lint> LLP;
typedef pair<char, char> CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v, hoge) upper_bound(v.begin(), v.end(), hoge)
#define lower(v, hoge) lower_bound(v.begin(), v.end(), hoge)
#define llower(v, hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v, hoge) *upper_bound(v.begin(), v.end(), hoge)
const lint MOD = pow(10, 9) + 7;
lint gcd(lint a, lint b) {
// aとbの最大公約数を返す
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(a % b, b);
}
lint lcm(lint a, lint b) {
// aとbの最小公倍数を返す
return a / gcd(a, b) * b;
}
/*
vector<char>al(26);
al =
{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL =
{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
vector<char>NUM(10);
NUM = { '0','1','2' ,'3' ,'4' ,'5' ,'6' ,'7' ,'8' ,'9' };
*/
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#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>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int lint;
typedef pair<int, int> P;
typedef pair<lint, lint> LLP;
typedef pair<char, char> CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v, hoge) upper_bound(v.begin(), v.end(), hoge)
#define lower(v, hoge) lower_bound(v.begin(), v.end(), hoge)
#define llower(v, hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v, hoge) *upper_bound(v.begin(), v.end(), hoge)
const lint MOD = pow(10, 9) + 7;
lint gcd(lint a, lint b) {
// aとbの最大公約数を返す
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(a % b, b);
}
lint lcm(lint a, lint b) {
// aとbの最小公倍数を返す
return a / gcd(a, b) * b;
}
/*
vector<char>al(26);
al =
{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL =
{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
vector<char>NUM(10);
NUM = { '0','1','2' ,'3' ,'4' ,'5' ,'6' ,'7' ,'8' ,'9' };
*/
int main() {
lint N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"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 u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
using f80 = __float80;
// }}}
constexpr i64 INF = 1'010'000'000'000'000'017LL;
constexpr i64 MOD = 1'000'000'007LL;
constexpr f64 EPS = 1e-12;
constexpr f64 PI = 3.14159265358979323846;
// util {{{
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
template <typename C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// }}}
// init {{{
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
// }}}
//--------------------------------------------------------------------
signed main() {
int n;
cin >> n;
cout << (n - 1) * (n) / 2 << endl;
// cout << ans << endl;
return 0;
}
|
#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 u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
using f80 = __float80;
// }}}
constexpr i64 INF = 1'010'000'000'000'000'017LL;
constexpr i64 MOD = 1'000'000'007LL;
constexpr f64 EPS = 1e-12;
constexpr f64 PI = 3.14159265358979323846;
// util {{{
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
template <typename C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// }}}
// init {{{
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
// }}}
//--------------------------------------------------------------------
signed main() {
i64 n;
cin >> n;
cout << (n - 1) * (n) / 2 << endl;
// cout << ans << endl;
return 0;
}
|
[
"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;
return 0;
}
cout << N * (N - 1) / 2 << 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;
return 0;
}
cout << N * (N - 1) / 2 << 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>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greater<>()
#define SUM(a) accumulate((a).begin(), (a).end(), 0)
#define d10 std::setprecision(10)
#define d20 std::setprecision(20)
const double PI = 3.14159265359;
ll gcd(ll a, ll b) {
ll t;
while (b != 0) {
t = a % b;
a = b;
b = t;
}
return a;
}
int gcd(int a, int b) {
int t;
while (b != 0) {
t = a % b;
a = b;
b = t;
}
return a;
}
ll recfact(ll start, ll n) {
ll i;
if (n <= 16) {
ll r = start;
for (i = start + 1; i < start + n; i++)
r = r * i % mod;
return r % mod;
}
i = n / 2;
return recfact(start, i) % mod * recfact(start + i, n - i) % mod;
}
ll fct(ll n) { return recfact(1, n); }
ll ncm(ll n, ll m) {
if (n < m)
return 0;
ll x = (fct(n) % mod / (fct(m) * fct(n - m)) % mod) % mod;
return x;
}
bool isincluded(char x, string str) {
bool f = 0;
for (size_t i = 0; i < str.size(); i++) {
if (str.at(i) == x)
f = 1;
}
return f;
}
int ctoi(char c) {
if ('0' <= c && c <= '9') {
return c - '0';
}
return 0;
}
int main(void) {
int n;
cin >> n;
n--;
cout << (1 + n) * n / 2 << endl;
return 0;
}
|
#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>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(a) (a).begin(), (a).end()
#define allg(a) (a).begin(), (a).end(), greater<>()
#define SUM(a) accumulate((a).begin(), (a).end(), 0)
#define d10 std::setprecision(10)
#define d20 std::setprecision(20)
const double PI = 3.14159265359;
ll gcd(ll a, ll b) {
ll t;
while (b != 0) {
t = a % b;
a = b;
b = t;
}
return a;
}
int gcd(int a, int b) {
int t;
while (b != 0) {
t = a % b;
a = b;
b = t;
}
return a;
}
ll recfact(ll start, ll n) {
ll i;
if (n <= 16) {
ll r = start;
for (i = start + 1; i < start + n; i++)
r = r * i % mod;
return r % mod;
}
i = n / 2;
return recfact(start, i) % mod * recfact(start + i, n - i) % mod;
}
ll fct(ll n) { return recfact(1, n); }
ll ncm(ll n, ll m) {
if (n < m)
return 0;
ll x = (fct(n) % mod / (fct(m) * fct(n - m)) % mod) % mod;
return x;
}
bool isincluded(char x, string str) {
bool f = 0;
for (size_t i = 0; i < str.size(); i++) {
if (str.at(i) == x)
f = 1;
}
return f;
}
int ctoi(char c) {
if ('0' <= c && c <= '9') {
return c - '0';
}
return 0;
}
int main(void) {
ll n;
cin >> n;
n--;
cout << (1 + n) * n / 2 << endl;
return 0;
}
|
[
"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);
}
return 0;
}
|
#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);
}
return 0;
}
|
[
"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 * (n - 1) / 2;
cout << ans << endl;
return 0;
}
|
#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 * (n - 1) / 2;
cout << ans << endl;
return 0;
}
|
[
"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.