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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
/*
vectr<int> a(n);
for(int i = 0;i < n;i++)
a[i] = i + 1;
*/
cout << (n - 1) * n / 2 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long n;
cin >> n;
/*
vectr<int> a(n);
for(int i = 0;i < n;i++)
a[i] = i + 1;
*/
cout << (n - 1) * n / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 727,747 | 727,746 | u864698760 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
/*
vectr<int> a(n);
for(int i = 0;i < n;i++)
a[i] = i + 1;
*/
cout << (n - 1) * n / 2 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long n;
cin >> n;
/*
vectr<int> a(n);
for(int i = 0;i < n;i++)
a[i] = i + 1;
*/
cout << (n - 1) * n / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 727,748 | 727,746 | u864698760 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,760 | 727,761 | u653759243 | cpp |
p02924 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2;
}
| [
"variable_declaration.type.change"
] | 727,762 | 727,763 | u389766217 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n;
cin >> n;
cout << (n - 1) * (n - 2) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 727,764 | 727,765 | u241615199 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans;
}
int main() {
ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
cout.setf(ios::fixed), cout.precision(20);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans;
}
int main() {
ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
cout.setf(ios::fixed), cout.precision(20);
solve();
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,766 | 727,767 | u224232591 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | [
"variable_declaration.type.change"
] | 727,768 | 727,769 | u120810144 | cpp |
p02924 | #include <bits/stdc++.h>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#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 MOD 1e9 + 7
#define INF 1e9
#define F first
#define S second
#define A... | #include <bits/stdc++.h>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#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 MOD 1e9 + 7
#define INF 1e9
#define F first
#define S second
#define A... | [
"variable_declaration.type.change"
] | 727,774 | 727,775 | u144980750 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", (1 + n - 1) * (n - 1) / 2);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
ll n;
scanf("%lld", &n);
printf("%lld\n", (1 + n - 1) * (n - 1) / 2);
return 0;
}
| [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 727,781 | 727,782 | u516461055 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
scanf("%lld", &n);
if (n == 1)
printf("%lld\n", 1);
else {
long long ans = n * (n - 1) / 2;
printf("%lld\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
scanf("%lld", &n);
if (n == 1)
printf("%lld\n", 0);
else {
long long ans = n * (n - 1) / 2;
printf("%lld\n", ans);
}
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"io.output.change"
] | 727,783 | 727,784 | u928486152 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
cout << ((n - 1) * (n - 1 + 1)) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
ll n;
cin >> n;
cout << (ll)((n - 1) * (n - 1 + 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 727,788 | 727,789 | u810838104 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<LL> VL;
#define REPD(i, a, b) for (LL i = (a); i < (b); i++)
#define REP(i, n) REPD(i, 0, ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<LL> VL;
#define REPD(i, a, b) for (LL i = (a); i < (b); i++)
#define REP(i, n) REPD(i, 0, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 727,790 | 727,791 | u548094461 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long int a;
a = (n * (n - 1)) / 2;
cout << a;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long int n;
cin >> n;
long int a;
a = (n * (n - 1)) / 2;
cout << a;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 727,800 | 727,801 | u657627386 | cpp |
p02924 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// ll... | [
"variable_declaration.type.change"
] | 727,802 | 727,803 | u680788721 | cpp |
p02924 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// ll... | [
"variable_declaration.type.change"
] | 727,804 | 727,803 | u680788721 | cpp |
p02924 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
cout << n * (n / 2) << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [] | 727,814 | 727,815 | u294531924 | cpp |
p02924 | #include <algorithm>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
} | #include <algorithm>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 727,818 | 727,819 | u656568465 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int N;
cin >> N;
cout << N * (N + 1) / 2 - N << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll N;
cin >> N;
cout << N * (N + 1) / 2 - N << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 727,822 | 727,823 | u419255487 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
ans = (N * (N - 1)) / 2;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans;
ans = (N * (N - 1)) / 2;
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 727,824 | 727,825 | u288500098 | cpp |
p02924 | // D - ModSum
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | // D - ModSum
#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,829 | 727,830 | u525065967 | cpp |
p02924 | // D - ModSum
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | // D - ModSum
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (long long)N * (N - 1) / 2 << endl;
} | [
"type_conversion.add"
] | 727,829 | 727,831 | u525065967 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin >> n;
unsigned long int sum = 0;
sum = n * (n - 1) / 2; // WA
cout << sum << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int n;
cin >> n;
unsigned long int sum = 0;
sum = n * (n - 1) / 2; // WA
cout << sum << "\n";
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 727,841 | 727,842 | u801512570 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int n;
cin >> n;
unsigned long int sum = 0;
sum = n * (n - 1) * 0.50000001; // WA
cout << sum << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int n;
cin >> n;
unsigned long int sum = 0;
sum = n * (n - 1) / 2; // WA
cout << sum << "\n";
return 0;
}
| [] | 727,843 | 727,842 | u801512570 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int n;
cin >> n;
unsigned long int sum = 0;
sum = n * (n - 1) * 0.5; // WA
cout << sum << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int n;
cin >> n;
unsigned long int sum = 0;
sum = n * (n - 1) / 2; // WA
cout << sum << "\n";
return 0;
}
| [] | 727,845 | 727,842 | u801512570 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int sum = 0;
sum = n * (n - 1) * 0.5; // WA
cout << sum << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int n;
cin >> n;
unsigned long int sum = 0;
sum = n * (n - 1) / 2; // WA
cout << sum << "\n";
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 727,846 | 727,842 | u801512570 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1) / 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << (n * (n - 1) / 2) << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 727,849 | 727,850 | u289547799 | cpp |
p02924 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inc... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inc... | [
"expression.operation.binary.remove"
] | 727,863 | 727,864 | u112723190 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl '\n';
#define FASTER \
ios_base::sync_with_stdio(false); \
cin.tie(NULL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl '\n';
#define FASTER \
ios_base::sync_with_stdio(false); \
cin.tie(NULL... | [
"expression.operation.binary.add"
] | 727,865 | 727,866 | u415956569 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
using ll = long lon... | [
"variable_declaration.type.change"
] | 727,869 | 727,870 | u902149880 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
ll N;
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 727,871 | 727,872 | u154650168 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << ((n * (n - 1)) / 2);
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << ((n * (n - 1)) / 2);
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 727,889 | 727,890 | u181765125 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
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++)
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,892 | 727,893 | u389041967 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, k, n) for (int i = k; i < n; i++)
#define all \
int i = 0; \
i < n; ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, k, n) for (int i = k; i < n; i++)
#define all \
int i = 0; \
i < n; ... | [
"variable_declaration.type.change"
] | 727,897 | 727,898 | u654508479 | cpp |
p02924 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"variable_declaration.type.change"
] | 727,936 | 727,937 | u698284709 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
ll p = (n * (n - 1)) / 2;
cout << p;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n;
cin >> n;
ll p = (n * (n - 1)) / 2;
cout << p;
return 0;
} | [
"variable_declaration.type.change"
] | 727,955 | 727,956 | u483156752 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N;
cin >> N;
cout << (N - 1) * (N - 2) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
} | [] | 727,957 | 727,958 | u904833081 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#de... | [
"variable_declaration.type.change"
] | 728,003 | 728,004 | u833515223 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#de... | [
"variable_declaration.type.change",
"function.return_value.change"
] | 728,005 | 728,004 | u833515223 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using Graph = vector<vector<int>>;
long int sum[200020] = {};
int main() {
int N;
cin >> N... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using Graph = vector<vector<int>>;
long int sum[200020] = {};
int main() {
long long int N;
... | [
"variable_declaration.type.widen.change"
] | 728,006 | 728,007 | u473116917 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
ll ans = n * (n - 1) / 2;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
ll ans = (ll)n * (n - 1) ... | [
"type_conversion.add"
] | 728,018 | 728,019 | u654115954 | cpp |
p02924 | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int result = n * (n - 1) / 2;
cout << result << endl;
return 0;
} | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int result = n * (n - 1) / 2;
cout << result << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 728,044 | 728,045 | u219241981 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
unsigned long n = 0;
cin >> n;
unsigned long ans = 0;
/*
for(float i = 1; i <= n - 1; ++i){
ans += i;
}
*/
ans = (n * (1.0 + n)) / 2.0;
ans -= n;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
unsigned long n = 0;
cin >> n;
unsigned long ans = 0;
/*
for(float i = 1; i <= n - 1; ++i){
ans += i;
}
*/
ans = (n * (1 + n)) / 2;
ans -= n;
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 728,048 | 728,049 | u580631296 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | [
"variable_declaration.type.change"
] | 728,074 | 728,075 | u391331433 | cpp |
p02924 | #include <algorithm>
#include <array>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | #include <algorithm>
#include <array>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 728,079 | 728,080 | u802905102 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long int m;
int n1;
n -= 1;
if (n % 2 == 0)
m = (n / 2) * (n + 1);
else
m = ((n + 1) / 2) * n;
cout << m;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
unsigned long long int m;
int n1;
n -= 1;
if (n % 2 == 0)
m = (n / 2) * (n + 1);
else
m = ((n + 1) / 2) * n;
cout << m;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 728,114 | 728,115 | u209981906 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i <... | #include <algorithm>
#include <cmath>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i <... | [
"variable_declaration.type.change"
] | 728,116 | 728,117 | u556660175 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | [
"variable_declaration.type.change"
] | 728,138 | 728,139 | u960997735 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 728,142 | 728,143 | u127063317 | 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 N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 728,144 | 728,143 | u127063317 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 728,146 | 728,143 | u127063317 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long res;
res = (n - 1) * n / 2;
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long res;
res = (n - 1) * n / 2;
cout << res << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,159 | 728,160 | u717463970 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define REP(i, n) for ... | #include <bits/stdc++.h>
using namespace std;
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
#define REP(i, n) for ... | [] | 728,163 | 728,164 | u201320915 | cpp |
p02924 | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
} | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n - 1) * n / 2 <<... | [
"variable_declaration.type.widen.change"
] | 728,165 | 728,166 | u132284673 | cpp |
p02924 | // 4_abc139_d
#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>
#inclu... | // 4_abc139_d
#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>
#inclu... | [
"variable_declaration.type.change"
] | 728,167 | 728,168 | u811561461 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, answer;
cin >> N;
answer = N * (N - 1) / 2;
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, answer;
cin >> N;
answer = N * (N - 1) / 2;
cout << answer << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,169 | 728,170 | u938841444 | cpp |
p02924 | #include "stdio.h"
int main(void) {
unsigned long len = 0;
unsigned long cnt = 0;
scanf("%d", &len);
cnt = (len * (len - 1)) / 2;
printf("%u\n", cnt);
return 0;
} | #include "stdio.h"
int main(void) {
long len = 0;
long cnt = 0;
scanf("%ld", &len);
cnt = len * (len - 1) / 2;
printf("%ld\n", cnt);
return 0;
} | [
"variable_declaration.type.narrow.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 728,175 | 728,176 | u692531611 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1);
ans /= 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long ans = n * (n - 1);
ans /= 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 728,181 | 728,182 | u404145225 | cpp |
p02924 | #include <bits/stdc++.h>
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 ALL(obj) (obj).begin(), (obj).end()
#define ll long long
#define ul unsigned long
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int M;
cin >> M;
... | #include <bits/stdc++.h>
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 ALL(obj) (obj).begin(), (obj).end()
#define ll long long
#define ul unsigned long
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
long int M;
cin >... | [
"variable_declaration.type.widen.change"
] | 728,208 | 728,209 | u948212340 | cpp |
p02924 | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | [
"expression.unary.arithmetic.add"
] | 728,226 | 728,227 | u576320075 | cpp |
p02924 | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | [
"expression.unary.arithmetic.add",
"expression.operation.binary.remove"
] | 728,228 | 728,227 | u576320075 | cpp |
p02924 | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 728,226 | 728,229 | u576320075 | cpp |
p02924 | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 728,228 | 728,229 | u576320075 | cpp |
p02924 | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 728,230 | 728,229 | u576320075 | cpp |
p02924 | #include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
std::unordered_map<int, std::vector<int>> adjecent;
std::unordered_map<int, ll> node2score;
std::vector<int> sol;
std::unordered_set<int> graph;
using namespace std;
int main(void) {
ll N;
cin >> N;
... | #include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
std::unordered_map<int, std::vector<int>> adjecent;
std::unordered_map<int, ll> node2score;
std::vector<int> sol;
std::unordered_set<int> graph;
using namespace std;
int main(void) {
ll N;
cin >> N;
... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 728,267 | 728,268 | u871841829 | cpp |
p02924 | #include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
std::unordered_map<int, std::vector<int>> adjecent;
std::unordered_map<int, ll> node2score;
std::vector<int> sol;
std::unordered_set<int> graph;
using namespace std;
int main(void) {
ll N;
cin >> N;
... | #include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
std::unordered_map<int, std::vector<int>> adjecent;
std::unordered_map<int, ll> node2score;
std::vector<int> sol;
std::unordered_set<int> graph;
using namespace std;
int main(void) {
ll N;
cin >> N;
... | [
"expression.operation.binary.remove"
] | 728,269 | 728,268 | u871841829 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
long long power(int x, int y) {
long long n = 1;
for (int i = 0; i < y; i++)
n *= x;
return n;
}
int log(int x, int y) {
int cnt = 0;
while (y > 1) {
y /= x;
cnt++;
}
return cnt;
}
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 <<... | #include <bits/stdc++.h>
using namespace std;
long long power(int x, int y) {
long long n = 1;
for (int i = 0; i < y; i++)
n *= x;
return n;
}
int log(int x, int y) {
int cnt = 0;
while (y > 1) {
y /= x;
cnt++;
}
return cnt;
}
int main() {
long long n;
cin >> n;
cout << (n - 1) * n ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,295 | 728,296 | u366974105 | cpp |
p02924 | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define FOR(i, s, e) for (ll i = s; i < e; ++i)
#define MOD 1000000007
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return... | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define FOR(i, s, e) for (ll i = s; i < e; ++i)
#define MOD 1000000007
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return... | [
"variable_declaration.type.change"
] | 728,297 | 728,298 | u147571984 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lli long long int
#define loop(i, x, n) for (lli i = x; i <= n; i++)
#define rloop(i, n, x) for (lli i = n; i >= x; i--)
typedef vector<ll> v64;
typedef vector<pair<ll, ll>> vp64;
typedef vector<bool> vbo;
typedef set<ll> s64;
typedef set<bool... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lli long long int
#define loop(i, x, n) for (lli i = x; i <= n; i++)
#define rloop(i, n, x) for (lli i = n; i >= x; i--)
typedef vector<ll> v64;
typedef vector<pair<ll, ll>> vp64;
typedef vector<bool> vbo;
typedef set<ll> s64;
typedef set<bool... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,317 | 728,318 | u223929716 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
ll ans = (n * (n - 1)) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll ans = (n * (n - 1)) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 728,319 | 728,320 | u195480727 | cpp |
p02924 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | [
"variable_declaration.type.change"
] | 728,338 | 728,339 | u169580012 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, ans;
cin >> N;
ans = N * (N - 1) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, ans;
cin >> N;
ans = N * (N - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,355 | 728,356 | u012621682 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#define int long long
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#define int long long
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T... | [
"variable_declaration.type.change"
] | 728,384 | 728,385 | u299377613 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
int ans = 0;
cin >> N;
if (N != 1) {
ans = ((N - 1) * N) / 2;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
long long ans = 0;
cin >> N;
if (N != 1) {
ans = ((N - 1) * N) / 2;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 728,386 | 728,387 | u682526550 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int ans = 0;
cin >> N;
if (N != 1) {
ans = ((N - 1) * N) / 2;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
long long ans = 0;
cin >> N;
if (N != 1) {
ans = ((N - 1) * N) / 2;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,388 | 728,387 | u682526550 | cpp |
p02924 | #include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int ans;
ans = n * (n - 1) / 2;
printf("%d\n", ans);
return 0;
} | #include <cstdio>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
long long ans;
ans = n * (n - 1) / 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,407 | 728,408 | u661869380 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long t = (N - 1) * N / 2;
cout << t << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long t = (N - 1) * N / 2;
cout << t << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,415 | 728,416 | u061289198 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ans = 0;
if (n % 2 == 0) {
ans = (n + 1) * (n / 2) - n;
} else {
ans = ((n - 1) + 1) * ((n - 1) / 2);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = 0;
if (n % 2 == 0) {
ans = (n + 1) * (n / 2) - n;
} else {
ans = ((n - 1) + 1) * ((n - 1) / 2);
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 728,417 | 728,418 | u245414044 | cpp |
p02924 | #include <algorithm>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int n, sum = 0;
cin >> n;
/*
for (int i = 1; i <= n-1; i++) {
sum += i;
}
... | #include <algorithm>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll n, sum = 0;
cin >> n;
/*
for (int i = 1; i <= n-1; i++) {
sum += i;
}
... | [
"variable_declaration.type.change"
] | 728,421 | 728,422 | u031034560 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
cout << n * (n - 1) / 2 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
unsigned long long int n;
cin >> n;
cout << n * (n - 1) / 2 << '\n';
return 0;
} | [
"variable_declaration.type.widen.change"
] | 728,423 | 728,424 | u507752074 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli N;
cin >> N;
int output = ((N - 1) * N) / 2;
cout << output << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli N;
cin >> N;
lli output = ((N - 1) * N) / 2;
cout << output << "\n";
} | [
"variable_declaration.type.change"
] | 728,427 | 728,428 | u905159724 | cpp |
p02924 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
const int INF = 1 << 28;
const long long MOD = 1000000007;
using namespace std;
using Graph = vector<vector<int>>;
template <class T> bool ch... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
const int INF = 1 << 28;
const long long MOD = 1000000007;
using namespace std;
using Graph = vector<vector<int>>;
template <class T> bool ch... | [
"variable_declaration.type.widen.change"
] | 728,435 | 728,436 | u586583774 | cpp |
p02924 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
int main() {
ll n;
cin >> n;
cout << (n * (n + 1)) / 2;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
int main() {
ll n;
cin >> n;
cout << (n * (n - 1)) / 2;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 728,442 | 728,443 | u092370911 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long int ans = n * (n - 1) / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int n;
cin >> n;
unsigned long long int ans = n * (n - 1) / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.widen.change"
] | 728,444 | 728,445 | u230147738 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int n;
cin >> n;
unsigned long long int ans = n * (n - 1) / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.widen.change"
] | 728,446 | 728,445 | u230147738 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#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,449 | 728,450 | u443975466 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define dobara(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define ss second
#define S(x) scanf("%d", &x)
#define SL(x) scanf("%lld", &x)
#define M 1000000007
#define sz(x) (int)x.size()
#define all(a) (a).beg... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define dobara(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define ss second
#define S(x) scanf("%d", &x)
#define SL(x) scanf("%lld", &x)
#define M 1000000007
#define sz(x) (int)x.size()
#define all(a) (a).beg... | [] | 728,460 | 728,461 | u636751798 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
long long ans;
int main() {
scanf("%d", &n);
ans = 1ll * ((n - 1) * n) / 2;
printf("%lld", ans);
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
long long ans;
int main() {
scanf("%d", &n);
ans = (1ll * (n - 1) * n) / 2;
printf("%lld", ans);
} | [] | 728,464 | 728,465 | u448523542 | 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;
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 << N * (N - 1) / 2;
return 0;
}
| [
"variable_declaration.type.change"
] | 728,466 | 728,467 | u002574984 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::cout << (n * (n - 1)) / 2 << st... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
long int n;
std::cin >> n;
std::cout << (n * (n - 1)) / 2 ... | [
"variable_declaration.type.widen.change"
] | 728,472 | 728,473 | u797455966 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n;
cin >> n;
n = n * (n - 1) / 2;
cout << n;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
long long int n;
cin >> n;
n = n * (n - 1) / 2;
cout << n;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 728,474 | 728,475 | u468506413 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int cnt = 0;
cin >> N;
if (N == 1)
cout << 0 << endl;
else if (N == 2)
cout << 1 << endl;
else {
cout << (1 + (N - 1)) * (N - 1) / 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
int cnt = 0;
cin >> N;
if (N == 1)
cout << 0 << endl;
else if (N == 2)
cout << 1 << endl;
else {
cout << (1 + (N - 1)) * (N - 1) / 2 << endl;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,476 | 728,477 | u839817954 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 5;
int n, t[M], ans;
int main() {
cin >> n;
n = 1ll * (n - 1) * n / 2ll;
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 5;
int n, t[M], ans;
int main() {
long long n;
cin >> n;
n = 1ll * (n - 1) * n / 2ll;
cout << n << endl;
} | [
"variable_declaration.add"
] | 728,478 | 728,479 | u451771503 | cpp |
p02924 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
long long N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,480 | 728,481 | u563743611 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n + 1) / 2;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
n = n - 1;
cout << n * (n + 1) / 2;
}
| [
"assignment.add"
] | 728,482 | 728,483 | u543038899 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long ... | [
"variable_declaration.type.change"
] | 728,486 | 728,487 | u641145334 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
long long r;
int n;
cin >> n;
r = n * (n - 1);
r = r / 2;
cout << r << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long r, n;
cin >> n;
r = n * (n - 1);
r = r / 2;
cout << r << endl;
return 0;
} | [] | 728,491 | 728,492 | u492556206 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
ll sum = 0;
sum += (n * (n - 1)) / 2;
cout << sum << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll sum = 0;
sum += (n * (n - 1)) / 2;
cout << sum << "\n";
return 0;
}
| [
"variable_declaration.type.change"
] | 728,501 | 728,502 | u466256802 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < (n); i++)
#define CLR(mat) memset(mat, 0, sizeof(mat))
#define IN(a, b, x) (a <= x && x < b)
#define out(ans) cout << ans << endl
typedef pair<int, int> P;
const ll mod = 1e9 + 7;
const ll INF = 1e9;
int main(... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < (n); i++)
#define CLR(mat) memset(mat, 0, sizeof(mat))
#define IN(a, b, x) (a <= x && x < b)
#define out(ans) cout << ans << endl
typedef pair<int, int> P;
const ll mod = 1e9 + 7;
const ll INF = 1e9;
int main(... | [
"variable_declaration.type.change"
] | 728,507 | 728,508 | u139458416 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define ll long long
using namespace std;
int n;
ll ans;
int main() {
cin >> n;
ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#define ll long long
using namespace std;
ll n;
ll ans;
int main() {
cin >> n;
ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 728,513 | 728,514 | u205232169 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
int ans;
cin >> N;
if (N == 1) {
ans = 0;
} else if (N == 2) {
ans = 1;
} else {
ans = N * (N - 1) / 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N;
long long ans;
cin >> N;
if (N == 1) {
ans = 0;
} else if (N == 2) {
ans = 1;
} else {
ans = N * (N - 1) / 2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 728,527 | 728,528 | u579355226 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.