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 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef uint64_t ull;
ll n;
double tmp;
ll ans;
int main(void) {
cin >> n;
tmp = n / 2.0;
ans = tmp * (n - 1);
cout << ans << endl;
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef uint64_t ull;
ll n;
long double tmp;
ll ans;
int main(void) {
cin >> n;
tmp = n / 2.0;
ans = tmp * (n - 1);
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 728,533 | 728,534 | u940654002 | cpp |
p02924 | //#pragma GCC optimize("O3", "unroll-loops")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | //#pragma GCC optimize("O3", "unroll-loops")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.type.change"
] | 728,543 | 728,544 | u276234834 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 728,545 | 728,546 | u407502234 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define INF 2e9
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPA(i, a, n) for (int i = a; i < n; ++i)
#define ALL(a) a.begin, a.end()
using namespace std;
int main(void) {
int N;
cin >> N;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define INF 2e9
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPA(i, a, n) for (int i = a; i < n; ++i)
#define ALL(a) a.begin, a.end()
using namespace std;
int main(void) {
long N;
cin >> N... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,549 | 728,550 | u358822669 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
template <typename T> static inline void ArrayInput(vector<T> &A) {
for (auto itr = A.begin(); i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
template <typename T> static inline void ArrayInput(vector<T> &A) {
for (auto itr = A.begin(); i... | [
"variable_declaration.type.primitive.change"
] | 728,553 | 728,554 | u846796522 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define s(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
int main() {
int t, i, j, n;
// cout << "Hello" << endl;
cin >> n;
cout << ((n * (n + 1)) / 2) - n << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define s(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
int main() {
ll t, i, j, n;
// cout << "Hello" << endl;
cin >> n;
cout << ((n * (n + 1)) / 2) - n << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 728,565 | 728,566 | u106540028 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = ((n) * (n - 1)) / 2;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = ((n) * (n - 1)) / 2;
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,567 | 728,568 | u957558006 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = ((n) * (n - 11)) / 2;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = ((n) * (n - 1)) / 2;
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"expression.operation.binary.change"
] | 728,569 | 728,568 | u957558006 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000007
#define maxn 1000000009b
int main() {
int N;
cin >> N;
N--;
cout << (N + 1) * N / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000007
#define maxn 1000000009b
int main() {
ll N;
cin >> N;
N--;
cout << (N + 1) * N / 2 << endl;
} | [
"variable_declaration.type.change"
] | 728,570 | 728,571 | u568545273 | cpp |
p02924 | #define HAVE_STRUCT_TIMESPEC
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans;
return 0;
}
| #define HAVE_STRUCT_TIMESPEC
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,572 | 728,573 | u963610246 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,576 | 728,577 | u433162241 | cpp |
p02924 | #include "assert.h"
#include "math.h"
#include <algorithm>
#include <bitset>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define BU... | #include "assert.h"
#include "math.h"
#include <algorithm>
#include <bitset>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define BU... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 728,580 | 728,581 | u058149584 | cpp |
p02924 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long LL;
typedef unsigned long UL;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
... | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long LL;
typedef unsigned long UL;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n;
cin >> n;
if (n == 1) {
cout << 0 ... | [
"variable_declaration.type.widen.change"
] | 728,586 | 728,587 | u549268855 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("inf.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int n;
cin >> n;
cout << ((n - 1) * (n)) / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("inf.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#define int long long
int n;
cin >> n;
cout << ((n - 1) * (n)) / 2;
} | [] | 728,588 | 728,589 | u870168650 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N = 0;
cin >> N;
int result = 0;
result = N * (N - 1) / 2;
cout << result;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int64_t N = 0;
cin >> N;
int64_t result = 0;
result = N * (N - 1) / 2;
cout << result;
} | [
"variable_declaration.type.primitive.change"
] | 728,594 | 728,595 | u994956045 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "0" << endl;
return 0;
} else
cout << n * (n - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 1) {
cout << "0" << endl;
return 0;
} else
cout << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,602 | 728,603 | u222866518 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
#define all(obj) obj.begin(), obj.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
#define all(obj) obj.begin(), obj.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.type.widen.change"
] | 728,604 | 728,605 | u369980487 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int N;
int main() {
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
retur... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
ll N;
int main() {
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
return... | [
"variable_declaration.type.change"
] | 728,606 | 728,607 | u551373727 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int N;
int main() {
cin >> N;
int ans = N * (N - 1) / 2;
cout << ans << endl;
retu... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
ll N;
int main() {
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
return... | [
"variable_declaration.type.change"
] | 728,608 | 728,607 | u551373727 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define exp 1e-10
using namespace std;
const int maxn = 1e5 + 1;
int main() {
int n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define exp 1e-10
using namespace std;
const int maxn = 1e5 + 1;
int main() {
long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,609 | 728,610 | u256983323 | cpp |
p02924 | #include <bits/stdc++.h>
const int MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define _sort(a) sort(a.begin(), a.end())
#define _sortd(a) sort(a.rbegin(), a.rend())
#define reverse(s) reverse(s.begin(), s.end())
#defi... | #include <bits/stdc++.h>
const int MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define _sort(a) sort(a.begin(), a.end())
#define _sortd(a) sort(a.rbegin(), a.rend())
#define reverse(s) reverse(s.begin(), s.end())
#defi... | [
"variable_declaration.type.change"
] | 728,622 | 728,623 | u598902504 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 728,624 | 728,625 | u504407856 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n + 1)) / 2 - 1 << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 728,626 | 728,625 | u504407856 | cpp |
p02924 | /*input
*/
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define pb push_back
using ll = long long;
using pii = pair<int, int>;
template <typename T> using V = vector<T>;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
c... | /*input
*/
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define pb push_back
using ll = long long;
using pii = pair<int, int>;
template <typename T> using V = vector<T>;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
c... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 728,631 | 728,632 | u704703586 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;... | [
"expression.operation.binary.remove"
] | 728,637 | 728,638 | u209067041 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,649 | 728,650 | u514932666 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"variable_declaration.type.change"
] | 728,651 | 728,652 | u852449189 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ASCII 97
int main() {
int N;
cin >> N;
N -= 1;
cout << N * (N + 1) / 2 << endl;
}
| #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ASCII 97
int main() {
long long int N;
cin >> N;
N -= 1;
cout << N * (N + 1) / 2 << endl;
}
| [
"variable_declaration.type.widen.change"
] | 728,655 | 728,656 | u689560153 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
N--;
int count = (1 + N) * N / 2;
cout << count << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
N--;
long long count = (1 + N) * N / 2;
cout << count << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,657 | 728,658 | u257724718 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
long long int n;
int ans = 0;
cin >> n;
ans = (n - 1) * n / 2;
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
long long int n;
long long int ans = 0;
cin >> n;
ans = (n - 1) * n / 2;
cout << ans;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 728,659 | 728,660 | u512857550 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll unsig... | [
"identifier.change"
] | 728,666 | 728,667 | u119996667 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, ans;
cin >> n;
ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,671 | 728,672 | u003026289 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(V,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(V,... | [
"variable_declaration.type.change"
] | 728,673 | 728,674 | u020746846 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(V,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(V,... | [
"variable_declaration.type.change"
] | 728,675 | 728,674 | u020746846 | cpp |
p02924 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
}
| #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 728,676 | 728,677 | u963055157 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::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;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64_t N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 728,678 | 728,679 | u237044327 | cpp |
p02924 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef pair... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef pair... | [
"variable_declaration.type.change"
] | 728,682 | 728,683 | u978836520 | cpp |
p02924 | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
printf("%d", n * (n - 1) / 2);
} | #include <stdio.h>
int main() {
long long n;
scanf("%lld", &n);
printf("%lld", n * (n - 1) / 2);
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,684 | 728,685 | u222643545 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a;
a = n * (n - 1) / 2;
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a;
a = n * (n - 1) / 2;
cout << a << endl;
}
| [
"variable_declaration.type.widen.change"
] | 728,692 | 728,693 | u567252408 | 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) /... | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
long long n;
cin >> n;
cout << n * (n ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,696 | 728,697 | u583628727 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define read(x) scanf("%d", &x)
#define ll long long
int n;
int main() {
read(n);
ll ans = 0;
ans = ((ll)(n - 1) * (ll)(n) / 2);
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define read(x) scanf("%d", &x)
#define ll long long
int n;
int main() {
read(n);
ll ans = 0;
ans = ((ll)(n - 1) * (ll)(n) / 2);
printf("%lld", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,700 | 728,701 | u656177110 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = (n - 1) * n / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t ans = (n - 1) * n / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 728,715 | 728,716 | u593459816 | cpp |
p02924 |
#include "iostream"
#include "string"
#include "vector"
using namespace std;
#define ll long long int
#define str string
ll MOD = 1000000007, INFL = 1ll << 60, INF = 1 << 30, mod = 1e9 + 7, Max = INF,
Min = -1;
double a = 0, b = 0, c = 0, n = 0, sum = 0;
ll A[500000] = {}, B[500000] = {}, ruiseki[500000] = {}, d... |
#include "iostream"
#include "string"
#include "vector"
using namespace std;
#define ll long long int
#define str string
ll MOD = 1000000007, INFL = 1ll << 60, INF = 1 << 30, mod = 1e9 + 7, Max = INF,
Min = -1;
ll a = 0, b = 0, c = 0, n = 0, sum = 0;
ll A[500000] = {}, B[500000] = {}, ruiseki[500000] = {}, dp[10... | [
"variable_declaration.type.change"
] | 728,721 | 728,722 | u109792330 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long k = ((n - 1) * n) / 2;
cout << k;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long k = ((n - 1) * n) / 2;
cout << k;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,725 | 728,726 | u259238319 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long N;
cin >> N;
ans = (N - 1) * N / 2;
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long N;
cin >> N;
ans = (N - 1) * N / 2;
printf("%lld\n", ans);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,729 | 728,730 | u572532976 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int ans;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ans = (N - 1) * N / 2;
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long N;
cin >> N;
ans = (N - 1) * N / 2;
printf("%lld\n", ans);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,731 | 728,730 | u572532976 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define LL long long
int n, ans;
int main() {
scanf("%d", &n);
ans = n * (n - 1) / 2;
printf("%d \n", ans);
// system("pause");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define LL long long
LL n, ans;
int main() {
scanf("%lld", &n);
ans = n * (n - 1) / 2;
printf("%lld \n", ans);
// system("pause");
return 0;
} | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,732 | 728,733 | u520815352 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 728,734 | 728,735 | u313578168 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 728,736 | 728,737 | u452933618 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, start, end) for (ll i = start; i < end; ++i)
#define dwn(i, n) for (int i = n; i >= 0; --i)
#define dwn2(i, start, end) for (ll i = start; i >= end; --i)
#define pll pair<ll, ll>
#define mk(x... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, start, end) for (ll i = start; i < end; ++i)
#define dwn(i, n) for (int i = n; i >= 0; --i)
#define dwn2(i, start, end) for (ll i = start; i >= end; --i)
#define pll pair<ll, ll>
#define mk(x... | [
"variable_declaration.type.change"
] | 728,740 | 728,741 | u624688258 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
n--;
cout << n * (n + 1) / 2;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
ll n;
cin >> n;
n--;
cout << n * (n + 1) / 2;
} | [
"variable_declaration.type.change"
] | 728,742 | 728,743 | u408650734 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n;
cin >> n;
n--;
cout << n * (n - 1) / 2;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
ll n;
cin >> n;
n--;
cout << n * (n + 1) / 2;
} | [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 728,744 | 728,743 | u408650734 | cpp |
p02924 | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * (n) / 2 << endl;
} | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n - 1) * (n) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,747 | 728,748 | u759162415 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
// 1+2+…+N-1
cout << N * (N - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
// 1+2+…+N-1
cout << N * (N - 1) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,751 | 728,752 | u519655118 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
typedef long long ll;
int main() {
int n;
cin >> n;
cout << (n) * (n - 1) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
typedef long long ll;
int main() {
ll n;
cin >> n;
cout << (n) * (n - 1) / 2 << endl;
}
| [
"variable_declaration.type.change"
] | 728,753 | 728,754 | u463360790 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
cout << x * (x - 1) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
cout << x * (x - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,755 | 728,756 | u538921909 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#def... | [
"variable_declaration.type.change"
] | 728,757 | 728,758 | u311671153 | cpp |
p02924 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <random... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <random... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,759 | 728,760 | u917972976 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int a[100001], ans, cnt;
int main() {
int n;
scanf("%d", &n);
printf("%d", (n - 1) * n / 2);
} | #include <bits/stdc++.h>
using namespace std;
int a[100001], ans, cnt;
int main() {
long long n;
scanf("%lld", &n);
printf("%lld", (n - 1) * n / 2);
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,763 | 728,764 | u718954939 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n;... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll n;
... | [
"variable_declaration.type.change"
] | 728,767 | 728,768 | u655777757 | 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;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,771 | 728,772 | u628538573 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 728,773 | 728,774 | u942714396 | cpp |
p02924 | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
int main() {
// std::ifstream in("i... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
int main() {
// std::ifstream in("i... | [
"variable_declaration.type.change"
] | 728,777 | 728,778 | u485731913 | cpp |
p02924 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1111111111;
constexpr lint LINF = ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1111111111;
constexpr lint LINF = ... | [
"expression.operation.binary.add"
] | 728,779 | 728,780 | u532573979 | cpp |
p02924 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set ... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set ... | [
"expression.unary.arithmetic.remove"
] | 728,793 | 728,794 | u784120136 | cpp |
p02924 | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int N;
cin >> N;
int ans = 0;
if (N != 1)
ans = (N - 1) * N / 2;
cout << ans << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main(int argc, char **argv) {
long long int N;
cin >> N;
long long int ans = 0;
if (N != 1)
ans = (N - 1) * N / 2;
cout << ans << "\n";
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 728,795 | 728,796 | u878657050 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << ((N - 1) * N / 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
uint64_t N;
cin >> N;
cout << ((N - 1) * N / 2) << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 728,797 | 728,798 | u072825550 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int N;
cin >> N;
int ans;
if (N == 1) {
ans = 0;
} else {
ans = (N - 1) * N / 2;
}
cout << ans << endl;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll N;
cin >> N;
ll ans;
if (N == 1) {
ans = 0;
} else {
ans = (N - 1) * N / 2;
}
cout << ans << endl;
r... | [
"variable_declaration.type.change"
] | 728,799 | 728,800 | u878967567 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int inf = 1000000000;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int inf = 1000000000;
int main() {
long long int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | [
"variable_declaration.type.widen.change"
] | 728,803 | 728,804 | u071036035 | cpp |
p02924 | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T> inline bool chmin(T &a, T b) {
if (a... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
///////////////////////////////////////////////
/* (๑╹◡╹) */
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T> inline bool chmin(T &a, T b) {
if (a... | [
"variable_declaration.type.change"
] | 728,805 | 728,806 | u532894762 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << '\n';
}
| [
"variable_declaration.type.change"
] | 728,807 | 728,808 | u166147681 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
double n;
cin >> n;
ll res = 0;
n -= 1;
res = (n * (n + 1)) / 2;
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
unsigned long long n;
cin >> n;
unsigned long long res = 0;
n -= 1;
res = (n * (n + 1)) / 2;
cout << res << endl;
return 0... | [
"variable_declaration.type.primitive.change"
] | 728,811 | 728,812 | u291297678 | cpp |
p02924 | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
// const long long mod = 1000000007;
// const long long mod = 998244353;
int main() {
long long N;
scanf("%lld", &N);
long long res = N * (N - 1) / 2;
printf("%d", res);
return 0;
} | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
// const long long mod = 1000000007;
// const long long mod = 998244353;
int main() {
long long N;
scanf("%lld", &N);
long long res = N * (N - 1) / 2;
printf("%lld", res);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,813 | 728,814 | u617987447 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using int64 = int64_t;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using int64 = int64_t;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
d... | [
"variable_declaration.type.primitive.change"
] | 728,815 | 728,816 | u160321725 | cpp |
p02924 | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define fro(i, j, n) for (int i = j; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define fro(i, j, n) for (int i = j; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i... | [
"variable_declaration.type.change"
] | 728,817 | 728,818 | u806159048 | cpp |
p02924 | #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include "bits/stdc++.h"
using namespace std;
int main() {
long long int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 728,819 | 728,820 | u518206537 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | [
"identifier.change"
] | 728,823 | 728,824 | u330661451 | cpp |
p02924 | #include <algorithm>
#include <ctype.h>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << 0 << endl;
else
cout << n * (n - 1... | #include <algorithm>
#include <ctype.h>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
if (n == 1)
cout << 0 << endl;
else
cout << n * (n... | [
"variable_declaration.type.primitive.change"
] | 728,825 | 728,826 | u819168380 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << endl;
#define ppr... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define range(a) a.begin(), a.end()
#define print(A, n) \
rep(i, 0, n) { cout << (i ? " " : "") << A[i]; } \
cout << endl;
#define ppr... | [
"variable_declaration.type.primitive.change"
] | 728,829 | 728,830 | u977554186 | cpp |
p02924 | #include <iomanip>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
int64_t Ans = N * (N - 1) / 2;
cout << Ans << endl;
return 0;
}
| #include <iomanip>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
int64_t Ans = N * (N - 1) / 2;
cout << Ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 728,831 | 728,832 | u004707990 | cpp |
p02924 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define sbits(a) _... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define sbits(a) _... | [
"variable_declaration.type.change"
] | 728,837 | 728,838 | u205309198 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll int
#define llu unsigned long long int
#define Endl endl
#define mod 998244353
#define mkp make_pair
#define pb push_back
#define cin(n) scanf("%d", &n)
#define cout(n) printf("%d ", n)
#define sf(n) scanf("%d", &n)
#define pf(n) printf("%d ", n)
#define bitget(n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define llu unsigned long long int
#define Endl endl
#define mod 998244353
#define mkp make_pair
#define pb push_back
#define cin(n) scanf("%d", &n)
#define cout(n) printf("%d ", n)
#define sf(n) scanf("%d", &n)
#define pf(n) printf("%d ", n)
#defin... | [] | 728,843 | 728,844 | u393384704 | cpp |
p02924 | #include <iostream>
int main(int argc, char const *argv[]) {
using namespace std;
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| #include <iostream>
int main(int argc, char const *argv[]) {
using namespace std;
long long n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,847 | 728,848 | u223511989 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<ll>;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
cout << n * (n - 1) / 2 << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<ll>;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
ll n;
cin >> n;
cout << n * (n - 1) / 2 << "\n";
}
| [
"variable_declaration.type.change"
] | 728,849 | 728,850 | u132434645 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = (n * (n - 1)) / 2;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans;
cin >> n;
ans = (n * (n - 1)) / 2;
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,851 | 728,852 | u525537745 | 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 ll;
int inputValue() {
int a;
cin >> a;
return a;
};
vo... | #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 ll;
int inputValue() {
int a;
cin >> a;
return a;
};
vo... | [
"variable_declaration.type.change"
] | 728,853 | 728,854 | u413763374 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
inline void prep() {
cin.tie(0);
cin.sync_with_stdio(0);
};
const double pi = acos(-1.);
// printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
... | #include <bits/stdc++.h>
using namespace std;
inline void prep() {
cin.tie(0);
cin.sync_with_stdio(0);
};
const double pi = acos(-1.);
// printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,859 | 728,860 | u381394404 | 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;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
if (N == 1) {
cout << 0;
} else {
cout << (N * (N - 1)) / 2;
}
} | [
"variable_declaration.type.primitive.change"
] | 728,861 | 728,862 | u386712304 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
unsigned long long N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
} | [
"variable_declaration.type.primitive.change"
] | 728,863 | 728,864 | u247407965 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int n, m, ans = 0;
int main() {
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, ans = 0;
signed main() {
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 728,865 | 728,866 | u822160737 | 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 IMAX 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long llong;
int main() {
int N;
cin >>... | #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 IMAX 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long llong;
int main() {
llong N;
cin ... | [
"variable_declaration.type.change"
] | 728,867 | 728,868 | u583193199 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n = n - 1;
n = n * (n + 1);
n = n / 2;
cout << n;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
n = n - 1;
n = n * (n + 1);
n = n / 2;
cout << n;
} | [
"variable_declaration.type.primitive.change"
] | 728,869 | 728,870 | u325573017 | cpp |
p02924 | // In The Name Of GOD
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const ll inf = 2000000000;
const ll infll = (ll)2 * 1000 * 1000 * 1000 * 1000 * 1000 * 1000;
const ll maxn = 8 * 1001 + 1;
#define pb push_back
#define pp pop_back
#define X first
#define Y second
#defin... | // In The Name Of GOD
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const ll inf = 2000000000;
const ll infll = (ll)2 * 1000 * 1000 * 1000 * 1000 * 1000 * 1000;
const ll maxn = 8 * 1001 + 1;
#define pb push_back
#define pp pop_back
#define X first
#define Y second
#defin... | [
"variable_declaration.type.change"
] | 728,875 | 728,876 | u459127263 | 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;
} | #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 << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.change"
] | 728,879 | 728,880 | u501163846 | 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"
] | 728,883 | 728,884 | u263859746 | cpp |
p02924 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sol = 0;
cin >> n;
sol = n * (n - 1);
sol = sol / 2;
cout << sol << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, sol = 0;
cin >> n;
sol = n * (n - 1);
sol = sol / 2;
cout << sol << endl;
}
| [
"variable_declaration.type.widen.change"
] | 728,889 | 728,890 | u919486853 | 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"
] | 728,893 | 728,894 | u090436701 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define all(f, x, ...) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define all(f, x, ...) ... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 728,898 | 728,899 | u640248738 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 728,906 | 728,907 | u825301315 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define N 100005
int main() {
int n;
cin >> n;
LL Ans = n * (n - 1) / 2;
cout << Ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define N 100005
int main() {
int n;
cin >> n;
LL Ans = 1LL * n * (n - 1) / 2;
cout << Ans;
return 0;
} | [
"assignment.change"
] | 728,908 | 728,909 | u399268660 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.