buggy_code
stringlengths 11
625k
| fixed_code
stringlengths 17
625k
| bug_type
stringlengths 2
4.45k
| language
int64 0
8
| token_count
int64 5
200k
|
|---|---|---|---|---|
#include <stdio.h>
#define N 5
int data[N];
void swap(int *a, int *b) {
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
void sort() {
int i, s;
for (i = 1; i < N - 1; i++) {
for (s = i + 1; s < N; s++) {
if (data[i] < data[s]) {
swap(&data[i], &data[s]);
}
}
}
}
int main() {
int i;
for (i = 0; i < N; i++) {
scanf("%d", &data[i]);
}
sort();
for (i = 0; i < N; i++) {
if (i != 0)
printf(" ");
printf("%d", data[i]);
}
printf("\n");
return 0;
}
|
#include <stdio.h>
#define N 5
int data[N];
void swap(int *a, int *b) {
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
void sort() {
int i, s;
for (i = 0; i < N - 1; i++) {
for (s = i + 1; s < N; s++) {
if (data[i] < data[s]) {
swap(&data[i], &data[s]);
}
}
}
}
int main() {
int i;
for (i = 0; i < N; i++) {
scanf("%d", &data[i]);
}
sort();
for (i = 0; i < N; i++) {
if (i != 0)
printf(" ");
printf("%d", data[i]);
}
printf("\n");
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]]
| 0
| 208
|
#include <stdio.h>
int main() {
int a, i, j, s[5];
scanf("%d %d %d %d %d", &s[0], &s[1], &s[2], &s[3], &s[4]);
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++) {
if (s[j] < s[j + 1]) {
a = s[j];
s[j] = s[j + 1];
s[j + 1] = a;
}
}
}
printf("%d %d %d %d %d\n", s[0], s[1], s[2], s[3], s[4]);
return 0;
}
|
#include <stdio.h>
int main() {
int a, i, j, s[5];
scanf("%d %d %d %d %d", &s[0], &s[1], &s[2], &s[3], &s[4]);
for (i = 0; i < 5; i++) {
for (j = 0; j < 4; j++) {
if (s[j] < s[j + 1]) {
a = s[j];
s[j] = s[j + 1];
s[j + 1] = a;
}
}
}
printf("%d %d %d %d %d\n", s[0], s[1], s[2], s[3], s[4]);
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 167
|
#include <stdio.h>
int main(void) {
int tem = 0, i, j;
int a[5];
for (i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
for (j = 0; j < 4; j++) {
for (i = 0; i < 4; i++) {
if (a[i] > a[i + 1]) {
tem = a[i];
a[i] = a[i + 1];
a[i + 1] = tem;
}
}
}
for (i = 0; i < 4; i++) {
printf("%d ", a[i]);
}
printf("%d\n", a[i]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int tem = 0, i, j;
int a[5];
for (i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
for (j = 0; j < 4; j++) {
for (i = 0; i < 4; i++) {
if (a[i] < a[i + 1]) {
tem = a[i];
a[i] = a[i + 1];
a[i + 1] = tem;
}
}
}
for (i = 0; i < 4; i++) {
printf("%d ", a[i]);
}
printf("%d\n", a[i]);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]]
| 0
| 169
|
#include <stdio.h>
int main(void) {
int a[5];
int i, j, swap;
scanf("%d %d %d %d %d", &a[0], &a[1], &a[2], &a[3], &a[4]);
for (i = 0; i < 5; i++) {
for (j = 0; j < 5 - i; j++) {
if (a[j] > a[j + 1]) {
swap = a[j];
a[j] = a[j + 1];
a[j + 1] = swap;
}
}
}
printf("%d %d %d %d %d", a[0], a[1], a[2], a[3], a[4]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int a[10];
int i, j, swap;
scanf("%d %d %d %d %d", &a[0], &a[1], &a[2], &a[3], &a[4]);
for (i = 0; i < 5; i++) {
for (j = 0; j < 4 - i; j++) {
if (a[j] < a[j + 1]) {
swap = a[j];
a[j] = a[j + 1];
a[j + 1] = swap;
}
}
}
printf("%d %d %d %d %d\n", a[0], a[1], a[2], a[3], a[4]);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 170
|
#include <stdio.h>
int main(void) {
int n[5];
int t;
int i, j;
for (i = 0; i < 5; i++) {
scanf("%d", &n[i]);
}
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++) {
if (n[i] < n[j]) {
t = n[i];
n[i] = n[j];
n[j] = t;
}
}
}
for (i = 0; i < 5; i++) {
printf("%d", n[i]);
if (i != 4) {
printf(" ");
}
}
printf("\n");
return (0);
}
|
#include <stdio.h>
int main(void) {
int n[5];
int t;
int i, j;
for (i = 0; i < 5; i++) {
scanf("%d", &n[i]);
}
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++) {
if (n[i] > n[j]) {
t = n[i];
n[i] = n[j];
n[j] = t;
}
}
}
for (i = 0; i < 5; i++) {
printf("%d", n[i]);
if (i != 4) {
printf(" ");
}
}
printf("\n");
return (0);
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]]
| 0
| 173
|
#include <iostream>
int main() {
int n;
std::cin >> n;
int s = 1;
for (std::size_t i = 2; i <= n; ++i) {
s *= i;
}
std::cout << s << std::endl;
return 0;
}
|
#include <iostream>
int main() {
int n;
std::cin >> n;
unsigned long long int s = 1;
for (std::size_t i = 2; i <= n; ++i) {
s *= i;
}
std::cout << s << std::endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 57
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int Fraction = 1;
for (int i = 0; i < n; i++) {
Fraction *= n - i;
}
printf("%d\n", Fraction);
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long int Fraction = 1;
for (int i = 0; i < n; i++) {
Fraction *= n - i;
}
printf("%lld\n", Fraction);
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 67
|
#include <bits/stdc++.h>
using namespace std;
int fact(int num) {
if (num == 0)
return 1;
return num * fact(num - 1);
}
int main() {
unsigned long long n = 0;
cin >> n;
n = fact(n);
cout << n << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long fact(int num) {
if (num == 0)
return 1;
return num * fact(num - 1);
}
int main() {
unsigned long long n = 0;
cin >> n;
n = fact(n);
cout << n << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 87], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 66
|
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int fact = 1;
for (int i = 2; i <= n; i++)
fact *= i;
cout << fact << '\n';
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
long long fact = 1;
for (int i = 2; i <= n; i++)
fact *= i;
cout << fact << '\n';
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 67
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int ans = 1;
for (int i = 1; i < n + 1; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
long long int ans = 1;
for (int i = 1; i < n + 1; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 57
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a;
for (int i = 1; i <= n; i++)
a *= i;
cout << a << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a = 1;
/*while(n){
a*=n--;
}*/
for (int i = 1; i <= n; i++)
a *= i;
cout << a << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 50
|
#include <iostream>
using namespace std;
int main(void) {
int n, ans = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
if (n == 0) {
ans = 1;
break;
} else {
ans *= i;
}
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main(void) {
long long int n, ans = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
if (n == 0) {
ans = 1;
break;
} else {
ans *= i;
}
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 67
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define REP(i, j, n) for (int i = j; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
using namespace std;
int main() {
int n, sum = 1;
cin >> n;
while (n > 1) {
sum *= n;
n--;
}
cout << sum << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define REP(i, j, n) for (int i = j; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
using namespace std;
int main() {
int n;
long long sum = 1;
cin >> n;
while (n > 1) {
sum *= n;
n--;
}
cout << sum << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 79
|
#include <iostream>
using namespace std;
int main(void) {
int n, fact = 1;
cin >> n;
for (int i = n; i > 0; i--) {
fact *= i;
}
cout << fact << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
long long int n, fact = 1;
cin >> n;
for (int i = n; i > 0; i--) {
fact *= i;
}
cout << fact << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 53
|
#include <iostream>
using namespace std;
int f(int n) {
if (n == 1)
return n;
return n * f(n - 1);
}
int main() {
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long f(int n) {
if (n == 1)
return n;
return n * f(n - 1);
}
int main() {
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 58
|
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 999999
using namespace std;
typedef long long ll;
int d[22];
int main() {
int n;
cin >> n;
d[1] = 1;
for (int i = 2; i <= n; i++) {
d[i] = d[i - 1] * i;
}
cout << d[n] << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 999999
using namespace std;
typedef long long ll;
ll d[22];
int main() {
int n;
cin >> n;
d[1] = 1;
for (int i = 2; i <= n; i++) {
d[i] = d[i - 1] * i;
}
cout << d[n] << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78]]
| 1
| 100
|
#include <cstdio>
int rec(int n) {
if (n == 1) {
return n;
} else {
return n * rec(n - 1);
}
}
int main() {
int n;
scanf("%d", &n);
printf("%d\n", rec(n));
return 0;
}
|
#include <cstdio>
long rec(int n) {
if (n == 1) {
return n;
} else {
return n * rec(n - 1);
}
}
int main() {
int n;
scanf("%d", &n);
printf("%ld\n", rec(n));
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 69
|
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
cin >> n;
if (n <= 20 && n >= 1) {
for (int a = 1; a <= n; a++) {
ans = ans * a;
}
cout << ans << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, ans = 1;
cin >> n;
if (n <= 20 && n >= 1) {
for (int a = 1; a <= n; a++) {
ans = ans * a;
}
cout << ans << endl;
}
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 63
|
#include <iostream>
int main() {
int n, a = 1;
std::cin >> n;
if (n <= 20 && n > 0) {
while (n != 0) {
a = a * n;
n--;
}
std::cout << a << std::endl;
}
return 0;
}
|
#include <iostream>
int main() {
long long int n, a = 1;
std::cin >> n;
if (n <= 20 && n > 0) {
while (n != 0) {
a = a * n;
n--;
}
std::cout << a << std::endl;
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 63
|
#include <iostream>
using namespace std;
int main() {
int i, n, a;
while (cin >> n) {
a = 1;
for (i = n; i >= 1; i--) {
a = a * i;
}
cout << a << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long int i, n, a;
while (cin >> n) {
a = 1;
for (i = n; i >= 1; i--) {
a = a * i;
}
cout << a << endl;
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 61
|
#include <iostream>
using namespace std;
int main() {
int x, ans = 1;
cin >> x;
for (int i = 2; i <= x; i++) {
ans *= i;
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
unsigned long int x, ans = 1;
cin >> x;
for (int i = 2; i <= x; i++) {
ans *= i;
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 49
|
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int f(int a) {
if (a == 0 || a == 1)
return 1;
else
return a * f(a - 1);
}
int n;
int main() {
cin >> n;
cout << f(n) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
using namespace std;
long long f(long long a) {
if (a == 0 || a == 1)
return 1;
else
return a * f(a - 1);
}
long long n;
int main() {
cin >> n;
cout << f(n) << "\n";
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96]]
| 1
| 67
|
#include <bits/stdc++.h>
using namespace std;
int n;
int dfs(int i) {
if (i == 1)
return 1;
else if (i == 0)
return 0;
return i * dfs(i - 1);
}
int main() {
cin >> n;
cout << dfs(n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long dfs(long long i) {
if (i == 1)
return 1;
else if (i == 0)
return 0;
return i * dfs(i - 1);
}
int main() {
cin >> n;
cout << dfs(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96]]
| 1
| 68
|
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, tot = 1;
cin >> a;
while (a >= 1) {
tot *= a;
a -= 1;
}
cout << tot << endl;
return 0;
}
|
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long a, tot = 1;
cin >> a;
while (a >= 1) {
tot *= a;
a -= 1;
}
cout << tot << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 54
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 1;
cin >> n;
while (n) {
ans *= n;
n--;
}
cout << n << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, ans = 1;
cin >> n;
while (n) {
ans *= n;
n--;
}
cout << ans << endl;
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]]
| 1
| 54
|
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#define INF 100000000
#define MOD 1000000007
using namespace std;
int main() {
int n;
cin >> n;
int ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#define INF 100000000
#define MOD 1000000007
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 1;
for (long long i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]]
| 1
| 75
|
#include <stdio.h>
int f(int n) { return n == 1 ? 1 : n * f(n - 1); }
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", f(n));
return 0;
}
|
#include <stdio.h>
long long f(int n) { return n == 1 ? 1 : n * f(n - 1); }
int main(void) {
int n;
scanf("%d", &n);
printf("%lld\n", f(n));
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 62
|
#include <iostream>
using namespace std;
int main() {
int n;
int ans = 1;
cin >> n;
for (int i = n; i > 0; i--)
ans *= i;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#define Lint long int
using namespace std;
int main() {
int n;
Lint ans = 1;
cin >> n;
for (int i = n; i > 0; i--)
ans *= i;
cout << ans << endl;
return 0;
}
|
[["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]]
| 1
| 51
|
#include <iostream>
using namespace std;
int main() {
int n, a = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
a *= i;
}
cout << a << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long n, a = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
a *= i;
}
cout << a << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 52
|
#include <iostream>
using namespace std;
int main(void) {
int n, x;
cin >> n;
x = 1;
while (n != 1) {
x *= n;
n--;
}
cout << x << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
long n, x;
cin >> n;
x = 1;
while (n != 1) {
x *= n;
n--;
}
cout << x << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 50
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 1;
for (int i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 1;
for (long long i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]]
| 1
| 50
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
k *= i;
}
cout << k << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
long long k = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
k *= i;
}
cout << k << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 54
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans;
cin >> n;
1 <= n <= 20;
ans = n;
for (int i = n - 1; i > 1; i--) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
1 <= n <= 20;
long long ans = n;
for (int i = n - 1; i > 1; i--) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 86
|
#include <iostream>
int factorial(int n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
int main(void) {
int n;
std::cin >> n;
std::cout << factorial(n) << std::endl;
return 0;
}
|
#include <iostream>
long long factorial(long long n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
int main(void) {
int n;
std::cin >> n;
std::cout << factorial(n) << std::endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96]]
| 1
| 61
|
#include <stdio.h>
int main(void) {
int n, i, P;
P = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
P = P * i;
}
printf("%d\n", P);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, i;
long long int P;
P = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
P = P * i;
}
printf("%lld\n", P);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 64
|
#include <iostream>
main() {
int n, i;
std::cin >> n;
for (i = n; --n;)
i *= n;
std::cout << i;
}
|
#include <iostream>
main() {
long long n, i;
std::cin >> n;
for (i = n; --n;)
i *= n;
std::cout << i << "\n";
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 44]]
| 1
| 38
|
#include <iostream>
using namespace std;
int main(void) {
while (!cin.eof()) {
int n;
cin >> n;
if (cin.eof())
break;
int f = 1;
for (int i = 2; i <= n; i++) {
f *= i;
}
cout << f << endl;
}
}
|
#include <iostream>
using namespace std;
int main(void) {
while (!cin.eof()) {
int n;
cin >> n;
if (cin.eof())
break;
long long f = 1;
for (int i = 2; i <= n; i++) {
f *= i;
}
cout << f << endl;
}
}
|
[["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 72
|
#include <iostream>
using namespace std;
int main() {
int x;
unsigned int ret = 1;
cin >> x;
for (int i = 1; i <= x; i++)
ret *= i;
if (!x)
ret = 0;
cout << ret << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int x;
unsigned long long int ret = 1;
cin >> x;
for (int i = 1; i <= x; i++)
ret *= i;
if (!x)
ret = 0;
cout << ret << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 58
|
#include <iostream>
using namespace std;
int f(int n) { return (n == 0 ? 1 : n * f(n - 1)); }
int main() {
int n;
cin >> n;
cout << f(n) << endl;
}
|
#include <iostream>
using namespace std;
long long f(int n) { return (n == 0 ? 1 : n * f(n - 1)); }
int main() {
int n;
cin >> n;
cout << f(n) << endl;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 54
|
#include <iostream>
using namespace std;
int main() {
long long x = 1;
int s;
cin >> s;
while (s == 1) {
x *= s;
s--;
}
cout << x << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int x = 1, s;
cin >> s;
while (s != 1) {
x *= s;
s--;
}
cout << x << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 79]]
| 1
| 49
|
#include <cstdio>
#include <iostream>
using namespace std;
long long f(int n) {
if (n == 0)
return 1;
return f(n - 1) * n;
}
int main() {
int n;
scanf("%d", &n);
printf("lld", f(n));
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
long long f(int n) {
if (n == 0)
return 1;
return f(n - 1) * n;
}
int main() {
int n;
scanf("%d", &n);
printf("%lld\n", f(n));
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 70
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n;
while (--n)
ans *= n;
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = n;
while (--n)
ans *= n;
cout << ans << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 39
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 1)
n = 1;
else if (n > 20)
n = 20;
int ans = 1;
for (int i = n; i > 0; i--)
ans *= i;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 1)
n = 1;
else if (n > 20)
n = 20;
long long ans = 1;
for (int i = n; i > 0; i--)
ans *= i;
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 72
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define present(c, e) ((c).find((e)) != (c).end())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
const double EPS = 1e-10;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;
int fact(int n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
int main() {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define present(c, e) ((c).find((e)) != (c).end())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
const double EPS = 1e-10;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;
ll fact(int n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
int main() {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 78]]
| 1
| 194
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int fuc(int n) {
if (n == 0)
return 1;
else
return n * fuc(n - 1);
}
int main() {
int n;
while (cin >> n)
cout << fuc(n) << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long fuc(long long n) {
if (n == 0)
return 1;
else
return n * fuc(n - 1);
}
int main() {
long long n;
while (cin >> n)
cout << fuc(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 65
|
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
unsigned int n;
int i;
cin >> n;
for (i = n, n = 1; i >= 1; i--)
n *= i;
cout << n << endl;
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
unsigned long long n;
int i;
cin >> n;
for (i = n, n = 1; i >= 1; i--)
n *= i;
cout << n << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 66
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a;
for (b = 1; b <= a; b++) {
c = 1;
for (d = b; d >= 1; d--) {
c *= d;
}
}
cout << c << '\n';
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int a, b, c, d;
cin >> a;
for (b = 1; b <= a; b++) {
c = 1;
for (d = b; d >= 1; d--) {
c *= d;
}
}
cout << c << '\n';
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 74
|
#include <iostream>
using namespace std;
int main() {
int n, f = 1;
cin >> n;
for (int i = 1; i <= n; i++)
f *= i;
cout << f;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, f = 1;
cin >> n;
for (int i = 1; i <= n; i++)
f *= i;
cout << f << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 48
|
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int f(int n) {
if (n == 1)
return 1;
return n * f(n - 1);
}
int main() {
int n;
while (cin >> n) {
cout << f(n) << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int f(int n) {
if (n == 1)
return 1;
return n * f(n - 1);
}
int main() {
int n;
while (cin >> n) {
cout << f(n) << endl;
}
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 70
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, i, t = 1;
cin >> n;
for (i = 1; i <= n; i++) {
t *= i;
}
cout << t << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long n, i, t = 1;
cin >> n;
for (i = 1; i <= n; i++) {
t *= i;
}
cout << t << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 55
|
#include <iostream>
using namespace std;
int main() {
int n, i, ans;
while (cin >> n) {
ans = 1;
for (i = 0; i < n; i++) {
ans = ans * (n - i);
}
cout << ans << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, i;
long long ans;
while (cin >> n) {
ans = 1;
for (i = 0; i < n; i++) {
ans = ans * (n - i);
}
cout << ans << endl;
}
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 62
|
#include <iostream>
using namespace std;
int main(void) {
int i;
unsigned int in;
cin >> in;
for (i = in; i > 1; i--) {
in *= i - 1;
}
cout << in << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int i;
unsigned long long in;
cin >> in;
for (i = in; i > 1; i--) {
in *= i - 1;
}
cout << in << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 54
|
#include <iostream>
using namespace std;
main() {
int n, i;
int out;
cin >> n;
out = 1;
for (i = n; i > 0; i--) {
out *= i;
}
cout << out << endl;
return 0;
}
|
#include <iostream>
using namespace std;
main() {
long long int n, i;
long long int out;
cin >> n;
out = 1;
for (i = n; i > 0; i--) {
out *= i;
}
cout << out << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 55
|
#include <stdio.h>
int factorial(int n) { return n > 1 ? n * factorial(n - 1) : 1; }
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", factorial(n));
return 0;
}
|
#include <stdio.h>
long long unsigned int factorial(int n) {
return n > 1 ? n * factorial(n - 1) : 1;
}
int main(void) {
int n;
scanf("%d", &n);
printf("%llu\n", factorial(n));
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 87], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 62
|
#include <iostream>
using namespace std;
int main() {
int n;
int result = 1;
cin >> n;
for (int i = n; i > 0; i--) {
result *= i;
}
cout << result << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int result = 1;
cin >> n;
for (int i = n; i > 0; i--) {
result *= i;
}
cout << result << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 53
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int num, fac = 1;
int main() {
cin >> num;
for (int i = 1; i <= num; i++) {
fac *= i;
}
cout << fac << endl;
return 0;
}
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int num;
long long int fac = 1;
int main() {
cin >> num;
for (int i = 1; i <= num; i++) {
fac *= i;
}
cout << fac << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 39, 40]]
| 1
| 70
|
#include <iostream>
using namespace std;
int main(void) {
unsigned int n;
unsigned int fact = 1;
cin >> n;
while (n)
fact *= n--;
cout << fact << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
unsigned long long int n;
unsigned long long int fact = 1;
cin >> n;
while (n)
fact *= n--;
cout << fact << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 45
|
#include <iostream>
using namespace std;
double factorial(int x) {
if (x != 1)
return x * factorial(x - 1);
else if (x == 1)
return 1;
}
int main() {
int a;
cin >> a;
cout << factorial(a) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
unsigned long long factorial(int x) {
if (x != 1)
return x * factorial(x - 1);
else if (x == 1)
return 1;
}
int main() {
int a;
cin >> a;
cout << factorial(a) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 87], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 65
|
#include <iostream>
using namespace std;
int main() {
int n;
long long sum = 1;
for (int i = 1; i <= n; i++) {
sum *= i;
}
cout << sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long sum = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
sum *= i;
}
cout << sum << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 50
|
#include <cmath>
#include <cstdio>
int main() {
int n, i, fac;
scanf("%d", &i);
fac = 1;
for (; i > 1; i--) {
fac = fac * i;
}
printf("%d\n", fac);
return 0;
}
|
#include <cmath>
#include <cstdio>
int main() {
long long n, i, fac;
scanf("%lld", &i);
fac = 1;
for (; i > 1; i--) {
fac = fac * i;
}
printf("%lld\n", fac);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 62
|
#include <iostream>
using namespace std;
int main() {
int n;
int result;
cin >> n;
result = 1;
for (int i = 1; i < n + 1; i++) {
result *= i;
}
cout << result << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int result;
cin >> n;
result = 1;
for (int i = 1; i < n + 1; i++) {
result *= i;
}
cout << result << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 54
|
// 14
#include <iostream>
using namespace std;
int main() {
int n;
int ans = 1;
cin >> n;
while (n) {
ans *= n--;
}
cout << ans << endl;
return 0;
}
|
// 14
#include <iostream>
using namespace std;
int main() {
int n;
long long ans = 1;
cin >> n;
while (n) {
ans *= n--;
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 45
|
#include <cstdio>
int n;
int answer = 1;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
answer *= i + 1;
}
printf("%d\n", answer);
return 0;
}
|
#include <cstdio>
int n;
long long answer = 1;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
answer *= i + 1;
}
printf("%lld\n", answer);
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 61
|
#include <iostream>
using namespace std;
int main() {
int n, s = 1;
cin >> n;
for (int i = 0; n - i > 0; i++)
s = s * (n - i);
cout << s << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int s = 1;
cin >> n;
for (int i = 0; n - i > 0; i++)
s = s * (n - i);
cout << s << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]]
| 1
| 55
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (!feof(stdin)) {
int n, sum = 1;
scanf("%d", &n);
if (feof(stdin))
break;
for (int i = 1; i <= n; i++)
sum *= i;
printf("%d\n", sum);
}
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (!feof(stdin)) {
int n;
double sum = 1;
scanf("%d", &n);
if (feof(stdin))
break;
for (int i = 1; i <= n; i++)
sum *= i;
printf("%.0f\n", sum);
}
}
|
[["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 78
|
#include <iostream>
using namespace std;
int main(void) {
int n;
long long int sum;
while (cin >> n) {
for (int i = 1; i <= n; i++) {
sum *= i;
}
cout << sum << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n;
long long int sum = 1;
while (cin >> n) {
for (int i = 1; i <= n; i++) {
sum *= i;
}
cout << sum << endl;
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 58
|
#include <iostream>
using namespace std;
int main() {
int x;
long long int sum = 0;
while (cin >> x) {
for (int i = 1; i <= x; i++) {
sum *= i;
}
cout << sum << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int x;
long long int sum = 1;
while (cin >> x) {
for (int i = 1; i <= x; i++) {
sum *= i;
}
cout << sum << endl;
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 59
|
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
cin >> n;
while (n > 1)
ans *= n--;
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
long long n, ans = 1;
cin >> n;
while (n > 1)
ans *= n--;
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 47
|
#include <iostream>
int func(int n) {
if (n == 0)
return 1;
return n * func(n - 1);
}
int main(void) {
int n;
std::cin >> n;
std::cout << func(n) << std::endl;
return 0;
}
|
#include <iostream>
unsigned long func(unsigned long n) {
if (n == 0)
return 1;
return n * func(n - 1);
}
int main(void) {
unsigned long n;
std::cin >> n;
std::cout << func(n) << std::endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 87], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 87], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 61
|
#include <iostream>
int main() {
int n;
int s = 1;
std::cin >> n;
for (int i = 1; i <= n; ++i) {
s *= i;
}
std::cout << s << '\n';
}
|
#include <iostream>
int main() {
int n;
unsigned long long int s = 1;
std::cin >> n;
for (int i = 1; i <= n; ++i) {
s *= i;
}
std::cout << s << '\n';
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 52
|
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
for (int i = n; i > 2; i--) {
n = n * (i - 1);
}
cout << n << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
unsigned long n;
cin >> n;
for (int i = n; i > 2; i--) {
n = n * (i - 1);
}
cout << n << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 55
|
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
cin >> n;
for (int i = n; i > 0; i--) {
ans = ans * i;
}
cout << ans;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, ans = 1;
cin >> n;
for (int i = n; i > 0; i--) {
ans = ans * i;
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 49
|
#include <stdio.h>
long long int ans[22];
void init();
int main() {
long long int s;
init();
while (scanf("%I64d", &s) == 1) {
printf("%I64d", ans[s]);
}
return 0;
}
void init() {
ans[0] = 0;
ans[1] = 1;
for (long long int i = 2; i <= 20; i++) {
ans[i] = ans[i - 1] * i;
}
}
|
#include <stdio.h>
long long int ans[22];
void init();
int main() {
long long int s;
init();
while (scanf("%lld", &s) == 1) {
printf("%lld\n", ans[s]);
}
return 0;
}
void init() {
ans[0] = 0;
ans[1] = 1;
for (long long int i = 2; i <= 20; i++) {
ans[i] = ans[i - 1] * i;
}
}
|
[["-", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["+", 51, 16, 31, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 113
|
#include <iostream>
using namespace std;
void solve() {
int n;
cin >> n;
unsigned long long int ans = 1;
for (int i = 1; i < n; ++i) {
ans *= i;
}
cout << ans << endl;
}
int main() {
solve();
return (0);
}
|
#include <iostream>
using namespace std;
void solve() {
int n;
cin >> n;
unsigned long long int ans = 1;
for (int i = 1; i <= n; ++i) {
ans *= i;
}
cout << ans << endl;
}
int main() {
solve();
return (0);
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 68
|
#include <iostream>
using namespace std;
unsigned int f(int n) {
if (n == 1)
return 1;
else
return n * f(n - 1);
}
int main() {
int n;
cin >> n;
cout << f(n);
return 0;
}
|
#include <iostream>
using namespace std;
unsigned long long int f(int n) {
if (n == 1)
return 1;
else
return n * f(n - 1);
}
int main() {
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 58
|
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n, result;
cin >> n;
result = n;
for (int i = 1; i < n; i++)
result *= i;
cout << result << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
long result;
cin >> n;
result = n;
for (int i = 1; i < n; i++)
result *= i;
cout << result << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 60
|
#include <iostream>
using namespace std;
int f(int n) {
if (n == 1)
return 1;
return n * f(n - 1);
}
int main() {
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long f(long long n) {
if (n == 1)
return 1;
return n * f(n - 1);
}
int main() {
long long n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 58
|
#include <cstdio>
using namespace std;
int main(void) {
int a;
double b = 1;
scanf("%d", &a);
for (int i = 1; i <= a; i++) {
b = b * a;
}
printf("%.0lf\n", b);
return 0;
}
|
#include <cstdio>
using namespace std;
int main(void) {
double a;
double b = 1;
scanf("%lf", &a);
for (double i = 1; i <= a; i++) {
b = b * i;
}
printf("%.0lf\n", b);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]]
| 1
| 66
|
#include <iostream>
using namespace std;
int main() {
unsigned int n, s;
cin >> n;
s = 1;
for (n; n > 0; n--)
s *= n;
cout << s << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long n, s;
cin >> n;
s = 1;
for (n; n > 0; n--)
s *= n;
cout << s << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 50
|
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
cin >> n;
for (int i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
long long int ans = 1;
cin >> n;
for (int i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]]
| 1
| 54
|
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, ans = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 49
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
unsigned int out;
int n;
while (cin >> n) {
out = 1;
for (int i = 0; i <= n; i++) {
if (i) {
out *= i;
}
}
cout << out << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
long long out;
int n;
while (cin >> n) {
out = 1;
for (int i = 0; i <= n; i++) {
if (i) {
out *= i;
}
}
cout << out << endl;
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 88
|
#include <iostream>
using namespace std;
int main() {
int f = 1;
int i;
cin >> i;
for (; i > 1; i--) {
f *= i;
}
cout << f << "\n";
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int f = 1;
int i;
cin >> i;
for (; i > 1; i--) {
f *= i;
}
cout << f << "\n";
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 51
|
#include <iostream>
int main() {
int n, m = 1;
std::cin >> n;
for (int i = n; i > 0; i--)
m *= i;
std::cout << m << std::endl;
return 0;
}
|
#include <iostream>
int main() {
int n;
long long int m = 1;
std::cin >> n;
for (int i = n; i > 0; i--)
m *= i;
std::cout << m << std::endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]]
| 1
| 52
|
#include <functional>
#include <iostream>
using namespace std;
int main() {
function<int(int)> const fact = [&](int n) -> int {
return n == 0 ? 1 : fact(n - 1) * n;
};
int i;
cin >> i;
cout << fact(i) << endl;
}
|
#include <functional>
#include <iostream>
using namespace std;
int main() {
function<long long(int)> const fact = [&](int n) -> long long {
return n == 0 ? 1 : fact(n - 1) * n;
};
int i;
cin >> i;
cout << fact(i) << endl;
}
|
[["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 39, 344, 3, 347, 0, 77, 39, 86, 0, 96], ["-", 51, 218, 49, 185, 0, 351, 0, 77, 39, 40], ["+", 49, 185, 0, 351, 0, 77, 39, 86, 0, 96]]
| 1
| 68
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
int b = 1;
while (a != 0) {
b *= a;
a--;
}
cout << b << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
long long int b = 1;
while (a != 0) {
b *= a;
a--;
}
cout << b << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 56
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, j) for (int i = 0; i < j; i++)
#define FOR(i, j, k) for (int i = j; i < k; i++)
const int N = 5;
int dfs(int n) {
if (n == 0)
return 1;
else
return dfs(n - 1) * n;
}
int main() {
int n;
cin >> n;
cout << dfs(n) << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, j) for (int i = 0; i < j; i++)
#define FOR(i, j, k) for (int i = j; i < k; i++)
const int N = 5;
long long int dfs(long long int n) {
if (n == 0)
return 1;
else
return dfs(n - 1) * n;
}
int main() {
long long int n;
cin >> n;
cout << dfs(n) << endl;
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 87
|
#include <iostream>
using namespace std;
int main() {
int n, i, f = 1;
cin >> n;
for (i = 1; i <= n; i++) {
f *= i;
}
cout << f << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, i;
long long f = 1;
cin >> n;
for (i = 1; i <= n; i++) {
f *= i;
}
cout << f << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 53
|
#include <iostream>
unsigned fact(unsigned int n) {
if (n <= 1)
return 1;
else
return n * fact(n - 1);
}
int main() {
unsigned n;
std::cin >> n;
std::cout << fact(n) << std::endl;
}
|
#include <iostream>
unsigned long long fact(unsigned long long n) {
if (n <= 1)
return 1;
else
return n * fact(n - 1);
}
int main() {
unsigned long long n;
std::cin >> n;
std::cout << fact(n) << std::endl;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 49, 53, 54, 55, 0, 56, 39, 86, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 59
|
#include <iostream>
using namespace std;
int factorial(int n) {
if (n > 0) {
return n * factorial(n - 1);
} else {
return 1;
}
}
int main() {
int n;
cin >> n;
cout << factorial(n) << endl;
}
|
#include <iostream>
using namespace std;
long long int factorial(long long int n) {
if (n > 0) {
return n * factorial(n - 1);
} else {
return 1;
}
}
int main() {
long long int n;
cin >> n;
cout << factorial(n) << endl;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 60
|
#include <iostream>
using namespace std;
int rep(int n) {
if (n == 0)
return 1;
return n * rep(n - 1);
}
int main() {
int n;
cin >> n;
cout << rep(n) << endl;
}
|
#include <iostream>
using namespace std;
long long int rep(long long int n) {
if (n == 0)
return 1;
return n * rep(n - 1);
}
int main() {
long long int n;
cin >> n;
cout << rep(n) << endl;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 55
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int pro = 1;
vector<int> array;
cin >> n;
for (int i = n; i > 0; i--) {
array.push_back(i);
}
for (int i = 0; i < array.size(); i++) {
pro *= array[i];
}
cout << pro << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long long pro = 1;
vector<int> array;
cin >> n;
for (int i = n; i > 0; i--) {
array.push_back(i);
}
for (int i = 0; i < array.size(); i++) {
pro *= array[i];
}
cout << pro << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 91
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int fact(int n);
int main(void) {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
int fact(int n) {
if (n == 1)
return 1;
else
return fact(n - 1) * n;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long fact(int n);
int main(void) {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
long fact(int n) {
if (n == 1)
return 1;
else
return fact(n - 1) * n;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 79
|
#include <stdio.h>
int main(void) {
long long int s;
int n, i;
scanf("%d", &n);
s = 1;
for (i = 2; i <= n; i++) {
s = s * i;
}
printf("%d\n", s);
return 0;
}
|
#include <stdio.h>
int main(void) {
long long int s;
int n, i;
scanf("%d", &n);
s = 1;
for (i = 2; i <= n; i++) {
s = s * i;
}
printf("%lld\n", s);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 67
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, j = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
j *= i;
}
cout << j << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long int n, j = 1;
cin >> n;
for (long long int i = 1; i <= n; i++) {
j *= i;
}
cout << j << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]]
| 1
| 54
|
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int ans = 1;
for (int i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
long long ans = 1;
for (int i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 54
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 1;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 1;
for (long long i = 1; i <= n; i++)
ans *= i;
cout << ans << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]]
| 1
| 48
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int x = 1;
for (int i = 0; i < n; ++i) {
x = x * (i + 1);
}
cout << x;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int x = 1;
for (int i = 0; i < n; ++i) {
x = x * (i + 1);
}
cout << x << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 57
|
#include <stdio.h>
int main(void) {
unsigned long long int kai = 1;
int n, i, x = 0;
scanf("%d", &n);
for (i = 1; i < n + 1; i++) {
kai = kai * i;
while (kai % 10 == 0) {
kai = kai / 10;
x += 1;
}
}
if (x == 0) {
printf("%d\n", kai);
} else {
printf("%d", kai);
for (i = 0; i < x; i++) {
printf("%d", 0);
}
printf("\n");
}
return 0;
}
|
#include <stdio.h>
int main(void) {
unsigned long long int kai = 1;
int n, i, x = 0;
scanf("%d", &n);
for (i = 1; i < n + 1; i++) {
kai = kai * i;
while (kai % 10 == 0) {
kai = kai / 10;
x += 1;
}
}
if (x == 0) {
printf("%llu\n", kai);
} else {
printf("%llu", kai);
for (i = 0; i < x; i++) {
printf("%d", 0);
}
printf("\n");
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 143
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rp(i, c) rep(i, (int)c.size())
#define fr(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(u) (u).rbegin(), (u).rend()
#define dbg(x) cerr << #x << " = " << (x) << endl
#define v_delete(a, b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector<T>>
#define init(a, b) memset((a), (b), sizeof((a)))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = 1 << 28;
const double INF = 1e10, EPS = 1e-9;
template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
string res;
stringstream ss;
ss << num;
return ss.str();
}
template <class T> T StringToInt(string str) {
T res = 0;
for (int i = 0; i < SIZE(str); i++)
res = (res * 10 + str[i] - '0');
return res;
}
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> void input(T &a, int n) {
for (int i = 0; i < n; ++i)
cin >> a[i];
}
template <class T> void input(T *a, int n) {
for (int i = 0; i < n; ++i)
cin >> a[i];
}
typedef pair<int, int> pii;
inline bool IN(int x, int y, int w, int h) {
return 0 <= x && x < w && 0 <= y && y < h;
}
int main() {
int n;
cin >> n;
int ans = 1;
while (n) {
ans *= n;
n--;
}
cout << ans << endl;
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rp(i, c) rep(i, (int)c.size())
#define fr(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(u) (u).rbegin(), (u).rend()
#define dbg(x) cerr << #x << " = " << (x) << endl
#define v_delete(a, b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector<T>>
#define init(a, b) memset((a), (b), sizeof((a)))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = 1 << 28;
const double INF = 1e10, EPS = 1e-9;
template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
string res;
stringstream ss;
ss << num;
return ss.str();
}
template <class T> T StringToInt(string str) {
T res = 0;
for (int i = 0; i < SIZE(str); i++)
res = (res * 10 + str[i] - '0');
return res;
}
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> void input(T &a, int n) {
for (int i = 0; i < n; ++i)
cin >> a[i];
}
template <class T> void input(T *a, int n) {
for (int i = 0; i < n; ++i)
cin >> a[i];
}
typedef pair<int, int> pii;
inline bool IN(int x, int y, int w, int h) {
return 0 <= x && x < w && 0 <= y && y < h;
}
int main() {
int n;
cin >> n;
long long int ans = 1;
while (n) {
ans *= n;
n--;
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 499
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.