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 n;
int main() {
cin >> n;
n = n - 1;
cout << n * (n + 1) / 2;
} | #include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cin >> n;
n = n - 1;
cout << n * (n + 1) / 2;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,225 | 726,226 | u690445001 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
n = n - 1;
cout << (n * (n + 1)) / 2;
} | #include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cin >> n;
n = n - 1;
cout << n * (n + 1) / 2;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,227 | 726,226 | u690445001 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 726,235 | 726,236 | u649232908 | cpp |
p02924 | #include <bits/stdc++.h>
#define SEKAI_NO_OWARI return 0;
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
... | #include <bits/stdc++.h>
#define SEKAI_NO_OWARI return 0;
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,237 | 726,238 | u863957421 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
ll MM = 1000000000;
ll mod = MM + 7;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x / GCD(x, y) * y;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
ll MM = 1000000000;
ll mod = MM + 7;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x / GCD(x, y) * y;... | [
"expression.operation.binary.remove"
] | 726,255 | 726,256 | u560381579 | cpp |
p02924 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | [
"variable_declaration.type.change"
] | 726,261 | 726,262 | u764228018 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << (ll)(N + 1) * N / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << (ll)(N - 1) * N / 2 << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 726,265 | 726,266 | u854161810 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 726,267 | 726,268 | u966647557 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| [
"variable_declaration.type.widen.change",
"io.output.newline.add"
] | 726,269 | 726,268 | u966647557 | cpp |
p02924 | #include <iostream>
#include <string>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
n--;
cout << (n * n + n) / 2 << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(int argc, const char *argv[]) {
long n;
cin >> n;
n--;
cout << (n * n + n) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 726,270 | 726,271 | u742520061 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int firstNum = 1, lastNum = n - 1;
cout << ((n - 1) * (firstNum + lastNum)) / 2;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long firstNum = 1, lastNum = n - 1;
cout << ((n - 1) * (firstNum + lastNum)) / 2;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,272 | 726,273 | u452284656 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int firstNum = 1, lastNum = n - 1;
cout << (n - 1) * (firstNum + lastNum) / 2;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long firstNum = 1, lastNum = n - 1;
cout << ((n - 1) * (firstNum + lastNum)) / 2;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,274 | 726,273 | u452284656 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,277 | 726,278 | u454087021 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.remove"
] | 726,284 | 726,285 | u173178820 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 726,286 | 726,285 | u173178820 | 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 <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"variable_declaration.type.primitive.change"
] | 726,293 | 726,294 | u135358384 | 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 <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"variable_declaration.type.primitive.change"
] | 726,295 | 726,294 | u135358384 | 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 <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"variable_declaration.type.primitive.change"
] | 726,293 | 726,297 | u135358384 | 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 <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"variable_declaration.type.primitive.change"
] | 726,295 | 726,297 | u135358384 | cpp |
p02924 | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,325 | 726,326 | u167604613 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int N;
unsigned long int z;
unsigned long int x;
cin >> N;
z = std::pow(N, 2);
x = (z - N) / 2;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int N;
unsigned long int z;
unsigned long int x;
cin >> N;
z = std::pow(N, 2);
x = (N * N - N) / 2;
cout << x << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.change"
] | 726,332 | 726,333 | u118514878 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int N;
unsigned long int z;
unsigned long int x;
cin >> N;
z = std::pow(N, 2.0);
x = (z - N) / 2;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long int N;
unsigned long int z;
unsigned long int x;
cin >> N;
z = std::pow(N, 2);
x = (N * N - N) / 2;
cout << x << endl;
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.change"
] | 726,334 | 726,333 | u118514878 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << n * (n - 1) / 2;
}
| [
"variable_declaration.type.widen.change"
] | 726,335 | 726,336 | u368383065 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 30;
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++)
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 30;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 726,337 | 726,338 | u525137785 | cpp |
p02924 | #include <iostream>
int main() {
using namespace std;
int n;
while (cin >> n)
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <iostream>
int main() {
using namespace std;
long long n;
while (cin >> n)
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,342 | 726,343 | u366581176 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 726,346 | 726,347 | u317177661 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | [
"literal.number.change",
"io.output.change"
] | 726,348 | 726,347 | u317177661 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | [
"literal.number.change",
"io.output.change"
] | 726,346 | 726,349 | u317177661 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change",
"expression.operation.binary.remove"
] | 726,348 | 726,349 | u317177661 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector<int>
#define pi pair<int, int>
const int N = 1e5 + 7;
const int INF = 1e9 + 7;
int n;
main() {
cin >> n;
cout << n * (n - 1) / 2;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector<int>
#define pi pair<int, int>
const int N = 1e5 + 7;
const int INF = 1e9 + 7;
ll n;
main() {
cin >> n;
cout << n * (n - 1) / 2;
}
| [
"variable_declaration.type.change"
] | 726,352 | 726,353 | u893893358 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, sum;
cin >> N;
sum = (N - 1) * N / 2;
printf("%d", sum);
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, sum;
cin >> N;
sum = (N - 1) * N / 2;
printf("%lld", sum);
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 726,356 | 726,357 | u038326140 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define intMax 2147483647
#define longMax 9223372036854775807
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vector<int>>
#define vvl vector < vector<long long>
#define vii vector<pair<int, int>>
#define ii pair<int, int>
#define... | #include <bits/stdc++.h>
using namespace std;
#define intMax 2147483647
#define longMax 9223372036854775807
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vector<int>>
#define vvl vector < vector<long long>
#define vii vector<pair<int, int>>
#define ii pair<int, int>
#define... | [
"variable_declaration.type.change"
] | 726,358 | 726,359 | u220696377 | 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"
] | 726,364 | 726,365 | u933895652 | cpp |
p02924 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int val;
val = N * (N - 1) / 2;
cout << val << endl;
} |
#include <iostream>
using namespace std;
int main() {
long long N;
cin >> N;
long long val;
val = N * (N - 1) / 2;
cout << val << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,366 | 726,367 | u811978802 | cpp |
p02924 | //................ DON'T WISH IT WERE EASIER, WISH YOU WERE
//BETTER........................
//............ WHEN LIFE PUTS YOU IN TOUGH SITUATIONS, DONT SAY "WHY ME" SAY
//"TRY ME".......
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_std... | //................ DON'T WISH IT WERE EASIER, WISH YOU WERE
//BETTER........................
//............ WHEN LIFE PUTS YOU IN TOUGH SITUATIONS, DONT SAY "WHY ME" SAY
//"TRY ME".......
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_std... | [] | 726,368 | 726,369 | u716581234 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORB(i, m, n) for (int i = m; i >= n; i--)
#define ll long long
#define pb push_back
#define popb pop_back
#define debug(i) cout << i << endl
u... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORB(i, m, n) for (int i = m; i >= n; i--)
#define ll long long
#define pb push_back
#define popb pop_back
#define debug(i) cout << i << endl
u... | [
"variable_declaration.type.change"
] | 726,370 | 726,371 | u525432476 | cpp |
p02924 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"variable_declaration.type.change"
] | 726,372 | 726,373 | u519950235 | cpp |
p02924 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << '\n';
}
| #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
unsigned long long n;
cin >> n;
cout << (n * (n - 1)) / 2 << '\n';
}
| [
"variable_declaration.type.primitive.change"
] | 726,374 | 726,375 | u452343113 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,378 | 726,379 | u612745975 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N * (N - 1) / 2) << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << ((long long)N * (N - 1) / 2) << '\n';
}
| [
"type_conversion.add"
] | 726,380 | 726,381 | u317918118 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long r = n * (n - 1) / 2;
cout << r << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long r = n * (n - 1) / 2;
cout << r << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,382 | 726,383 | u210522720 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int r = (n * (n - 1)) / 2;
cout << r << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long r = n * (n - 1) / 2;
cout << r << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,384 | 726,383 | u210522720 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int r = n * (n - 1) / 2;
cout << r << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long r = n * (n - 1) / 2;
cout << r << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,385 | 726,383 | u210522720 | 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() {
long long n; //要素数
cin >> n;
cout << ((n - 1) * n) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,392 | 726,393 | u958460645 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 726,394 | 726,395 | u999331208 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
typedef long ... | [
"variable_declaration.type.change"
] | 726,400 | 726,401 | u681869152 | cpp |
p02924 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int ans = 0;
cin >> N;
ans = (N - 1) * N / 2;
cout << ans;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
long N;
long ans = 0;
cin >> N;
ans = (N - 1) * N / 2;
cout << ans;
} | [
"variable_declaration.type.primitive.change"
] | 726,407 | 726,408 | u240544830 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#incl... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#incl... | [
"variable_declaration.type.change"
] | 726,411 | 726,412 | u236127431 | 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() {
ll n;
cin >> n;
int ans = (1 + (n - 1)) * (n - 1) / 2;
cout << ans << 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 ans = (1 + (n - 1)) * (n - 1) / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 726,413 | 726,414 | u006721330 | 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 ans = (1 + (n - 1)) * (n - 1) / 2;
cout << ans << 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 ans = (1 + (n - 1)) * (n - 1) / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 726,415 | 726,414 | u006721330 | 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;
int ans = (1 + (n - 1)) * (n - 1) / 2;
cout << ans << 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 ans = (1 + (n - 1)) * (n - 1) / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 726,416 | 726,414 | u006721330 | 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 ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 726,417 | 726,418 | u006721330 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 1) * N / 2;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
cout << (N - 1) * N / 2;
} | [
"variable_declaration.type.primitive.change"
] | 726,419 | 726,420 | u676441479 | cpp |
p02924 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD = 1e9 + 7;
int main() {
i... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD = 1e9 + 7;
int main() {
i... | [
"variable_declaration.type.change"
] | 726,421 | 726,422 | u117615163 | cpp |
p02924 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
... | [
"variable_declaration.type.change"
] | 726,424 | 726,425 | u016189984 | 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() {
unsigned long long int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 726,426 | 726,427 | u844640682 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * n - n) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * n - n) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,428 | 726,429 | u201455094 | cpp |
p02924 | /*
∧,,∧
( 'ω' )つ ＜WA,またお前か！！
（m9 ＼
＼ ＼
) ) ＼
／／ ＼ ＼
(＿） (＿)
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(x, y) for (int x = 0; x < y; x++)
#define MOD 1000000007
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a,... | /*
∧,,∧
( 'ω' )つ ＜WA,またお前か！！
（m9 ＼
＼ ＼
) ) ＼
／／ ＼ ＼
(＿） (＿)
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(x, y) for (int x = 0; x < y; x++)
#define MOD 1000000007
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a,... | [
"variable_declaration.type.change"
] | 726,432 | 726,433 | u321915648 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
#define FOR0(var, max) for (ui(var) = 0; (var) < (max); ++(var))
#define FOR_INV(var, min, max) \
for (ui(var) = (max)-1; (var) + 1 > (min); --(var... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
#define FOR0(var, max) for (ui(var) = 0; (var) < (max); ++(var))
#define FOR_INV(var, min, max) \
for (ui(var) = (max)-1; (var) + 1 > (min); --(var... | [
"variable_declaration.type.change",
"io.output.change"
] | 726,438 | 726,439 | u549435272 | cpp |
p02924 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) f... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) f... | [
"variable_declaration.type.change"
] | 726,447 | 726,448 | u239409893 | cpp |
p02924 | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<... | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<... | [
"variable_declaration.type.change"
] | 726,452 | 726,453 | u033602950 | cpp |
p02924 | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<... | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<... | [
"variable_declaration.type.change"
] | 726,454 | 726,453 | u033602950 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
const ll in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
const ll in... | [
"variable_declaration.type.change"
] | 726,455 | 726,456 | u620242073 | cpp |
p02924 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using std::cout;
using ll = long long;
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd11(ll x, ll y) {
long long a = max(x, ... | [
"variable_declaration.type.change"
] | 726,472 | 726,473 | u776056110 | cpp |
p02924 | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)... | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)... | [
"variable_declaration.type.change"
] | 726,479 | 726,480 | u528744583 | cpp |
p02924 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"variable_declaration.type.change"
] | 726,483 | 726,484 | u716566635 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define lpsbd(i, s, b, d) for (size_t i = (s); i < (b); i += (d))
#define lpsb(i, s, b) for (size_t i = (s); i < (b); i++)
#define lpn(i, n) for (size_t i = 0; i < (n); i++)
#define fa(i, x) for (auto &i : x)
#define vcd(t, n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define lpsbd(i, s, b, d) for (size_t i = (s); i < (b); i += (d))
#define lpsb(i, s, b) for (size_t i = (s); i < (b); i++)
#define lpn(i, n) for (size_t i = 0; i < (n); i++)
#define fa(i, x) for (auto &i : x)
#define vcd(t, n... | [
"variable_declaration.type.change"
] | 726,491 | 726,492 | u330913290 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL << 29;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); ++i)
int main() {
ll N;
cin >> N;
cout << N * ((N ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL << 29;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); ++i)
int main() {
ll N;
cin >> N;
cout << N * (N -... | [] | 726,498 | 726,499 | u386806796 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL << 29;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); ++i)
int main() {
ll N;
cin >> N;
cout << N * (N /... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL << 29;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); ++i)
int main() {
ll N;
cin >> N;
cout << N * (N -... | [] | 726,500 | 726,499 | u386806796 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
long long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,508 | 726,509 | u399987025 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | [
"variable_declaration.type.change",
"variable_declaration.remove"
] | 726,514 | 726,515 | u007637377 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans;
ans = ((N - 1) * N) / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
long int ans;
ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 726,516 | 726,517 | u856234158 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans;
ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
long int ans;
ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 726,518 | 726,517 | u856234158 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, h[100005];
long long int ans;
cin >> n;
ans = n * (n - 1) / 2;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int h[100005];
long long int n, ans;
cin >> n;
ans = n * (n - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.remove",
"variable_declaration.add"
] | 726,524 | 726,525 | u125468789 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#de... | [] | 726,528 | 726,529 | u152447503 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define INF LLONG_MAX
#define PI acos(-1)
const ll MOD = 1e9 + 7;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#de... | [] | 726,530 | 726,529 | u152447503 | cpp |
p02924 | #include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
} else {
int n2 = n - 1;
cout << n2 * (n2 + 1) / 2 << endl;
}
return 0;
} | #include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
} else {
int64_t n2 = n - 1;
cout << n2 * (n2 + 1) / 2 << endl;
}
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 726,534 | 726,535 | u658151925 | cpp |
p02924 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | #include <cstdlib>
#include <iostream>
#include <vector>
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",
"control_flow.return.add",
"control_flow.return.0.add"
] | 726,536 | 726,537 | u909162870 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n * n - 1) / 2;
} | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n * (n - 1)) / 2;
} | [] | 726,541 | 726,542 | u608777907 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * n - 1) / 2;
} | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n * (n - 1)) / 2;
} | [
"variable_declaration.type.widen.change"
] | 726,543 | 726,542 | u608777907 | cpp |
p02924 | #include <bits/stdc++.h>
#define MAX 1000000000
using namespace std;
typedef long long ll;
int n;
int main() {
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define MAX 1000000000
using namespace std;
typedef long long ll;
ll n;
int main() {
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 726,546 | 726,547 | u930997891 | cpp |
p02924 | #include <iostream>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| #include <iostream>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 726,548 | 726,549 | u711582524 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int N;
int main() {
cin >> N;
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)++)
long N;
int main() {
cin >> N;
N--;
cout << ((N * (N + 1)) / 2) << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 726,550 | 726,551 | u562728594 | cpp |
p02924 | #include <iostream>
using namespace std;
int n;
void solve() { cout << (n * (n - 1)) / 2 << endl; }
int main() {
cin >> n;
solve();
}
| #include <iostream>
using namespace std;
typedef long long ll;
ll n;
void solve() { cout << (n * (n - 1)) / 2 << endl; }
int main() {
cin >> n;
solve();
}
| [] | 726,552 | 726,553 | u618167957 | cpp |
p02924 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 726,559 | 726,560 | u643698380 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int64_t ans = (n * (n - 1)) / 2;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t ans = (n * (n - 1)) / 2ll;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 726,561 | 726,562 | u229148215 | 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 all(x) (x).begin(), (x).end()
/////////////////////////////////////////////////////////
void Main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
//////////////////////////////... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
/////////////////////////////////////////////////////////
void Main() {
ll N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
///////////////////////////////... | [
"variable_declaration.type.change"
] | 726,563 | 726,564 | u855985627 | 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"
] | 726,572 | 726,573 | u628758223 | cpp |
p02924 | #include <cstdio>
using namespace std;
main() {
int n;
scanf("%d", &n);
printf("%d\n", n * (n - 1) / 2);
return 0;
} | #include <cstdio>
using namespace std;
main() {
long long n;
scanf("%lld", &n);
printf("%lld\n", n * (n - 1) / 2);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 726,576 | 726,577 | u468811760 | cpp |
p02924 | #include <cstdio>
using namespace std;
main() {
int n;
scanf("%d", &n);
printf("%d\n", n * (n + 1) / 2);
return 0;
} | #include <cstdio>
using namespace std;
main() {
long long n;
scanf("%lld", &n);
printf("%lld\n", n * (n - 1) / 2);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 726,578 | 726,577 | u468811760 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1) / 2);
} | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n * (n - 1) / 2);
} | [
"variable_declaration.type.widen.change"
] | 726,584 | 726,585 | u217218591 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << ((n + 1) / 3);
} | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n * (n - 1) / 2);
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"literal.number.change"
] | 726,586 | 726,585 | u217218591 | cpp |
p02924 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.change"
] | 726,587 | 726,588 | u487641373 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
cout << 0.5 * N * (N - 1) << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
| [
"expression.operation.binary.remove"
] | 726,593 | 726,594 | u803481017 | 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;
int ans;
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() {
int64_t N;
cin >> N;
int64_t ans;
ans = N * (N - 1) / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 726,595 | 726,596 | u967294601 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define INF 1e9
int n;
class fastio {
public:
fastio() {
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
}
} __fastio;
void solve() {
cin >> n;
/**
ind = 1 2 3 4 5 6 . . . . N
per = 2 3 4 5 6 7 . . . . 1
... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define INF 1e9
long long n;
class fastio {
public:
fastio() {
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
}
} __fastio;
void solve() {
cin >> n;
/**
ind = 1 2 3 4 5 6 . . . . N
per = 2 3 4 5 6 7 . . .... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,601 | 726,602 | u485065344 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define INF 1e9
int n;
class fastio {
public:
fastio() {
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
}
} __fastio;
void solve() {
cin >> n;
/**
ind = 1 2 3 4 5 6 . . . . N
per = 2 3 4 5 6 7 . . . . 1
... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define INF 1e9
long long n;
class fastio {
public:
fastio() {
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
}
} __fastio;
void solve() {
cin >> n;
/**
ind = 1 2 3 4 5 6 . . . . N
per = 2 3 4 5 6 7 . . .... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,603 | 726,602 | u485065344 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n - 1) * (n - 2) / 2 << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
} | [] | 726,606 | 726,607 | u273962215 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 726,612 | 726,613 | u688422725 | cpp |
p02924 | #include "bits/stdc++.h"
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++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"
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++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"
] | 726,615 | 726,616 | u955276157 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.