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 |
|---|---|---|---|---|---|---|---|
p03037 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n, m;
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
m = sc.nextInt();
int max = 1;
int min = 10;
int ans = 0;
for (int i = 0; i < m; i++) {
int maxTmp, minTmp;
maxTm... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n, m;
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
m = sc.nextInt();
int max = 1;
int min = n;
int ans = 0;
for (int i = 0; i < m; i++) {
int maxTmp, minTmp;
maxTmp... | null | 850,626 | 850,627 | u395242880 | java |
p02994 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int l = sc.nextInt();
int sum = 0;
boolean zr = false;
for (int i = 1; i <= n; i++) {
int azi = l + i - 1;
if (azi == 0) {
zr ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int l = sc.nextInt();
int sum = 0;
boolean zr = false;
for (int i = 1; i <= n; i++) {
int azi = l + i - 1;
if (azi == 0) {
zr ... | null | 804,003 | 804,004 | u173662133 | java |
p03059 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int t = sc.nextInt();
int biscuitNum = biscuitNum(a, b, t);
System.out.println("biscuitNum:" + biscuitNum);
}
public stati... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int t = sc.nextInt();
int biscuitNum = biscuitNum(a, b, t);
System.out.println(biscuitNum);
}
public static int biscuitNum... | null | 871,876 | 871,877 | u847564582 | java |
p03280 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int A1 = sc.nextInt();
int A2 = sc.nextInt();
int answer = (A1 - 1) * (A2 - 1) + 1;
System.out.println(answer);
}
}
| import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int A1 = sc.nextInt();
int A2 = sc.nextInt();
int answer = (A1 - 1) * (A2 - 1);
System.out.println(answer);
}
}
| null | 1,061,636 | 1,061,637 | u899929023 | java |
p03274 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int K = sc.nextInt();
int S[] = new int[N];
for (int i = 0; i < N; i++)
S[i] = sc.nextInt();
int temp = 0;
int ans = 1000000000;
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int K = sc.nextInt();
int S[] = new int[N];
for (int i = 0; i < N; i++)
S[i] = sc.nextInt();
int temp = 0;
int ans = 1000000000;
... | null | 1,058,584 | 1,058,585 | u645304546 | java |
p03347 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
ArrayList<Integer>[] g;
void run() {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
long[] A = new long[N];
for (int i = 0; i < N; ++i) {
A[i] = sc.nextLong();
}
long ans = ... | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
ArrayList<Integer>[] g;
void run() {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
long[] A = new long[N];
for (int i = 0; i < N; ++i) {
A[i] = sc.nextLong();
}
long ans = ... | null | 1,118,633 | 1,118,634 | u313111801 | java |
p03494 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner in = new Scanner(System.in)) {
int N = in.nextInt();
int[] A = new int[N];
for (int i = 0; i < N; i++) {
A[i] = in.nextInt();
}
int count = 0;
for (;;) {
if (is... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner in = new Scanner(System.in)) {
int N = in.nextInt();
int[] A = new int[N];
for (int i = 0; i < N; i++) {
A[i] = in.nextInt();
}
int count = 0;
for (;;) {
if (is... | null | 1,246,241 | 1,246,242 | u552502395 | java |
p03470 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
Arrays.sort(a);
int ans = 0;
for (int i = 1; i < n; i++) {
... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
Arrays.sort(a);
int ans = 0;
for (int i = 1; i < n; i++) {
... | null | 1,215,805 | 1,215,806 | u431125128 | java |
p03681 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
if (Math.abs(N - M) > 1) {
System.out.println(0);
return;
}
long r = 1000000007;
long ans = 1;
while (N > 0 && ... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
if (Math.abs(N - M) > 1) {
System.out.println(0);
return;
}
long r = 1000000007;
long ans = 1;
while (N > 0 && ... | null | 1,357,198 | 1,357,199 | u149468221 | java |
p03994 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
int k = sc.nextInt();
int count = 0;
int flag = 0;
for (int i = 0; i < s.length; i++) {
// count = ((s[i] - 'a') % 26 + '... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
int k = sc.nextInt();
int count = 0;
int flag = 0;
for (int i = 0; i < s.length; i++) {
// count = ((s[i] - 'a') % 26 + '... | null | 1,504,224 | 1,504,225 | u383342473 | java |
p03994 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
int k = sc.nextInt();
int count = 0;
int flag = 0;
for (int i = 0; i < s.length; i++) {
// count = ((s[i] - 'a') % 26 + '... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
int k = sc.nextInt();
int count = 0;
int flag = 0;
for (int i = 0; i < s.length; i++) {
// count = ((s[i] - 'a') % 26 + '... | null | 1,504,226 | 1,504,225 | u383342473 | java |
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"
] | 723,825 | 723,826 | u453366189 | cpp |
p02924 | #include <bits //stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | [
"variable_declaration.type.widen.change"
] | 723,834 | 723,835 | u670898337 | cpp |
p02924 | #include <bits //stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| [
"variable_declaration.type.widen.change"
] | 723,834 | 723,836 | u670898337 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"variable_declaration.type.change"
] | 723,837 | 723,838 | u257571179 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 723,839 | 723,840 | u477233273 | cpp |
p02924 | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
ll int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
return 0;
}
| [] | 723,841 | 723,842 | u912766486 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (ll(i) - 1 = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (ll(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define AL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (ll(i) - 1 = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (ll(i) = (m); (i) < (n); (i)++)
#define INF 1e9
#define AL... | [
"expression.operation.binary.remove"
] | 723,843 | 723,844 | u276682785 | 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"
] | 723,845 | 723,846 | u734345532 | cpp |
p02924 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int INF = 1e9;
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve() {
int n;
... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int INF = 1e9;
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve() {
ll n;
c... | [
"variable_declaration.type.change"
] | 723,850 | 723,851 | u110044127 | 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"
] | 723,854 | 723,855 | u835523614 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, ans;
cin >> n;
ans = (n + 1) * n / 2 - n;
cout << ans << "\n"s;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int64_t n, ans;
cin >> n;
ans = (n - 1) * n / 2;
cout << ans << "\n"s;
} | [
"variable_declaration.type.primitive.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 723,870 | 723,871 | u104613587 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n, ans;
cin >> n;
ans = (n + 1) * n / 2 - n;
cout << ans << "\n"s;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int64_t n, ans;
cin >> n;
ans = (n + 1) * n / 2 - n;
cout << ans << "\n"s;
} | [
"variable_declaration.type.primitive.change"
] | 723,870 | 723,872 | u104613587 | cpp |
p02924 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading \
zero str.erase(0, min(str.find_first_not_of('0'), str.size() - 1));
using namespace __gnu_pbds;
using namespace std;
typedef long long... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading \
zero str.erase(0, min(str.find_first_not_of('0'), str.size() - 1));
using namespace __gnu_pbds;
using namespace std;
typedef long long... | [
"variable_declaration.type.change"
] | 723,873 | 723,874 | u989611568 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e5 + 5;
typedef long long ll;
int n, m;
bool vis[100005];
vector<int> v[100005];
int main() {
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int inf = 1e5 + 5;
typedef long long ll;
ll n, m;
bool vis[100005];
vector<int> v[100005];
int main() {
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
}
| [
"variable_declaration.type.change"
] | 723,875 | 723,876 | u989611568 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unsigned long long res = N * (N - 1);
res >>= 1;
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unsigned long long res = N;
res *= N - 1;
res >>= 1;
cout << res << endl;
return 0;
}
| [] | 723,884 | 723,885 | u090445726 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long res = N * (N - 1);
res >>= 1;
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
unsigned long long res = N;
res *= N - 1;
res >>= 1;
cout << res << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 723,886 | 723,885 | u090445726 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using vi = vector<int>;
template <class T> using Grid = vector<vector<T>>;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using vi = vector<int>;
template <class T> using Grid = vector<vector<T>>;
... | [
"variable_declaration.type.change"
] | 723,900 | 723,901 | u857147058 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
using vb = vector<bool>;
using vb2 = vector<vector<bool>>;
using vc = vector<char>;
using vc2 = vector<vector<char>>;
using vs = vector<string>;
using si = set<int>;
using vs2 = vector<vector<str... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
using vb = vector<bool>;
using vb2 = vector<vector<bool>>;
using vc = vector<char>;
using vc2 = vector<vector<char>>;
using vs = vector<string>;
using si = set<int>;
using vs2 = vector<vector<str... | [] | 723,902 | 723,903 | u892922562 | 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"
] | 723,906 | 723,907 | u237390401 | cpp |
p02924 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // dequef
#includ... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // dequef
#includ... | [
"variable_declaration.type.change"
] | 723,915 | 723,916 | u396266329 | cpp |
p02924 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <iostream>
#include <math.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"
] | 723,925 | 723,926 | u292453550 | cpp |
p02923 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | [
"call.add",
"call.arguments.change"
] | 723,943 | 723,944 | u915020369 | cpp |
p02923 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [
"expression.operation.binary.add"
] | 723,945 | 723,946 | u874644572 | cpp |
p02924 | // doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using nam... | // doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using nam... | [
"variable_declaration.type.change"
] | 723,958 | 723,959 | u592758681 | cpp |
p02924 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T... | [
"variable_declaration.type.change"
] | 723,960 | 723,961 | u725680599 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
--n;
cout << (n * (n - 1)) / 2 - 1 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
--n;
cout << (n * (n + 1)) / 2 << '\n';
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 723,966 | 723,965 | u600244905 | cpp |
p02924 | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
using usize = ::std::size_t;
using u64 = ::std::int_least64_t;
// using u64 = long long;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_wi... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
using usize = ::std::size_t;
using u64 = ::std::int_least64_t;
// using u64 = long long;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_wi... | [
"expression.operation.binary.remove"
] | 723,967 | 723,968 | u945078804 | 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 ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1e9;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
#define PI 3.14159265358979323846264338327950L
#define MOD 10... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1e9;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
#define PI 3.14159265358979323846264338327950L
#define MOD 10... | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 723,969 | 723,970 | u624076058 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unor... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unor... | [
"variable_declaration.type.change"
] | 723,971 | 723,972 | u125180853 | cpp |
p02924 | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rep2(i, a, n) for (int i = a; i <= n; i++)
#define rrep(i, a, n) for (int i = a; i > n; i--)
#define rrep2... | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rep2(i, a, n) for (int i = a; i <= n; i++)
#define rrep(i, a, n) for (int i = a; i > n; i--)
#define rrep2... | [
"variable_declaration.type.widen.change"
] | 723,975 | 723,976 | u829260400 | 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"
] | 723,984 | 723,985 | u830087664 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 723,986 | 723,987 | u830087664 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define Dcout(a) cout << setprecision(20) << a << endl
#defin... | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define Dcout(a) cout << setprecision(20) << a << endl
#defin... | [
"variable_declaration.type.change"
] | 723,988 | 723,989 | u502312544 | cpp |
p02924 | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#i... | #pragma region header
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#i... | [
"variable_declaration.type.change"
] | 723,994 | 723,995 | u926006934 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// ll fpow(ll b,ll p,ll mod){
// b %=mod;
// ll ans=1;
// while(p){
//
// if (p&1){
// ans *=b;
// ans %=mod;
// }
// b *=b;
// b%=mod;
// p >>=1;
// }
// return ans;
//}
int mai... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
ll n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
| [
"variable_declaration.type.change"
] | 724,006 | 724,007 | u230285506 | cpp |
p02924 | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll f(int n) { return n * (n + 1) / 2; }
int main() {
int n;
cin >> n;
cout << f(n - 1) << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll f(ll n) { return n * (n + 1) / 2; }
int main() {
ll n;
cin >> n;
cout << f(n - 1) << endl;
} | [
"variable_declaration.type.change"
] | 724,019 | 724,020 | u563170985 | cpp |
p02924 | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int f(int n) { return n * (n + 1) / 2; }
int main() {
int n;
cin >> n;
cout << f(n - 1) << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll f(ll n) { return n * (n + 1) / 2; }
int main() {
ll n;
cin >> n;
cout << f(n - 1) << endl;
} | [
"variable_declaration.type.change"
] | 724,021 | 724,020 | u563170985 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int a;
cin >> a;
cout << a * (a - 1);
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int a;
cin >> a;
cout << a * (a - 1) / 2;
}
| [
"expression.operation.binary.add"
] | 724,022 | 724,023 | u079532978 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
cout << a * (a - 1) / 2;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int a;
cin >> a;
cout << a * (a - 1) / 2;
}
| [
"variable_declaration.type.widen.change"
] | 724,024 | 724,023 | u079532978 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
cout << a * (a - 1);
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int a;
cin >> a;
cout << a * (a - 1) / 2;
}
| [
"variable_declaration.type.widen.change",
"expression.operation.binary.add"
] | 724,025 | 724,023 | u079532978 | 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;
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 724,026 | 724,027 | u201651098 | 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 n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 724,032 | 724,033 | u367958900 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename... | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename... | [
"variable_declaration.type.change"
] | 724,038 | 724,039 | u469813907 | cpp |
p02924 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"variable_declaration.type.change"
] | 724,042 | 724,043 | u151236434 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e7 + 5;
int main() {
int n;
cin >> n;
ll sum = n * (n - 1) / 2;
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e7 + 5;
int main() {
ll n, sum;
cin >> n;
sum = n * (n - 1) / 2;
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.change",
"variable_declaration.add"
] | 724,044 | 724,045 | u816631826 | 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 N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,046 | 724,047 | u816631826 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = (ll)n * (n - 1) / 2;
cout << ans << endl;
} | [
"type_conversion.add"
] | 724,052 | 724,053 | u259578308 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | [
"variable_declaration.type.change"
] | 724,054 | 724,055 | u864785784 | cpp |
p02924 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | [
"variable_declaration.type.change"
] | 724,056 | 724,055 | u864785784 | cpp |
p02924 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int ans;
cin >> ans;
cout << ((ans - 1) * ans) / 2;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
long long ans;
cin >> ans;
cout << ((ans - 1) * ans) / 2;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,063 | 724,064 | u747032676 | cpp |
p02924 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
ans = (1 + N) * N / 2 - N;
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
ans = (1 + N) * N / 2 - N;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,069 | 724,070 | u503221936 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, m, i, j, sum = 0;
cin >> n;
sum = (n * (n - 1)) / 2;
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, p, m, i, j, sum = 0;
cin >> n;
sum = (n * (n - 1)) / 2;
cout << sum << endl;
}
| [
"variable_declaration.type.change"
] | 724,071 | 724,072 | u018679195 | cpp |
p02924 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 210;
int n;
int main() {
scanf("%d", &n);
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 210;
long long n;
int main() {
scanf("%lld", &n);
cout << n * (n - 1) / 2 << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 724,083 | 724,084 | u334070979 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 724,085 | 724,086 | u005072763 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int Z_algo(string s) {
int n = s.length();
vector<int> z(n);
int L = 0, R = 0;
for (int i = 1; i < n; i++) {
if (i > R) {
L = R = i;
... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int Z_algo(string s) {
int n = s.length();
vector<int> z(n);
int L = 0, R = 0;
for (int i = 1; i < n; i++) {
if (i > R) {
L = R = i;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,091 | 724,092 | u221780420 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
// 小数点以下桁数
// fixed << setprecision(i)
int gcd(int a, int b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int64_t lcm(int a, int b) { return (int64_t)a * b / gcd(a, b); }
int factorial(int a) {
int b = 1;
while (a) {
b *= a--;
}
return b;
} // 13以下対応
bool is_p... | #include <bits/stdc++.h>
using namespace std;
// 小数点以下桁数
// fixed << setprecision(i)
int gcd(int a, int b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int64_t lcm(int a, int b) { return (int64_t)a * b / gcd(a, b); }
int factorial(int a) {
int b = 1;
while (a) {
b *= a--;
}
return b;
} // 13以下対応
bool is_p... | [
"variable_declaration.type.primitive.change"
] | 724,096 | 724,097 | u652660628 | cpp |
p02924 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
n--;
cout << (n * (n + 1)) / 2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n;
cin >> n;
n--;
cout << (n * (n + 1)) / 2 << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,100 | 724,101 | u043140820 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
--n;
ll ans = (n + 1) * n / 2;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
--n;
ll ans = (n + 1) * n / 2;
cout << ans << '\n';
return 0;
} | [
"variable_declaration.type.change"
] | 724,102 | 724,103 | u600402037 | cpp |
p02924 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
--n;
int ans = (n + 1) * n / 2;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
--n;
ll ans = (n + 1) * n / 2;
cout << ans << '\n';
return 0;
} | [
"variable_declaration.type.change"
] | 724,104 | 724,103 | u600402037 | cpp |
p02924 | #include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(), (l).end()
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
// const ll mod = 1000000007;
// const ll maxn = 1000000000;
//-------------------------------------... | #include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(), (l).end()
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
// const ll mod = 1000000007;
// const ll maxn = 1000000000;
//-------------------------------------... | [] | 724,105 | 724,106 | u195822478 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define MOD 1000000007ULL;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << en... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define MOD 1000000007ULL;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll N;
cin >> N;
cout << N * (N - 1) / 2 << end... | [
"variable_declaration.type.change"
] | 724,107 | 724,108 | u054729397 | cpp |
p02924 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int ans = (N - 1) * N / 2;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 724,112 | 724,113 | u291332466 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
cout << (ll)N * (N - 1) / 2;
return 0;
}
| [
"type_conversion.add"
] | 724,117 | 724,118 | u145483532 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | [
"variable_declaration.type.change"
] | 724,119 | 724,120 | u825601908 | 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 <utility>
#include <vector>
//エイリアス
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
class S... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//エイリアス
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
class S... | [
"variable_declaration.type.change"
] | 724,121 | 724,122 | u269291896 | cpp |
p02924 | // D.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2 << endl;
}
| // D.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
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"
] | 724,126 | 724,127 | u902619368 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (long long)n * (n - 1) / 2 << endl;
} | [
"type_conversion.add",
"expression.operation.binary.add"
] | 724,130 | 724,129 | u247123590 | cpp |
p02924 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 724,133 | 724,134 | u950002813 | cpp |
p02924 | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
int main(void) {
ll N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
int main(void) {
ll N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
return 0;
} | [] | 724,138 | 724,139 | u909017535 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1LL << 60;
// int INF = numeric_limits<int>::max();
int main(int, char **) {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1LL << 60;
// int INF = numeric_limits<int>::max();
int main(int, char **) {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 724,140 | 724,141 | u475866458 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, n, m;
cin >> x;
n = (x - 1) * x;
m = n / 2;
cout << m << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, n, m;
cin >> x;
n = (x - 1) * x;
m = n / 2;
cout << m << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,142 | 724,143 | u795342657 | cpp |
p02924 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecis... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // fixed, setprecis... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,150 | 724,151 | u100459591 | 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"
] | 724,155 | 724,156 | u404794295 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int N;
cin >> N;
ans = (N - 1) * N / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
long long N;
cin >> N;
ans = (N - 1) * N / 2;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,157 | 724,158 | u446774692 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INFINITO... | #include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INFINITO... | [
"variable_declaration.type.change"
] | 724,161 | 724,162 | u202699008 | 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() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 724,167 | 724,168 | u321168841 | cpp |
p02924 | #pragma once
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define all(vs) (vs).begin(), (vs).end()
#define roundup(A, B) (A) / (B) + ((A) % (B) == 0 ? 0 : 1)
#define read(type, name) ... | #pragma once
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define all(vs) (vs).begin(), (vs).end()
#define roundup(A, B) (A) / (B) + ((A) % (B) == 0 ? 0 : 1)
#define read(type, name) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,171 | 724,172 | u822155101 | cpp |
p02924 | #pragma once
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define all(vs) (vs).begin(), (vs).end()
#define roundup(A, B) (A) / (B) + ((A) % (B) == 0 ? 0 : 1)
#define read(type, name) ... | #pragma once
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define all(vs) (vs).begin(), (vs).end()
#define roundup(A, B) (A) / (B) + ((A) % (B) == 0 ? 0 : 1)
#define read(type, name) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,173 | 724,172 | u822155101 | cpp |
p02924 | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size();
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) * n / 2;
} | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size();
using namespace std;
int main() {
ll n;
cin >> n;
cout << (n - 1) * n / 2;
} | [
"variable_declaration.type.change"
] | 724,182 | 724,183 | u002627851 | cpp |
p02924 | #include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <un... | #include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <un... | [] | 724,193 | 724,194 | u652423305 | cpp |
p02924 | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define reverse(x) reverse(x.begin(), x.end())
#define sort(x) sort(x.begin(), x.end())
#define pb push_back
#define pii pair<int, int>
#define pll pair<long long, long long>
#define f first
#define s second
typedef long long ll;
const int mod = 1e9 + 7;
using ... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define reverse(x) reverse(x.begin(), x.end())
#define sort(x) sort(x.begin(), x.end())
#define pb push_back
#define pii pair<int, int>
#define pll pair<long long, long long>
#define f first
#define s second
typedef long long ll;
const int mod = 1e9 + 7;
using ... | [
"variable_declaration.type.change",
"call.add"
] | 724,195 | 724,196 | u580061629 | cpp |
p02924 | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
int N;
cin >> N;
ll ans = N * (N - 1) / 2;
cout << ans << endl;
return (0);
} | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
ll N;
cin >> N;
ll ans = (N * (N - 1)) / 2;
cout << ans << endl;
return (0);
} | [
"variable_declaration.type.change"
] | 724,203 | 724,204 | u027946359 | cpp |
p02924 | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 724,207 | 724,208 | u547099897 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
int ans = 0;
if (n == 1) {
ans = 0;
} else {
ans = (2 + (n - 1)) * (n - 2) / 2 + 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
ll ans = 0;
if (n == 1) {
ans = 0;
} else {
ans = (2 + (n - 1)) * (n - 2) / 2 + 1;
}
cout << ans << endl;
return 0;
} | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 724,209 | 724,210 | u225581241 | cpp |
p02924 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int a... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,213 | 724,214 | u221285045 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2;
} | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main() {
int64_t N;
cin >> N;
cout << (N * (N - 1)) / 2;
} | [
"variable_declaration.type.primitive.change"
] | 724,215 | 724,216 | u058742919 | 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() {
long long n;
cin >> n;
cout << (n * (n + 1)) / 2 - n;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,217 | 724,218 | u004676431 | cpp |
p02924 | #include <bits/stdc++.h>
#define FOR(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
#define MOD 1000000007
#define INF 1000000000
using ll = long long int;
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int N;
cin >> N;
ll ans =... | #include <bits/stdc++.h>
#define FOR(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
#define MOD 1000000007
#define INF 1000000000
using ll = long long int;
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
ll N;
cin >> N;
ll ans = ... | [
"variable_declaration.type.change"
] | 724,223 | 724,224 | u099619676 | cpp |
p02924 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long max = 0LL;
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,225 | 724,226 | u099619676 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.