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 |
|---|---|---|---|---|---|---|---|
p03679 | #include <bits/stdc++.h>
#define F(i, l, r) for (long long i = l; i <= r; ++i)
#define REP(i, r) for (int i = 0; i < (int)r; ++i)
#define Fr(i, l, r) for (long long i = l; i >= r; --i)
#define RP (i, u) for (i = u - 1; i >= 0; --i)
#define pb push_back
#define X first
#define Y second
#define mk make_pair
#define sz si... | #include <bits/stdc++.h>
#define F(i, l, r) for (long long i = l; i <= r; ++i)
#define REP(i, r) for (int i = 0; i < (int)r; ++i)
#define Fr(i, l, r) for (long long i = l; i >= r; --i)
#define RP (i, u) for (i = u - 1; i >= 0; --i)
#define pb push_back
#define X first
#define Y second
#define mk make_pair
#define sz si... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,904 | 1,357,905 | u680097146 | cpp |
p03679 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define MOD (1000000000 + 7)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll x, a, b;
cin >> x >> a >> b;
if (x + a <= b) {
cout << "dangerous" << endl;
return 0;
}
if (b <= a) {
cout << "... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define MOD (1000000000 + 7)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll x, a, b;
cin >> x >> a >> b;
if (x + a < b) {
cout << "dangerous" << endl;
return 0;
}
if (b <= a) {
cout << "d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,906 | 1,357,907 | u683044142 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
long long x, a, b;
int main() {
scanf("%lld%lld%lld", &x, &a, &b);
if (b >= x + a + 1)
printf("dangerous\n");
else {
if (x - a == b)
printf("delicious\n");
else
printf("safe\n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
long long x, a, b;
int main() {
scanf("%lld%lld%lld", &x, &a, &b);
if (b >= x + a + 1)
printf("dangerous\n");
else {
if (a >= b)
printf("delicious\n");
else
printf("safe\n");
... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,910 | 1,357,911 | u154273313 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a < 0)
cout << "delicious" << endl;
else if (b - a <= x)
cout << "safe" << endl;
else if (b - a > x)
cout << "dangerous" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a <= 0)
cout << "delicious" << endl;
else if (b - a <= x)
cout << "safe" << endl;
else if (b - a > x)
cout << "dangerous" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,912 | 1,357,913 | u376444088 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
long long int x, a, b;
cin >> x >> a >> b;
if (b - a < 0) {
cout << "delicious" << endl;
} else {
if (b - a <= x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
}
} | #include <iostream>
using namespace std;
int main() {
long long int x, a, b;
cin >> x >> a >> b;
if (b - a <= 0) {
cout << "delicious" << endl;
} else {
if (b - a <= x) {
cout << "safe" << endl;
} else {
cout << "dangerous" << endl;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,914 | 1,357,915 | u232829151 | cpp |
p03679 | #include <stdio.h>
int main(void) {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (a > b) {
printf("delicious\n");
return 0;
} else if (a + x > b) {
printf("safe\n");
return 0;
}
printf("dangerous\n");
return 0;
} | #include <stdio.h>
int main(void) {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (a >= b) {
printf("delicious\n");
return 0;
} else if (a + x >= b) {
printf("safe\n");
return 0;
}
printf("dangerous\n");
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,918 | 1,357,919 | u186693730 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
int t = B - A;
if (t <= 0)
cout << "delicitous" << endl;
else if (t <= X)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
int t = B - A;
if (t <= 0)
cout << "delicious" << endl;
else if (t <= X)
cout << "safe" << endl;
else
cout << "dangerous" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,357,930 | 1,357,931 | u637269150 | cpp |
p03679 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define ll long long
#define ull unsigned long ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define ll long long
#define ull unsigned long ... | [
"control_flow.branch.if.condition.change"
] | 1,357,932 | 1,357,933 | u159695843 | cpp |
p03679 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define ll long long
#define ull unsigned long ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define ll long long
#define ull unsigned long ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,934 | 1,357,933 | u159695843 | cpp |
p03679 | // This file is a "Hello, world!" in C++ language by GCC for wandbox.
#include <iostream>
int main() {
int X, A, B;
std::cin >> X;
std::cin >> A;
std::cin >> B;
if (B - A < 0) {
std::cout << "delicious" << std::endl;
} else if (B - A <= X) {
std::cout << "safe" << std::endl;
} else {
std::co... |
#include <iostream>
int main() {
int X, A, B;
std::cin >> X;
std::cin >> A;
std::cin >> B;
if (B - A <= 0) {
std::cout << "delicious" << std::endl;
} else if (B - A <= X) {
std::cout << "safe" << std::endl;
} else {
std::cout << "dangerous" << std::endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,943 | 1,357,944 | u249453101 | cpp |
p03679 | #include "bits/stdc++.h"
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (-a + b > x)
cout << "dangerous";
else if (b <= a)
cout << "delicous";
else
cout << "safe";
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (-a + b > x)
cout << "dangerous";
else if (b <= a)
cout << "delicious";
else
cout << "safe";
}
| [
"literal.string.change",
"io.output.change"
] | 1,357,945 | 1,357,946 | u400235146 | cpp |
p03679 | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
long long int x, a, b, y;
cin >> x >> a >> b;
y = a - b;
if (y > 0) {
cout << "delicious" << endl;
return 0;
}
y = 0 - y;
if (x > y) {
cout << "safe" << endl;
} else {
cout << "dangerous" ... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
long long int x, a, b, y;
cin >> x >> a >> b;
y = a - b;
if (y >= 0) {
cout << "delicious" << endl;
return 0;
}
y = 0 - y;
if (x >= y) {
cout << "safe" << endl;
} else {
cout << "dangerous... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,947 | 1,357,948 | u708637230 | cpp |
p03679 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int x, a, b;
cin >> x >> a >> b;
if (a - b > 0) {
cout << "delicious";
return 0;
} else {
int diff = b - a;
if (diff > x) {
cout << "dangerous";
} else
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int x, a, b;
cin >> x >> a >> b;
if (a - b >= 0) {
cout << "delicious";
return 0;
} else {
int diff = b - a;
if (diff > x) {
cout << "dangerous";
} else
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,951 | 1,357,952 | u745865391 | cpp |
p03679 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
using ll = long long;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a - b > 0)
cout << "delicious" << endl;
else if (b - a <= x + 1)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
using ll = long long;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a - b >= 0)
cout << "delicious" << endl;
else if (b - a <= x)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,955 | 1,357,956 | u704411633 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a > x) {
cout << "dangerous" << endl;
} else if (b - a < x) {
cout << "delicious" << endl;
} else {
cout << "safe" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a > x) {
cout << "dangerous" << endl;
} else if (b <= a) {
cout << "delicious" << endl;
} else {
cout << "safe" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,957 | 1,357,958 | u127194462 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a > x) {
cout << "dangerous" << endl;
} else if (b - a < 0) {
cout << "delicious" << endl;
} else {
cout << "safe" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (b - a > x) {
cout << "dangerous" << endl;
} else if (b <= a) {
cout << "delicious" << endl;
} else {
cout << "safe" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,959 | 1,357,958 | u127194462 | cpp |
p03679 | #include <stdio.h>
int main() {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (b - a < 0)
printf("delicious\n");
else if (b - a < x)
printf("safe\n");
else
printf("dangerous\n");
return 0;
} | #include <stdio.h>
int main() {
int x, a, b;
scanf("%d %d %d", &x, &a, &b);
if (b - a <= 0)
printf("delicious\n");
else if (b - a <= x)
printf("safe\n");
else
printf("dangerous\n");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,960 | 1,357,961 | u371668760 | cpp |
p03679 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll x, a, b;
cin >> x >> a >> b;
if (x < b - a) {
cout << "dangerous" << endl;
} else if (b < a) {
cout << "delicious" << endl;
} else if (b - a <= x && b - a >= 0) {
cout << "safe" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll x, a, b;
cin >> x >> a >> b;
if (x < b - a) {
cout << "dangerous" << endl;
} else if (b <= a) {
cout << "delicious" << endl;
} else if (b - a <= x && b - a > 0) {
cout << "safe" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,962 | 1,357,963 | u182281036 | cpp |
p03679 | #include <stdio.h>
int main() {
long long x, a, b;
while (scanf("%lld %lld %lld", &x, &a, &b) != EOF) {
if (b - a < 0)
printf("delicious\n");
else if (b - a <= x)
printf("safe\n");
else
printf("dangerous\n");
}
return 0;
} | #include <stdio.h>
int main() {
long long x, a, b;
while (scanf("%lld %lld %lld", &x, &a, &b) != EOF) {
if (b - a <= 0)
printf("delicious\n");
else if (b - a <= x)
printf("safe\n");
else
printf("dangerous\n");
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,357,968 | 1,357,969 | u947238359 | cpp |
p03679 | #include <iostream>
using namespace std;
int main(void) {
int x, a, b;
cin >> x >> a >> b;
int d = b - a;
if (d < 0) {
cout << "delicious" << endl;
} else {
if (d >= x) {
cout << "dengerous" << endl;
} else {
cout << "safe" << endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int x, a, b;
cin >> x >> a >> b;
int d = b - a;
if (d <= 0) {
cout << "delicious" << endl;
} else {
if (d > x) {
cout << "dangerous" << endl;
} else {
cout << "safe" << endl;
}
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,357,973 | 1,357,971 | u998741086 | cpp |
p03679 | #include <iostream>
using namespace std;
int main(void) {
int x, a, b;
cin >> x >> a >> b;
int d = b - a;
if (d < 0) {
cout << "delicious" << endl;
} else {
if (d > x) {
cout << "dengerous" << endl;
} else {
cout << "safe" << endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int x, a, b;
cin >> x >> a >> b;
int d = b - a;
if (d <= 0) {
cout << "delicious" << endl;
} else {
if (d > x) {
cout << "dangerous" << endl;
} else {
cout << "safe" << endl;
}
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,357,974 | 1,357,971 | u998741086 | cpp |
p03679 | #include <iostream>
using namespace std;
int main(void) {
int x, a, b;
cin >> x >> a >> b;
int d = b - a;
if (d <= 0) {
cout << "delicious" << endl;
} else {
if (d >= x) {
cout << "dengerous" << endl;
} else {
cout << "safe" << endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int x, a, b;
cin >> x >> a >> b;
int d = b - a;
if (d <= 0) {
cout << "delicious" << endl;
} else {
if (d > x) {
cout << "dangerous" << endl;
} else {
cout << "safe" << endl;
}
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,357,975 | 1,357,971 | u998741086 | cpp |
p03679 | /*
なせば大抵なんとかなる！
*/
#define VERNIY \
st(); \
int ver = 0, niy = 0, hbk = 0
#include <algorithm>
#include <ctype.h>
#include <float.h>
#include <functional>
#include <iostream>
... | /*
なせば大抵なんとかなる！
*/
#define VERNIY \
st(); \
int ver = 0, niy = 0, hbk = 0
#include <algorithm>
#include <ctype.h>
#include <float.h>
#include <functional>
#include <iostream>
... | [
"control_flow.branch.if.condition.change"
] | 1,357,987 | 1,357,988 | u676654593 | cpp |
p03679 | #include <iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x < y) {
cout << "dangerous" << endl;
} else if (x >= y + z) {
cout << "delicious" << endl;
} else {
cout << "safe" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if (x < z - y) {
cout << "dangerous" << endl;
} else if (y >= z) {
cout << "delicious" << endl;
} else {
cout << "safe" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,357,995 | 1,357,996 | u994767958 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int x, a, b;
int main() {
while (scanf("%d %d %d", &x, &a, &b) != EOF) {
if (x > b)
printf("delicious\n");
else {
if (a <= x)
printf("safe\n");
else
printf("dan... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int x, a, b;
int main() {
while (scanf("%d %d %d", &x, &a, &b) != EOF) {
if (a >= b)
printf("delicious\n");
else {
if (b - a <= x)
printf("safe\n");
else
printf... | [
"control_flow.branch.if.condition.change"
] | 1,357,997 | 1,357,998 | u990753715 | cpp |
p03679 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int x, a, b;
int main() {
while (scanf("%d %d %d", &x, &a, &b) != EOF) {
if (x >= b)
printf("delicious\n");
else {
if (a <= x)
printf("safe\n");
else
printf("da... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int x, a, b;
int main() {
while (scanf("%d %d %d", &x, &a, &b) != EOF) {
if (a >= b)
printf("delicious\n");
else {
if (b - a <= x)
printf("safe\n");
else
printf... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,357,999 | 1,357,998 | u990753715 | cpp |
p03682 | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | [
"assignment.variable.change",
"identifier.change"
] | 1,358,012 | 1,358,013 | u961136005 | cpp |
p03682 | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,358,036 | 1,358,037 | u892687772 | cpp |
p03682 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,358,043 | 1,358,044 | u612271542 | cpp |
p03682 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,358,043 | 1,358,045 | u612271542 | cpp |
p03682 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,358,058 | 1,358,059 | u508571192 | cpp |
p03680 | #include <iostream>
#include <vector>
using namespace std;
struct X {
int id;
bool pushFlag;
X(int _id, bool _pushFlag) {
id = _id;
pushFlag = _pushFlag;
}
};
int main(int argc, char *argv[]) {
int N;
cin >> N;
int i;
vector<X> A;
int a1;
for (i = 0; i < N; i++) {
cin >> a1;
A.push_b... | #include <iostream>
#include <vector>
using namespace std;
struct X {
int id;
bool pushFlag;
X(int _id, bool _pushFlag) {
id = _id;
pushFlag = _pushFlag;
}
};
int main(int argc, char *argv[]) {
int N;
cin >> N;
int i;
vector<X> A;
int a1;
for (i = 0; i < N; i++) {
cin >> a1;
A.push_b... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,358,125 | 1,358,126 | u875570028 | cpp |
p03680 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int execute(int i, int a[]) { return a[i]; }
int main() {
int n;
int a[100000];
int b;
int i;
int count = 0;
int count2 = 1;
int t;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 2... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int execute(int i, int a[]) { return a[i]; }
int main() {
int n;
int a[100000];
int b;
int i;
int count = 0;
int count2 = 1;
int t;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 2... | [
"control_flow.return.add",
"control_flow.return.0.add",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,358,139 | 1,358,138 | u315339674 | cpp |
p03680 | #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n + 1];
for (i = 1; i < n; i++) {
cin >> a[i];
}
i = 1;
for (int cnt = 1; cnt < n + 2; cnt++) {
if (i == 2) {
cout << cnt << endl;
return 0;
}
i = a[i];
}
cout << -1 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n + 1];
for (i = 1; i < n + 1; i++) {
cin >> a[i];
}
i = 1;
for (int cnt = 0; cnt < n + 1; cnt++) {
if (i == 2) {
cout << cnt << endl;
return 0;
}
i = a[i];
}
cout << -1 << endl;
return 0;
}... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,358,147 | 1,358,148 | u356069145 | cpp |
p03680 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
typedef unsigned long long LL;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a;
a.push_back(0);
for (int i = 0; i < N; i++) {
int tmp;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
typedef unsigned long long LL;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a;
a.push_back(0);
for (int i = 0; i < N; i++) {
int tmp;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,358,149 | 1,358,150 | u285975384 | cpp |
p03680 | #include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
/*
*▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀
* ▀▀ ▀▀▀▀▀▀ ▀ ▀▀▀▀▀▀ ▀ ▀
* ▀ ▀ ▀ ▀ ▀ ▀ ▀
* ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀
* ▀ ▀▀▀▀ ▀ ▀ ▀ ▀ ▀
... | #include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
/*
*▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀
* ▀▀ ▀▀▀▀▀▀ ▀ ▀▀▀▀▀▀ ▀ ▀
* ▀ ▀ ▀ ▀ ▀ ▀ ▀
* ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀
* ▀ ▀▀▀▀ ▀ ▀ ▀ ▀ ▀
... | [
"expression.operation.binary.remove"
] | 1,358,152 | 1,358,153 | u654605759 | cpp |
p03680 | // Written by Zhu Zeqi
// Come on,baby
// Hack,please
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#inc... | // Written by Zhu Zeqi
// Come on,baby
// Hack,please
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#inc... | [
"expression.operation.binary.add"
] | 1,358,156 | 1,358,157 | u466062134 | cpp |
p03680 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, j = 0, now = 0;
cin >> n;
int a[n];
for (int i = 1; i < n + 1; i++)
cin >> a[i];
now = a[1];
if (now == 2) {
cout << "-1" << endl;
j = 1;
return 0;
}
for (int i = 1; i < n; i++) {
now = a[now];
if (now == 2) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, j = 0, now = 0;
cin >> n;
int a[n];
for (int i = 1; i < n + 1; i++)
cin >> a[i];
now = a[1];
if (now == 2) {
cout << "1" << endl;
j = 1;
return 0;
}
for (int i = 1; i < n; i++) {
now = a[now];
if (now == 2) {
... | [
"literal.string.change",
"io.output.change"
] | 1,358,164 | 1,358,165 | u740813127 | cpp |
p03680 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = -1;
int i = 1;
for (int j = 1; j < N; j++) {
i = a[i - 1];
if (i == 2) {
ans = j;
}
}
cout << ans << endl;
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = -1;
int i = 1;
for (int j = 1; j <= N; j++) {
i = a[i - 1];
if (i == 2) {
ans = j;
break;
}
}
cout << ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,358,184 | 1,358,185 | u265700560 | cpp |
p03681 | #include <bits/stdc++.h>
#define D 1000000007
using namespace std;
using ull = unsigned long long;
ull func(ull x) {
if (x == 1 || x == 0)
return 1;
else {
return x * func(x - 1);
}
}
int main() {
ull n, m;
cin >> n >> m;
ull ans = 0;
ull n_func = 1, m_func = 1;
if (n - m > 1 || m - n > 1) {
... | #include <bits/stdc++.h>
#define D 1000000007
using namespace std;
using ull = long long;
ull func(ull x) {
if (x == 1 || x == 0)
return 1;
else {
return x * func(x - 1);
}
}
int main() {
ull n, m;
cin >> n >> m;
ull ans = 0;
ull n_func = 1, m_func = 1;
if (n - m > 1 || m - n > 1) {
cout <<... | [
"variable_declaration.type.narrow.change"
] | 1,358,207 | 1,358,208 | u277318398 | cpp |
p03681 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
if (n - m != 0 && n - m != -1 && n - m != 1)
cout << 0 << endl;
ll sn = 1, sm = 1;
if (n - m == 0) {
rep(i, n) {
s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
if (n - m != 0 && n - m != -1 && n - m != 1)
cout << 0 << endl;
ll sn = 1, sm = 1;
if (n - m == 0) {
rep(i, n) {
s... | [
"expression.operation.binary.remove"
] | 1,358,213 | 1,358,214 | u211503916 | cpp |
p03682 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define int long long
const int CN = 1e6 + 5;
int read() {
int s = 0, ne = 1;
char c = getchar();
while (c < '0' || c > '9')
ne = c == '-' ? -1 : 1, c = getchar();
while (c >... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
#define int long long
const int CN = 1e6 + 5;
int read() {
int s = 0, ne = 1;
char c = getchar();
while (c < '0' || c > '9')
ne = c == '-' ? -1 : 1, c = getchar();
while (c >... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,358,224 | 1,358,225 | u896820793 | cpp |
p03682 | //#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#... | //#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 1,358,264 | 1,358,265 | u519460014 | cpp |
p03683 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, s, e) for (int i = s; i >= e; i--)
#define reps(i, s, e) for (int i = s; i < e; i++)
#define inf 1e18
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x) x.size()
#define ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, s, e) for (int i = s; i >= e; i--)
#define reps(i, s, e) for (int i = s; i < e; i++)
#define inf 1e18
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x) x.size()
#define ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,358,285 | 1,358,286 | u026620445 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
// vector<ll> G[550010];
// vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
// vector<ll> G[550010];
// vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,358,287 | 1,358,288 | u399527088 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
// vector<ll> G[550010];
// vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
// vector<ll> G[550010];
// vector<P> tree[500010];
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,358,289 | 1,358,288 | u399527088 | cpp |
p03683 | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll factorial(int n) {
ll res = 1;
rep(i, 1, n + 1) res = (res * (ll)i) % MOD;
return res;
}
int main() {
int n, m;
cin >> n >> m;
ll ans;
if (abs(n - m) > ... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
ll factorial(int n) {
ll res = 1;
rep(i, 1, n + 1) res = (res * (ll)i) % MOD;
return res;
}
int main() {
int n, m;
cin >> n >> m;
ll ans;
if (abs(n - m) > ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,358,290 | 1,358,291 | u052247353 | cpp |
p03683 | #include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
typedef long long lint;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
int fac[N];
namespace utils {
template <class T> inline void apn(T &x, const T y) { x > y ? x = y : 0; }
template <class T> inline void apx(T &x, const T y) { x < y ? x = ... | #include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
typedef long long lint;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
int fac[N];
namespace utils {
template <class T> inline void apn(T &x, const T y) { x > y ? x = y : 0; }
template <class T> inline void apx(T &x, const T y) { x < y ? x = ... | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 1,358,296 | 1,358,297 | u379976159 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
int main() {
const long wa = 1000000007;
int N, M;
cin >> N >> M;
if (abs(N - M) > 1)
cout << 0;
else {
long mat = 1;
for (long i = 1; i < N + 1; i++) {
mat *= i;
mat = mat % wa;
}
for (long i = 1; i < M + 1; i++) {
mat *= i;... | #include <bits/stdc++.h>
using namespace std;
int main() {
const long wa = 1000000007;
int N, M;
cin >> N >> M;
if (abs(N - M) > 1)
cout << 0;
else {
long mat = 1;
for (long i = 1; i < N + 1; i++) {
mat *= i;
mat = mat % wa;
}
for (long i = 1; i < M + 1; i++) {
mat *= i;... | [
"assignment.add"
] | 1,358,300 | 1,358,301 | u593555034 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
ll fact(ll num) {
if (num == 1)
return 1;
else
return ll(num * (fact(num - 1) % ll(1e9 + 7))) % ll(1e9 + 7);
}
int main() {
ll n, m;
cin >> n >> m;
if (n > m)
swap(n, m);
if (m - n > 1)
cout << 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
ll fact(ll num) {
if (num == 1)
return 1;
else
return ll(num * (fact(num - 1) % ll(1e9 + 7))) % ll(1e9 + 7);
}
int main() {
ll n, m;
cin >> n >> m;
if (n > m)
swap(n, m);
if (m - n > 1)
cout << 0... | [
"identifier.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,358,306 | 1,358,307 | u630664279 | cpp |
p03683 | #include <iostream>
#include <stdlib.h>
using namespace std;
long Factorial(int k);
int main() {
long long n, m, ans = 0;
cin >> n >> m;
if (abs(n - m) >= 2) {
ans = 0;
} else if (abs(n - m) == 1) {
ans = Factorial(n) % 1000000007 * Factorial(m) % 1000000007;
} else if (n == m) {
ans = 2 * Facto... | #include <iostream>
#include <stdlib.h>
using namespace std;
long Factorial(int k);
int main() {
long n, m, ans = 0;
cin >> n >> m;
if (abs(n - m) >= 2) {
ans = 0;
} else if (abs(n - m) == 1) {
ans = (Factorial(n) % 1000000007) * Factorial(m) % 1000000007;
} else if (n == m) {
ans = 2 * (Factori... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change"
] | 1,358,310 | 1,358,311 | u821416900 | cpp |
p03683 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
long long ans1 = 1, ans2 = 1;
if (abs(N - M) >= 2) {
cout << '0' << endl;
return 0;
}
for (int i = 1; i <= N; i++) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
long long ans1 = 1, ans2 = 1;
if (abs(N - M) >= 2) {
cout << '0' << endl;
return 0;
}
for (int i = 1; i <= N; i++) ... | [
"expression.operation.binary.add"
] | 1,358,312 | 1,358,313 | u500026208 | cpp |
p03683 | #include "bits/stdc++.h"
#define rep(i, a, n) for (int i = a; i < n; i++)
#define MOD (ull)1000000007
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
ull memo[100100] = {0};
int num = 1;
ull kaizyou(ull a) {
if (a <= num)
return memo[a];
rep(i, num, a + 1) {
memo[i] = memo[i - ... | #include "bits/stdc++.h"
#define rep(i, a, n) for (int i = a; i < n; i++)
#define MOD (ll)1000000007
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
ll memo[100100] = {0};
int num = 1;
ll kaizyou(ll a) {
if (a <= num)
return memo[a];
rep(i, num, a + 1) {
memo[i] = memo[i - 1] *... | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 1,358,320 | 1,358,321 | u129134470 | cpp |
p03683 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
ll perm(ll a) {
if (MOD <= a)
return 0;
ll ans0 = 1, ans1 = 1;
for (ll i = 1; i < a / 2; ++i) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
ll perm(ll a) {
if (MOD <= a)
return 0;
ll ans0 = 1, ans1 = 1;
for (ll i = 1; i < a / 2; ++i) {
... | [
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 1,358,326 | 1,358,327 | u915020369 | cpp |
p03683 | #include <algorithm>
#include <assert.h>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <deque>
#include <errno.h>
#include <float.h>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#incl... | #include <algorithm>
#include <assert.h>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <deque>
#include <errno.h>
#include <float.h>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#incl... | [
"expression.operation.binary.add"
] | 1,358,330 | 1,358,331 | u535589138 | cpp |
p03683 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,358,339 | 1,358,340 | u745906650 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
if (abs(n - m) > 1)
cout << 0 << endl;
else {
long long a, b = 1;
for (int i = 2; i <= max(n, m); i++) {
b = b * i % 1000000007;
if (i == min(n, m))
a = b;
}
if (a == b)
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
if (abs(n - m) > 1)
cout << 0 << endl;
else {
long long a, b = 1;
for (int i = 1; i <= max(n, m); i++) {
b = b * i % 1000000007;
if (i == min(n, m))
a = b;
}
if (a == b)
cout <<... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,358,341 | 1,358,342 | u477678256 | cpp |
p03683 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int mod(ll a) {
int c = a % 1000000007;
if (c >= 0)
return c;
else
return... |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int mod(ll a) {
int c = a % 1000000007;
if (c >= 0)
return c;
else
return... | [
"variable_declaration.type.change"
] | 1,358,343 | 1,358,344 | u763881112 | cpp |
p03683 | #include <bits/stdc++.h>
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define in insert
#define er erase
#define fr first
#define sc second
typedef long long ll;
const int inf = INT_MAX;
const int nmax = 1e5 + 5;
const int mod = 1e9 + 7;
using namespace std;
int n, m, i;
ll ans = 1;
int main() {
ios... | #include <bits/stdc++.h>
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define in insert
#define er erase
#define fr first
#define sc second
typedef long long ll;
const int inf = INT_MAX;
const int nmax = 1e5 + 5;
const int mod = 1e9 + 7;
using namespace std;
int n, m, i;
ll ans = 1;
int main() {
ios... | [
"call.add",
"call.arguments.add"
] | 1,358,347 | 1,358,348 | u130140706 | cpp |
p03683 | #include <bits/stdc++.h>
#define pp pair<int, int>
#define MZ 1000000007
#define pq priority_queue
using namespace std;
long long init[100005];
long long dp[100005][2];
int main() {
int n, m;
scanf("%d%d", &n, &m);
init[1] = 1;
for (int i = 2; i <= 100000; i++)
init[i] = (init[i - 1] * i) % MZ;
if (n == m... | #include <bits/stdc++.h>
#define pp pair<int, int>
#define MZ 1000000007
#define pq priority_queue
using namespace std;
long long init[100005];
long long dp[100005][2];
int main() {
int n, m;
scanf("%d%d", &n, &m);
init[1] = 1;
for (int i = 2; i <= 100000; i++)
init[i] = (init[i - 1] * i) % MZ;
if (n == m... | [
"expression.operation.binary.remove"
] | 1,358,363 | 1,358,364 | u383263796 | cpp |
p03683 | // Code Author:-code_kika //
// Institution:-IIT(BHU) //
#include <bits/stdc++.h>
using namespace std;
// io
#define sf(x) scanf("%d", &x);
#define sf2(x, y) scanf("%d %d", &x, &y);
#define sf3(x, y, z) scanf("%d %d %d", &x, &y, &z);
#define pf(x) printf("%d", x);
#define pf2(x, y) printf("%d %d", x, y);
#define pf3(... | // Code Author:-code_kika //
// Institution:-IIT(BHU) //
#include <bits/stdc++.h>
using namespace std;
// io
#define sf(x) scanf("%d", &x);
#define sf2(x, y) scanf("%d %d", &x, &y);
#define sf3(x, y, z) scanf("%d %d %d", &x, &y, &z);
#define pf(x) printf("%d", x);
#define pf2(x, y) printf("%d %d", x, y);
#define pf3(... | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,358,367 | 1,358,368 | u015917396 | cpp |
p03683 | #include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define lli long long int
void swap1(lli *a, lli *b) {
lli tmp = *a;
*a = *b;
*b = *a;
}
#define DEBUG 1
#define NUM 1000000007
int main() {
lli n, m;
lli ans =... | #include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define lli long long int
void swap1(lli *a, lli *b) {
lli tmp = *a;
*a = *b;
*b = tmp;
}
#define DEBUG 1
#define NUM 1000000007
int main() {
lli n, m;
lli ans ... | [
"assignment.value.change"
] | 1,358,369 | 1,358,370 | u041513069 | cpp |
p03683 | #include <bits/stdc++.h> //Written by ThiDaiLoc
using namespace std; // Team Three Wolves
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pll;
#define fu(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, b, a) for (ll i = b; i >= a; i--)
#define ms(a, x) memset(a, x, sizeof a)
#define prec(n) fixe... | #include <bits/stdc++.h> //Written by ThiDaiLoc
using namespace std; // Team Three Wolves
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pll;
#define fu(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, b, a) for (ll i = b; i >= a; i--)
#define ms(a, x) memset(a, x, sizeof a)
#define prec(n) fixe... | [
"expression.operation.binary.add"
] | 1,358,371 | 1,358,372 | u104888333 | cpp |
p03683 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
int n, m;
long long f[N]; // factoriel
long long ans;
int abs(int x) {
if (x < 0)
return -x;
return x;
}
void Calc_Factoriel() {
long long i;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
int n, m;
long long f[N]; // factoriel
long long ans;
int abs(int x) {
if (x < 0)
return -x;
return x;
}
void Calc_Factoriel() {
long long i;... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,358,375 | 1,358,376 | u974695394 | cpp |
p03683 | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int MAXN = 100010;
int n, m;
ll fac[MAXN];
int main() {
int i;
scanf("%d%d", &n, &m);
if (n < m)
swap(n, m);
if (n - m > 1) {
printf("0\n");
return 0;
}
fac[0] = 1;
for (i = 1; ... | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int MAXN = 100010;
int n, m;
ll fac[MAXN];
int main() {
int i;
scanf("%d%d", &n, &m);
if (n < m)
swap(n, m);
if (n - m > 1) {
printf("0\n");
return 0;
}
fac[0] = 1;
for (i = 1; ... | [
"expression.operation.binary.add"
] | 1,358,379 | 1,358,380 | u373494487 | cpp |
p03683 | #define _CRT_SECURE_NO_WARNINGS
#define TASK "C-large"
#pragma comment(linker, "/STACK:1710886400")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set... | #define _CRT_SECURE_NO_WARNINGS
#define TASK "C-large"
#pragma comment(linker, "/STACK:1710886400")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set... | [
"expression.operation.binary.add"
] | 1,358,383 | 1,358,384 | u474089159 | cpp |
p03683 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 10005;
int main() {
int n, m;
long long mod = 1e9 + 7;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 << endl;
return 0;
}
int ans = 1;
for (int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 10005;
int main() {
int n, m;
long long mod = 1e9 + 7;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 << endl;
return 0;
}
long long ans = 1;
fo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,358,393 | 1,358,394 | u349794429 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
#define maxn 150000
#define ll long long
#define md 1000000007
int n, m;
int fac[maxn + 5];
int main() {
#ifdef WXL
freopen("in.txt", "r", stdin);
#endif
scanf("%d%d", &n, &m);
fac[0] = 1;
for (int i = 1; i <= maxn; ++i)
fac[i] = (ll)fac[i - 1] * i % md;
... | #include <bits/stdc++.h>
using namespace std;
#define maxn 150000
#define ll long long
#define md 1000000007
int n, m;
int fac[maxn + 5];
int main() {
#ifdef WXL
freopen("in.txt", "r", stdin);
#endif
scanf("%d%d", &n, &m);
fac[0] = 1;
for (int i = 1; i <= maxn; ++i)
fac[i] = (ll)fac[i - 1] * i % md;
... | [
"expression.operation.binary.add"
] | 1,358,395 | 1,358,396 | u584850916 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
ll f[100010];
int main() {
int n, m;
scanf("%d%d", &n, &m);
f[0] = 1;
for (int i = 1; i <= 100000; i++)
f[i] = f[i - 1] * i % M;
if (n == m)
printf("%lld\n", 2 * f[n] * f[m] % M);
else if (abs(n - m) == 1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
ll f[100010];
int main() {
int n, m;
scanf("%d%d", &n, &m);
f[0] = 1;
for (int i = 1; i <= 100000; i++)
f[i] = f[i - 1] * i % M;
if (n == m)
printf("%lld\n", 2 * f[n] * f[m] % M);
else if (abs(n - m) == 1)... | [
"expression.operation.binary.add"
] | 1,358,397 | 1,358,398 | u089329978 | cpp |
p03684 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f
#define lb lower_bound
#define db(x) \
{ cout << "#db " << x << end... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f
#define lb lower_bound
#define db(x) \
{ cout << "#db " << x << end... | [
"expression.operation.binary.remove"
] | 1,358,403 | 1,358,404 | u353919145 | cpp |
p03682 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000018
#define mod 1000000007
#define MAXN 100005
typedef pair<int, int> PA;
struct edge {
int u;
int v;
int cost;
};
int n;
PA xx[MAXN], yy[MAXN];
edge G[2 * MAXN];
int par[2 * MAXN];
int ranks[2 * MAXN];
void init(int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000018
#define mod 1000000007
#define MAXN 100005
typedef pair<int, int> PA;
struct edge {
int u;
int v;
int cost;
};
int n;
PA xx[MAXN], yy[MAXN];
edge G[2 * MAXN];
int par[2 * MAXN];
int ranks[2 * MAXN];
void init(int... | [
"assignment.value.change",
"identifier.change"
] | 1,358,420 | 1,358,421 | u384299515 | cpp |
p03682 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define mp make... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define mp make... | [
"control_flow.branch.if.condition.change"
] | 1,358,424 | 1,358,425 | u566529875 | cpp |
p03682 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
// UnionFind木
// 素集合データ構造というデータ構造です
// いくつかの対象が集合に分類されている状況で
// 2つの要素が同じ集合にいるのか、それとも違う集合にいるのか
// ということを効率的に調べる機能があります
struct UnionFind {
std::vector<int> parent; // あるデータの親
std::vector<int> sizes; // あるデータが属する木のサイズ
// コンストラクタ
// データ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
// UnionFind木
// 素集合データ構造というデータ構造です
// いくつかの対象が集合に分類されている状況で
// 2つの要素が同じ集合にいるのか、それとも違う集合にいるのか
// ということを効率的に調べる機能があります
struct UnionFind {
std::vector<int> parent; // あるデータの親
std::vector<int> sizes; // あるデータが属する木のサイズ
// コンストラクタ
// データ... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,358,440 | 1,358,441 | u457912018 | cpp |
p03682 | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,358,449 | 1,358,450 | u741231562 | cpp |
p03683 | #include <cmath>
#include <cstdio>
using namespace std;
const int M = 1000000007;
int n, m;
long long ans = 1;
int main() {
scanf("%d%d", &n, &m);
if (abs(n - m) > 1) {
printf("-1\n");
return 0;
}
for (int i = 1; i <= n; ++i)
ans = ans * i % M;
for (int i = 1; i <= m; ++i)
ans = ans * i % M;
... | #include <cmath>
#include <cstdio>
using namespace std;
const int M = 1000000007;
int n, m;
long long ans = 1;
int main() {
scanf("%d%d", &n, &m);
if (abs(n - m) > 1) {
printf("0\n");
return 0;
}
for (int i = 1; i <= n; ++i)
ans = ans * i % M;
for (int i = 1; i <= m; ++i)
ans = ans * i % M;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,358,458 | 1,358,459 | u807061858 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | [
"literal.number.change"
] | 1,358,469 | 1,358,470 | u530107518 | cpp |
p03683 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const ll LLINF = 1LL << 60;
/... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const ll LLINF = 1LL << 60;
/... | [
"assignment.value.change",
"call.arguments.change"
] | 1,358,473 | 1,358,474 | u275488634 | cpp |
p03683 | #include <iostream>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
if (abs(N - M) <= 1) {
int ans = 2 - abs(N - M);
for (int i = 1; i <= N; i++) {
ans *= i;
ans %= 1000000007;
}
for (int i = 1; i <= M; i++) {
ans *= i;
ans %= 1000000007;
}
cout << ans ... | #include <iostream>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
if (abs(N - M) <= 1) {
long ans = 2 - abs(N - M);
for (long i = 1; i <= N; i++) {
ans *= i;
ans %= 1000000007;
}
for (long i = 1; i <= M; i++) {
ans *= i;
ans %= 1000000007;
}
cout << a... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 1,358,475 | 1,358,476 | u115888500 | cpp |
p03683 | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
if (b - a > 1) {
cout << 0;
} else if (a == b) {
ll s = 1;
for (ll i = a; i >= 1; i--) {
s = s * i;
s %= MOD;
}
for (ll i = a;... | #include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
if (b - a > 1) {
cout << 0;
} else if (a == b) {
ll s = 1;
for (ll i = a; i >= 1; i--) {
s = s * i;
s %= MOD;
}
for (ll i = a;... | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 1,358,481 | 1,358,482 | u891061025 | cpp |
p03683 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
long long factorial(int n) {
long long ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
}
return ans;
}
int main() {
int N, M;
long long ans;
cin >> N >... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
long long factorial(int n) {
long long ans = 1;
for (int i = 1; i <= n; i++) {
ans = ans * i % 1000000007;
}
return ans;
}
int main() {
int N, M;
long long... | [
"assignment.value.change",
"assignment.change"
] | 1,358,485 | 1,358,486 | u354773735 | cpp |
p03683 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a - b >= 2 || b - a >= 2)
cout << "0" << endl;
else if (a - b == 1 || b - a == 1) {
int p_a = 1;
int p_b = 1;
for (int i = 1; i <= a; i++) {
p_a = (i * p_a) % 1000000007;
}
for (... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a - b >= 2 || b - a >= 2)
cout << "0" << endl;
else if (a - b == 1 || b - a == 1) {
long long p_a = 1;
long long p_b = 1;
for (int i = 1; i <= a; i++) {
p_a = (i * p_a) % 1000000007;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,358,487 | 1,358,488 | u266272131 | cpp |
p03683 | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (abs(N - M) > 1)
cout << 0 << endl;
else {
int a = 1, b = 1;
for (int i = 1; i < N + 1; i++) {
a = a * i % 1000000007;
}
for (int i = 1; i < M + 1; i++) {
b = b * i % 1000000007;
}
if (M == ... | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (abs(N - M) > 1)
cout << 0 << endl;
else {
long long a = 1, b = 1;
for (int i = 1; i < N + 1; i++) {
a = a * i % 1000000007;
}
for (int i = 1; i < M + 1; i++) {
b = b * i % 1000000007;
}
if ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,358,491 | 1,358,492 | u967654064 | cpp |
p03683 | // header {{{
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define kita cout << "kita\n"
#define print2(i, n) cout << (i) << ": " ... | // header {{{
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define kita cout << "kita\n"
#define print2(i, n) cout << (i) << ": " ... | [
"literal.number.change",
"io.output.change"
] | 1,358,495 | 1,358,496 | u857259336 | cpp |
p03683 | // header {{{
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define kita cout << "kita\n"
#define print2(i, n) cout << (i) << ": " ... | // header {{{
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define kita cout << "kita\n"
#define print2(i, n) cout << (i) << ": " ... | [
"literal.number.change",
"io.output.change"
] | 1,358,495 | 1,358,497 | u857259336 | cpp |
p03683 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, x, n) for (int i = x; i < n; i++)
#define int long long
using namespace std;
long long k = 1000000007;
int f(int n) {
if (n =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, x, n) for (int i = x; i < n; i++)
#define int long long
using namespace std;
long long k = 1000000007;
int f(int n) {
if (n =... | [
"expression.operation.binary.add"
] | 1,358,502 | 1,358,503 | u093420647 | cpp |
p03683 | // ConsoleApplication1.cpp : コンソール アプリケーションのエントリ
// ポイントを定義します。
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility... | // ConsoleApplication1.cpp : コンソール アプリケーションのエントリ
// ポイントを定義します。
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 1,358,504 | 1,358,505 | u069133305 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000000 + 7;
int mul(int a, int b) {
long long res = a * 1LL * b;
return res % MOD;
}
int fact(int n) {
int res = 1;
for (int i = 1; i <= n; ++i) {
res = mul(res, i);
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
if (n >... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000000 + 7;
int mul(int a, int b) {
long long res = a * 1LL * b;
return res % MOD;
}
int fact(int n) {
int res = 1;
for (int i = 1; i <= n; ++i) {
res = mul(res, i);
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
if (n >... | [
"control_flow.return.add",
"control_flow.return.0.add",
"identifier.change",
"call.arguments.change"
] | 1,358,508 | 1,358,507 | u809959248 | cpp |
p03683 | #include "iostream"
using namespace std;
long long int N, M, n = 1, m = 1, ans;
int main() {
cin >> N >> M;
if (abs(N - M) >= 2) {
ans = 0;
} else {
for (int i = 1; i <= N; i++) {
n = n * i;
n = n % 1000000007;
}
for (int j = 1; j <= M; j++) {
m = m * j;
m = m % 1000000007... | #include "iostream"
using namespace std;
long long int N, M, n = 1, m = 1, ans;
int main() {
cin >> N >> M;
if (abs(N - M) >= 2) {
ans = 0;
} else {
for (int i = 1; i <= N; i++) {
n = n * i;
n = n % 1000000007;
}
for (int j = 1; j <= M; j++) {
m = m * j;
m = m % 1000000007... | [
"assignment.add"
] | 1,358,509 | 1,358,510 | u382176401 | cpp |
p03683 | #include <bits/stdc++.h>
const int Mod = 1000000007;
#define LL long long
using namespace std;
LL ans = 1, fac[100100], n, m;
int main() {
cin >> n >> m;
if (n > m)
swap(n, m);
if (n - m >= 2) {
cout << 0;
return 0;
}
fac[0] = 1;
for (int i = 1; i <= m; i++) {
fac[i] = (fac[i - 1] * i) % Mod... | #include <bits/stdc++.h>
const int Mod = 1000000007;
#define LL long long
using namespace std;
LL ans = 1, fac[100100], n, m;
int main() {
cin >> n >> m;
if (n > m)
swap(n, m);
if (m - n >= 2) {
cout << 0;
return 0;
}
fac[0] = 1;
for (int i = 1; i <= m; i++) {
fac[i] = (fac[i - 1] * i) % Mod... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,358,511 | 1,358,512 | u299193372 | cpp |
p03683 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 1,358,520 | 1,358,521 | u016799241 | cpp |
p03683 | #include <iostream>
using namespace std;
#define L 1000000009
#define PROD(a, b) ((((a) % L) * ((b) % L)) % L)
int factorial(long long N) {
if (N <= 1)
return 1;
else
return PROD(N, factorial(N - 1));
}
long long solve(long long N, long long M) {
switch (N - M) {
case 1:
case -1:
return PROD(fa... | #include <iostream>
using namespace std;
#define L 1000000007l
#define PROD(a, b) ((((a) % L) * ((b) % L)) % L)
int factorial(long long N) {
if (N <= 1)
return 1;
else
return PROD(N, factorial(N - 1));
}
long long solve(long long N, long long M) {
switch (N - M) {
case 1:
case -1:
return PROD(f... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,358,522 | 1,358,523 | u305157958 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
LL a[110000];
const int mod = 1e9 + 7;
int main() {
int n, m;
scanf("%d%d", &n, &m);
if (abs(n - m) > 1)
puts("0");
else {
a[0] = 1;
for (int i = 1; i <= n; i++)
a[i] = a[i - 1] * i % mod;
LL ans = a[n] * a[m] % mod;
if... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
LL a[110000];
const int mod = 1e9 + 7;
int main() {
int n, m;
scanf("%d%d", &n, &m);
if (abs(n - m) > 1)
puts("0");
else {
a[0] = 1;
for (int i = 1; i <= max(n, m); i++)
a[i] = a[i - 1] * i % mod;
LL ans = a[n] * a[m] % mod... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 1,358,526 | 1,358,527 | u662041847 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
template <typename...> static inline int gc(void) { return getchar(); }
static inline void read(long long int &x) {
int k, m = 0;
x = 0;
for (;;) {
k = gc();
if (k == 45) {
m = 1;
break;
}
if (48 <= k && k <= 57) {
x = k - 48;
... | #include <bits/stdc++.h>
using namespace std;
template <typename...> static inline int gc(void) { return getchar(); }
static inline void read(long long int &x) {
int k, m = 0;
x = 0;
for (;;) {
k = gc();
if (k == 45) {
m = 1;
break;
}
if (48 <= k && k <= 57) {
x = k - 48;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,358,528 | 1,358,529 | u462437857 | cpp |
p03683 | // I Guds namn
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
const ll MAXN = 100 * 1000 + 13, MOD = 1000 * 1000 * 1000 + 7;
ll fact[MAXN];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll n, m;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 <<... | // I Guds namn
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
const ll MAXN = 100 * 1000 + 13, MOD = 1000 * 1000 * 1000 + 7;
ll fact[MAXN];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
ll n, m;
cin >> n >> m;
if (abs(n - m) > 1) {
cout << 0 <<... | [
"assignment.add"
] | 1,358,532 | 1,358,533 | u861666788 | cpp |
p03683 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
int n, m;
cin >> n >> m;
long long int f[100011];
f[1] = 1;
f[0] = 1;
for (int i = 2; i <= 1000011; i++) {
f[i] = (i * f[i - 1]) % mod;
}
if (n >= m + 2 || m >= n + 2) {
cout << "0\n";
} else if (n == m) {
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
int n, m;
cin >> n >> m;
long long int f[100011];
f[1] = 1;
f[0] = 1;
for (int i = 2; i <= 100001; i++) {
f[i] = (i * f[i - 1]) % mod;
}
if (n >= m + 2 || m >= n + 2) {
cout << "0\n";
} else if (n == m) {
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,358,534 | 1,358,535 | u111764401 | cpp |
p03683 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int mo = 1e9 + 7;
typedef long long ll;
ll n, m;
ll getstep(ll n) {
ll res = 1;
for (ll i = 1; i <= n; i++)
res = (res *... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int mo = 1e9 + 7;
typedef long long ll;
ll n, m;
ll getstep(ll n) {
ll res = 1;
for (ll i = 1; i <= n; i++)
res = (res *... | [
"call.arguments.change",
"call.arguments.add"
] | 1,358,543 | 1,358,544 | u082124198 | cpp |
p03684 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, s, n) for (int i... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, s, n) for (int i... | [
"call.add",
"call.arguments.change"
] | 1,358,557 | 1,358,558 | u652683896 | cpp |
p03684 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,358,559 | 1,358,560 | u798181098 | cpp |
p03684 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf = 1e9;
const int64_t in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf = 1e9;
const int64_t in... | [
"control_flow.branch.if.condition.change"
] | 1,358,561 | 1,358,562 | u759266806 | cpp |
p03684 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 100005
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
ty... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 100005
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
ty... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,358,565 | 1,358,566 | u600916050 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.