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 "SaveFuncs.cpp"
/*****/
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#... | //#include "SaveFuncs.cpp"
/*****/
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#... | [
"variable_declaration.type.change"
] | 726,619 | 726,620 | u588369531 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
int main() {
ll n;
cin >> n;
cout << n / (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 726,621 | 726,622 | u831873811 | cpp |
p02924 | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll n;
cout << n * (n - 1) / 2 << endl;
} | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| [] | 726,623 | 726,624 | u949798495 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vecto... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vecto... | [
"variable_declaration.type.change"
] | 726,631 | 726,632 | u756614568 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
typedef long long ll;
const int N = 1e5 + 5;... | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
typedef long long ll;
const int N = 1e5 + 5;... | [
"assignment.change"
] | 726,636 | 726,637 | u411771230 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,638 | 726,639 | u771565679 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,640 | 726,639 | u771565679 | 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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
const... | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
const... | [
"variable_declaration.type.change"
] | 726,641 | 726,642 | u915689660 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 726,643 | 726,644 | u395846213 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | #include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repf(i, x, n) for (int i = (int)(x); i < (int... | [
"variable_declaration.type.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 726,643 | 726,645 | u395846213 | 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 ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << 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 ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
ll ans = (N * (N - 1)) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 726,646 | 726,647 | u689844566 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int answer;
answer = N * (N - 1) / 2;
cout << answer << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t answer;
answer = N * (N - 1) / 2;
cout << answer << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 726,652 | 726,653 | u119425165 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define all(t) (t).begin(), (t).end()
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inl... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define all(t) (t).begin(), (t).end()
#define MOD 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
return 0;
}
}
template <class T> inl... | [
"variable_declaration.type.change"
] | 726,657 | 726,658 | u962104148 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n - 1) * n / 2 << "\n";
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,691 | 726,692 | u582460965 | cpp |
p02924 | #include <bits/stdc++.h>
#include <cstdlib>
#include <ctime>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | #include <bits/stdc++.h>
#include <cstdlib>
#include <ctime>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
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"
] | 726,693 | 726,694 | u466393447 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << (a * (a - 1) / 2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long a;
cin >> a;
cout << (a * (a - 1) / 2);
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 726,700 | 726,701 | u657236078 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1)... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1)... | [
"variable_declaration.type.change"
] | 726,719 | 726,720 | u815863697 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
ans = n * (n - 1) / 2;
// for(int i = 1; i < n; i++) ans += i;
cout << ans;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
ans = n * (n - 1) / 2;
// for(int i = 1; i < n; i++) ans += i;
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,732 | 726,733 | u521973174 | cpp |
p02924 | #include <iostream>
int main() {
int N;
long int ans = 0;
std::cin >> N;
ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
int main() {
long int N, ans = 0;
std::cin >> N;
ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.remove",
"variable_declaration.add"
] | 726,744 | 726,745 | u721269623 | cpp |
p02924 | #include <iostream>
int main() {
int N, ans = 0;
std::cin >> N;
ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
int main() {
long int N, ans = 0;
std::cin >> N;
ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 726,746 | 726,745 | u721269623 | cpp |
p02924 | #include <iostream>
int main() {
int N, ans = 0;
std::cin >> N;
ans = N * (N - 1) / 2;
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
int main() {
long int N, ans = 0;
std::cin >> N;
ans = (N * (N - 1)) / 2;
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 726,746 | 726,748 | u721269623 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
/* alias */
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpii = vector<pii>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
/* repetition */
#define rep(i, n) for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
/* alias */
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpii = vector<pii>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
/* repetition */
#define rep(i, n) for (int i = 0; i <... | [
"variable_declaration.type.change"
] | 726,764 | 726,765 | u792521295 | cpp |
p02924 | #include <iostream>
int main(void) {
int n;
std::cin >> n;
std::cout << n * (n - 1) / 2 << std::endl;
return 0;
} | #include <iostream>
int main(void) {
long long n;
std::cin >> n;
std::cout << n * (n - 1) / 2 << std::endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,772 | 726,773 | u654558363 | cpp |
p02924 | /*input
13
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
} | /*input
13
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
} | [
"variable_declaration.type.primitive.change"
] | 726,780 | 726,781 | u965602776 | cpp |
p02924 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
ans = (n * n - 1) / 2;
cout << ans << endl;
} |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
ans = (n * (n - 1)) / 2;
cout << ans << endl;
}
| [] | 726,782 | 726,783 | u880212367 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORL(i, x) for (int i = head[x]; i; i = nxt[i])
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EACH(i, c) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORL(i, x) for (int i = head[x]; i; i = nxt[i])
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EACH(i, c) ... | [
"variable_declaration.type.change"
] | 726,784 | 726,785 | u054501336 | cpp |
p02924 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int M;
M = N * (N - 1) / 2;
cout << M << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long N;
cin >> N;
long M;
M = N * (N - 1) / 2;
cout << M << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 726,792 | 726,793 | u215743476 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
typedef long long ll;
const ll longinf = 1LL << 60;
using namespace std;
int n;
ll ans;
int main() {
cin >> n;
ans = (1 + n) * n / 2;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
typedef long long ll;
const ll longinf = 1LL << 60;
using namespace std;
ll n;
ll ans;
int main() {
cin >> n;
ans = (1 + n) * n / 2;
a... | [
"variable_declaration.type.change"
] | 726,798 | 726,799 | u806661586 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map> //hash map
#include <utility>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map> //hash map
#include <utility>
#include <vector>
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rrep(i, a, n) for (int(i) = (a); (i) >= (n); (i)--)
... | [
"variable_declaration.type.change"
] | 726,811 | 726,812 | u677400065 | cpp |
p02924 | #include <bits/stdc++.h>
#include <iomanip>
#include <unordered_map>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
ll ans;
ans = n * (n - 1) / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <iomanip>
#include <unordered_map>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
ll ans;
ans = n * (n - 1) / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 726,820 | 726,821 | u295618957 | cpp |
p02924 | #include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N;
std::cin >> N;
std::cout << N * (N - 1) / 2 << std::endl;
} | #include <array>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
long N;
std::cin >> N;
std::cout << N * (N - 1) / 2 << std::endl;
} | [
"variable_declaration.type.primitive.change"
] | 726,833 | 726,834 | u474016796 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
a = n * (n - 1);
b = a / 2;
cout << b;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int n, a, b;
cin >> n;
a = n * (n - 1);
b = a / 2;
cout << b;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 726,837 | 726,838 | u157835683 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
template <class e, class t, int N>
std::basic_istream<e, t> &operator>>(std::basic_istream<e, t> &in,
const e (&literal)[N]) {
std::array<e, N - 1> buffer; // get buffer
in >> buffer[0]; // skips whitespace
if (N > 2)... | #include <bits/stdc++.h>
using namespace std;
template <class e, class t, int N>
std::basic_istream<e, t> &operator>>(std::basic_istream<e, t> &in,
const e (&literal)[N]) {
std::array<e, N - 1> buffer; // get buffer
in >> buffer[0]; // skips whitespace
if (N > 2)... | [] | 726,841 | 726,842 | u037242228 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define bug cout << "-----------" << endl
const long long INF = (long long)1e18;
#define ll long long int
#define MAX 2268312229760322080
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define bug cout << "-----------" << endl
const long long INF = (long long)1e18;
#define ll long long int
#define MAX 2268312229760322080
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| [
"variable_declaration.type.change"
] | 726,847 | 726,848 | u918077858 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
int main()... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
int main()... | [
"variable_declaration.type.change"
] | 726,854 | 726,855 | u607865971 | 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() {
unsigned long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,856 | 726,857 | u827974318 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
// Function Macros:
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define setpre(n) cout << fixed << setprecision(n)
// Type Definitions:
typedef long long ll;
typedef unsigned long long ull;
// Constants:
const int INF = 2e9;... | #include <bits/stdc++.h>
using namespace std;
// Function Macros:
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define setpre(n) cout << fixed << setprecision(n)
// Type Definitions:
typedef long long ll;
typedef unsigned long long ull;
// Constants:
const int INF = 2e9;... | [
"variable_declaration.type.change"
] | 726,859 | 726,860 | u449175559 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
// Function Macros:
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define setpre(n) cout << fixed << setprecision(n)
// Type Definitions:
typedef long long ll;
typedef unsigned long long ull;
// Constants:
const int INF = 2e9;... | #include <bits/stdc++.h>
using namespace std;
// Function Macros:
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define setpre(n) cout << fixed << setprecision(n)
// Type Definitions:
typedef long long ll;
typedef unsigned long long ull;
// Constants:
const int INF = 2e9;... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 726,861 | 726,860 | u449175559 | 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 / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,862 | 726,863 | u577926181 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
long long int n, x;
x = (n * (n - 1)) / 2;
cout << x << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int n, x;
cin >> n;
x = (n * (n - 1)) / 2;
cout << x << endl;
return 0;
}
| [] | 726,864 | 726,865 | u072203760 | cpp |
p02924 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll ans;
ans = (n * n - n) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans;
ans = (n * n - n) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 726,868 | 726,869 | u639426108 | 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() {
long long int N;
cin >> N;
cout << N * (N - 1) / 2;
} | [
"variable_declaration.type.widen.change"
] | 726,881 | 726,882 | u926416331 | cpp |
p02924 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int h[100001];
int a[100001];
int main() {
cin.tie(0); // cout と cin の同期を切る
ios::sync_with_stdio(false); /* cの stdioストリーム (printfとか)と*/
int N;
cin >> N;
cout << ((N - 1) * (N)) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int h[100001];
int a[100001];
int main() {
cin.tie(0); // cout と cin の同期を切る
ios::sync_with_stdio(false); /* cの stdioストリーム (printfとか)と*/
long long N;
cin >> N;
cout << ((N - 1) * (N)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,887 | 726,888 | u858520692 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
long long res = 0;
cin >> n;
cout << ((n - 1) * n) / 2;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n;
long long res = 0;
cin >> n;
cout << ((n - 1) * n) / 2;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,895 | 726,896 | u021107862 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
unsigned int N;
cin >> N;
unsigned int ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
unsigned long N;
cin >> N;
unsigned long ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 726,897 | 726,898 | u204252859 | 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() {
unsigned long N;
cin >> N;
unsigned long ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,899 | 726,898 | u204252859 | 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() {
unsigned long N;
cin >> N;
unsigned long ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,900 | 726,898 | u204252859 | 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"
] | 726,901 | 726,902 | u864044904 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2;
} | #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",
"io.output.newline.add"
] | 726,903 | 726,902 | u864044904 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
int sum = (n * (n - 1)) / 2;
cout << sum << endl;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long sum = (n * (n - 1)) / 2;
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,904 | 726,905 | u526278960 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int sum = (n * (n - 1)) / 2;
cout << sum << endl;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long sum = (n * (n - 1)) / 2;
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,906 | 726,905 | u526278960 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long s = (n * (n + 1)) / 2;
cout << s << endl;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
n--;
long long s = (n * (n + 1)) / 2;
cout << s << endl;
} | [
"expression.unary.arithmetic.add"
] | 726,909 | 726,910 | u146209432 | 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 n;
cin >> n;
cout << n * (n + 1) / 2 - n << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,915 | 726,916 | u710397511 | 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;
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;
int main() {
ll n;
cin >> n;
cout << (ll)n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 726,921 | 726,922 | u775556337 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,923 | 726,924 | u942915776 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n;
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 726,948 | 726,949 | u032189172 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = (1 + N) * N / 2 - N;
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = (1 + N) * N / 2 - N;
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,950 | 726,951 | u582357587 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = (1 + N) * N / 2 - N;
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = (1 + N) * N / 2 - N;
cout << ans;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,950 | 726,952 | u582357587 | cpp |
p02924 | typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2;
cout << ans << endl;
} | typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 726,955 | 726,956 | u438592861 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2 == 1) {
cout << n * (n - 1) / 2 << endl;
} else {
cout << (n + 1) * n / 2 - n << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
if (n % 2 == 1) {
cout << n * (n - 1) / 2 << endl;
} else {
cout << (n + 1) * n / 2 - n << endl;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,962 | 726,963 | u564060397 | 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 int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| [
"variable_declaration.type.widen.change"
] | 726,966 | 726,967 | u984200859 | cpp |
p02924 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 726,976 | 726,977 | u917944707 | cpp |
p02924 | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define MOD 1000000007
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define MOD 1000000007
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [] | 726,980 | 726,981 | u336130820 | cpp |
p02924 | #include <bits/stdc++.h>
#include <vector>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
//ループマクロ
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; 0 <= i; i--)
//入出力
#define SCOUT(x) cout <<... | #include <bits/stdc++.h>
#include <vector>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
//ループマクロ
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; 0 <= i; i--)
//入出力
#define SCOUT(x) cout <<... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,988 | 726,989 | u281840563 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
int n, ans;
cin >> n;
ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
ll n, ans;
cin >> n;
ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 727,000 | 727,001 | u199343957 | cpp |
p02924 | /*
Chase
Your
Legend
英雄志逐传奇
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
type... | /*
Chase
Your
Legend
英雄志逐传奇
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
type... | [
"variable_declaration.type.change"
] | 727,014 | 727,015 | u955534952 | cpp |
p02924 | /*
Chase
Your
Legend
英雄志逐传奇
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
type... | /*
Chase
Your
Legend
英雄志逐传奇
*/
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
type... | [
"variable_declaration.type.change"
] | 727,016 | 727,015 | u955534952 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
// const ll MOD=998244353;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
// const ll MOD=998244353;
int main() {
int N;
cin >> N;
cout << 1LL * N * (N - 1) / 2 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 727,017 | 727,018 | u046768272 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
printf("%lld\n", n * (n - 1) / 2);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 727,029 | 727,030 | u919923389 | cpp |
p02924 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
t... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
t... | [
"variable_declaration.type.change"
] | 727,031 | 727,032 | u662614053 | cpp |
p02924 | #include <algorithm>
#include <climits> // LLONG_MAX, LLONG_MIN, INT_MIN, INT_MAX
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility> // pair make_pair
#include <vector>
... | #include <algorithm>
#include <climits> // LLONG_MAX, LLONG_MIN, INT_MIN, INT_MAX
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility> // pair make_pair
#include <vector>
... | [
"variable_declaration.type.primitive.change"
] | 727,035 | 727,036 | u703205079 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << n * (n + 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 727,045 | 727,046 | u017167684 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define psi pair<string, int>
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
long long sum = n * (n - 1) / 2;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define psi pair<string, int>
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n;
cin >> n;
long long sum = n * (n - 1) / 2;
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,047 | 727,048 | u224843402 | 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"
] | 727,057 | 727,058 | u038569501 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
int main() {
int n;
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 sz(x) int(x.size())
typedef long long ll;
int main() {
ll n;
cin >> n;
cout << (n * (n - 1) / 2) << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 727,069 | 727,070 | u168525123 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num = (N - 1) * (N);
cout << num / 2 << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long num = (N - 1) * (N);
cout << num / 2 << "\n";
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,071 | 727,072 | u605757515 | cpp |
p02924 | #include <stdio.h>
int main(int argc, char const *argv[]) {
int N;
scanf("%d", &N);
int mod_sum;
mod_sum = N * (N - 1) / 2;
printf("%d\n", mod_sum);
return 0;
} | #include <stdio.h>
int main(int argc, char const *argv[]) {
long int N;
scanf("%ld", &N);
long int mod_sum;
mod_sum = N * (N - 1) / 2;
printf("%ld\n", mod_sum);
return 0;
} | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 727,073 | 727,074 | u723444827 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
long long n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,092 | 727,093 | u359856428 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 1 + (n + 1) * (n - 2) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << 1 + (n + 1) * (n - 2) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,094 | 727,095 | u548026329 | 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"
] | 727,096 | 727,097 | u548026329 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,098 | 727,099 | u331948661 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
if (N != 1)
ans = N * (N - 1) / 2;
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t ans = 0;
if (N != 1)
ans = N * (N - 1) / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 727,114 | 727,115 | u661738979 | cpp |
p02924 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1... | [
"variable_declaration.type.change"
] | 727,116 | 727,117 | u117734686 | cpp |
p02924 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
unsigned long long ans = 0, temp = 0;
cin >> n;
an... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
unsigned long long ans = 0, temp = 0;
cin >> n;
an... | [
"call.arguments.change"
] | 727,122 | 727,123 | u227764848 | cpp |
p02924 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
ll ans = 0, temp = 0;
cin >> n;
ans = (n * (n - 1)... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
unsigned long long n;
unsigned long long ans = 0, temp = 0;
... | [
"variable_declaration.type.primitive.change"
] | 727,124 | 727,125 | u227764848 | cpp |
p02924 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
int ans = 0, temp = 0;
cin >> n;
ans = (n * (n - 1... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
unsigned long long n;
unsigned long long ans = 0, temp = 0;
... | [
"variable_declaration.type.primitive.change"
] | 727,126 | 727,125 | u227764848 | cpp |
p02924 | #include <stdio.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d", (n * (n - 1)) / 2);
} | #include <stdio.h>
using namespace std;
int main() {
long long int n;
scanf("%lld", &n);
printf("%lld", (n * (n - 1)) / 2);
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 727,127 | 727,128 | u271454647 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
auto ans = static_cast<long long>(N * (N - 1) / 2);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
auto ans = static_cast<long long>(N) * (N - 1) / 2;
cout << ans << endl;
}
| [
"call.arguments.change"
] | 727,135 | 727,136 | u879434320 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
auto N = 0;
cin >> N;
auto ans = N * (N - 1) / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
auto ans = (long long)N * (N - 1) / 2;
cout << ans << endl;
}
| [
"type_conversion.add"
] | 727,137 | 727,138 | u879434320 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
auto N = 0;
cin >> N;
auto ans = N * (N - 1) / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
auto ans = N * (N - 1) / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.widen.change"
] | 727,137 | 727,139 | u879434320 | 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;
auto ans = N * (N - 1) / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.type.narrow.change"
] | 727,140 | 727,139 | u879434320 | 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"
] | 727,140 | 727,141 | u879434320 | 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;
cout << ((2 + n - 1) * (n - 2)) / 2 + 1 << 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;
cout << ((2 + n - 1) * (n - 2)) / 2 + 1 << endl;
// cout << (1 + n - 1) * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 727,144 | 727,145 | u735909278 | cpp |
p02924 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
n = n - 1;
ll ans = (n + 1) * n / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
n = n - 1;
ll ans = (n + 1) * n / 2;
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 727,150 | 727,151 | u142253890 | cpp |
p02924 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
n = n - 1;
int ans = (n + 1) * n / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
n = n - 1;
ll ans = (n + 1) * n / 2;
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 727,152 | 727,151 | u142253890 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long long int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | [
"variable_declaration.type.widen.change"
] | 727,159 | 727,160 | u258342334 | cpp |
p02924 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"variable_declaration.type.change"
] | 727,185 | 727,186 | u526630579 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); } //最小公倍数
int main() {
long lon... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,189 | 727,190 | u110681742 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
uint64_t m = 2;
uint64_t t = (n + 1) * n;
uint64_t ret = t / m - n;
cout << ret << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
uint64_t n;
cin >> n;
uint64_t m = 2;
uint64_t t = (n + 1) * n;
uint64_t ret = t / m - n;
cout << ret << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 727,191 | 727,192 | u155403964 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vii vector<pair<int, int>>
#define vll vector<pair<ll, ll>>
#define pb push_back
#define el '\n'
#define N 1000000007
#define re return
#define PI 3.14159265
#define take(a, n) ... | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vii vector<pair<int, int>>
#define vll vector<pair<ll, ll>>
#define pb push_back
#define el '\n'
#define N 1000000007
#define re return
#define PI 3.14159265
#define take(a, n) ... | [
"variable_declaration.type.change"
] | 727,193 | 727,194 | u093730269 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.