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 |
|---|---|---|---|---|---|---|---|
p03680 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, i;
int b = 1;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >>... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, i;
int b = 1;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++) {
cin >>... | [
"assignment.change"
] | 1,356,642 | 1,356,641 | u898651494 | cpp |
p03680 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
typedef pai... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
typedef pai... | [
"expression.operation.binary.remove"
] | 1,356,649 | 1,356,650 | u701131323 | cpp |
p03680 | #include <cstdint>
#include <iostream>
using namespace std;
#define SIZE 100000
uint32_t led[SIZE];
bool status[SIZE];
int32_t main() {
uint32_t num;
cin >> num;
for (uint32_t i = 0; i < num; i++) {
status[i] = false;
uint32_t val;
cin >> val;
led[i] = val;
}
uint32_t index = 1;
uint32_... | #include <cstdint>
#include <iostream>
using namespace std;
#define SIZE 100001
static uint32_t led[SIZE];
static bool status[SIZE];
int32_t main() {
uint32_t num;
cin >> num;
for (uint32_t i = 1; i <= num; i++) {
status[i] = false;
uint32_t val;
cin >> val;
led[i] = val;
}
uint32_t index... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.specifier.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.conditio... | 1,356,651 | 1,356,652 | u802614675 | cpp |
p03680 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//---------------------------------------------------------------------------------------------------
/*--------... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//---------------------------------------------------------------------------------------------------
/*--------... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.value.change"
] | 1,356,689 | 1,356,690 | u141378465 | cpp |
p03680 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, t, i, z, k;
int a[100010];
while (scanf("%d", &n) != EOF) {
t = 1;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
z = a[1];
for (i = 1; i < n; i++) {
if (z != 2) {
z = a[z];
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, t, i, z, k;
int a[100010];
while (scanf("%d", &n) != EOF) {
t = 1;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
z = a[1];
for (i = 1; i < n; i++) {
if (z != 2) {
z = a[z];
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,356,693 | 1,356,694 | u926816202 | cpp |
p03680 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, t, i, z, k;
int a[100010];
while (scanf("%d", &n) != EOF) {
t = 1;
for (i = 1; i < n; i++) {
scanf("%d", &a[i]);
}
z = a[1];
for (i = 1; i <= n; i++) {
if (z != 2) {
z = a[z];
... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, t, i, z, k;
int a[100010];
while (scanf("%d", &n) != EOF) {
t = 1;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
z = a[1];
for (i = 1; i < n; i++) {
if (z != 2) {
z = a[z];
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 1,356,695 | 1,356,694 | u926816202 | cpp |
p03680 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, t, i, z, k;
int a[100010];
while (scanf("%d", &n) != EOF) {
t = 1;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
z = a[0];
for (i = 1; i <= n; i++) {
if (z != 2) {
z = a[z];... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, t, i, z, k;
int a[100010];
while (scanf("%d", &n) != EOF) {
t = 1;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
z = a[1];
for (i = 1; i < n; i++) {
if (z != 2) {
z = a[z];
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 1,356,696 | 1,356,694 | u926816202 | cpp |
p03680 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, t, i, z, k;
int a[100010];
while (scanf("%d", &n) != EOF) {
t = 1;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
z = a[0];
for (i = 1; i <= n; i++) {
if (z != 2) {
z = a[z];... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n, t, i, z, k;
int a[100010];
while (scanf("%d", &n) != EOF) {
t = 1;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
z = a[1];
for (i = 1; i <= n; i++) {
if (z != 2) {
z = a[z];... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 1,356,696 | 1,356,697 | u926816202 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define f(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define char_f(i, a) for (int i = (int)(a); (char)s[i] != '\0'; i++)
#define rf(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define llf(i, a, b) ... | #include <bits/stdc++.h>
using namespace std;
#define f(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define char_f(i, a) for (int i = (int)(a); (char)s[i] != '\0'; i++)
#define rf(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define llf(i, a, b) ... | [
"literal.string.change",
"io.output.change"
] | 1,356,727 | 1,356,728 | u290402695 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
long long ans = 1;
if (abs(N - M) > 1)
cout << 5 << endl;
else if (abs(N - M) == 1) {
int X = max(N, M);
int Y = min(N, M);
while (X != 1) {
ans *= X;
ans %= 1000000007;
ans *= Y;
an... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
long long ans = 1;
if (abs(N - M) > 1)
cout << 0 << endl;
else if (abs(N - M) == 1) {
int X = max(N, M);
int Y = min(N, M);
while (X != 1) {
ans *= X;
ans %= 1000000007;
ans *= Y;
an... | [
"literal.number.change",
"io.output.change"
] | 1,356,739 | 1,356,740 | u406634703 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long X = 1000000000 + 7;
vector<long long> table(100009, 0);
int main() {
int n, m;
cin >> n >> m;
if (m - 1 <= n && n <= m + 1) {
table[1] = 1;
rep(i, max(m, n... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long X = 1000000000 + 7;
vector<long long> table(100009, 0);
int main() {
int n, m;
cin >> n >> m;
if (m - 1 <= n && n <= m + 1) {
table[1] = 1;
rep(i, max(m, n... | [
"literal.string.change",
"io.output.change"
] | 1,356,745 | 1,356,746 | u060936992 | cpp |
p03681 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [] | 1,356,753 | 1,356,754 | u631558039 | cpp |
p03681 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,356,755 | 1,356,754 | u631558039 | cpp |
p03681 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int n = M;
int m = M;
int mod = 1000000007;
if (abs(N - M) > 1) {
cout << 0 << endl;
} else {
long a = 1;
while (N--) {
a = a * ... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int n = N;
int m = M;
int mod = 1000000007;
if (abs(N - M) > 1) {
cout << 0 << endl;
} else {
long a = 1;
while (N--) {
a = a * ... | [
"variable_declaration.value.change",
"identifier.change"
] | 1,356,760 | 1,356,761 | u387371565 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i, j, x, m, sum = 1;
cin >> n >> m;
if (abs(n - m) >= 1) {
cout << 0 << endl;
return 0;
}
for (i = 1; i <= n; i++) {
sum *= i;
sum %= 1000000007;
}
for (i = 1; i <= m; i++) {
sum *= i;
sum %= 1000... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i, j, x, m, sum = 1;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 << endl;
return 0;
}
for (i = 1; i <= n; i++) {
sum *= i;
sum %= 1000000007;
}
for (i = 1; i <= m; i++) {
sum *= i;
sum %= 10000... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,356,767 | 1,356,768 | u863370423 | cpp |
p03681 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
ll list[max(n, m) + 1];
list[1] = 1;
list[0] = 1;
for (int i = 0; i < max(n, m); i++) {
list[i + 1] = (list[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int INF = 1000000009;
int mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
ll list[max(n, m) + 1];
list[1] = 1;
list[0] = 1;
for (int i = 0; i < max(n, m); i++) {
list[i + 1] = (list[i... | [
"control_flow.branch.if.condition.change"
] | 1,356,769 | 1,356,770 | u924451152 | cpp |
p03681 | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | // _/ _/ _/_/_/ _/
//_/_/_/_/ _/_/ _/_/_/_/ _/_/ _/ _/_/
// _/ _/ _/ _/ _/ _/ _/_/_/ _/
//_/ _/ _/ _/ _/ _/ _/ _/ _/
// _/_/ _/_/ _/_/ _/_/ _/_/ _/
#include <algorithm>
#include <cmath>
#include <iomanip>
#in... | [
"literal.number.change",
"io.output.change"
] | 1,356,779 | 1,356,780 | u401900157 | cpp |
p03681 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,356,787 | 1,356,788 | u263933075 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define MAX 5100000
#define MOD 1000000007
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) { // nのbitと...00001を比較 nが2で割り切れるならtrue
res = (res * a) % mod;
}
a = (a * a) % mod;
n >>= 1;
}
... | #include <bits/stdc++.h>
using namespace std;
#define MAX 5100000
#define MOD 1000000007
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) { // nのbitと...00001を比較 nが2で割り切れるならtrue
res = (res * a) % mod;
}
a = (a * a) % mod;
n >>= 1;
}
... | [
"control_flow.branch.if.condition.change"
] | 1,356,789 | 1,356,790 | u630211216 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (i = 0; i < n; i++)
#define REPR(i, n) for (i = n; i >= 0; i--)
#define FOR(i, m, n) for (i = m; i < n; i++)
#define MOD 1000000007
using nam... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (i = 0; i < n; i++)
#define REPR(i, n) for (i = n; i >= 0; i--)
#define FOR(i, m, n) for (i = m; i < n; i++)
#define MOD 1000000007
using nam... | [
"expression.operation.binary.add"
] | 1,356,797 | 1,356,798 | u768152935 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | [
"variable_declaration.type.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,356,811 | 1,356,810 | u832995587 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | [
"literal.number.type.widen.change"
] | 1,356,812 | 1,356,810 | u832995587 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
const ll mod = 1000000007LL;
if (1 < abs(n - m)) {
cout << 0 << end... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
const ll mod = 1000000007LL;
if (1 < abs(n - m)) {
cout << 0 << end... | [
"expression.operation.binary.add"
] | 1,356,817 | 1,356,818 | u828388155 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
#define MOD 1000000007
long long fact(long long x) {
long long r = 1;
for (long long i = 1; i <= x; i++) {
r = (r * x) % MOD;
}
return (r % MOD);
}
int main() {
long long m, d;
cin >> m >> d;
if (abs(... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
#define MOD 1000000007
long long fact(long long x) {
long long r = 1;
for (long long i = 1; i <= x; i++) {
r = (r * i) % MOD;
}
return (r % MOD);
}
int main() {
long long m, d;
cin >> m >> d;
if (abs(... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,356,821 | 1,356,822 | u407355496 | cpp |
p03681 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP2(i, x, n) for (int i = x; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
static const int INF... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP2(i, x, n) for (int i = x; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
static const int INF... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,356,849 | 1,356,850 | u849151695 | cpp |
p03681 |
// Problem : C - Reconciled?
// Contest : AtCoder - AtCoder Beginner Contest 065
// URL : https://atcoder.jp/contests/abc065/tasks/arc076_a
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣶⡾⠏⠉⠙⠳⢦⡀⠀⠀⠀
⠀⠀⠀⣴⠿⠏⠀⠀⠀⠀⠀⠀⢳⡀⠀
⠀⠀⢠⣟⣋⡀... |
// Problem : C - Reconciled?
// Contest : AtCoder - AtCoder Beginner Contest 065
// URL : https://atcoder.jp/contests/abc065/tasks/arc076_a
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣶⡾⠏⠉⠙⠳⢦⡀⠀⠀⠀
⠀⠀⠀⣴⠿⠏⠀⠀⠀⠀⠀⠀⢳⡀⠀
⠀⠀⢠⣟⣋⡀... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,356,861 | 1,356,862 | u197541395 | cpp |
p03681 |
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | [
"control_flow.return.add"
] | 1,356,863 | 1,356,864 | u126859973 | cpp |
p03681 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
vector<int> x(10000);
int main() {
int N, M;
cin >> N >> M;
ll ans = 1;
if (N == M + 1 || N + 1 == M) {
for (int i = N; i >= 1; i--) {
ans *= i;
if (ans >= 10... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
vector<int> x(10000);
int main() {
int N, M;
cin >> N >> M;
ll ans = 1;
if (N == M + 1 || N + 1 == M) {
for (int i = N; i >= 1; i--) {
ans *= i;
if (ans >= 10... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,356,880 | 1,356,881 | u629548179 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, M;
cin >> N >> M;
if (abs(N - M) > 1) {
cout << 0 << endl;
return 0;
}
int INF = 1e9 + 7;
int ans = 1;
if (abs(N - M) == 0) {
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= INF;
}
fo... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, M;
cin >> N >> M;
if (abs(N - M) > 1) {
cout << 0 << endl;
return 0;
}
int INF = 1e9 + 7;
int ans = 1;
if (abs(N - M) == 0) {
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= INF;
}
f... | [
"expression.operator.change"
] | 1,356,886 | 1,356,887 | u237390401 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, M;
cin >> N >> M;
if (abs(N - M) > 1) {
cout << 0 << endl;
}
int INF = 1e9 + 7;
int ans = 1;
if (abs(N - M) == 0) {
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= INF;
}
for (int i = 1; ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, M;
cin >> N >> M;
if (abs(N - M) > 1) {
cout << 0 << endl;
return 0;
}
int INF = 1e9 + 7;
int ans = 1;
if (abs(N - M) == 0) {
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= INF;
}
f... | [
"control_flow.return.add",
"control_flow.return.0.add",
"expression.operator.change"
] | 1,356,888 | 1,356,887 | u237390401 | cpp |
p03681 | #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, M;
cin >> N >> M;
ll mod = 1;
rep(i, N... | #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, M;
cin >> N >> M;
ll mod = 1;
rep(i, N... | [
"assignment.change"
] | 1,356,905 | 1,356,906 | u054729397 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
const long double PI = acos(-1);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll GetDigit(ll num) { return lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
const long double PI = acos(-1);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll GetDigit(ll num) { return lo... | [
"expression.operation.binary.add"
] | 1,356,913 | 1,356,914 | u167755809 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const LL mod = 1000000007;
int main() {
LL N, M;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const LL mod = 1000000007;
int main() {
int N, M;
cin >>... | [
"variable_declaration.type.change"
] | 1,356,919 | 1,356,920 | u240685518 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const LL mod = 1000000007;
int main() {
int N, M;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const LL mod = 1000000007;
int main() {
int N, M;
cin >>... | [
"assignment.change"
] | 1,356,921 | 1,356,920 | u240685518 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long calc(long long a) {
long long ans = 1;
for (long long i = a; i > 1; i--) {
ans *= a;
ans %= mod;
}
return ans;
}
int main() {
long long a, b;
cin >> a >> b;
if (abs(a - b) > 1) {
cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long calc(long long a) {
long long ans = 1;
for (long long i = a; i > 1; i--) {
ans *= i;
ans %= mod;
}
return ans;
}
int main() {
long long a, b;
cin >> a >> b;
if (abs(a - b) > 1) {
cout << 0 << endl;
... | [
"assignment.value.change",
"identifier.change"
] | 1,356,926 | 1,356,927 | u480831358 | cpp |
p03681 | #include <algorithm>
#include <iostream>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
long long ans = 1;
if (abs(n - m) >= 0 && abs(n - m) <= 1) {
for (int i = n; !(i == 1); i--) {
ans *= (i % mod);
ans %= mod;
}
for (int i = m; !(i == m); i--) {
... | #include <algorithm>
#include <iostream>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
long long ans = 1;
if (abs(n - m) >= 0 && abs(n - m) <= 1) {
for (int i = n; !(i == 1); i--) {
ans *= (i % mod);
ans %= mod;
}
for (int i = m; !(i == 1); i--) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,356,933 | 1,356,934 | u633402865 | cpp |
p03681 | #include <algorithm>
#include <iostream>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
long long ans = 1;
if (abs(n - m) >= 0 && abs(n - m) <= 1) {
for (int i = n; !(i == 1); i--) {
ans *= (i % mod);
ans %= mod;
}
for (int i = m; !(i == m); i++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
long long ans = 1;
if (abs(n - m) >= 0 && abs(n - m) <= 1) {
for (int i = n; !(i == 1); i--) {
ans *= (i % mod);
ans %= mod;
}
for (int i = m; !(i == 1); i--) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,356,935 | 1,356,934 | u633402865 | cpp |
p03681 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define rep(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define rep(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
... | [
"assignment.value.change",
"assignment.change"
] | 1,356,949 | 1,356,950 | u850516963 | cpp |
p03681 | #include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (abs(n - m) >= 2)
cout << 0 << endl;
if (n == m) {
long long ans = 1;
for (long long i = n; i >= 1; i--)
ans = ans * i % 1000000007;
cout << ans * ans * 2 % 1000000007;
}
if (abs(m - n) == 1) {
... | #include <iostream>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (abs(n - m) >= 2)
cout << 0 << endl;
if (n == m) {
long long ans = 1;
for (long long i = n; i >= 1; i--)
ans = ans * i % 1000000007;
cout << ans * ans * 2 % 1000000007;
}
if (abs(m - n) == 1) {
... | [
"expression.operation.binary.remove"
] | 1,356,979 | 1,356,980 | u238205921 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
long long int factorial(long long int N) {
for (int i = N - 1; 1 < i; i--) {
N *= i;
}
return N;
// 1000000007
}
int main() {
long long int N, M;
cin >> N >> M;
if (1 < abs(N - M)) {
cout << "0" << endl;
} else if (abs(N - M) == 1) {
cout << f... | #include <bits/stdc++.h>
using namespace std;
long long int factorial(long long int N) {
for (int i = N - 1; 1 < i; i--) {
N *= i;
N %= 1000000007;
}
return N;
// 1000000007
}
int main() {
long long int N, M;
cin >> N >> M;
if (1 < abs(N - M)) {
cout << "0" << endl;
} else if (abs(N - M) ... | [
"assignment.add"
] | 1,357,005 | 1,357,006 | u926416331 | cpp |
p03681 | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define reverse(x) reverse(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;
ll dp[100005], n, m;
int ... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define reverse(x) reverse(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;
ll dp[300005], n, m;
int ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,357,020 | 1,357,021 | u580061629 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define line cout << "\n";
#define fast \
ios_base ::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define line cout << "\n";
#define fast \
ios_base ::sync_with_stdio(false); \
cin.tie(0); ... | [
"expression.operation.binary.remove"
] | 1,357,035 | 1,357,036 | u389438219 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long MOD = 1000000007;
long long N, M;
cin >> N >> M;
int diff = abs(N - M);
if (diff > 1) {
cout << 0 << endl;
exit(0);
}
if (N == M) {
long long ans = 1;
for (int i = 0; i < N; ++i) {
ans = ans * (i + 1) % MOD;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long MOD = 1000000007;
long long N, M;
cin >> N >> M;
int diff = abs(N - M);
if (diff > 1) {
cout << 0 << endl;
exit(0);
}
if (N == M) {
long long ans = 1;
for (int i = 0; i < N; ++i) {
ans = ans * (i + 1) % MOD;
}... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,357,037 | 1,357,038 | u701527888 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int facctorialMethod(int k) {
ll sum = 1;
for (int i = 1; i <= k; ++i) {
sum = (sum % (1000000000 + 7)) * (i % (1000000000 + 7));
}
return sum % (1000000000 + 7);
}
int main() {
int n, m;
ll ans = 0;
cin >> n >> m;
ll N, M;
N... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int facctorialMethod(int k) {
ll sum = 1;
for (int i = 1; i <= k; ++i) {
sum = (sum % (1000000000 + 7)) * (i % (1000000000 + 7));
}
return sum % (1000000000 + 7);
}
int main() {
int n, m;
ll ans = 0;
cin >> n >> m;
ll N, M;
N... | [
"literal.number.change",
"assignment.value.change"
] | 1,357,043 | 1,357,044 | u919919068 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
const long num = 1000000007;
long long ans = 0;
int i;
if (abs(n - m) <= 1) {
ans = 1;
for (i = 1; i <= n; i++) {
ans *= i;
ans = ans % num;
}
for (i = 1; i <= m; i++) {
ans *= i;
ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
const long num = 1000000007;
long long ans = 0;
int i;
if (abs(n - m) <= 1) {
ans = 1;
for (i = 1; i <= n; i++) {
ans *= i;
ans = ans % num;
}
for (i = 1; i <= m; i++) {
ans *= i;
ans ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,357,072 | 1,357,073 | u523698212 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 << endl;
return 0;
}
int nr = 1, mr = 1;
// n!
for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 << endl;
return 0;
}
ll nr = 1, mr = 1;
// n!
for (int i = 1; i <= n; i++)
... | [
"variable_declaration.type.change"
] | 1,357,076 | 1,357,077 | u650236619 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 << endl;
return 0;
}
int nr = 1, mr = 1;
// n!
for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 << endl;
return 0;
}
ll nr = 1, mr = 1;
// n!
for (int i = 1; i <= n; i++)
... | [
"variable_declaration.type.change"
] | 1,357,078 | 1,357,077 | u650236619 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define MOD 1000000007
#define all(c) c.begin(), c.end()
#define rep(i, s, e) for (auto i = s; i < e; i++)
#define peek(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define MOD 1000000007
#define all(c) c.begin(), c.end()
#define rep(i, s, e) for (auto i = s; i < e; i++)
#define peek(v) \
for (auto i : v) ... | [
"variable_declaration.type.change",
"assignment.change"
] | 1,357,085 | 1,357,086 | u493278617 | cpp |
p03681 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,357,087 | 1,357,088 | u942085302 | cpp |
p03681 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
if (n - m > 1 || m - n > 1) {
cout << 0 << endl;
return 0;
} else {
ll ans = 1;
for (ll i = 2; i <= n; i++) {
ans = (ans * i) % 100000... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
if (n - m > 1 || m - n > 1) {
cout << 0 << endl;
return 0;
} else {
ll ans = 1;
for (ll i = 2; i <= n; i++) {
ans = (ans * i) % 100000... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,357,106 | 1,357,107 | u553123421 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
ll ans = 1;
if (abs(N - M) >= 2)
cout << 0 << endl;
else {
for (int i = N; i ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
ll ans = 1;
if (abs(N - M) >= 2)
cout << 0 << endl;
else {
for (int i = N; i ... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 1,357,111 | 1,357,112 | u475843109 | cpp |
p03681 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
const int MOD = 1000000007;
const int MAX = 200000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
// n= 200000までのやつ
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
const int MOD = 1000000007;
const int MAX = 200000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
// n= 200000までのやつ
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1... | [
"variable_declaration.type.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,357,117 | 1,357,116 | u233586402 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,357,127 | 1,357,128 | u093973314 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (2 <= abs(N - M))
cout << 0 << endl;
else {
if (N != M) {
long long ans = 1;
for (long long i = 1; i <= N; i++)
ans = (i * ans) % 1000000007;
for (long long i = 1; i <= M; i++)
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (2 <= abs(N - M))
cout << 0 << endl;
else {
if (N != M) {
long long ans = 1;
for (long long i = 1; i <= N; i++)
ans = (i * ans) % 1000000007;
for (long long i = 1; i <= M; i++)
ans = ... | [] | 1,357,139 | 1,357,140 | u101018317 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long mul_mod(long long x, long long y, long long mod) {
return (x * y) % mod;
}
long long factorial_mod(long long a, long long mod) {
long long ans = 1;
for (int i = 2; i <= a; i++) {
ans = mul_mod(ans, i, mod);
}
return ans;
}
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long mul_mod(long long x, long long y, long long mod) {
return (x * y) % mod;
}
long long factorial_mod(long long a, long long mod) {
long long ans = 1;
for (int i = 2; i <= a; i++) {
ans = mul_mod(ans, i, mod);
}
return ans;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,156 | 1,357,157 | u618697411 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long mul_mod(long long x, long long y, long long mod) {
return (x * y) % mod;
}
long long factorial_mod(long long a, long long mod) {
long long ans = 1;
for (int i = 2; i <= a; i++) {
ans = mul_mod(ans, i, mod);
}
return ans;
}
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long mul_mod(long long x, long long y, long long mod) {
return (x * y) % mod;
}
long long factorial_mod(long long a, long long mod) {
long long ans = 1;
for (int i = 2; i <= a; i++) {
ans = mul_mod(ans, i, mod);
}
return ans;
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,158 | 1,357,157 | u618697411 | cpp |
p03681 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[114514];
signed main() {
int n, m;
cin >> n >> m;
a[1] = 1;
a[2] = 2;
for (int i = 3; i < 114514; i++) {
a[i] = (a[i - 1] * i) % 100000007;
}
if (abs(n - m) > 1) {
cout << 0 << endl;
} else if (abs(n - m) == 1) {
cout ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[114514];
signed main() {
int n, m;
cin >> n >> m;
a[1] = 1;
a[2] = 2;
for (int i = 3; i < 114514; i++) {
a[i] = (a[i - 1] * i) % 1000000007;
}
if (abs(n - m) > 1) {
cout << 0 << endl;
} else if (abs(n - m) == 1) {
cout... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,357,169 | 1,357,170 | u942393279 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define double long double
#define pi 3.141592653589
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define double long double
#define pi 3.141592653589
using namespace std;
... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change",
"call.arguments.add"
] | 1,357,173 | 1,357,174 | u971256474 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long int n, m, ans = 1;
cin >> n >> m;
if (n == m) {
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= 1000000007;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long int n, m, ans = 1;
cin >> n >> m;
if (n == m) {
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= 1000000007;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,357,175 | 1,357,176 | u019356802 | cpp |
p03681 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uns... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uns... | [
"control_flow.break.add"
] | 1,357,179 | 1,357,180 | u507693948 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef vector<ll> Vi;
typedef vector<Vi> VVi;
const double EPS = (1e-7);
const ll INF = (1e13);
const double PI = (acos(-1));
const ll MOD = ll(1e9) + 7;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
typedef vector<ll> Vi;
typedef vector<Vi> VVi;
const double EPS = (1e-7);
const ll INF = (1e13);
const double PI = (acos(-1));
const ll MOD = ll(1e9) + 7;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n... | [
"assignment.change"
] | 1,357,183 | 1,357,184 | u820560680 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define int ll
#define MOD 1000000007
int rec(int n) {
if (n == 1)
return 1;
return ((n % MOD) * (rec(n - 1) % MOD)) % MOD;
}
signed main() {
cin.tie(0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define int ll
#define MOD 1000000007
int rec(int n) {
if (n == 1)
return 1;
return ((n % MOD) * (rec(n - 1) % MOD)) % MOD;
}
signed main() {
cin.tie(0... | [
"expression.operation.binary.remove"
] | 1,357,208 | 1,357,209 | u310101703 | cpp |
p03681 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int modulo = 1000000007; // 10^9 + 7
// 自分のパソコンだと実行できない
// なぜ？
// メモリを使いすぎ？
// 階乗はforloopにすべき
// 階乗
ll factorial(int ... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int modulo = 1000000007; // 10^9 + 7
// 階乗
ll factorial(int N) {
ll ans = 1;
for (int i = 1; i <= N; i++) {
an... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"assignment.change"
] | 1,357,210 | 1,357,211 | u774652316 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans, o = 1, p = 1, mod = 1000000007;
int n, m;
scanf("%d %d", &n, &m);
if (abs(n - m) > 1) {
printf("0\n");
} else {
for (int i = 1; i <= min(n, m); i++) {
o *= i;
p *= i;
o %= mod;
p %= mod;
}
if (ab... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans, o = 1, p = 1, mod = 1000000007;
int n, m;
scanf("%d %d", &n, &m);
if (abs(n - m) > 1) {
printf("0\n");
} else {
for (int i = 1; i <= min(n, m); i++) {
o *= i;
p *= i;
o %= mod;
p %= mod;
}
if (ab... | [] | 1,357,218 | 1,357,219 | u123756661 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define INF int(1e9)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RE... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define INF int(1e9)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RE... | [
"call.add",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 1,357,220 | 1,357,221 | u136378781 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
uint64_t mod = 1000000000 + 7;
uint64_t factorial(uint64_t v) {
uint64_t ans = 1;
for (uint64_t i = 1; i <= v; ++i) {
ans *= i;
ans %= mod;
}
return ans;
}
uint32_t check(uint64_t n, uint6... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
uint64_t mod = 1000000000 + 7;
uint64_t factorial(uint64_t v) {
uint64_t ans = 1;
for (uint64_t i = 1; i <= v; ++i) {
ans *= i;
ans %= mod;
}
return ans;
}
uint32_t check(int64_t n, int64_... | [
"variable_declaration.type.primitive.change"
] | 1,357,231 | 1,357,232 | u100280611 | cpp |
p03681 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
uint64_t mod = 1000000000 + 7;
uint64_t factorial(uint64_t v) {
uint64_t ans = 1;
for (uint32_t i = 1; i <= v; ++i) {
ans *= i;
ans %= mod;
}
return ans;
}
uint32_t check(uint64_t n, uint6... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
uint64_t mod = 1000000000 + 7;
uint64_t factorial(uint64_t v) {
uint64_t ans = 1;
for (uint64_t i = 1; i <= v; ++i) {
ans *= i;
ans %= mod;
}
return ans;
}
uint32_t check(int64_t n, int64_... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change"
] | 1,357,233 | 1,357,232 | u100280611 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define Would
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define Would
#d... | [
"assignment.value.change"
] | 1,357,234 | 1,357,235 | u096883693 | cpp |
p03681 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | [
"control_flow.branch.if.condition.change"
] | 1,357,238 | 1,357,239 | u142878260 | cpp |
p03681 | #include <bits/stdc++.h>
const long long int MOD = 1e9 + 7;
using namespace std;
int res_factorial;
long long int factorial(int n) {
long long int res = 1;
for (int i = 1; i <= n; i++) {
res *= i;
res %= MOD;
}
return res;
}
int main() {
long long int n, m;
long long int ans = 0;
cin >> n >> m;
... | #include <bits/stdc++.h>
const long long int MOD = 1e9 + 7;
using namespace std;
int res_factorial;
long long int factorial(int n) {
long long int res = 1;
for (int i = 1; i <= n; i++) {
res *= i;
res %= MOD;
}
return res;
}
int main() {
long long int n, m;
long long int ans = 0;
cin >> n >> m;
... | [
"expression.operation.binary.add"
] | 1,357,262 | 1,357,263 | u245414044 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
const ll mod = 1e9 + 7;
int main() {
ll n, m, ans = 1;
cin >> n >> m;
if (n - m >= 2)
cout << 0 << endl;
else {
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= mod;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
const ll mod = 1e9 + 7;
int main() {
ll n, m, ans = 1;
cin >> n >> m;
if (abs(n - m) >= 2)
cout << 0 << endl;
else {
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= mod;
... | [
"control_flow.branch.if.condition.change"
] | 1,357,264 | 1,357,265 | u207048881 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
const ll mod = 1e9 + 7;
int main() {
ll n, m, ans = 1;
cin >> n >> m;
if (n - m >= 2)
cout << 0 << endl;
else {
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= mod;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
const ll mod = 1e9 + 7;
int main() {
ll n, m, ans = 1;
cin >> n >> m;
if (abs(n - m) >= 2)
cout << 0 << endl;
else {
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= mod;
... | [
"control_flow.branch.if.condition.change"
] | 1,357,266 | 1,357,265 | u207048881 | cpp |
p03681 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a ... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,357,271 | 1,357,272 | u096717230 | cpp |
p03681 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"expression.operation.binary.remove"
] | 1,357,273 | 1,357,272 | u096717230 | cpp |
p03681 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,357,274 | 1,357,272 | u096717230 | cpp |
p03681 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | [
"literal.number.type.widen.change"
] | 1,357,276 | 1,357,277 | u508571192 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | [
"control_flow.branch.if.condition.change"
] | 1,357,280 | 1,357,281 | u509680664 | cpp |
p03681 | #include <iostream>
#define M 1000000007L
long n, m;
long f(long x) { return x - 1 ? x * f(x - 1) : 1; }
main() {
std::cin >> n >> m;
std::cout << f(n) * f(m) * ((abs(n - m) < 2) + (n == m)) % M;
} | #include <iostream>
#define M 1000000007L
long n, m;
long f(long x) { return x - 1 ? x * f(x - 1) % M : 1; }
main() {
std::cin >> n >> m;
std::cout << f(n) * f(m) * ((abs(n - m) < 2) + (n == m)) % M;
} | [
"expression.operation.binary.add"
] | 1,357,291 | 1,357,292 | u601082779 | cpp |
p03681 | #include <iostream>
#define M 1000000007L
long n, m;
long f(long x) { return x - 1 ? x * f(x - 1) : 1; }
main() {
std::cin >> n >> m;
std::cout << f(n) * f(m) % M * ((abs(n - m) < 2) + (n == m));
} | #include <iostream>
#define M 1000000007L
long n, m;
long f(long x) { return x - 1 ? x * f(x - 1) % M : 1; }
main() {
std::cin >> n >> m;
std::cout << f(n) * f(m) * ((abs(n - m) < 2) + (n == m)) % M;
} | [
"expression.operation.binary.remove"
] | 1,357,293 | 1,357,292 | u601082779 | cpp |
p03681 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
if (abs(N - M) >= 2) {
cout << 0 << endl;
return 0;
} else {
long long na = 1;
long long ma = 1;
for (long long i = 1; i <= N; i++)
na = na * i ... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < n; i++)
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
if (abs(N - M) >= 2) {
cout << 0 << endl;
return 0;
} else {
long long na = 1;
long long ma = 1;
for (long long i = 1; i <= N; i++)
na = na * i ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 1,357,300 | 1,357,301 | u452655263 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int mod = pow(10, 9) + 7;
int N, M;
cin >> N >> M;
long long ans = 1;
if (abs(N - M) > 1)
cout << 0 << endl;
else if (N == M) {
for (int i = 1; i <= N; i++) {
ans = (ans * i) % mod;
}
for (int j = 1; j <= M; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int mod = pow(10, 9) + 7;
int N, M;
cin >> N >> M;
long long ans = 1;
if (abs(N - M) > 1)
cout << 0 << endl;
else if (N == M) {
for (int i = 1; i <= N; i++) {
ans = (ans * i) % mod;
}
for (int j = 1; j <= M; j++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,306 | 1,357,307 | u052332717 | cpp |
p03681 | #include <iostream>
using namespace std;
long long abs(long long x, long long y) {
long c;
if (x >= y) {
c = x - y;
} else {
c = y - x;
}
return c;
}
long long Fac(long long n) {
int rep = 1;
for (int i = 1; i <= n; i++) {
rep = rep * i;
rep = rep % 1000000007;
}
return rep;
}
int... | #include <iostream>
using namespace std;
long long abs(long long x, long long y) {
long long c;
if (x >= y) {
c = x - y;
} else {
c = y - x;
}
return c;
}
long long Fac(long long n) {
long long rep = 1;
for (long long i = 1; i <= n; i++) {
rep = rep * i;
rep = rep % 1000000007;
}
r... | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 1,357,308 | 1,357,309 | u904123392 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 1;
return 0;
}
long long int ans = 1;
for (int i = 1; i <= n; i++) {
ans = (ans * i) % MOD;
}
for (int i = 1; i <= m; i++) {
ans = (ans * i... | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0;
return 0;
}
long long int ans = 1;
for (int i = 1; i <= n; i++) {
ans = (ans * i) % MOD;
}
for (int i = 1; i <= m; i++) {
ans = (ans * i... | [
"literal.number.change",
"io.output.change"
] | 1,357,314 | 1,357,315 | u110464018 | cpp |
p03681 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
long long A, B, ans = 1;
int main() {
cin >> A >> B;
if (abs(A - B) > 1) {
cout << endl;
return 0;
}
if (A == B)
ans *= 2;
for (int i = 1; i <= A; i++)
ans = ans * i % mod;
for (int i = 1; i <= B; i++)
ans = ans * i % ... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
long long A, B, ans = 1;
int main() {
cin >> A >> B;
if (abs(A - B) > 1) {
cout << 0 << endl;
return 0;
}
if (A == B)
ans *= 2;
for (int i = 1; i <= A; i++)
ans = ans * i % mod;
for (int i = 1; i <= B; i++)
ans = ans *... | [
"io.output.change"
] | 1,357,331 | 1,357,332 | u398834439 | cpp |
p03681 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
long long A, B, ans = 1;
int main() {
cin >> A >> B;
if (abs(A - B) > 1) {
cout << endl;
return 0;
}
if (A == B)
ans *= 2;
for (int i = 1; i <= A; i++)
ans = ans * i % mod;
for (int i = 1; i <= B; i++)
ans = ans * i % ... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
long long A, B, ans = 1;
int main() {
cin >> A >> B;
if (abs(A - B) > 1) {
cout << 0 << endl;
return 0;
}
if (A == B)
ans *= 2;
for (int i = 1; i <= A; i++)
ans = ans * i % mod;
for (int i = 1; i <= B; i++)
ans = ans *... | [
"io.output.change"
] | 1,357,334 | 1,357,332 | u398834439 | cpp |
p03681 | #include <iostream>
using namespace std;
int64_t mod_fact(int64_t n) {
int64_t fact(1);
for (int64_t i = 1; i <= n; i++) {
fact *= i;
fact %= 1'000'000'007;
}
return fact;
}
int main() {
int64_t n, m;
cin >> n >> m;
int64_t ans(0);
if ((n > m ? n : m) - (n <= m ? n : m) > 1)
ans = 0;
ans... | #include <iostream>
using namespace std;
int64_t mod_fact(int64_t n) {
int64_t fact(1);
for (int64_t i = 1; i <= n; i++) {
fact *= i;
fact %= 1'000'000'007;
}
return fact;
}
int main() {
int64_t n, m;
cin >> n >> m;
int64_t ans(0);
if ((n > m ? n : m) - (n <= m ? n : m) > 1)
ans = 0;
els... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,357,335 | 1,357,336 | u081445141 | cpp |
p03681 | #include <iostream>
using namespace std;
long long int factorial(long long int);
int main() {
int n, m;
cin >> n >> m;
if (n - m == 0) {
cout << (2 * factorial(n) * factorial(m)) % 1000000007 << endl;
} else if (n - m == 1 || n - m == -1) {
cout << (factorial(n) * factorial(m)) % 1000000007 << endl;
}... | #include <iostream>
using namespace std;
long long int factorial(long long int);
int main() {
int n, m;
cin >> n >> m;
if (n - m == 0) {
cout << (2 * factorial(n) * factorial(m)) % 1000000007 << endl;
} else if (n - m == 1 || n - m == -1) {
cout << (factorial(n) * factorial(m)) % 1000000007 << endl;
}... | [
"assignment.change"
] | 1,357,351 | 1,357,352 | u848736574 | cpp |
p03681 | #include <iostream>
using namespace std;
int factorial(long long int);
int main() {
int n, m;
cin >> n >> m;
if (n - m == 0) {
cout << (2 * factorial(n) * factorial(m)) % 1000000007 << endl;
} else if (n - m == 1 || n - m == -1) {
cout << (factorial(n) * factorial(m)) % 1000000007 << endl;
} else {
... | #include <iostream>
using namespace std;
long long int factorial(long long int);
int main() {
int n, m;
cin >> n >> m;
if (n - m == 0) {
cout << (2 * factorial(n) * factorial(m)) % 1000000007 << endl;
} else if (n - m == 1 || n - m == -1) {
cout << (factorial(n) * factorial(m)) % 1000000007 << endl;
}... | [
"assignment.change"
] | 1,357,353 | 1,357,352 | u848736574 | cpp |
p03681 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define int long long
int inf = (1LL << 62);
using namespace st... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define int long long
int inf = (1LL << 62);
using namespace st... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,357,358 | 1,357,359 | u179987763 | cpp |
p03681 | #include <algorithm>
#include <algorithm>
#include <ctype.h>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define INF 0x3f3f3f3f
#define FAST_IO ios::s... | #include <algorithm>
#include <algorithm>
#include <ctype.h>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define INF 0x3f3f3f3f
#define FAST_IO ios::s... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 1,357,395 | 1,357,396 | u516665253 | cpp |
p03681 | #include <algorithm>
#include <array>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <type_traits>
template <typename R = std::uint64_t, typename T, typename U>
static inline typename std::common_type<R, T, U>::type modfact(T n,
U mod) ... | #include <algorithm>
#include <array>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <type_traits>
template <typename R = std::uint64_t, typename T, typename U>
static inline typename std::common_type<R, T, U>::type modfact(T n,
U mod) ... | [] | 1,357,399 | 1,357,400 | u350906518 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1000000007;
ll facctoria(ll k) {
ll mol = 1;
for (ll i = 1; i <= k; ++i) {
mol *= i;
mol %= mod;
}
return mol;
}
int main() {
ll n, m;
cin >> n >> m;
ll N = facctoria(n) % mod;
ll M = facctoria(m) % mod;
if (abs... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1000000007;
ll facctoria(ll k) {
ll mol = 1;
for (int i = 1; i <= k; ++i) {
mol *= i;
mol %= mod;
}
return mol;
}
int main() {
ll n, m;
cin >> n >> m;
ll N = facctoria(n) % mod;
ll M = facctoria(m) % mod;
if (ab... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,357,403 | 1,357,404 | u592099403 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1000000007;
ll facctoria(ll k) {
ll mol = 1;
for (ll i = 1; i <= k; ++i) {
mol *= i;
mol %= mod;
}
return mol;
}
int main() {
ll n, m;
cin >> n >> m;
ll N = facctoria(n) % mod;
ll M = facctoria(m) % mod;
if (abs... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1000000007;
ll facctoria(ll k) {
ll mol = 1;
for (ll i = 1; i <= k; ++i) {
mol *= i;
mol %= mod;
}
return mol;
}
int main() {
ll n, m;
cin >> n >> m;
ll N = facctoria(n) % mod;
ll M = facctoria(m) % mod;
if (abs... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,357,403 | 1,357,405 | u592099403 | cpp |
p03681 | #include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
ll num = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
ll N = 1, M = 1;
for (int i = 1; i <= n; i++) {
N *= i;
N %= num;
}
for (int i = 1; i <= m; i++) {
M *= i;
M %= num;
}
if (n == m)
cout << N * M ... | #include <cmath>
#include <iostream>
using namespace std;
using ll = long long;
ll num = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
ll N = 1, M = 1;
for (int i = 1; i <= n; i++) {
N *= i;
N %= num;
}
for (int i = 1; i <= m; i++) {
M *= i;
M %= num;
}
if (n == m)
cout << N * M ... | [
"expression.operation.binary.add"
] | 1,357,412 | 1,357,413 | u394482932 | cpp |
p03681 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define Rep(i, n) for (int i = 0; i <= (int)(n - 1); i++)
typedef long long ll;
typedef unsigned l... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define Rep(i, n) for (int i = 0; i <= (int)(n - 1); i++)
typedef long long ll;
typedef unsigned l... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,357,432 | 1,357,433 | u297045966 | cpp |
p03681 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define Rep(i, n) for (int i = 0; i <= (int)(n - 1); i++)
typedef long long ll;
typedef unsigned l... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define Rep(i, n) for (int i = 0; i <= (int)(n - 1); i++)
typedef long long ll;
typedef unsigned l... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,357,434 | 1,357,433 | u297045966 | cpp |
p03681 | #include <algorithm>
#include <iostream>
#define MOD 1000000007
using namespace std;
int N, M;
long long permutation(int num) {
long long a = 1;
for (int i = 1; i <= num; i++)
a = a * i % MOD;
return a;
}
void solve() {
if (abs(N - M) > 1) {
cout << 0 << endl;
return;
}
long long ans = perm... | #include <algorithm>
#include <iostream>
#define MOD 1000000007
using namespace std;
int N, M;
long long permutation(int num) {
long long a = 1;
for (int i = 1; i <= num; i++)
a = a * i % MOD;
return a;
}
void solve() {
if (abs(N - M) > 1) {
cout << 0 << endl;
return;
}
long long ans = perm... | [
"assignment.value.change",
"assignment.change"
] | 1,357,435 | 1,357,436 | u307037394 | cpp |
p03681 | #include <algorithm>
#include <cstdio>
#include <functional>
#define NN 1000000007
using namespace std;
int main(void) {
int i, j, n, m;
long long x;
scanf("%d %d", &n, &m);
if (n < m)
swap(n, m);
else {
if (n - m > 1)
x = 0;
x = 1;
for (i = 2; i <= n; i++) {
x = (x * i) % NN;
... | #include <algorithm>
#include <cstdio>
#include <functional>
#define NN 1000000007
using namespace std;
int main(void) {
int i, j, n, m;
long long x;
scanf("%d %d", &n, &m);
if (n < m)
swap(n, m);
if (n - m > 1)
x = 0;
else {
x = 1;
for (i = 2; i <= n; i++) {
x = (x * i) % NN;
}
... | [
"control_flow.branch.else.add"
] | 1,357,461 | 1,357,462 | u296610335 | cpp |
p03681 | #include <cstdint>
#include <iostream>
using namespace std;
#define DIV 1000000007
#define SIZE 10001
long long facts[10001];
long long fact(uint64_t n) {
long long val = 1;
for (uint32_t i = 1; i <= n; i++) {
val *= i;
}
return val;
}
int32_t main() {
uint64_t n, m;
cin >> n >> m;
if (n == m) {... | #include <cstdint>
#include <iostream>
using namespace std;
#define DIV 1000000007
#define SIZE 10001
long long facts[10001];
long long fact(uint64_t n) {
long long val = 1;
for (uint32_t i = 1; i <= n; i++) {
val *= i;
val %= DIV;
}
return val;
}
int32_t main() {
uint64_t n, m;
cin >> n >> m;
... | [
"assignment.add"
] | 1,357,465 | 1,357,466 | u802614675 | cpp |
p03681 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long q(long long n) {
if (n == 0) {
return 1;
} else {
return (n * q(n - 1)) % mod;
}
}
int main() {
long long a, b;
long long m, n;
long long t;
scanf("%lld %lld", &a, &b);
m = q(a) % mod;
n = q(b) % mod;
if (a - b... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long q(long long n) {
if (n == 0) {
return 1;
} else {
return (n * q(n - 1)) % mod;
}
}
int main() {
long long a, b;
long long m, n;
long long t;
scanf("%lld %lld", &a, &b);
m = q(a) % mod;
n = q(b) % mod;
if (a - b... | [
"literal.number.change",
"io.output.change"
] | 1,357,471 | 1,357,472 | u962598225 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.