problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02924
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"variable_declaration.type.change"
] | 725,613
| 725,614
|
u976045502
|
cpp
|
p02924
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(var) \
do { \
std::cout << __LINE__ << "> " << #var << ": "; \
view(var); \
} while (0)
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
void Main() {
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(var) \
do { \
std::cout << __LINE__ << "> " << #var << ": "; \
view(var); \
} while (0)
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
void Main() {
ll N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
|
[
"variable_declaration.type.change"
] | 725,615
| 725,616
|
u215692812
|
cpp
|
p02924
|
/*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
list<int>::iterator it;
list<int>::iterator it1;
vector<int>::iterator it2;
vector<int>::iterator it3;
set<int>::iterator it4;
map<string, int>::iterator it5;
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
|
/*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
list<int>::iterator it;
list<int>::iterator it1;
vector<int>::iterator it2;
vector<int>::iterator it3;
set<int>::iterator it4;
map<string, int>::iterator it5;
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
LL n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 725,617
| 725,618
|
u506295831
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,621
| 725,622
|
u204973596
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2;
return 0;
}
|
[
"variable_declaration.type.change"
] | 725,638
| 725,639
|
u975658594
|
cpp
|
p02924
|
#include <algorithm>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(int argc, const char *argv[]) {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#include <algorithm>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define _GLIBCXX_DEBUG
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
int main(int argc, const char *argv[]) {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
int64_t n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 725,649
| 725,650
|
u702462808
|
cpp
|
p02924
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SIZE(obj) (int)(obj).sizeT()
#define YESNO(cond, yes, no) \
{ cout << ((cond) ? (yes) : (no)) << endl; }
#define SORT(list) sort(ALL((list)));
#define RSORT(list) sort((list).rbegin(), (list).rend())
#define ASSERT(cond, mes) assert(cond &&mes)
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'050'000'000;
template <typename T> T round_up(const T &a, const T &b) {
return (a + (b - 1)) / b;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << p.second;
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
REP(i, (int)v.size()) is >> v[i];
return is;
}
template <typename T> T clamp(T &n, T a, T b) {
if (n < a)
n = a;
if (n > b)
n = b;
return n;
}
template <typename T> static T GCD(T u, T v) {
T r;
while (v != 0) {
r = u % v;
u = v;
v = r;
}
return u;
}
template <typename T> static T LCM(T u, T v) { return u / GCD(u, v) * v; }
template <class T> std::vector<T> enum_div(T n) {
std::vector<T> ret;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
bool isPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
for (ll i = 3; i * i <= num; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
};
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool is_integer(T x) { return std::floor(x) == x; }
struct ToUpper {
char operator()(char c) { return toupper(c); }
};
struct ToLower {
char operator()(char c) { return tolower(c); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SIZE(obj) (int)(obj).sizeT()
#define YESNO(cond, yes, no) \
{ cout << ((cond) ? (yes) : (no)) << endl; }
#define SORT(list) sort(ALL((list)));
#define RSORT(list) sort((list).rbegin(), (list).rend())
#define ASSERT(cond, mes) assert(cond &&mes)
constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'050'000'000;
template <typename T> T round_up(const T &a, const T &b) {
return (a + (b - 1)) / b;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << p.first << p.second;
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
REP(i, (int)v.size()) is >> v[i];
return is;
}
template <typename T> T clamp(T &n, T a, T b) {
if (n < a)
n = a;
if (n > b)
n = b;
return n;
}
template <typename T> static T GCD(T u, T v) {
T r;
while (v != 0) {
r = u % v;
u = v;
v = r;
}
return u;
}
template <typename T> static T LCM(T u, T v) { return u / GCD(u, v) * v; }
template <class T> std::vector<T> enum_div(T n) {
std::vector<T> ret;
for (T i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
bool isPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
for (ll i = 3; i * i <= num; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
};
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool is_integer(T x) { return std::floor(x) == x; }
struct ToUpper {
char operator()(char c) { return toupper(c); }
};
struct ToLower {
char operator()(char c) { return tolower(c); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 725,657
| 725,658
|
u303039933
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define F first
#define S second
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define PI 3.141592653589
// Input
#define in(a) scanf("%d", &a)
#define in2(a, b) scanf("%d%d", &a, &b)
#define in3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define llin(a) cin >> a
#define inl(a) scanf("%lld", &a)
#define read(v, i, n) \
for (i = 0; i < n; i++) \
in(v[i])
#define twod(mat, i, j, n, m) \
rep(i, n) { rep(j, m) in(mat[i][j]); }
#define sc(ch) scanf("%c", &ch)
#define sstr(str) scanf("%s", str)
// Output
#define pr(a) printf("%d ", a)
#define pr2(a, b) printf("%d %d\n", a, b)
#define pr3(a, b, c) printf("%d %d %d\n", a, b, c)
#define out(a) printf("%d\n", a)
#define outl(a) printf("%lld\n", a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define yes printf("YES\n")
#define no printf("NO\n")
#define lin printf("\n")
// Iterator
#define lp(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) for (i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lower(v, k) lower_bound(v.begin(), v.end(), k) - v.begin()
#define upper(v, k) upper_bound(v.begin(), v.end(), k) - v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
// Debug
#define dbg(v, i, n) \
for (i = 0; i < n; i++) \
pr(v[i]); \
lin
#define what(x) cerr << #x << " : " << x << "\n"
#define ck printf("continue\n")
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << "\n";
err(++it, args...);
}
// Data Type
#define ll long long int
#define ii pair<int, int>
#define pli pair<ll, int>
#define triple tuple<int, int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define viii vector<pair<pair<int, int>, int>>
#define vvii vector<vector<pair<int, int>>>
#define M 1000000007
#define N 100005 // check the limits, man
int main() {
int n, ans;
in(n);
ans = n, ans *= (n - 1);
llout(ans / 2);
}
|
#include <bits/stdc++.h>
using namespace std;
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define F first
#define S second
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define PI 3.141592653589
// Input
#define in(a) scanf("%d", &a)
#define in2(a, b) scanf("%d%d", &a, &b)
#define in3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define llin(a) cin >> a
#define inl(a) scanf("%lld", &a)
#define read(v, i, n) \
for (i = 0; i < n; i++) \
in(v[i])
#define twod(mat, i, j, n, m) \
rep(i, n) { rep(j, m) in(mat[i][j]); }
#define sc(ch) scanf("%c", &ch)
#define sstr(str) scanf("%s", str)
// Output
#define pr(a) printf("%d ", a)
#define pr2(a, b) printf("%d %d\n", a, b)
#define pr3(a, b, c) printf("%d %d %d\n", a, b, c)
#define out(a) printf("%d\n", a)
#define outl(a) printf("%lld\n", a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define yes printf("YES\n")
#define no printf("NO\n")
#define lin printf("\n")
// Iterator
#define lp(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) for (i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lower(v, k) lower_bound(v.begin(), v.end(), k) - v.begin()
#define upper(v, k) upper_bound(v.begin(), v.end(), k) - v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
// Debug
#define dbg(v, i, n) \
for (i = 0; i < n; i++) \
pr(v[i]); \
lin
#define what(x) cerr << #x << " : " << x << "\n"
#define ck printf("continue\n")
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << "\n";
err(++it, args...);
}
// Data Type
#define ll long long int
#define ii pair<int, int>
#define pli pair<ll, int>
#define triple tuple<int, int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define viii vector<pair<pair<int, int>, int>>
#define vvii vector<vector<pair<int, int>>>
#define M 1000000007
#define N 100005 // check the limits, man
int main() {
int n;
ll ans;
in(n);
ans = n, ans *= (n - 1);
llout(ans / 2);
}
|
[] | 725,659
| 725,660
|
u365730500
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, ans;
cin >> N;
N--;
ans = N * (N + 1) / 2;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, ans;
cin >> N;
N--;
ans = N * (N + 1) / 2;
cout << ans << endl;
}
|
[
"variable_declaration.type.change"
] | 725,664
| 725,665
|
u070343125
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long M = (N - 1) * N / 2;
cout << M << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long M = (N - 1) * N / 2;
cout << M << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,671
| 725,672
|
u842939260
|
cpp
|
p02924
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 725,683
| 725,684
|
u154833883
|
cpp
|
p02924
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"variable_declaration.type.change"
] | 725,685
| 725,686
|
u979078704
|
cpp
|
p02924
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define len(X) ((int)(X).size())
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#define SAY(X) cout << (X) << '\n';
#else
#define DBG(X)
#define SAY(X)
#endif
#define M_PI 3.14159265358979323846
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>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
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;
}
int solve() {
int N;
std::cin >> N;
return ((N - 1) * N) / 2;
}
int main() {
std::cout << solve() << std::endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define len(X) ((int)(X).size())
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#define SAY(X) cout << (X) << '\n';
#else
#define DBG(X)
#define SAY(X)
#endif
#define M_PI 3.14159265358979323846
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>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
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;
}
ll solve() {
ll N;
std::cin >> N;
return ((N - 1) * N) / 2;
}
int main() {
std::cout << solve() << std::endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 725,723
| 725,724
|
u187453157
|
cpp
|
p02924
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#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;
cout << ans << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 725,725
| 725,726
|
u722986066
|
cpp
|
p02924
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2;
system("PAUSE");
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2;
system("PAUSE");
}
|
[
"variable_declaration.type.change"
] | 725,735
| 725,736
|
u004411048
|
cpp
|
p02924
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma comment(linker, "/STACK:16777216")
#pragma warning(disable : 6031)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eps (1e-9)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef tuple<int, int, int> tiii;
int main() {
#ifdef LOCAL_MACHINE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long n;
cin >> n;
if (n == 2)
cout << 1;
else if (n == 1)
cout << 0;
else {
long long res = 0;
if (n % 2 == 1) {
res += n % 2;
res += (2 + n - 1) * (n - 2) / 2;
} else {
res += 1 % 2;
res += (3 + n - 1) * (n - 2) / 2;
}
cout << res;
}
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma comment(linker, "/STACK:16777216")
#pragma warning(disable : 6031)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eps (1e-9)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef tuple<int, int, int> tiii;
int main() {
#ifdef LOCAL_MACHINE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long n;
cin >> n;
if (n == 2)
cout << 1;
else if (n == 1)
cout << 0;
else {
long long res = 0;
if (n % 2 == 1) {
res += n % 2;
res += (2 + n - 1) * (n - 2) / 2;
} else {
res += 1 % 2;
res += (2 + n - 1) * (n - 2) / 2;
}
cout << res;
}
return 0;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 725,739
| 725,740
|
u648324897
|
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 N;
cin >> N;
cout << N * (N - 1LL) / 2LL << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 725,741
| 725,742
|
u486097563
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main(void) {
int n, ans;
cin >> n;
ans = (n - 1) * n / 2;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
long long int n, ans;
cin >> n;
ans = (n - 1) * n / 2;
cout << ans << endl;
return 0;
}
|
[
"variable_declaration.type.widen.change"
] | 725,749
| 725,750
|
u589734885
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 725,758
| 725,759
|
u285358283
|
cpp
|
p02924
|
#include <iostream>
int main() {
int N;
std::cin >> N;
std::cout << N * (N - 1) / 2 << std::endl;
}
|
#include <iostream>
int main() {
long long N;
std::cin >> N;
std::cout << N * (N - 1) / 2 << std::endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,760
| 725,761
|
u543584809
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
const int INF = 1001001001;
int main() {
int 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)
typedef long long ll;
const int INF = 1001001001;
int main() {
ll n;
cin >> n;
cout << ((n - 1) * (n) / 2) << endl;
}
|
[
"variable_declaration.type.change"
] | 725,764
| 725,765
|
u564182781
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int 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 < (int)n; i++)
int main() {
long long int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
|
[
"variable_declaration.type.widen.change"
] | 725,775
| 725,776
|
u138062788
|
cpp
|
p02924
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define PI 3.14159265358979
typedef long long int ll;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2;
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define PI 3.14159265358979
typedef long long int ll;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2;
}
|
[
"variable_declaration.type.change"
] | 725,784
| 725,785
|
u444349080
|
cpp
|
p02924
|
#include <iostream>
int main() {
long n;
unsigned long ans;
std::cin >> n;
ans = n * (n + 1) / 2;
std::cout << ans;
}
|
#include <iostream>
int main() {
long n;
unsigned long ans;
std::cin >> n;
ans = n * (n - 1) / 2;
std::cout << ans;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 725,786
| 725,787
|
u523698212
|
cpp
|
p02924
|
// in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n";
#define migmig \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define read \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int del = 728729;
int main() {
migmig;
int n;
cin >> n;
cout << (n * (n - 1)) / 2;
return 0;
}
|
// in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n";
#define migmig \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define read \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int del = 728729;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
|
[] | 725,790
| 725,791
|
u433132072
|
cpp
|
p02924
|
#include <iostream>
int main() {
int N;
std::cin >> N;
// int s = 0;
// for (int i = 1; i < N; i++)
// {
// s += i;
// }
int s;
s = ((N - 1) * N) / 2;
std::cout << s << std::endl;
}
|
// ============================================================================
// なんかACもらえない
// ============================================================================
#include <iostream>
int main() {
unsigned long long N;
std::cin >> N;
// int s = 0;
// for (int i = 1; i < N; i++)
// {
// s += i;
// }
unsigned long long s;
s = ((N - 1) * N) / 2;
std::cout << s << std::endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 725,806
| 725,807
|
u395804356
|
cpp
|
p02924
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x) // decltypeで型取得、引数があればva_argsのところに入れる
using namespace std;
typedef long long ll; // long longをllでかけるようにした
const int INF = 1e9;
int main(void) {
int n;
cin >> n;
n -= 1;
ll res = n * (n + 1) / 2;
cout << res << endl;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x) // decltypeで型取得、引数があればva_argsのところに入れる
using namespace std;
typedef long long ll; // long longをllでかけるようにした
const int INF = 1e9;
int main(void) {
ll n;
cin >> n;
n -= 1;
unsigned long long res = n * (n + 1) / 2;
cout << res << endl;
}
|
[
"variable_declaration.type.change"
] | 725,817
| 725,818
|
u369212307
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,823
| 725,824
|
u972702156
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 725,848
| 725,849
|
u267265758
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n = n - 1;
long long ans = n * (n + 1);
ans /= 2;
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
n = n - 1;
long long ans = n * (n + 1);
ans /= 2;
cout << ans;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,853
| 725,854
|
u566755496
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << (a * (a - 1)) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
cout << (a * (a - 1)) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,855
| 725,856
|
u623687794
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << a * (a - 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
cout << (a * (a - 1)) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,857
| 725,856
|
u623687794
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 725,864
| 725,865
|
u473403559
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int n;
void input() { cin >> n; }
void solve() { cout << (n * (n - 1) / 2) << endl; }
int main() {
input();
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long int n;
void input() { cin >> n; }
void solve() { cout << (n * (n - 1) / 2) << endl; }
int main() {
input();
solve();
}
|
[
"variable_declaration.type.widen.change"
] | 725,866
| 725,867
|
u129327203
|
cpp
|
p02924
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int a, b, i, j, k, n, m;
int str[100005];
int main() {
scanf("%d", &n);
cout << n * (n - 1) / 2;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
long long int a, b, i, j, k, n, m;
int str[100005];
int main() {
scanf("%lld", &n);
cout << n * (n - 1) / 2;
return 0;
}
|
[
"literal.string.change",
"call.arguments.change"
] | 725,868
| 725,869
|
u748042489
|
cpp
|
p02924
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 725,870
| 725,871
|
u825412276
|
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 pair<int, int> P;
int main() {
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 pair<int, int> P;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 725,872
| 725,873
|
u620735210
|
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() {
int N;
cin >> N;
cout << (long)N * (long)(N - 1) / 2 << endl;
return 0;
}
|
[
"type_conversion.add"
] | 725,880
| 725,881
|
u701098435
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n, m) for (int i = n; i < m; i++)
#define REPR(i, n, m) for (int i = n; i >= m; i--)
#define LREP(i, n, m) for (ll i = n; i < m; i++)
#define LREPR(i, n, m) for (ll i = n; i >= m; i--)
#define P pair<int, int>
const int INF = 1e9 + 1;
const int MOD = 1e9 + 7;
//---functions---//
int gcd(int a, int b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
int s2i(string num) {
stringstream ss;
ss << num << flush;
int n;
ss >> n;
return n;
}
string i2s(int n) {
stringstream ss;
ss << n << flush;
return ss.str();
}
bool firstCompare(const P &firstElof, const P &secondElof) {
return firstElof.first < secondElof.first;
}
bool secondCompare(const P &firstElof, const P &secondElof) {
return firstElof.second < secondElof.second;
}
//---------------//
//-----class-----//
class UnionFind {
public:
vector<ll> par; // parents
vector<ll> siz; // sizes of set
vector<ll> rank; // rank of each element
UnionFind(ll n) : par(n), siz(n, 1LL), rank(n) { LREP(i, 0, n) par[i] = i; }
// initialization
/*
void init(ll n){
par.assign(n);
siz.assign(n, 1LL);
rank.assign(n);
LREP(i, 0, n) par[i] = i;
}
*/
// find the root of x
ll find(ll x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
// Unite two set including x or y
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[x] == rank[y])
rank[x]++;
}
}
// Do x and y belong to the same set?
bool issame(ll x, ll y) { return find(x) == find(y); }
};
int N;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> N;
cout << (N - 1) * N / 2 << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n, m) for (int i = n; i < m; i++)
#define REPR(i, n, m) for (int i = n; i >= m; i--)
#define LREP(i, n, m) for (ll i = n; i < m; i++)
#define LREPR(i, n, m) for (ll i = n; i >= m; i--)
#define P pair<int, int>
const int INF = 1e9 + 1;
const int MOD = 1e9 + 7;
//---functions---//
int gcd(int a, int b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
int s2i(string num) {
stringstream ss;
ss << num << flush;
int n;
ss >> n;
return n;
}
string i2s(int n) {
stringstream ss;
ss << n << flush;
return ss.str();
}
bool firstCompare(const P &firstElof, const P &secondElof) {
return firstElof.first < secondElof.first;
}
bool secondCompare(const P &firstElof, const P &secondElof) {
return firstElof.second < secondElof.second;
}
//---------------//
//-----class-----//
class UnionFind {
public:
vector<ll> par; // parents
vector<ll> siz; // sizes of set
vector<ll> rank; // rank of each element
UnionFind(ll n) : par(n), siz(n, 1LL), rank(n) { LREP(i, 0, n) par[i] = i; }
// initialization
/*
void init(ll n){
par.assign(n);
siz.assign(n, 1LL);
rank.assign(n);
LREP(i, 0, n) par[i] = i;
}
*/
// find the root of x
ll find(ll x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
// Unite two set including x or y
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[x] == rank[y])
rank[x]++;
}
}
// Do x and y belong to the same set?
bool issame(ll x, ll y) { return find(x) == find(y); }
};
ll N;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> N;
cout << (N - 1) * N / 2 << '\n';
}
|
[
"variable_declaration.type.change"
] | 725,888
| 725,889
|
u052746401
|
cpp
|
p02924
|
#include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,890
| 725,891
|
u483156389
|
cpp
|
p02924
|
#include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n + 1) / 2 << endl;
}
|
#include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 725,892
| 725,891
|
u483156389
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << int((N - 1) * N / 2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << ll((N - 1) * N / 2) << endl;
return 0;
}
|
[
"call.function.change",
"io.output.change"
] | 725,903
| 725,904
|
u244832678
|
cpp
|
p02924
|
#include <stdio.h>
int main(void) {
int N, A;
scanf("%d", &N);
A = N * (N - 1) / 2;
printf("%d", A);
return 0;
}
|
#include <stdio.h>
int main(void) {
long int N, A;
scanf("%ld", &N);
A = N * (N - 1) / 2;
printf("%ld", A);
return 0;
}
|
[
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 725,911
| 725,912
|
u666712170
|
cpp
|
p02924
|
#include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
int n;
scanf("%d", &n);
int total = n * (n - 1) * 1 / 2;
printf("%d", total);
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
ll n;
scanf("%lld", &n);
ll total = n * (n - 1) * 1 / 2;
printf("%lld", total);
return 0;
}
|
[
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 725,927
| 725,928
|
u837233010
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cout << n * (n - 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
|
[] | 725,934
| 725,935
|
u777477705
|
cpp
|
p02924
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <tuple>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
ll fast_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = fast_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
int main() {
int n;
cin >> n;
ll ans;
ans = n * (n - 1) / 2;
cout << ans;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <tuple>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
ll fast_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = fast_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
int main() {
ll n;
cin >> n;
ll ans;
ans = n * (n - 1) / 2;
cout << ans;
return 0;
}
|
[
"variable_declaration.type.change"
] | 725,936
| 725,937
|
u652150585
|
cpp
|
p02924
|
/*
g++ -std=c++14 -O2 -Wall a.cpp -o a && a < in.txt > out.txt
*/
// io
#include <iostream>
//#include <fineam> //http://www.cplusplus.com/reference/fineam/fineam/
//#include <cstdio>
#include <iomanip> //http://www.cplusplus.com/reference/iomanip/
#include <limits>
// util
#include <algorithm>
#include <cstring>
#include <string>
//#include <utility>
//#include <functional> //http://www.cplusplus.com/reference/functional/
//#include <cstdlib>
#include <cmath>
//#include <complex>
//#include <random>
//#include <bitset>
// containers https://en.cppreference.com/w/cpp/container
#include <queue>
#include <set>
#include <vector>
//#include <map>
//#include <unordered_set>
//#include <unordered_map>
// time
//#include <ctime>
//#include <chrono>
// https://en.cppreference.com/w/cpp/header/chrono
// http://www.cplusplus.com/reference/chrono/
using namespace std;
typedef vector<int> arri;
typedef vector<float> arrf;
typedef pair<int, int> pairi;
typedef long long ll;
typedef long double ld;
const int mod = 1e9 + 7;
const ll inf = 0x7fffffffffffffff;
const ll infneg = -0x7fffffffffffffff;
// file input routed to stdinout
/*
std::ifineam inFile("input.txt");
std::ofineam outFile("output.txt");
std::cin.rdbuf(inFile.rdbuf());
std::cout.rdbuf(outFile.rdbuf());
*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
cout << n * (n - 1) / 2;
}
|
/*
g++ -std=c++14 -O2 -Wall a.cpp -o a && a < in.txt > out.txt
*/
// io
#include <iostream>
//#include <fineam> //http://www.cplusplus.com/reference/fineam/fineam/
//#include <cstdio>
#include <iomanip> //http://www.cplusplus.com/reference/iomanip/
#include <limits>
// util
#include <algorithm>
#include <cstring>
#include <string>
//#include <utility>
//#include <functional> //http://www.cplusplus.com/reference/functional/
//#include <cstdlib>
#include <cmath>
//#include <complex>
//#include <random>
//#include <bitset>
// containers https://en.cppreference.com/w/cpp/container
#include <queue>
#include <set>
#include <vector>
//#include <map>
//#include <unordered_set>
//#include <unordered_map>
// time
//#include <ctime>
//#include <chrono>
// https://en.cppreference.com/w/cpp/header/chrono
// http://www.cplusplus.com/reference/chrono/
using namespace std;
typedef vector<int> arri;
typedef vector<float> arrf;
typedef pair<int, int> pairi;
typedef long long ll;
typedef long double ld;
const int mod = 1e9 + 7;
const ll inf = 0x7fffffffffffffff;
const ll infneg = -0x7fffffffffffffff;
// file input routed to stdinout
/*
std::ifineam inFile("input.txt");
std::ofineam outFile("output.txt");
std::cin.rdbuf(inFile.rdbuf());
std::cout.rdbuf(outFile.rdbuf());
*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
cout << n * (n - 1) / 2;
}
|
[
"variable_declaration.type.change"
] | 725,938
| 725,939
|
u027395921
|
cpp
|
p02924
|
#include <array>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#include <array>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,945
| 725,946
|
u822685707
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << ((n - 1) * n) / 2;
}
|
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << ((n - 1) * n) / 2;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,956
| 725,957
|
u155692157
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << ((n - 1) * n) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << ((n - 1) * n) / 2;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,958
| 725,959
|
u638965820
|
cpp
|
p02924
|
#include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define fi first
#define se second
void print(bool c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void Print(bool c) {
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
ll gcdll(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool cmp(const pii &a, const pii &b) {
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int main() {
double n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define ALL(a) (a).begin(), (a).end()
#define sort_v(a) sort(a.begin(), a.end())
#define fi first
#define se second
void print(bool c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void Print(bool c) {
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
ll gcdll(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (b == 0)
break;
a %= b;
}
return a;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
bool cmp(const pii &a, const pii &b) {
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"variable_declaration.type.change"
] | 725,960
| 725,961
|
u705296057
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cout << (n * (n + 1)) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2;
return 0;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 725,964
| 725,965
|
u666534200
|
cpp
|
p02924
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(x) (x).begin(), (x).end()
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 (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout << (ll)(n - 1) * (n - 2) / 2 << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(x) (x).begin(), (x).end()
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 (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout << (ll)(n - 1) * (n) / 2 << endl;
return 0;
}
|
[
"expression.operation.binary.remove"
] | 725,966
| 725,967
|
u834415466
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 725,999
| 726,000
|
u331302877
|
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 int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.widen.change"
] | 726,015
| 726,016
|
u592099403
|
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"
] | 726,017
| 726,018
|
u633402865
|
cpp
|
p02924
|
#include <bits/stdc++.h>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
#define mod 1000000007
using namespace std;
class CompareFirst {
public:
bool operator()(pair<int, int> n1, pair<int, int> n2) {
return n1.first > n2.first; //>:desc <:asc
}
};
int main() {
unsigned long long n, k, ans;
//入力を受け取る
cin >> n;
n--;
// ans = 0.5 * n * (n+1) (1,...,n-1の和）
//桁あふれしないように、変数kで途中計算を受け取る
/*
if(n%2==0){
k=n/2;
ans = k*(n+1);
}else{
k=(n+1)/2;
ans = n*k;
}*/
ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
#define drep(i, cc, n) for (int i = cc; i >= n; --i)
#define mod 1000000007
using namespace std;
class CompareFirst {
public:
bool operator()(pair<int, int> n1, pair<int, int> n2) {
return n1.first > n2.first; //>:desc <:asc
}
};
int main() {
long long n, k, ans;
//入力を受け取る
cin >> n;
n--;
// ans = 0.5 * n * (n+1) (1,...,n-1の和）
//桁あふれしないように、変数kで途中計算を受け取る
/*
if(n%2==0){
k=n/2;
ans = k*(n+1);
}else{
k=(n+1)/2;
ans = n*k;
}*/
ans = n * (n + 1) / 2;
cout << ans << endl;
return 0;
}
|
[
"variable_declaration.type.narrow.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 726,019
| 726,020
|
u736278528
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,021
| 726,022
|
u182310429
|
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() {
long long n;
cin >> n;
cout << (n - 1) * n / 2LL << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 726,025
| 726,026
|
u612175324
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i > (b); --i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL INF = 1000000000;
const LL MOD = 1000000007;
// other
//-------------------------------------------
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define FI first
#define SE second
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i > (b); --i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL INF = 1000000000;
const LL MOD = 1000000007;
// other
//-------------------------------------------
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define FI first
#define SE second
int main() {
LL N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 726,039
| 726,040
|
u276588887
|
cpp
|
p02924
|
#include "bits/stdc++.h"
void Main() {
int n;
std::cin >> n;
std::cout << n * (n - 1) / 2 << std::endl;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
|
#include "bits/stdc++.h"
void Main() {
long int n;
std::cin >> n;
std::cout << n * (n - 1) / 2 << std::endl;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
|
[
"variable_declaration.type.widen.change"
] | 726,041
| 726,042
|
u931698099
|
cpp
|
p02924
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long int
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
int N;
cin >> N;
cout << ((N - 1) * N) / 2 << endl;
return 0;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long int
#define pb push_back
#define mp make_pair
using namespace std;
int main() {
long N;
cin >> N;
cout << ((N - 1) * N) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 726,047
| 726,048
|
u468862268
|
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 N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 726,064
| 726,065
|
u148959786
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << 0;
else
cout << n * (n - 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 1)
cout << 0;
else
cout << n * (n - 1) / 2;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,071
| 726,072
|
u451534321
|
cpp
|
p02924
|
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
int ans = ((n - 1) * n) / 2;
cout << ans << endl;
}
|
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
ll n;
cin >> n;
ll ans = ((n - 1) * n) / 2;
cout << ans << endl;
}
|
[
"variable_declaration.type.change"
] | 726,084
| 726,085
|
u247576416
|
cpp
|
p02924
|
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
int ans = (n - 1) * (n) / 2;
cout << ans << endl;
}
|
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
ll n;
cin >> n;
ll ans = ((n - 1) * n) / 2;
cout << ans << endl;
}
|
[
"variable_declaration.type.change"
] | 726,086
| 726,085
|
u247576416
|
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 N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,087
| 726,088
|
u922952729
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n + 1)) / 2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2;
}
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 726,089
| 726,090
|
u560858626
|
cpp
|
p02924
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.widen.change"
] | 726,099
| 726,100
|
u783674761
|
cpp
|
p02924
|
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, pair<int, int>> PP;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vec;
int inf = -1;
ll mod = pow(10, 9) + 7;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
|
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, pair<int, int>> PP;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vec;
int inf = -1;
ll mod = pow(10, 9) + 7;
int main() {
ll n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 726,101
| 726,102
|
u678503521
|
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"
] | 726,111
| 726,112
|
u749089333
|
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"
] | 726,113
| 726,112
|
u749089333
|
cpp
|
p02924
|
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long sum_mod = (n - 1) * n / 2;
cout << sum_mod << endl;
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long n;
cin >> n;
long sum_mod = (n - 1) * n / 2;
cout << sum_mod << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 726,114
| 726,115
|
u977925575
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = mod * mod;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = mod * mod;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
int main() {
ll N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
|
[
"variable_declaration.type.change"
] | 726,118
| 726,119
|
u194894739
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = mod * mod;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = mod * mod;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
int main() {
ll N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
|
[
"variable_declaration.type.change"
] | 726,120
| 726,119
|
u194894739
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
const ll INF = 1e18;
#define print(x) cout << (x) << endl;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
const ll INF = 1e18;
#define print(x) cout << (x) << endl;
#define rep(i, m, n) for (ll i = (m); i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
|
[
"variable_declaration.type.change"
] | 726,121
| 726,122
|
u583742345
|
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 N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,123
| 726,124
|
u979452668
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long long int ans;
if (n == 1) {
cout << 0 << endl;
return 0;
} else if (n == 2) {
cout << 1 << endl;
return 0;
}
ans = (n - 1) * (n) / 2;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long int ans;
if (n == 1) {
cout << 0 << endl;
return 0;
} else if (n == 2) {
cout << 1 << endl;
return 0;
}
ans = (long int)(n - 1) * (n) / 2;
cout << ans << endl;
return 0;
}
|
[
"variable_declaration.type.narrow.change"
] | 726,125
| 726,126
|
u493846037
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long int ans;
if (n == 1) {
cout << 0 << endl;
return 0;
} else if (n == 2) {
cout << 1 << endl;
return 0;
}
ans = (n - 1) * (n) / 2;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long int ans;
if (n == 1) {
cout << 0 << endl;
return 0;
} else if (n == 2) {
cout << 1 << endl;
return 0;
}
ans = (long int)(n - 1) * (n) / 2;
cout << ans << endl;
return 0;
}
|
[
"type_conversion.add"
] | 726,127
| 726,126
|
u493846037
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long int ans;
if (n == 1) {
cout << 0 << endl;
return 0;
} else if (n == 2) {
cout << 1 << endl;
return 0;
}
ans = (n - 1) * (n - 2) / 2;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long int ans;
if (n == 1) {
cout << 0 << endl;
return 0;
} else if (n == 2) {
cout << 1 << endl;
return 0;
}
ans = (long int)(n - 1) * (n) / 2;
cout << ans << endl;
return 0;
}
|
[
"expression.operation.binary.remove"
] | 726,128
| 726,126
|
u493846037
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll mod = 1000000007;
/*
例えば2 3 1 4をそれぞれ1 2 3 4で割り、割った余りの総和の最大値を計算する
2 3 4 ... n-1 n 1とすると、余りの総和は1+2+...+(n-1)となり、これが最大？
*/
void solve() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll mod = 1000000007;
/*
例えば2 3 1 4をそれぞれ1 2 3 4で割り、割った余りの総和の最大値を計算する
2 3 4 ... n-1 n 1とすると、余りの総和は1+2+...+(n-1)となり、これが最大？
*/
void solve() {
ll n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
[
"variable_declaration.type.change"
] | 726,133
| 726,134
|
u272496669
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll mod = 1000000007;
/*
2 3 1 4をそれぞれ1 2 3 4で割り、割った余りの総和の最大値を計算する
n 1 2 ... n-1とすると、余りの総和は1+2+...+(n-1)となり、これが最大？
*/
void solve() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll mod = 1000000007;
/*
例えば2 3 1 4をそれぞれ1 2 3 4で割り、割った余りの総和の最大値を計算する
2 3 4 ... n-1 n 1とすると、余りの総和は1+2+...+(n-1)となり、これが最大？
*/
void solve() {
ll n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
[
"variable_declaration.type.change"
] | 726,135
| 726,134
|
u272496669
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n;
long long answer = (n * (n - 1)) / 2;
cout << answer;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
unsigned long n;
cin >> n;
unsigned long answer = (n * (n - 1)) / 2;
cout << answer;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.remove"
] | 726,137
| 726,138
|
u387480576
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = 2147483647;
constexpr ll L_INF = 9223372036854775807LL;
//===
int main() {
int n;
cin >> n;
cout << n * (n + 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = 2147483647;
constexpr ll L_INF = 9223372036854775807LL;
//===
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 726,147
| 726,146
|
u067237725
|
cpp
|
p02924
|
#include <bits/stdc++.h>
#define len(x) (int)(x.size())
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
cout << (1 + (n - 1)) * (n - 1) / 2 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define len(x) (int)(x.size())
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
cout << (ll)(1 + (n - 1)) * (n - 1) / 2 << '\n';
return 0;
}
|
[
"variable_declaration.type.change"
] | 726,148
| 726,149
|
u522035594
|
cpp
|
p02924
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
cout << (n - 1 + 1) * (n - 1) / 2 << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long n;
cin >> n;
cout << (n - 1 + 1) * (n - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,150
| 726,151
|
u830782448
|
cpp
|
p02924
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
const int INF = 1 << 29;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
const int INF = 1 << 29;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 726,159
| 726,160
|
u024764559
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans = (N * (N - 1)) / 2;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long N;
cin >> N;
long ans = (N * (N - 1)) / 2;
cout << ans << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 726,170
| 726,171
|
u882359130
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
long long b = a * (a - 1);
cout << b / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
long long b = a * (a - 1);
cout << b / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,172
| 726,173
|
u787241689
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
int b = (a - 1) * a;
cout << b / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
long long b = a * (a - 1);
cout << b / 2 << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 726,174
| 726,173
|
u787241689
|
cpp
|
p02924
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ans = (n - 1) * n / 2;
cout << ans << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = (n - 1) * n / 2;
cout << ans << endl;
}
|
[
"variable_declaration.type.change"
] | 726,183
| 726,184
|
u709142358
|
cpp
|
p02924
|
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
typedef long long ll;
using std::string;
using std::vector;
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
//////////////////////////////////////
//////////////////////////////////////
int main() {
// std::ifstream in("0_normal_2");
// std::cin.rdbuf(in.rdbuf());
int N;
std::cin >> N;
int ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
}
|
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
typedef long long ll;
using std::string;
using std::vector;
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
//////////////////////////////////////
//////////////////////////////////////
int main() {
// std::ifstream in("0_normal_2");
// std::cin.rdbuf(in.rdbuf());
ll N;
std::cin >> N;
ll ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 726,190
| 726,191
|
u888094685
|
cpp
|
p02924
|
#include <iostream>
int main() {
int N;
std::cin >> N;
int ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
}
|
#include <iostream>
int main() {
long long N;
std::cin >> N;
long long ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,192
| 726,193
|
u150861392
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
cout << (1 + (n - 1)) * (n - 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
cout << (1 + (n - 1)) * (n - 1) / 2;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 726,194
| 726,195
|
u585918714
|
cpp
|
p02924
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (1 + n - 1) * (n - 1) / 2 << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (1 + n - 1) * (n - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,197
| 726,198
|
u448407332
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (1 + n) * (n - 1) / 2 << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[] | 726,205
| 726,206
|
u912025537
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
//{1,2,...,n-1,n}を{2,3,...,n,1}で割ったあまりは{1,2,...,n-1,0}
cout << n * (n - 1) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
//{1,2,...,n-1,n}を{2,3,...,n,1}で割ったあまりは{1,2,...,n-1,0}
cout << (int64_t)n * (n - 1) / 2 << endl; //桁が足りない？
}
|
[
"type_conversion.add"
] | 726,211
| 726,212
|
u661308718
|
cpp
|
p02924
|
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
cout << (n * (n - 1) / 2) << endl;
}
|
#include <iostream>
using namespace std;
int main(void) {
long long int n;
cin >> n;
cout << (n * (n - 1) / 2) << endl;
}
|
[
"variable_declaration.type.widen.change"
] | 726,213
| 726,214
|
u639343026
|
cpp
|
p02924
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
const ll INF = 1e14;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
const ll INF = 1e14;
const ll MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
[
"variable_declaration.type.change"
] | 726,215
| 726,216
|
u946090308
|
cpp
|
p02924
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define Rep(i, m, n) for (int i = m; i < n; i++)
#define repeatrev(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 ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define itn int
const int MAX = 510000;
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef priority_queue<int> Pr;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define Rep(i, m, n) for (int i = m; i < n; i++)
#define repeatrev(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 ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define itn int
const int MAX = 510000;
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef priority_queue<int> Pr;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"variable_declaration.type.change"
] | 726,221
| 726,222
|
u584355627
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.