problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long max = 0;
cin >> N;
max = N * (N - 1) / 2;
cout << max << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
long long max = 0;
cin >> N;
max = N * (N - 1) / 2;
cout << max << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,227 | 724,226 | u099619676 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, max = 0;
cin >> N;
max = N * (N - 1) / 2;
cout << max << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
long long max = 0;
cin >> N;
max = N * (N - 1) / 2;
cout << max << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,228 | 724,226 | u099619676 | cpp |
p02924 | #include <bits/stdc++.h>
#define PI 3.141592653
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ(x) ((int)(x).size()) // size() unsigned -> int
#define descSort(a) sort(a.begin(), a.end(), std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x, ll y) {
if (... | #include <bits/stdc++.h>
#define PI 3.141592653
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ(x) ((int)(x).size()) // size() unsigned -> int
#define descSort(a) sort(a.begin(), a.end(), std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x, ll y) {
if (... | [
"variable_declaration.type.change"
] | 724,236 | 724,237 | u817523595 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
long long sum = 0;
sum = N * (N - 1) / 2;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N;
cin >> N;
long long sum = 0;
sum = N * (N - 1) / 2;
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,240 | 724,241 | u406647332 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
// long long ret = 0;
// for (int i = 1; i <= n-1; i++) ret += i%(i+1);
long long ret = (1 + n) * n / 2 - n;
cout << setprecision(32) << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ret = (long long)(1 + n) * n / 2 - n;
cout << setprecision(30) << ret << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 724,255 | 724,256 | u161892443 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
// long long ret = 0;
// for (int i = 1; i <= n-1; i++) ret += i%(i+1);
long long ret = (1 + n) * n / 2 - n;
cout << setprecision(10) << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ret = (long long)(1 + n) * n / 2 - n;
cout << setprecision(30) << ret << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 724,257 | 724,256 | u161892443 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 724,268 | 724,269 | u303884911 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = N * (N - 1);
ans /= 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = N * (N - 1);
ans /= 2;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,270 | 724,271 | u251242696 | 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 long N;
cin >> N;
long long ans = N * (N - 1);
ans /= 2;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,272 | 724,271 | u251242696 | cpp |
p02924 | /*
The Island Was Silent before.
.....
And One day again it became Silent.
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define modd(a, b) ((a + 2 * b) % b)
#define debug(a) cout << #a << ": " << (a) << "\n"
#define ioso ios_base::sync_with_stdio(0), cin.tie(0), cout.ti... | /*
The Island Was Silent before.
.....
And One day again it became Silent.
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define modd(a, b) ((a + 2 * b) % b)
#define debug(a) cout << #a << ": " << (a) << "\n"
#define ioso ios_base::sync_with_stdio(0), cin.tie(0), cout.ti... | [] | 724,273 | 724,274 | u118452388 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n + 1) / 2 - n << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n + 1) / 2 - n << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,278 | 724,279 | u948522631 | 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"
] | 724,282 | 724,283 | u476488060 | 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"
] | 724,285 | 724,286 | u602140789 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"variable_declaration.type.change"
] | 724,289 | 724,290 | u406237526 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1)
cout << 0 << endl;
else
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 1)
cout << 0 << endl;
else
cout << (n * (n - 1)) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,295 | 724,296 | u537835158 | cpp |
p02924 | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | [
"variable_declaration.type.change"
] | 724,297 | 724,298 | u137332130 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vp vector<P>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vp vector<P>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i, n) for (int i = (int... | [
"variable_declaration.type.change"
] | 724,299 | 724,300 | u037098269 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ans;
ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans;
ans = N * (N - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,301 | 724,302 | u037098269 | cpp |
p02924 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 724,305 | 724,306 | u516525290 | cpp |
p02924 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"variable_declaration.type.change"
] | 724,307 | 724,308 | u516525290 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n + 1) / 2) - n << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n + 1) / 2) - n << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,316 | 724,317 | u145562832 | cpp |
p02924 | /**
* Includes
*/
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace s... | /**
* Includes
*/
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace s... | [
"variable_declaration.type.change"
] | 724,318 | 724,319 | u576106056 | cpp |
p02924 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i ... | [] | 724,320 | 724,321 | u576106056 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << '\n';
return 0;
}
| [
"variable_declaration.type.change"
] | 724,324 | 724,325 | u596385287 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(... | [
"variable_declaration.type.change"
] | 724,326 | 724,327 | u317379170 | cpp |
p02924 | #include <iostream>
int main() {
int a;
std::cin >> a;
std::cout << (a - 1) * a / 2 << std::endl;
return 0;
}
| #include <iostream>
int main() {
long long int a;
std::cin >> a;
std::cout << (a - 1) * a / 2 << std::endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 724,335 | 724,336 | u122743027 | cpp |
p02924 | #include <iostream>
int main() {
int a;
std::cin >> a;
std::cout << (a + 1) * a / 2 << std::endl;
return 0;
} | #include <iostream>
int main() {
long long int a;
std::cin >> a;
std::cout << (a - 1) * a / 2 << std::endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 724,337 | 724,336 | u122743027 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long int
#define booga cout << "booga" << endl
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main(int argc, char **argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout... | #include <bits/stdc++.h>
#define ll long long int
#define booga cout << "booga" << endl
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main(int argc, char **argv) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
cout ... | [
"variable_declaration.type.change"
] | 724,338 | 724,339 | u389078199 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long int
#define booga cout << "booga" << endl
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main(int argc, char **argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout... | #include <bits/stdc++.h>
#define ll long long int
#define booga cout << "booga" << endl
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
int main(int argc, char **argv) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
cout ... | [
"variable_declaration.type.change"
] | 724,340 | 724,339 | u389078199 | cpp |
p02924 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
long long powerexp(long long base, long long exp, int mod) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % mod;
exp = exp >> 1;
base = (base * base) % mod;
}... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
long long powerexp(long long base, long long exp, int mod) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % mod;
exp = exp >> 1;
base = (base * base) % mod;
}... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 724,349 | 724,350 | u617339064 | cpp |
p02924 | #include "bits/stdc++.h"
#define sp << " "
#define el << "\n"
#define S second
#define F first
#define mp make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define obit __builtin_popcount
#define pof pop_front
#define mod (int)1e9 + 7
#define For(i, a, n) for (i = a; i < n; i++)
using namespac... | #include "bits/stdc++.h"
#define sp << " "
#define el << "\n"
#define S second
#define F first
#define mp make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define obit __builtin_popcount
#define pof pop_front
#define mod (int)1e9 + 7
#define For(i, a, n) for (i = a; i < n; i++)
using namespac... | [
"variable_declaration.type.change"
] | 724,351 | 724,352 | u404899607 | 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"
] | 724,357 | 724,358 | u534800382 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,359 | 724,360 | u270272336 | cpp |
p02924 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main(void) {
int N;
cin >> N;
long long ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int main(void) {
long long N;
cin >> N;
long long ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,361 | 724,362 | u150155436 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<ch... | [
"variable_declaration.type.change"
] | 724,365 | 724,366 | u919867411 | cpp |
p02924 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int I... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int I... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 724,369 | 724,370 | u802434195 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,380 | 724,381 | u014212625 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 724,382 | 724,383 | u850516963 | cpp |
p02924 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
... | [
"variable_declaration.type.change"
] | 724,384 | 724,385 | u850516963 | cpp |
p02924 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
ans = (n - 1) * n / 2;
cout << ans << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
ans = (n - 1) * n / 2;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,392 | 724,393 | u973971669 | cpp |
p02924 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alen... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alen... | [
"variable_declaration.type.change"
] | 724,394 | 724,395 | u344810256 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
cout << n * (n + 1) / 2 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 724,396 | 724,397 | u476027087 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n + 1) / 2 << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 724,398 | 724,397 | u476027087 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll x = (N * (N - 1)) / 2;
cout << x << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll x = (N * (N - 1)) / 2;
cout << x << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 724,399 | 724,400 | u859566721 | 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() {
int n;
cin >> n;
cout << (ll)n * (n - 1) / 2 << endl;
} | [
"type_conversion.add"
] | 724,413 | 724,414 | u929569377 | 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"
] | 724,413 | 724,415 | u929569377 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define LIMIT 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < (int)n; i++)
/* デバッグ */
#define debug(x) cout << #x << " = " << (x) << endl
#define debug2(x, y) \
cout << "(" << #x <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define LIMIT 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < (int)n; i++)
/* デバッグ */
#define debug(x) cout << #x << " = " << (x) << endl
#define debug2(x, y) \
cout << "(" << #x <<... | [
"variable_declaration.type.change"
] | 724,423 | 724,424 | u271743799 | cpp |
p02924 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 724,425 | 724,426 | u448922807 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int sum = 0;
sum = N * (N - 1) / 2;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long sum = 0;
sum = N * (N - 1) / 2;
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,431 | 724,432 | u468440139 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 724,435 | 724,436 | u077104253 | cpp |
p02924 | #include <iostream>
int main() {
int N;
std::cin >> N;
std::cout << N * (N - 1) / 2 << std::endl;
}
| #include <iostream>
int main() {
long long int N;
std::cin >> N;
std::cout << N * (N - 1) / 2 << std::endl;
}
| [
"variable_declaration.type.widen.change"
] | 724,437 | 724,438 | u327750344 | cpp |
p02924 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
long long ans = N * (N - 1) / 2;
cout << ans;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
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"
] | 724,439 | 724,440 | u289578952 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
N = N * (N - 1) / 2;
cout << N << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
N = N * (N - 1) / 2;
cout << N << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 724,441 | 724,442 | u109380020 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
int main() {
// 0からN-1の和
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
// 0からN-1の和
long long N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,450 | 724,451 | u967106822 | cpp |
p02924 | #include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define pi 3.1415926535897932384
#define E9 1000000000
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define pi 3.1415926535897932384
#define E9 1000000000
int main() {
int64_t N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 724,454 | 724,455 | u474180590 | 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"
] | 724,456 | 724,457 | u094861294 | 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() {
int64_t n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
} | [
"variable_declaration.type.primitive.change"
] | 724,458 | 724,459 | u424542120 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,462 | 724,463 | u515923980 | cpp |
p02924 | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
#define rep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main(void) {
int n;
if (!scanf("%d", &n))
return -1;
int sum = (1 + n) * n / 2 - n;
printf("%d\n", sum);
}
| #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
#define rep(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
int main(void) {
long long int n;
if (!scanf("%lld", &n))
return -1;
long long int sum = (1 + n) * n / 2 - n;
printf("%lld\n", sum);
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 724,468 | 724,469 | u624645160 | cpp |
p02924 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 724,470 | 724,471 | u868237899 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,472 | 724,473 | u443151804 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
cout << n * floor((n - 1) / 2);
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"call.remove",
"call.arguments.change"
] | 724,474 | 724,473 | u443151804 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, start, end) for (int i = start; i < (int)(end); ++i)
int main() {
int n;
cin >> n;
ll ans = (n - 1) * n / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, start, end) for (int i = start; i < (int)(end); ++i)
int main() {
ll n;
cin >> n;
ll ans = (n - 1) * n / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 724,481 | 724,482 | u382890689 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
long long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,492 | 724,493 | u583701239 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | [
"variable_declaration.type.change"
] | 724,494 | 724,495 | u132371041 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pi 3.14159265359
int main() {
ll N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
| [
"variable_declaration.type.change"
] | 724,496 | 724,497 | u160347785 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_ll(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_ll(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] ... | [
"expression.operation.binary.remove"
] | 724,500 | 724,501 | u364076769 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n + (n - 1)) / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 724,504 | 724,505 | u297195722 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
int main() {
int n;
cin >> n;
ll sum = n * (n / 2);
co(sum);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
int main() {
ll n;
cin >> n;
ll sum = n * (n - 1) / 2;
co(sum);
} | [
"variable_declaration.type.change"
] | 724,508 | 724,509 | u789075914 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | [
"variable_declaration.type.change"
] | 724,510 | 724,511 | u637983859 | cpp |
p02924 | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
template <typename T> void vecprint(vector<T> v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
template <typename T> void qprint(priority_queue<T> q) {
while (!q.empty()) {
c... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
template <typename T> void vecprint(vector<T> v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
template <typename T> void qprint(priority_queue<T> q) {
while (!q.empty()) {
c... | [
"variable_declaration.type.change"
] | 724,512 | 724,513 | u637983859 | cpp |
p02924 | #include "bits/stdc++.h"
#define rep(i, j) for (long long i = j; i > 0; i--)
using namespace std;
int main() {
int n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i, j) for (long long i = j; i > 0; i--)
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,523 | 724,524 | u616794313 | cpp |
p02924 | #include "bits/stdc++.h"
#define rep(i, j) for (long long i = j; i > 0; i--)
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i, j) for (long long i = j; i > 0; i--)
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,526 | 724,524 | u616794313 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int N;
signed main() {
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long N;
signed main() {
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,527 | 724,528 | u934469795 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
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++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main() {
Int N, ans;
cin >> N;
ans = N * (N - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 724,529 | 724,530 | u527311983 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define repp(i, n) for (int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define pb push_back
#define mp make_pair
#define riverse(v) reverse((v).begin(), (v).end())
using vi = vecto... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define repp(i, n) for (int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define pb push_back
#define mp make_pair
#define riverse(v) reverse((v).begin(), (v).end())
using vi = vecto... | [
"variable_declaration.type.change"
] | 724,538 | 724,539 | u587801819 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int n;
cin >> n;
cout << n * (n - 1) / 2 << e... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << en... | [
"variable_declaration.type.change"
] | 724,540 | 724,541 | u202813867 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"variable_declaration.type.change"
] | 724,542 | 724,543 | u832995587 | 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 main() {
int N;
cin >> N;
cout << (N - 1) * N / ... | #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 main() {
ll N;
cin >> N;
cout << ((N - 1) * N) /... | [
"variable_declaration.type.change"
] | 724,549 | 724,550 | u135626132 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (int)1e9 + 7
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<long long>>
#define pii... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (int)1e9 + 7
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<long long>>
#define pii... | [
"assignment.variable.change",
"identifier.change"
] | 724,553 | 724,554 | u499675841 | cpp |
p02924 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | #include <iostream>
typedef long long ll;
using namespace std;
int main(void) {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 724,561 | 724,562 | u998349161 | 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 int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 724,563 | 724,564 | u455696572 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define repi(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define repi(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (... | [
"variable_declaration.type.change"
] | 724,568 | 724,569 | u099184991 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#defin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#defin... | [
"variable_declaration.type.change"
] | 724,570 | 724,571 | u718394671 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll sum = 0;
sum = n * (n - 1) / 2;
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll sum = 0;
sum = n * (n - 1) / 2;
cout << sum << endl;
} | [
"variable_declaration.type.change"
] | 724,579 | 724,580 | u497418592 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 724,581 | 724,582 | u828593789 | cpp |
p02924 | #include <bits/stdc++.h>
#define lli long long int
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (lli i = 0, i##_len = (lli)(n); i < i##_len; i++)
#define repf(i, n) for (lli i = 1, i##_len = (lli)(n + 1); i < i##_len; i++)
#define per... | #include <bits/stdc++.h>
#define lli long long int
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (lli i = 0, i##_len = (lli)(n); i < i##_len; i++)
#define repf(i, n) for (lli i = 1, i##_len = (lli)(n + 1); i < i##_len; i++)
#define per... | [
"literal.number.change",
"io.output.change"
] | 724,583 | 724,584 | u548791035 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | [
"variable_declaration.type.change"
] | 724,593 | 724,594 | u952081880 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, a, n) for (int i = a; i < (int)(n); i++)
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, a, n) for (int i = a; i < (int)(n); i++)
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
cout << ((n - 1) * n) / 2 << endl;
}
| [
"variable_declaration.type.change"
] | 724,595 | 724,596 | u872158847 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
retur... | [
"variable_declaration.type.change"
] | 724,601 | 724,602 | u229427161 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| [
"variable_declaration.type.change"
] | 724,614 | 724,615 | u094654185 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
}
| [
"variable_declaration.type.change"
] | 724,618 | 724,619 | u246343119 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define rep(inc, bgn, end) for (int inc = bgn; inc < end; ++inc)
#define repe(inc, bgn, end) for (int inc = bgn; inc <= end; ++inc)
using ll = long long;
using namespace std;
// -d
int main() {
int n;
cin >> n;
ll ans = n * (n - 1);... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define rep(inc, bgn, end) for (int inc = bgn; inc < end; ++inc)
#define repe(inc, bgn, end) for (int inc = bgn; inc <= end; ++inc)
using ll = long long;
using namespace std;
// -d
int main() {
ll n;
cin >> n;
ll ans = n * (n - 1);
... | [
"variable_declaration.type.change"
] | 724,624 | 724,625 | u028176029 | cpp |
p02924 | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a... | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
// loops
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define OneToN(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define ZeroToN(i, n) for (ll i = 0; i < (ll)(n + 1); i++)
#define AToB(i, a... | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 724,628 | 724,629 | u105001881 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using name... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using name... | [
"variable_declaration.type.change"
] | 724,630 | 724,631 | u758223800 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long int res = (N - 1) * N / 2;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int res = (N - 1) * N / 2;
cout << res << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 724,635 | 724,636 | u384300282 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> s... | [
"variable_declaration.type.change"
] | 724,666 | 724,667 | u213868052 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
#define rep(i, n) for (int i = 0;... | [
"variable_declaration.type.change"
] | 724,670 | 724,671 | u718048349 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) << 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;
} | [
"expression.operation.binary.add"
] | 724,675 | 724,676 | u526179183 | cpp |
p02924 | #include <iostream>
#include <sstream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef ... | #include <iostream>
#include <sstream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef ... | [
"variable_declaration.type.change"
] | 724,677 | 724,678 | u652760628 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.