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 8
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;
maxTmp = sc.nextInt();
minTmp = sc.nextInt();
max = Math.max(max, maxTmp);
min = Math.min(min, minTmp);
}
ans = min - max + 1;
if (ans < 1) {
System.out.println(0);
} else {
System.out.println(ans);
}
}
}
|
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 = sc.nextInt();
minTmp = sc.nextInt();
max = Math.max(max, maxTmp);
min = Math.min(min, minTmp);
}
ans = min - max + 1;
if (ans < 1) {
System.out.println(0);
} else {
System.out.println(ans);
}
}
}
| 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 = true;
}
sum += azi;
}
if (zr) {
System.out.println(sum);
} else if (l > 1) {
System.out.println(sum - (l));
} else {
System.out.println(sum - (l + n - 1));
}
}
}
|
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 = true;
}
sum += azi;
}
if (zr) {
System.out.println(sum);
} else if (l >= 1) {
System.out.println(sum - (l));
} else {
System.out.println(sum - (l + n - 1));
}
}
}
| 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 static int biscuitNum(int a, int b, int t) { return (t / a) * b; }
}
|
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(int a, int b, int t) { return (t / a) * b; }
}
| 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;
if (K == 1) {
ans = 100000000;
for (int i = 0; i < N; i++) {
temp = S[i];
ans = Math.min(Math.abs(temp), ans);
}
System.out.println(ans);
}
else if (N - K != 0) {
for (int i = 0; i < N - K; i++) {
int min = S[i];
int max = S[i + K - 1];
if (min < 0 && max > 0)
temp = Math.min(2 * (-min) + max, (-min) + 2 * max);
else
temp = Math.max(Math.abs(min), Math.abs(max));
ans = Math.min(ans, temp);
}
System.out.println(ans);
}
else {
int min = S[0];
int max = S[N - 1];
if (min < 0 && max > 0)
System.out.println(Math.min(2 * (-min) + max, (-min) + 2 * max));
else
System.out.println(Math.max(Math.abs(min), Math.abs(max)));
}
sc.close();
}
}
|
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;
if (K == 1) {
for (int i = 0; i < N; i++) {
temp = S[i];
ans = Math.min(Math.abs(temp), ans);
}
System.out.println(ans);
}
else if (N - K != 0) {
for (int i = 0; i <= N - K; i++) {
int min = S[i];
int max = S[i + K - 1];
if (min < 0 && max > 0)
temp = Math.min(2 * (-min) + max, (-min) + 2 * max);
else
temp = Math.max(Math.abs(min), Math.abs(max));
ans = Math.min(ans, temp);
}
System.out.println(ans);
}
else {
int min = S[0];
int max = S[N - 1];
if (min < 0 && max > 0)
System.out.println(Math.min(2 * (-min) + max, (-min) + 2 * max));
else
System.out.println(Math.max(Math.abs(min), Math.abs(max)));
}
sc.close();
}
}
| 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 = 0;
for (int i = 0; i < N; ++i) {
if ((i == 0 && A[0] != 0) || (i > 0 && A[i] - A[i - 1] > 1)) {
System.out.println(-1);
}
}
for (int i = 1; i < N; ++i) {
if (i == N - 1 || A[i + 1] != A[i] + 1) {
ans += A[i];
}
}
System.out.println(ans);
}
public static void main(String[] args) { new Main().run(); }
void tr(Object... objects) {
System.out.println(Arrays.deepToString(objects));
}
}
|
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 = 0;
for (int i = 0; i < N; ++i) {
if ((i == 0 && A[0] != 0) || (i > 0 && A[i] - A[i - 1] > 1)) {
System.out.println(-1);
return;
}
}
for (int i = 1; i < N; ++i) {
if (i == N - 1 || A[i + 1] != A[i] + 1) {
ans += A[i];
}
}
System.out.println(ans);
}
public static void main(String[] args) { new Main().run(); }
void tr(Object... objects) {
System.out.println(Arrays.deepToString(objects));
}
}
| 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 (isAllEven(A)) {
for (int i = 0; i < N; i++) {
A[i] /= 2;
}
} else {
break;
}
}
System.out.println(count);
}
}
private static boolean isAllEven(int[] A) {
for (int i = 0; i < A.length; i++) {
if (A[i] % 2 == 1) {
return false;
}
}
return true;
}
}
|
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 (isAllEven(A)) {
for (int i = 0; i < N; i++) {
A[i] /= 2;
}
count++;
} else {
break;
}
}
System.out.println(count);
}
}
private static boolean isAllEven(int[] A) {
for (int i = 0; i < A.length; i++) {
if (A[i] % 2 == 1) {
return false;
}
}
return true;
}
}
| 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++) {
if (a[i] > a[i - 1]) {
ans++;
}
}
System.out.println(ans);
}
}
|
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++) {
if (a[i] > a[i - 1]) {
ans++;
}
}
System.out.println(ans + 1);
}
}
| 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 && M > 0) {
ans *= N;
ans %= r;
ans *= M;
ans %= r;
N--;
M--;
}
if (N == M)
ans *= 2;
System.out.println(ans);
}
}
|
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 && M > 0) {
ans *= N;
ans %= r;
ans *= M;
ans %= r;
N--;
M--;
}
if (N == M)
ans *= 2;
ans %= r;
System.out.println(ans);
}
}
| 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 + 'a');
if (s[i] == 'a') {
flag = 1;
}
count = 26 - (s[i] - 'a');
if (count <= k) {
s[i] = 'a';
k = k - count;
flag = 1;
}
// System.out.println(count);
}
if (k > 0) {
if (k >= 26 && flag == 1) {
k = k % 26;
}
s[s.length - 1] = (char)((s[s.length - 1] - 'a' + k) % 26 + 'a');
}
for (int i = 0; i < s.length; i++) {
System.out.print(s[i]);
}
System.out.println("");
sc.close();
}
}
|
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 + 'a');
if (s[i] == 'a') {
continue;
}
count = 26 - (s[i] - 'a');
if (count <= k) {
s[i] = 'a';
k = k - count;
flag = 1;
}
// System.out.println(count);
}
if (k > 0) {
if (k >= 26 && flag == 1) {
k = k % 26;
}
s[s.length - 1] = (char)((s[s.length - 1] - 'a' + k) % 26 + 'a');
}
for (int i = 0; i < s.length; i++) {
System.out.print(s[i]);
}
System.out.println("");
sc.close();
}
}
| 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 + 'a');
if (s[i] == 'a') {
flag = 1;
}
count = 26 - (s[i] - 'a');
if (count <= k) {
s[i] = 'a';
k = k - count;
flag = 1;
}
// System.out.println(count);
}
if (k > 0) {
if (k >= 26 && flag == 1) {
k = k - 26;
}
s[s.length - 1] = (char)((s[s.length - 1] - 'a' + k) % 26 + 'a');
}
for (int i = 0; i < s.length; i++) {
System.out.print(s[i]);
}
System.out.println("");
sc.close();
}
}
|
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 + 'a');
if (s[i] == 'a') {
continue;
}
count = 26 - (s[i] - 'a');
if (count <= k) {
s[i] = 'a';
k = k - count;
flag = 1;
}
// System.out.println(count);
}
if (k > 0) {
if (k >= 26 && flag == 1) {
k = k % 26;
}
s[s.length - 1] = (char)((s[s.length - 1] - 'a' + k) % 26 + 'a');
}
for (int i = 0; i < s.length; i++) {
System.out.print(s[i]);
}
System.out.println("");
sc.close();
}
}
| 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); \
cout.tie(NULL);
int main() {
FASTINOUT;
int x;
cin >> x;
cout << (x - 1) * (x) / 2 << endl;
return 0;
}
|
#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); \
cout.tie(NULL);
int main() {
FASTINOUT;
ll x;
cin >> x;
cout << (x - 1) * (x) / 2 << endl;
return 0;
}
|
[
"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 ALL(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
template <uint MD> struct ModInt {
using M = ModInt;
const static M G;
uint v;
ModInt(ll _v = 0) { set_v(uint(_v % MD + MD)); }
M &set_v(uint _v) {
v = (_v < MD) ? _v : _v - MD;
return *this;
}
explicit operator bool() const { return v != 0; }
M operator-() const { return M() - *this; }
M operator+(const M &r) const { return M().set_v(v + r.v); }
M operator-(const M &r) const { return M().set_v(v + MD - r.v); }
M operator*(const M &r) const { return M().set_v(uint(ull(v) * r.v % MD)); }
M operator/(const M &r) const { return *this * r.inv(); }
M &operator+=(const M &r) { return *this = *this + r; }
M &operator-=(const M &r) { return *this = *this - r; }
M &operator*=(const M &r) { return *this = *this * r; }
M &operator/=(const M &r) { return *this = *this / r; }
bool operator==(const M &r) const { return v == r.v; }
M pow(ll n) const {
M x = *this, r = 1;
while (n) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
M inv() const { return pow(MD - 2); }
friend ostream &operator<<(ostream &os, const M &r) { return os << r.v; }
};
using Mint = ModInt<1000000007>;
const double PI = 3.14159265358979323846;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
bool is_prime(long long N) {
if (N == 1)
return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0)
return false;
}
return true;
}
int main() {
ll n;
cin >> n;
cout << 0.5 * n * (n - 1) << endl;
}
|
#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 ALL(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
template <uint MD> struct ModInt {
using M = ModInt;
const static M G;
uint v;
ModInt(ll _v = 0) { set_v(uint(_v % MD + MD)); }
M &set_v(uint _v) {
v = (_v < MD) ? _v : _v - MD;
return *this;
}
explicit operator bool() const { return v != 0; }
M operator-() const { return M() - *this; }
M operator+(const M &r) const { return M().set_v(v + r.v); }
M operator-(const M &r) const { return M().set_v(v + MD - r.v); }
M operator*(const M &r) const { return M().set_v(uint(ull(v) * r.v % MD)); }
M operator/(const M &r) const { return *this * r.inv(); }
M &operator+=(const M &r) { return *this = *this + r; }
M &operator-=(const M &r) { return *this = *this - r; }
M &operator*=(const M &r) { return *this = *this * r; }
M &operator/=(const M &r) { return *this = *this / r; }
bool operator==(const M &r) const { return v == r.v; }
M pow(ll n) const {
M x = *this, r = 1;
while (n) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
M inv() const { return pow(MD - 2); }
friend ostream &operator<<(ostream &os, const M &r) { return os << r.v; }
};
using Mint = ModInt<1000000007>;
const double PI = 3.14159265358979323846;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
bool is_prime(long long N) {
if (N == 1)
return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0)
return false;
}
return true;
}
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"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;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
int main(void) { solve(); }
|
#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;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
int main(void) { solve(); }
|
[
"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 ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
string text = "abcdefghijklmnopqrstuvwxyz";
const int maxn = 1e6 + 7;
// .--------------.
// | Try First One|
// '--------------'
// | .--------------.
// | | |
// V V |
// .--------------. |
// | AC. |<---. |
// '--------------' | |
// (True)| |(False) | |
// .--------' | | |
// | V | |
// | .--------------. | |
// | | Try Again |----' |
// | '--------------' |
// | |
// | .--------------. |
// '->| Try Next One |-------'
// '--------------'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
cout << n * (n - 1) / 2;
}
|
#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 ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
string text = "abcdefghijklmnopqrstuvwxyz";
const int maxn = 1e6 + 7;
// .--------------.
// | Try First One|
// '--------------'
// | .--------------.
// | | |
// V V |
// .--------------. |
// | AC. |<---. |
// '--------------' | |
// (True)| |(False) | |
// .--------' | | |
// | V | |
// | .--------------. | |
// | | Try Again |----' |
// | '--------------' |
// | |
// | .--------------. |
// '->| Try Next One |-------'
// '--------------'
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
cout << n * (n - 1) / 2;
}
|
[
"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>>;
int main() {
int N;
cin >> N;
int ans = (N - 1) * N / 2;
cout << ans << endl;
}
|
#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>>;
int main() {
int N;
cin >> N;
ll ans = (ll)(N - 1) * N / 2ll;
cout << ans << endl;
}
|
[
"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<string>>;
using pii = pair<int, int>;
using mii = map<int, int>;
const int INF = 1e9;
const ll LINF = 1e18;
const long double PI = acos(-1.0);
#define MP(a, b) make_pair((a), (b))
#define MT(...) make_tuple(__VA_ARGS__)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SORT(v) sort(ALL(v));
#define RSORT(v) sort(RALL(v));
#define IN(type, a) \
type a; \
cin >> a;
#define VIN(type, a, n) \
vector<type> a(n); \
cin >> a;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define COUT(x) cout << (x) << endl;
#define DCOUT(x, n) cout << fixed << setprecision(n) << (x) << endl;
#define ENDL cout << endl;
#define DB(s, x) cout << (s) << " : " << x << endl;
#define HOGE COUT("HOGE")
template <typename T> inline istream &operator>>(istream &i, vector<T> &v) {
REP(j, sz(v)) i >> v[j];
return i;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
IN(int, n);
COUT(n * (n - 1) / 2);
}
|
#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<string>>;
using pii = pair<int, int>;
using mii = map<int, int>;
const int INF = 1e9;
const ll LINF = 1e18;
const long double PI = acos(-1.0);
#define MP(a, b) make_pair((a), (b))
#define MT(...) make_tuple(__VA_ARGS__)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SORT(v) sort(ALL(v));
#define RSORT(v) sort(RALL(v));
#define IN(type, a) \
type a; \
cin >> a;
#define VIN(type, a, n) \
vector<type> a(n); \
cin >> a;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define COUT(x) cout << (x) << endl;
#define DCOUT(x, n) cout << fixed << setprecision(n) << (x) << endl;
#define ENDL cout << endl;
#define DB(s, x) cout << (s) << " : " << x << endl;
#define HOGE COUT("HOGE")
template <typename T> inline istream &operator>>(istream &i, vector<T> &v) {
REP(j, sz(v)) i >> v[j];
return i;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
IN(ll, n);
COUT(n * (n - 1) / 2);
}
|
[] | 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
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#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
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"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 = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (auto &&i : v)
scanf("%d", &i);
v.emplace_back(INF<int>);
int cur = 0, curr = 0, ans = 0;
while (cur < n) {
if (v[cur] >= v[cur + 1])
cur++, curr++;
else {
ans = curr;
curr = 0;
cur++;
}
}
cout << ans << "\n";
return 0;
}
|
#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 = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (auto &&i : v)
scanf("%d", &i);
v.emplace_back(INF<int>);
int cur = 0, curr = 0, ans = 0;
while (cur < n) {
if (v[cur] >= v[cur + 1])
cur++, curr++;
else {
ans = max(ans, curr);
curr = 0;
cur++;
}
}
cout << ans << "\n";
return 0;
}
|
[
"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<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const vector<ll> four{0, 1, 0, -1, 0};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = (b)-1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(ll a, ll b) {
ll ans = 1;
for (ll i = 1; b; i *= 2) {
if (b & i) {
b ^= i;
ans *= a;
}
a *= a;
}
return ans;
}
template <typename T> inline constexpr bool chmin(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool chmax(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(range(b));
b.erase(unique(range(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(range(b));
b.erase(unique(range(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
inline int scan() { return getchar(); }
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(unsigned &a) { scanf("%u", &a); }
inline void scan(long &a) { scanf("%ld", &a); }
inline void scan(long long &a) { scanf("%lld", &a); }
inline void scan(unsigned long long &a) { scanf("%llu", &a); }
inline void scan(char &a) { cin >> a; }
inline void scan(float &a) { scanf("%f", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(long double &a) { scanf("%Lf", &a); }
inline void scan(vector<bool> &vec) {
for (unsigned i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(string &a) { cin >> a; }
template <class T> inline void scan(vector<T> &vec);
template <class T, size_t size> inline void scan(array<T, size> &vec);
template <class T, class L> inline void scan(pair<T, L> &p);
template <class T, size_t size> inline void scan(T (&vec)[size]);
template <class T> inline void scan(vector<T> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, size_t size> inline void scan(array<T, size> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, class L> inline void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> inline void scan(T (&vec)[size]) {
for (auto &i : vec)
scan(i);
}
template <class T> inline void scan(T &a) { cin >> a; }
inline void in() {}
template <class Head, class... Tail> inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
inline void print() { putchar(' '); }
inline void print(const bool &a) { printf("%d", a); }
inline void print(const int &a) { printf("%d", a); }
inline void print(const unsigned &a) { printf("%u", a); }
inline void print(const long &a) { printf("%ld", a); }
inline void print(const long long &a) { printf("%lld", a); }
inline void print(const unsigned long long &a) { printf("%llu", a); }
inline void print(const char &a) { printf("%c", a); }
inline void print(const char a[]) { printf("%s", a); }
inline void print(const float &a) { printf("%.10f", a); }
inline void print(const double &a) { printf("%.10f", a); }
inline void print(const long double &a) { printf("%.10Lf", a); }
template <class T> void print(const vector<T> &vec);
template <class T, size_t size> void print(const array<T, size> &vec);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> inline void print(const T (&vec)[size]);
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &vec) {
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> inline void print(const T (&vec)[size]) {
print(vec[0]);
for (auto i = vec; ++i != end(vec);) {
putchar(' ');
print(*i);
}
}
template <class T> inline void print(const T &a) { cout << a; }
inline int out() {
putchar('\n');
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
putchar('\n');
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
inline int first(const bool &i) { return out(i ? "first" : "second"); }
inline int yes(const bool &i) { return out(i ? "yes" : "no"); }
inline int Yes(const bool &i) { return out(i ? "Yes" : "No"); }
inline int YES(const bool &i) { return out(i ? "YES" : "NO"); }
inline int Yay(const bool &i) { return out(i ? "Yay!" : ":("); }
inline int Possible(const bool &i) {
return out(i ? "Possible" : "Impossible");
}
inline int POSSIBLE(const bool &i) {
return out(i ? "POSSIBLE" : "IMPOSSIBLE");
}
inline void Case(ll i) { printf("Case #%lld: ", i); }
signed main() {
LL(n);
VEC(ll, a, n);
ll h = LINF, cnt = 0, ans = 0;
each(i, a) {
if (h >= i) {
cnt++;
h = i;
chmax(ans, cnt);
} else {
h = i;
cnt = 1;
}
}
out(ans);
}
|
#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<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const vector<ll> four{0, 1, 0, -1, 0};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = (b)-1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(ll a, ll b) {
ll ans = 1;
for (ll i = 1; b; i *= 2) {
if (b & i) {
b ^= i;
ans *= a;
}
a *= a;
}
return ans;
}
template <typename T> inline constexpr bool chmin(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool chmax(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(range(b));
b.erase(unique(range(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(range(b));
b.erase(unique(range(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
inline int scan() { return getchar(); }
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(unsigned &a) { scanf("%u", &a); }
inline void scan(long &a) { scanf("%ld", &a); }
inline void scan(long long &a) { scanf("%lld", &a); }
inline void scan(unsigned long long &a) { scanf("%llu", &a); }
inline void scan(char &a) { cin >> a; }
inline void scan(float &a) { scanf("%f", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(long double &a) { scanf("%Lf", &a); }
inline void scan(vector<bool> &vec) {
for (unsigned i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(string &a) { cin >> a; }
template <class T> inline void scan(vector<T> &vec);
template <class T, size_t size> inline void scan(array<T, size> &vec);
template <class T, class L> inline void scan(pair<T, L> &p);
template <class T, size_t size> inline void scan(T (&vec)[size]);
template <class T> inline void scan(vector<T> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, size_t size> inline void scan(array<T, size> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, class L> inline void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> inline void scan(T (&vec)[size]) {
for (auto &i : vec)
scan(i);
}
template <class T> inline void scan(T &a) { cin >> a; }
inline void in() {}
template <class Head, class... Tail> inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
inline void print() { putchar(' '); }
inline void print(const bool &a) { printf("%d", a); }
inline void print(const int &a) { printf("%d", a); }
inline void print(const unsigned &a) { printf("%u", a); }
inline void print(const long &a) { printf("%ld", a); }
inline void print(const long long &a) { printf("%lld", a); }
inline void print(const unsigned long long &a) { printf("%llu", a); }
inline void print(const char &a) { printf("%c", a); }
inline void print(const char a[]) { printf("%s", a); }
inline void print(const float &a) { printf("%.10f", a); }
inline void print(const double &a) { printf("%.10f", a); }
inline void print(const long double &a) { printf("%.10Lf", a); }
template <class T> void print(const vector<T> &vec);
template <class T, size_t size> void print(const array<T, size> &vec);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> inline void print(const T (&vec)[size]);
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &vec) {
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> inline void print(const T (&vec)[size]) {
print(vec[0]);
for (auto i = vec; ++i != end(vec);) {
putchar(' ');
print(*i);
}
}
template <class T> inline void print(const T &a) { cout << a; }
inline int out() {
putchar('\n');
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
putchar('\n');
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
inline int first(const bool &i) { return out(i ? "first" : "second"); }
inline int yes(const bool &i) { return out(i ? "yes" : "no"); }
inline int Yes(const bool &i) { return out(i ? "Yes" : "No"); }
inline int YES(const bool &i) { return out(i ? "YES" : "NO"); }
inline int Yay(const bool &i) { return out(i ? "Yay!" : ":("); }
inline int Possible(const bool &i) {
return out(i ? "Possible" : "Impossible");
}
inline int POSSIBLE(const bool &i) {
return out(i ? "POSSIBLE" : "IMPOSSIBLE");
}
inline void Case(ll i) { printf("Case #%lld: ", i); }
signed main() {
LL(n);
VEC(ll, a, n);
ll h = LINF, cnt = 0, ans = 0;
each(i, a) {
if (h >= i) {
cnt++;
h = i;
chmax(ans, cnt);
} else {
h = i;
cnt = 1;
}
}
out(ans - 1);
}
|
[
"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 namespace __gnu_cxx;
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vi = vector<int>;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ld PI = acos(-1);
template <typename T> inline T mini(T &x, T y) { return x = min(x, y); }
template <typename T> inline T maxi(T &x, T y) { return x = max(x, y); }
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
class DModSum {
public:
void solve(std::istream &cin, std::ostream &cout) {
int n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
}
};
int32_t main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
DModSum solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
|
// 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 namespace __gnu_cxx;
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vi = vector<int>;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ld PI = acos(-1);
template <typename T> inline T mini(T &x, T y) { return x = min(x, y); }
template <typename T> inline T maxi(T &x, T y) { return x = max(x, y); }
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
class DModSum {
public:
void solve(std::istream &cin, std::ostream &cout) {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
}
};
int32_t main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
DModSum solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
|
[
"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 &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// const ll INF = 1LL << 60;
// const int INF = 1001001001;
int main(void) {
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#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 &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// const ll INF = 1LL << 60;
// const int INF = 1001001001;
int main(void) {
ll n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
|
[
"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_with_stdio(false);
u64 N;
cin >> N;
cout << N * (N - 1) / 2 - 1 << endl;
return 0;
}
|
#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_with_stdio(false);
u64 N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
return 0;
}
|
[
"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 1000000007
// setprecision(15)
int main() {
ll N;
cin >> N;
ll ans;
if (N == 1) {
ans = 0;
} else {
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 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 1000000007
// setprecision(15)
int main() {
ll N;
cin >> N;
ll ans;
if (N == 1) {
ans = 0;
} else {
ans = (N - 1) * N / 2;
}
cout << ans << endl;
}
|
[
"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 <unordered_set>
#include <utility>
#include <vector>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N;
cin >> N;
ll ans = 0;
ans = ((N - 1) + 1) * (N - 1) / 2;
cout << ans << endl;
}
|
#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 <unordered_set>
#include <utility>
#include <vector>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
const long long INF = 1LL << 60;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll ans = 0;
ans = ((N - 1) + 1) * (N - 1) / 2;
cout << ans << endl;
}
|
[
"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(i, a, n) for (int i = a; i >= n; i--)
#define lrep(i, a, n) for (long int i = a; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
int main() {
int ans = 0;
int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
}
|
#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(i, a, n) for (int i = a; i >= n; i--)
#define lrep(i, a, n) for (long int i = a; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
int main() {
int ans = 0;
long int N;
cin >> N;
cout << (N - 1) * N / 2 << endl;
return 0;
}
|
[
"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
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define fi first
#define se second
using Graph = vector<vector<ll>>;
const ll INF = (1LL << 60);
const double pi = acos(-1.0);
/******************* debug ********************/
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
#define dbg cout << "line : " << __LINE__ << " debug" << endl
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
/****** Template of some basic operations *****/
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = ll> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename F> struct FixPoint : F {
FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args> decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F> inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
/*******************************************************/
/******************** Start coding ! *******************/
int main() {
int n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
}
|
#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
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define fi first
#define se second
using Graph = vector<vector<ll>>;
const ll INF = (1LL << 60);
const double pi = acos(-1.0);
/******************* debug ********************/
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
#define dbg cout << "line : " << __LINE__ << " debug" << endl
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
/****** Template of some basic operations *****/
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = ll> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename F> struct FixPoint : F {
FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args> decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F> inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
/*******************************************************/
/******************** Start coding ! *******************/
int main() {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
}
|
[
"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>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// ===============================================================
// using系
#pragma region header
using namespace std;
using lint = long long;
using ld = long double;
using ulint = unsigned long long;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
constexpr lint mod = 1000000007;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
// ========================================================================
// define
#define INF (lint)10000000000000000;
#define mod (int)1000000007
#pragma region header
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
#pragma endregion
#pragma endregion
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
#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>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// ===============================================================
// using系
#pragma region header
using namespace std;
using lint = long long;
using ld = long double;
using ulint = unsigned long long;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
constexpr lint mod = 1000000007;
constexpr long double pi = 3.141592653589793238462643383279;
#pragma endregion
// ========================================================================
// define
#define INF (lint)10000000000000000;
#define mod (int)1000000007
#pragma region header
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
#pragma endregion
#pragma endregion
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
lint n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
|
[
"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 main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
cout << n * (n - 1) / 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
ll n;
cin >> n;
cout << 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 T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int main() {
int n;
cin >> n;
// 0 <= M < P ということを踏まえてると
// Aを P = A - 1となるようにすれば Pに対するMが全て最大化される
// したがって、1 ~ n - 1の和を求めれば良い
n--;
ll ans = n * (n + 1) / 2;
cout << ans << endl;
}
|
#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 T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int main() {
ll n;
cin >> n;
// 0 <= M < P ということを踏まえてると
// Aを P = A - 1となるようにすれば Pに対するMが全て最大化される
// したがって、1 ~ n - 1の和を求めれば良い
n--;
ll ans = n * (n + 1) / 2;
cout << ans << endl;
}
|
[
"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() {
int n;
cin >> n;
cout << ((1 + n - 1) * (n - 1)) / 2;
}
|
#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() {
ll n;
cin >> n;
cout << ((1 + n - 1) * (n - 1)) / 2;
}
|
[
"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>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
|
#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>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
|
[
"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>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
}
|
#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>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
}
|
[
"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;
while (R < n && s[R - L] == s[R])
R++;
z[i] = R - L;
R--;
} else {
int k = i - L;
if (z[k] < R - i + 1)
z[i] = z[k];
else {
L = i;
while (R < n && s[R - L] == s[R])
R++;
z[i] = R - L;
R--;
}
}
}
int mx = 0;
for (int i = 0; i < n; i++)
mx = max(mx, min(i, z[i]));
return mx;
}
const int mxN = 1e9 + 7;
int main() {
int n;
cin >> n;
n--;
cout << ((n * (n + 1)) / 2);
return 0;
}
|
#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;
while (R < n && s[R - L] == s[R])
R++;
z[i] = R - L;
R--;
} else {
int k = i - L;
if (z[k] < R - i + 1)
z[i] = z[k];
else {
L = i;
while (R < n && s[R - L] == s[R])
R++;
z[i] = R - L;
R--;
}
}
}
int mx = 0;
for (int i = 0; i < n; i++)
mx = max(mx, min(i, z[i]));
return mx;
}
const int mxN = 1e9 + 7;
int main() {
long long n;
cin >> n;
n--;
cout << ((n * (n + 1ll)) / 2ll);
return 0;
}
|
[
"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_prime(int a) {
if (a <= 1)
return false;
for (int i = 2; (int64_t)i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
//順列の全列挙
// vector<int> v(N);
// iota(v.begin(), v.end(), 1); // v に 1, 2, ... N を設定
// do {
// for(auto x : v) cout << x << " "; cout << "\n"; // v の要素を表示
// } while( next_permutation(v.begin(), v.end()) );
int main() {
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#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_prime(int a) {
if (a <= 1)
return false;
for (int i = 2; (int64_t)i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
//順列の全列挙
// vector<int> v(N);
// iota(v.begin(), v.end(), 1); // v に 1, 2, ... N を設定
// do {
// for(auto x : v) cout << x << " "; cout << "\n"; // v の要素を表示
// } while( next_permutation(v.begin(), v.end()) );
int main() {
int64_t n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"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;
//---------------------------------------------------------------------------------------------------
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vll = vector<ll>; // intの1次元の型に vi という別名をつける
using vvll = vector<vll>; // intの2次元の型に vvi という別名をつける
using vs = vector<string>; // stringの1次元の型に vs という別名をつける
using pll =
pair<ll, ll>; // これ以降 pii という型名はpair<ll, ll> と同じ意味で使える
//---------------------------------------------------------------------------------------------------
int main() {
ll n;
cin >> n;
cout << n * (n - 1) * 0.5 << endl;
}
|
#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;
//---------------------------------------------------------------------------------------------------
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vll = vector<ll>; // intの1次元の型に vi という別名をつける
using vvll = vector<vll>; // intの2次元の型に vvi という別名をつける
using vs = vector<string>; // stringの1次元の型に vs という別名をつける
using pll =
pair<ll, ll>; // これ以降 pii という型名はpair<ll, ll> と同じ意味で使える
//---------------------------------------------------------------------------------------------------
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[] | 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 << endl;
}
|
#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 << endl;
}
|
[
"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 <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
using pint = pair<int, int>;
using vec = vector<int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
#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 <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
using pint = pair<int, int>;
using vec = vector<int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
}
|
[
"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 Stream {
public:
Stream() {}
//配列以外の入力を受け取る
void read() {}
template <typename First, typename... Rest>
void read(First &first, Rest &...rest) {
cin >> first;
read(rest...);
}
template <typename T> vector<T> read_vec(size_t n) {
vector<T> tmp(n);
for (size_t i = 0; i < n; i++) {
cin >> tmp[i];
}
return tmp;
}
//配列を区切って出力する
template <typename T> void write_vec(vector<T> &v, char divider) {
for (size_t i = 0; i < v.size(); i++) {
cout << v[i] << divider;
}
}
};
int main() {
Stream io;
int N;
io.read(N);
cout << N * (N - 1) / 2;
return 0;
}
|
#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 Stream {
public:
Stream() {}
//配列以外の入力を受け取る
void read() {}
template <typename First, typename... Rest>
void read(First &first, Rest &...rest) {
cin >> first;
read(rest...);
}
template <typename T> vector<T> read_vec(size_t n) {
vector<T> tmp(n);
for (size_t i = 0; i < n; i++) {
cin >> tmp[i];
}
return tmp;
}
//配列を区切って出力する
template <typename T> void write_vec(vector<T> &v, char divider) {
for (size_t i = 0; i < v.size(); i++) {
cout << v[i] << divider;
}
}
};
int main() {
Stream io;
ll N;
io.read(N);
cout << N * (N - 1) / 2;
return 0;
}
|
[
"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.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var, n) for (int var = 0; var < n; ++var)
#define repi(n) rep(i, n)
#define repj(n) rep(j, n)
#define repi1(n) for (int i = 1; i < n; ++i)
#define repj1(n) for (int j = 1; j < n; ++j)
int _min(int a, int b) { return a <= b ? a : b; }
int _min(ll a, ll b) { return a <= b ? a : b; }
int _max(int a, int b) { return a >= b ? a : b; }
int _max(ll a, ll b) { return a >= b ? a : b; }
void zero(int *data, int n) { memset(data, 0, sizeof(int) * n); }
void zero(ll *data, int n) { memset(data, 0, sizeof(ll) * n); }
void zero(char *data, int n) { memset(data, 0, sizeof(char) * n); }
char readc() {
char var;
fscanf(_fin, "%c", &var);
return var;
}
int readi() {
int var;
fscanf(_fin, "%d", &var);
return var;
}
ll readll() {
ll var;
fscanf(_fin, "%lld", &var);
return var;
}
void repread(int *data, int n) { repi(n) data[i] = readi(); }
void repread(ll *data, int n) { repi(n) data[i] = readll(); }
int reads(char *str, int maxsize) {
for (;;) {
if (fgets(str, maxsize, _fin) == NULL)
break;
if (str[0] != '\n' && str[0] != '\r')
break;
}
int slen = strlen(str);
if (slen == 0)
return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r')
str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout, "%c", var)
#define writecsp(var) fprintf(_fout, "%c ", var)
#define writecln(var) fprintf(_fout, "%c\n", var)
#define writei(var) fprintf(_fout, "%d", var)
#define writeisp(var) fprintf(_fout, "%d ", var)
#define writellsp(var) fprintf(_fout, "%lld ", var)
#define writeiln(var) fprintf(_fout, "%d\n", var)
#define writellln(var) fprintf(_fout, "%lld\n", var)
#define writeulln(var) fprintf(_fout, "%llu\n", var)
#define writefln(var) fprintf(_fout, "%f\n", var)
#define writes(str) fprintf(_fout, "%s", str)
#define writesp() fprintf(_fout, " ")
#define writeln() fprintf(_fout, "\n")
#define iseven(x) ((x & 1) == 0 ? 1 : 0)
#define RUN_LOCAL(testfilename) \
{ \
_fin = fopen(testfilename, "r"); \
if (_fin == NULL) \
_fin = stdin; \
}
#define swap(type, a, b) \
{ \
type t = a; \
a = b; \
b = t; \
}
#define sort(data, n) std::sort(data, data + n)
//#define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b) //what the hell
//is this...
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void reverse(char *data, int n) {
int k = n >> 1;
repi(k) {
char tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
void reverse(int *data, int n) {
int k = n >> 1;
repi(k) {
int tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
#define _Vec(type, name) \
struct name { \
type *data; \
int size; \
int n; \
}; \
void init(name *t, int size) { \
t->data = (type *)malloc(sizeof(type) * size); \
t->size = size; \
t->n = 0; \
} \
void resize(name *t) { \
int ns = t->size * 1.2f; \
t->data = (type *)realloc(t->data, sizeof(type) * ns); \
t->size = ns; \
} \
void add(name *t, type val) { \
if (t->n >= t->size) \
resize(t); \
int k = t->n; \
t->data[k] = val; \
t->n = k + 1; \
} \
void free(name *t) { free(t->data); }
_Vec(int, Veci) _Vec(long long, Vecll) _Vec(char *, Vecs)
#define _ispal(type, name) \
int name(type *a, type *b, int n) { \
repi(n) { \
if (a[i] != b[n - i - 1]) { \
return 0; \
} \
} \
return 1; \
}
_ispal(int, ispali) _ispal(char, ispalc)
#define _Pair(type, name) \
struct name { \
type x, y; \
}; \
int cmp_##name(const void *_a, const void *_b) { \
name *a = (name *)_a; \
name *b = (name *)_b; \
if (a->x == b->x) { \
if (a->y < b->y) \
return -1; \
else \
return 1; \
} \
if (a->x < b->x) \
return -1; \
else \
return 1; \
} \
void sort_##name(name *d, int n) { qsort(d, n, sizeof(name), cmp_##name); }
_Pair(int, Pairi)
int cmp_Str(const void *_a, const void *_b) {
char *a = *((char **)_a);
char *b = *((char **)_b);
return strcmp(a, b);
}
void sort_Str(char **str, int n) { qsort(str, n, sizeof(char *), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (; n;) {
if (n & 1)
ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
//------------------------------------------
//------------
int main() {
RUN_LOCAL("testabc14sssss2E.txt");
int n = readi();
writeiln((n - 1) * n / 2);
return 0;
}
|
/*
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.141592653589793238462643383279502884197169399375105820974
#define ten5p1 100001
#define ten6p1 1000001
#define ten8p1 100000001
#define ten9p1 1000000001
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define rep(var, n) for (int var = 0; var < n; ++var)
#define repi(n) rep(i, n)
#define repj(n) rep(j, n)
#define repi1(n) for (int i = 1; i < n; ++i)
#define repj1(n) for (int j = 1; j < n; ++j)
int _min(int a, int b) { return a <= b ? a : b; }
int _min(ll a, ll b) { return a <= b ? a : b; }
int _max(int a, int b) { return a >= b ? a : b; }
int _max(ll a, ll b) { return a >= b ? a : b; }
void zero(int *data, int n) { memset(data, 0, sizeof(int) * n); }
void zero(ll *data, int n) { memset(data, 0, sizeof(ll) * n); }
void zero(char *data, int n) { memset(data, 0, sizeof(char) * n); }
char readc() {
char var;
fscanf(_fin, "%c", &var);
return var;
}
int readi() {
int var;
fscanf(_fin, "%d", &var);
return var;
}
ll readll() {
ll var;
fscanf(_fin, "%lld", &var);
return var;
}
void repread(int *data, int n) { repi(n) data[i] = readi(); }
void repread(ll *data, int n) { repi(n) data[i] = readll(); }
int reads(char *str, int maxsize) {
for (;;) {
if (fgets(str, maxsize, _fin) == NULL)
break;
if (str[0] != '\n' && str[0] != '\r')
break;
}
int slen = strlen(str);
if (slen == 0)
return 0;
if (str[slen - 1] == '\n' || str[slen - 1] == '\r')
str[--slen] = 0;
return slen;
}
#define writec(var) fprintf(_fout, "%c", var)
#define writecsp(var) fprintf(_fout, "%c ", var)
#define writecln(var) fprintf(_fout, "%c\n", var)
#define writei(var) fprintf(_fout, "%d", var)
#define writeisp(var) fprintf(_fout, "%d ", var)
#define writellsp(var) fprintf(_fout, "%lld ", var)
#define writeiln(var) fprintf(_fout, "%d\n", var)
#define writellln(var) fprintf(_fout, "%lld\n", var)
#define writeulln(var) fprintf(_fout, "%llu\n", var)
#define writefln(var) fprintf(_fout, "%f\n", var)
#define writes(str) fprintf(_fout, "%s", str)
#define writesp() fprintf(_fout, " ")
#define writeln() fprintf(_fout, "\n")
#define iseven(x) ((x & 1) == 0 ? 1 : 0)
#define RUN_LOCAL(testfilename) \
{ \
_fin = fopen(testfilename, "r"); \
if (_fin == NULL) \
_fin = stdin; \
}
#define swap(type, a, b) \
{ \
type t = a; \
a = b; \
b = t; \
}
#define sort(data, n) std::sort(data, data + n)
//#define mod(a,b) b==0 ? 0 : a==0 ? 0 :(a>0 ? a%b : b + a % b) //what the hell
//is this...
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void reverse(char *data, int n) {
int k = n >> 1;
repi(k) {
char tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
void reverse(int *data, int n) {
int k = n >> 1;
repi(k) {
int tmp = data[i];
data[i] = data[n - i - 1];
data[n - i - 1] = tmp;
}
}
#define _Vec(type, name) \
struct name { \
type *data; \
int size; \
int n; \
}; \
void init(name *t, int size) { \
t->data = (type *)malloc(sizeof(type) * size); \
t->size = size; \
t->n = 0; \
} \
void resize(name *t) { \
int ns = t->size * 1.2f; \
t->data = (type *)realloc(t->data, sizeof(type) * ns); \
t->size = ns; \
} \
void add(name *t, type val) { \
if (t->n >= t->size) \
resize(t); \
int k = t->n; \
t->data[k] = val; \
t->n = k + 1; \
} \
void free(name *t) { free(t->data); }
_Vec(int, Veci) _Vec(long long, Vecll) _Vec(char *, Vecs)
#define _ispal(type, name) \
int name(type *a, type *b, int n) { \
repi(n) { \
if (a[i] != b[n - i - 1]) { \
return 0; \
} \
} \
return 1; \
}
_ispal(int, ispali) _ispal(char, ispalc)
#define _Pair(type, name) \
struct name { \
type x, y; \
}; \
int cmp_##name(const void *_a, const void *_b) { \
name *a = (name *)_a; \
name *b = (name *)_b; \
if (a->x == b->x) { \
if (a->y < b->y) \
return -1; \
else \
return 1; \
} \
if (a->x < b->x) \
return -1; \
else \
return 1; \
} \
void sort_##name(name *d, int n) { qsort(d, n, sizeof(name), cmp_##name); }
_Pair(int, Pairi)
int cmp_Str(const void *_a, const void *_b) {
char *a = *((char **)_a);
char *b = *((char **)_b);
return strcmp(a, b);
}
void sort_Str(char **str, int n) { qsort(str, n, sizeof(char *), cmp_Str); }
ll expmod(ll x, ll n, ll m) {
ll ans = 1;
for (; n;) {
if (n & 1)
ans = (ans * x) % m;
x = (x * x) % m;
n >>= 1;
}
return ans;
}
ll combmod(ll n, ll k, ll m) {
ll ret = 1;
ll div = 1;
for (ll i = 0; i < k; ++i) {
ret = (ret * (n - i) % m) % m;
div = (div * (i + 1)) % m;
}
div = expmod(div, m - 2, m) % m;
return (ret * div) % m;
}
//------------------------------------------
//------------
int main() {
RUN_LOCAL("testabc14sssss2E.txt");
ll n = readll();
writellln((n - 1) * n / 2);
return 0;
}
|
[
"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, setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h> // double sqrt
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2;
return 0;
}
|
#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, setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h> // double sqrt
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n;
cin >> n;
cout << (n * (n - 1)) / 2;
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 724,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 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define fo(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define fo(i, n) for (int i = 0; i < n; i++)
int main() {
ll n;
cin >> n;
cout << (n * (n - 1)) / 2 << endl;
return 0;
}
|
[
"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) \
type name; \
cin >> name
using namespace std;
/*
予想と答えをすべて比較するのが最速。O(n)
*/
void A() {
string s, t;
cin >> s >> t;
int answer = 0;
rep(i, s.length()) {
if (s[i] == t[i])
answer++;
}
cout << answer << endl;
}
/*
タップを使うごとにA-1ずつ増える。Bと1の距離をA-1で割った（切り上げ）のが答え。
A,Bの値によらないのでO(1)の解法である。
*/
void B() {
int A, B;
cin >> A >> B;
cout << roundup(B - 1, A - 1) << endl;
}
/*
左から走査することで最大長を求めることができる。最大長を0で初期化し、
左端からスタートする。右に進める限り現在の長さをincrementし、進めなくなったところで最大長を更新する。
そして止まったところからリセットして再開する。これを繰り返すことで最大長を求めることができる。
計算量はO(n)、空間量はO(1)となる。
*/
void C() {
int n;
cin >> n;
int length = 0, max_length = 0;
int prev = 0, current;
rep(i, n) {
cin >> current;
if (prev >= current) {
length++;
} else {
max_length = max(max_length, length);
length = 0;
}
prev = current;
}
max_length = max(max_length, length);
cout << max_length << endl;
}
/*
剰余を最大にするのは、MをM+1で割った場合であるから、
iに対して1つずれた順列を作れば最適である。配列の最後Nについては、
N+1を用意することはできないので、1で剰余を取る（必ず10になる）。
このやり方で和を求めた場合は、1からN-1までの和に等しいので(N-1)(N)/2となる。
->これが最大っていうのはどうわかるの?
*/
void D() {
read(int, n);
cout << (n * (n - 1)) / 2 << endl;
}
int main() { D(); }
|
#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) \
type name; \
cin >> name
using namespace std;
/*
予想と答えをすべて比較するのが最速。O(n)
*/
void A() {
string s, t;
cin >> s >> t;
int answer = 0;
rep(i, s.length()) {
if (s[i] == t[i])
answer++;
}
cout << answer << endl;
}
/*
タップを使うごとにA-1ずつ増える。Bと1の距離をA-1で割った（切り上げ）のが答え。
A,Bの値によらないのでO(1)の解法である。
*/
void B() {
int A, B;
cin >> A >> B;
cout << roundup(B - 1, A - 1) << endl;
}
/*
左から走査することで最大長を求めることができる。最大長を0で初期化し、
左端からスタートする。右に進める限り現在の長さをincrementし、進めなくなったところで最大長を更新する。
そして止まったところからリセットして再開する。これを繰り返すことで最大長を求めることができる。
計算量はO(n)、空間量はO(1)となる。
*/
void C() {
int n;
cin >> n;
int length = 0, max_length = 0;
int prev = 0, current;
rep(i, n) {
cin >> current;
if (prev >= current) {
length++;
} else {
max_length = max(max_length, length);
length = 0;
}
prev = current;
}
max_length = max(max_length, length);
cout << max_length << endl;
}
/*
剰余を最大にするのは、MをM+1で割った場合であるから、
iに対して1つずれた順列を作れば最適である。配列の最後Nについては、
N+1を用意することはできないので、1で剰余を取る（必ず10になる）。
このやり方で和を求めた場合は、1からN-1までの和に等しいので(N-1)(N)/2となる。
->これが最大っていうのはどうわかるの?
*/
void D() {
read(long long, n);
cout << n * (n - 1) / 2 << endl;
}
int main() { D(); }
|
[
"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) \
type name; \
cin >> name
using namespace std;
/*
予想と答えをすべて比較するのが最速。O(n)
*/
void A() {
string s, t;
cin >> s >> t;
int answer = 0;
rep(i, s.length()) {
if (s[i] == t[i])
answer++;
}
cout << answer << endl;
}
/*
タップを使うごとにA-1ずつ増える。Bと1の距離をA-1で割った（切り上げ）のが答え。
A,Bの値によらないのでO(1)の解法である。
*/
void B() {
int A, B;
cin >> A >> B;
cout << roundup(B - 1, A - 1) << endl;
}
/*
左から走査することで最大長を求めることができる。最大長を0で初期化し、
左端からスタートする。右に進める限り現在の長さをincrementし、進めなくなったところで最大長を更新する。
そして止まったところからリセットして再開する。これを繰り返すことで最大長を求めることができる。
計算量はO(n)、空間量はO(1)となる。
*/
void C() {
int n;
cin >> n;
int length = 0, max_length = 0;
int prev = 0, current;
rep(i, n) {
cin >> current;
if (prev >= current) {
length++;
} else {
max_length = max(max_length, length);
length = 0;
}
prev = current;
}
max_length = max(max_length, length);
cout << max_length << endl;
}
/*
剰余を最大にするのは、MをM+1で割った場合であるから、
iに対して1つずれた順列を作れば最適である。配列の最後Nについては、
N+1を用意することはできないので、1で剰余を取る（必ず10になる）。
このやり方で和を求めた場合は、1からN-1までの和に等しいので(N-1)(N)/2となる。
->これが最大っていうのはどうわかるの?
*/
void D() {
read(int, n);
cout << n * (n - 1) / 2 << endl;
}
int main() { D(); }
|
#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) \
type name; \
cin >> name
using namespace std;
/*
予想と答えをすべて比較するのが最速。O(n)
*/
void A() {
string s, t;
cin >> s >> t;
int answer = 0;
rep(i, s.length()) {
if (s[i] == t[i])
answer++;
}
cout << answer << endl;
}
/*
タップを使うごとにA-1ずつ増える。Bと1の距離をA-1で割った（切り上げ）のが答え。
A,Bの値によらないのでO(1)の解法である。
*/
void B() {
int A, B;
cin >> A >> B;
cout << roundup(B - 1, A - 1) << endl;
}
/*
左から走査することで最大長を求めることができる。最大長を0で初期化し、
左端からスタートする。右に進める限り現在の長さをincrementし、進めなくなったところで最大長を更新する。
そして止まったところからリセットして再開する。これを繰り返すことで最大長を求めることができる。
計算量はO(n)、空間量はO(1)となる。
*/
void C() {
int n;
cin >> n;
int length = 0, max_length = 0;
int prev = 0, current;
rep(i, n) {
cin >> current;
if (prev >= current) {
length++;
} else {
max_length = max(max_length, length);
length = 0;
}
prev = current;
}
max_length = max(max_length, length);
cout << max_length << endl;
}
/*
剰余を最大にするのは、MをM+1で割った場合であるから、
iに対して1つずれた順列を作れば最適である。配列の最後Nについては、
N+1を用意することはできないので、1で剰余を取る（必ず10になる）。
このやり方で和を求めた場合は、1からN-1までの和に等しいので(N-1)(N)/2となる。
->これが最大っていうのはどうわかるの?
*/
void D() {
read(long long, n);
cout << n * (n - 1) / 2 << endl;
}
int main() { D(); }
|
[
"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 <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//#define double long double
//#define int long long
//#define int unsigned long long
#define ll long long
#define ld long double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define pd pair<ld, ld>
#define str string
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define vd vector<ld>
#define vs vector<str>
#define vpi vector<pi>
#define vpl vector<pl>
#define vpd vector<pd>
#define si set<int>
#define FF(i, j, n) for (signed i = j; i <= n; i++)
#define DD(i, j, n) for (signed i = j; i >= n; i--)
#define F(i, j, n) for (signed i = j; i < n; i++)
#define D(i, j, n) for (signed i = j; i > n; i--)
#define mem(a, b) memset(a, b, sizeof(a))
#define ndl cout << endl
#define ull unsigned long long
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fLL;
#define sz(x) (signed)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define X first
#define Y second
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int pct(int x) { return __builtin_popcount(x); }
int bit(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int cdiv(int a, int b) {
return a / b + !(a < 0 || a % b == 0);
} // division of a by b rounded up, assumes b > 0
// DEBUG, compile with -DLOCAL
void DBG() { cerr << "]" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
cerr << to_string(h);
if (sizeof...(t))
cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define HERE cout << "===GOTHERE===" << endl
#else
#define dbg(...) 42
#define HERE 42
#endif
/* ============== END OF HEADER ============== */
const int maxn = 1e5 * 3 + 20;
int n, _, q, k;
void solve() {
cin >> n;
cout << n * (n - 1) / 2;
}
signed main() {
// clock_t t1 = clock();
IOS solve();
// cout << "THE ALGORITHM TOOK: " << (clock() - t1) * 1.0 / CLOCKS_PER_SEC *
// 1000 << "ms"<< endl;
return 0;
}
|
#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 <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//#define double long double
#define int long long
//#define int unsigned long long
#define ll long long
#define ld long double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define pd pair<ld, ld>
#define str string
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define vd vector<ld>
#define vs vector<str>
#define vpi vector<pi>
#define vpl vector<pl>
#define vpd vector<pd>
#define si set<int>
#define FF(i, j, n) for (signed i = j; i <= n; i++)
#define DD(i, j, n) for (signed i = j; i >= n; i--)
#define F(i, j, n) for (signed i = j; i < n; i++)
#define D(i, j, n) for (signed i = j; i > n; i--)
#define mem(a, b) memset(a, b, sizeof(a))
#define ndl cout << endl
#define ull unsigned long long
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fLL;
#define sz(x) (signed)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define X first
#define Y second
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int pct(int x) { return __builtin_popcount(x); }
int bit(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int cdiv(int a, int b) {
return a / b + !(a < 0 || a % b == 0);
} // division of a by b rounded up, assumes b > 0
// DEBUG, compile with -DLOCAL
void DBG() { cerr << "]" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
cerr << to_string(h);
if (sizeof...(t))
cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define HERE cout << "===GOTHERE===" << endl
#else
#define dbg(...) 42
#define HERE 42
#endif
/* ============== END OF HEADER ============== */
const int maxn = 1e5 * 3 + 20;
int n, _, q, k;
void solve() {
cin >> n;
cout << n * (n - 1) / 2;
}
signed main() {
// clock_t t1 = clock();
IOS solve();
// cout << "THE ALGORITHM TOOK: " << (clock() - t1) * 1.0 / CLOCKS_PER_SEC *
// 1000 << "ms"<< endl;
return 0;
}
|
[] | 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 namespace std;
int n, m;
int main() {
int i, j;
int ans;
cin >> n;
if (n == 1)
ans = 0;
else if (n == 2)
ans = 1;
else {
ans = (n - 1) * n / 2;
}
cout << ans;
return 0;
}
|
#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 namespace std;
int n, m;
int main() {
int i, j;
ll ans;
cin >> n;
if (n == 1)
ans = 0;
else if (n == 2)
ans = 1;
else {
ans = (ll)(n - 1) * n / 2;
}
cout << ans;
return 0;
}
|
[
"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 argc, const char *argv[]) {
// ABC139 D
int N;
cin >> N;
cout << N * (N - 1) / 2;
}
|
#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 argc, const char *argv[]) {
// ABC139 D
long long N;
cin >> N;
cout << N * (N - 1) / 2;
}
|
[
"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 = N * (N - 1) / 2;
cout << ans << endl;
return 0;
}
|
#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 = N * (N - 1) / 2;
cout << ans << endl;
return 0;
}
|
[
"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.