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
| change_count
int64 0
100
|
|---|---|---|---|---|---|
#include <iostream>
using namespace std;
int main() {
int i, n;
int fact = 1;
cin >> n;
for (i = 2; i <= n; i++) {
fact *= i;
}
cout << fact << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int i, n;
unsigned long fact = 1;
cin >> n;
for (i = 2; i <= n; i++) {
fact *= i;
}
cout << fact << 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
| 54
| 3
|
#include <iostream>
using namespace std;
int main() {
int n, ans;
cin >> n;
ans = 1;
for (int i = n; i > 0; i--)
ans *= i;
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, ans;
cin >> n;
ans = 1;
for (int i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 49
| 4
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
scanf("%d", &n);
for (int i = 2; i <= n; i++) {
ans *= i;
}
printf("%d\n", ans);
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long n, ans = 1;
scanf("%lld", &n);
for (int i = 2; i <= n; i++) {
ans *= i;
}
printf("%lld\n", ans);
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
| 64
| 7
|
#include <iostream>
using namespace std;
main() {
int i, n, r;
r = 1;
cin >> n;
for (i = 1; i <= n; ++i) {
r = r * i;
}
cout << r << endl;
}
|
#include <iostream>
using namespace std;
main() {
int i, n;
long long int r;
r = 1;
cin >> n;
for (i = 1; i <= n; ++i) {
r = r * i;
}
cout << r << 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
| 53
| 5
|
#include <iostream>
using namespace std;
int kaijo(int n) {
if (n <= 1)
return 1;
return n * kaijo(n - 1);
}
int main() {
int n;
cin >> n;
cout << kaijo(n) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long kaijo(int n) {
if (n <= 1)
return 1;
return (long long)n * kaijo(n - 1);
}
int main() {
int n;
cin >> n;
cout << kaijo(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 8, 9, 0, 37, 0, 16, 31, 74, 0, 24], ["+", 0, 16, 31, 74, 39, 77, 39, 86, 0, 96], ["+", 8, 9, 0, 37, 0, 16, 31, 74, 0, 25]]
| 1
| 58
| 7
|
#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 (int 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]]
| 1
| 50
| 3
|
#include <iostream>
using namespace std;
int fact(int n) {
if (n <= 1)
return n;
else
return n * fact(n - 1);
}
int main(int argc, char *argv[]) {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long int fact(long long int n) {
if (n <= 1)
return n;
else
return n * fact(n - 1);
}
int main(int argc, char *argv[]) {
long long int n;
cin >> n;
cout << fact(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
| 67
| 6
|
#include <iostream>
using namespace std;
int main() {
int n, sum = 1;
cin >> n;
for (int k = 1; k <= n; k++) {
sum = sum * k;
}
cout << sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long n, sum = 1;
cin >> n;
for (int k = 1; k <= n; k++) {
sum = sum * k;
}
cout << sum << 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
| 3
|
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, ans = 1;
cin >> n;
for (long long int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << "\n";
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 8, 9, 0, 7, 10, 43, 39, 86, 0, 96]]
| 1
| 54
| 4
|
#include <iostream>
using namespace std;
int fact(int n) {
if (n == 1) {
return 1;
} else {
return n * fact(n - 1);
}
}
int main() {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long int fact(long long int n) {
if (n == 1) {
return 1;
} else {
return n * fact(n - 1);
}
}
int main() {
long long int n;
cin >> n;
cout << fact(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
| 63
| 6
|
puts 2..(gets.to_i).inject(1){|r,x|r*x}
|
puts (2..(gets.to_i)).inject(1){|r,x|r*x}
|
[["+", 0, 652, 3, 4, 0, 652, 486, 739, 0, 24], ["+", 0, 652, 486, 739, 0, 475, 444, 739, 0, 25]]
| 4
| 23
| 2
|
STDIN.gets.chomp.to_i.downto(2).inject(1) { |a, e| a * e }
|
puts STDIN.gets.chomp.to_i.downto(2).inject(1) { |a, e| a * e }
|
[["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]]
| 4
| 27
| 1
|
n = gets.chomp
result = 1
while n > 0 do
result *= n
n -= 1
end
puts result
|
n = gets.to_i
result = 1
while n > 0 do
result *= n
n -= 1
end
puts result
|
[["-", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 662, 12, 652, 735, 22]]
| 4
| 22
| 2
|
while n = gets.to_i && n
def fact(n) n > 0 ? n * fact(n - 1) : 1 end
puts fact(n)
end
|
while n = gets
n = n.to_i
def fact(n) n > 0 ? n * fact(n - 1) : 1 end
puts fact(n)
end
|
[["+", 0, 493, 0, 89, 8, 170, 0, 662, 31, 22], ["+", 0, 493, 0, 89, 8, 170, 0, 662, 0, 32], ["+", 0, 89, 8, 170, 0, 662, 12, 652, 486, 22], ["-", 0, 493, 0, 89, 15, 662, 12, 738, 17, 98], ["-", 0, 493, 0, 89, 15, 662, 12, 738, 12, 22]]
| 4
| 34
| 5
|
#include <stdio.h>
int main(void) {
int i, n, sum = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
sum *= i;
}
printf("%d\n", sum);
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, n;
long sum = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
sum *= i;
}
printf("%ld\n", sum);
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, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 60
| 5
|
#include <stdio.h>
int main(void) {
int n, i, kaijo;
kaijo = 1;
scanf("%d", &n);
for (i = n; i > 0; i--) {
kaijo *= i;
}
printf("%d\n", kaijo);
return 0;
}
|
#include <stdio.h>
int main(void) {
long n, i, kaijo;
kaijo = 1;
scanf("%ld", &n);
for (i = n; i > 0; i--) {
kaijo *= i;
}
printf("%ld\n", kaijo);
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]]
| 0
| 62
| 6
|
#include <stdio.h>
int N(int n) {
if (n == 1) {
return n;
} else {
return n * N(n - 1);
}
}
int main(void) {
int n;
scanf("%d", &n);
printf("%lld\n", N(n));
return 0;
}
|
#include <stdio.h>
long long int N(int n) {
if (n == 1) {
return n;
} else {
return n * N(n - 1);
}
}
int main(void) {
int n;
scanf("%d", &n);
printf("%lld\n", N(n));
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 0
| 70
| 2
|
#include <stdio.h>
main() {
int i, n;
long ans;
ans = 1;
scanf("%d", &n);
for (i = n; i > 0; i--) {
ans *= i;
}
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
main() {
int i, n;
long long ans;
ans = 1;
scanf("%d", &n);
for (i = n; i > 0; i--) {
ans *= i;
}
printf("%lld\n", ans);
return 0;
}
|
[["+", 0, 30, 0, 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]]
| 0
| 62
| 3
|
#include <stdio.h>
int main() {
int i, n, a;
scanf("%d", &n);
for (a = 1, i = 1; i <= n; i++) {
a *= i;
}
printf("%d\n", a);
return 0;
}
|
#include <stdio.h>
int main() {
int i, n;
double a;
scanf("%d", &n);
for (a = 1, i = 1; i <= n; i++) {
a *= i;
}
printf("%.0f\n", a);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 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
| 61
| 5
|
#include <stdio.h>
unsigned long long factorial(int n) {
if (n == 1)
return 1;
else
return n * factorial(n - 1);
}
int main() {
int n;
scanf("%d", &n);
printf("%ull\n", factorial(n));
return 0;
}
|
#include <stdio.h>
unsigned long long factorial(int n) {
if (n == 1)
return 1;
else
return n * factorial(n - 1);
}
int main() {
int n;
scanf("%d", &n);
printf("%llu\n", factorial(n));
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 67
| 2
|
#include <stdio.h>
int main(void) {
unsigned long long factoricals[21];
int i;
factoricals[0] = 1;
for (i = 1; i < 20; i++) {
factoricals[i] = factoricals[i - 1] * i;
}
scanf("%d", &i);
printf("%I64u\n", factoricals[i]);
return 0;
}
|
#include <stdio.h>
int main(void) {
unsigned long long factoricals[21];
int i;
factoricals[0] = 1;
for (i = 1; i <= 20; i++) {
factoricals[i] = factoricals[i - 1] * i;
}
scanf("%d", &i);
printf("%llu\n", factoricals[i]);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 82
| 4
|
// AOJ Volume 0 Problem 0019
#include <stdio.h>
int main(void) {
long long f;
int n;
int i;
scanf("%d", &n);
f = 1;
for (; n > 1; n--) {
f *= n;
}
printf("%u", f / 100000000);
printf("%u\n", f % 100000000);
return (0);
}
|
#include <stdio.h>
int main(void) {
long long f;
int n;
int i;
scanf("%d", &n);
f = 1;
for (; n > 1; n--) {
f *= n;
}
printf("%u", f / 1000000000);
printf("%u\n", f % 1000000000);
return (0);
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 0
| 78
| 4
|
n;
main(float i) {
for (i = scanf("%d", &n); n; i *= n--)
;
n = !printf("%.f\n", i);
}
|
n;
main(double i) {
for (i = scanf("%d", &n); n; i *= n--)
;
n = !printf("%.f\n", i);
}
|
[["-", 36, 36, 0, 30, 0, 113, 39, 77, 39, 40], ["+", 36, 36, 0, 30, 0, 113, 39, 77, 39, 40]]
| 0
| 45
| 2
|
n;
main(i) {
for (scanf("%d", &n); n; i *= n--)
;
n = !printf("%d\n", i);
}
|
n;
main(long i) {
for (i = scanf("%d", &n); n; i *= n--)
;
n = !printf("%ld\n", i);
}
|
[["+", 0, 30, 0, 113, 39, 77, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 113, 0, 25, 0, 35], ["+", 0, 30, 0, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 30, 0, 9, 0, 7, 10, 11, 17, 32], ["-", 12, 91, 28, 2, 3, 4, 0, 5, 0, 6], ["+", 12, 91, 28, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 41
| 4
|
n;
main(i) {
for (scanf("%d", &n); n; i *= n--)
;
n = !printf("%d\n", i);
}
|
n;
main(long i) {
for (scanf("%d", &n); n; i *= n--)
;
n = !printf("%ld\n", i);
}
|
[["+", 0, 30, 0, 113, 39, 77, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 113, 0, 25, 0, 35], ["-", 12, 91, 28, 2, 3, 4, 0, 5, 0, 6], ["+", 12, 91, 28, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 41
| 4
|
#include <stdio.h>
/** Application main entry point. */
int main(int argc, char *argv[]) {
int res = 1;
int n;
scanf("%d", &n);
while (n) {
res *= n--;
}
printf("%d\n", res);
return (0);
}
|
#include <stdio.h>
/** Application main entry point. */
int main(int argc, char *argv[]) {
unsigned long long int res = 1;
int n;
scanf("%d", &n);
while (n) {
res *= n--;
}
printf("%lld\n", res);
return (0);
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 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]]
| 0
| 61
| 5
|
#include <stdio.h>
main() {
int n;
long int sum;
scanf("%d", &n);
sum = n;
while (n > 1) {
n--;
sum *= n;
}
printf("%d\n", sum);
return 0;
}
|
#include <stdio.h>
main() {
int n;
long long int sum;
scanf("%d", &n);
sum = n;
while (n > 1) {
n--;
sum *= n;
}
printf("%lld\n", sum);
return 0;
}
|
[["+", 0, 30, 0, 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]]
| 0
| 57
| 3
|
#include <stdio.h>
int main(int argc, char *argv[]) {
int n, i, fact = 1;
scanf("%d", &n);
for (i = 1; i < (n + 1); ++i) {
fact *= i;
}
printf("%d\n", fact);
return 0;
}
|
#include <stdio.h>
int main(int argc, char *argv[]) {
int n, i;
long long int fact = 1;
scanf("%d", &n);
for (i = 1; i < (n + 1); ++i) {
fact *= i;
}
printf("%lld\n", fact);
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]]
| 0
| 71
| 7
|
#include <stdio.h>
int factorial(int x, int y) {
if (x == 1)
return y;
else {
y *= x;
factorial(x - 1, y);
}
}
int main() {
int a;
scanf("%d", &a);
printf("%d\n", factorial(a, 1));
return 0;
}
|
#include <stdio.h>
long long int factorial(int x, long long int y) {
if (x == 1)
return y;
else {
y *= x;
factorial(x - 1, y);
}
}
int main() {
int a;
scanf("%d", &a);
printf("%lld\n", factorial(a, 1));
return 0;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 75
| 6
|
#include <stdio.h>
int main() {
int n, i;
scanf("%d", &n);
for (i = n - 1; i >= 1; i--)
n *= i;
printf("%d\n", n);
return 0;
}
|
#include <stdio.h>
int main() {
long long n;
int i;
scanf("%lld", &n);
for (i = n - 1; i >= 1; i--)
n *= i;
printf("%lld\n", n);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 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
| 55
| 10
|
main(a) {
return ~scanf("%d", &a) ? !printf("%d", main(a)) : a ? main(a - 1) * a : 1;
}
|
long long main(a) {
return ~scanf("%d", &a) ? !printf("%lld\n", main(a))
: a ? main(a - 1) * a
: 1;
}
|
[["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 64, 91, 28, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 91, 28, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 91, 28, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 44
| 5
|
long long main(a) {
return ~scanf("%d", &a) ? !printf("%lld\n", main(a))
: a < 20 && a ? main(a - 1) * a
: 1;
}
|
long long main(a) {
return ~scanf("%d", &a) ? !printf("%lld\n", main(a))
: a < 21 && a ? main(a - 1) * a
: 1;
}
|
[["-", 0, 41, 75, 41, 15, 16, 31, 16, 12, 13], ["+", 0, 41, 75, 41, 15, 16, 31, 16, 12, 13]]
| 0
| 51
| 2
|
#include <limits.h>
#include <stdio.h>
int main() {
long long unsigned int ans = 1;
int a;
scanf("%llu", &a);
while (a > 1) {
ans *= a;
a -= 1;
}
printf("%llu\n", ans);
return 0;
}
|
#include <limits.h>
#include <stdio.h>
int main() {
long long unsigned int ans = 1;
int a;
scanf("%d", &a);
while (a > 1) {
ans *= a;
a -= 1;
}
printf("%llu\n", ans);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 60
| 2
|
#include <stdio.h>
int main() {
int n, a = 1;
scanf("%d", &n);
while (n > 1) {
a *= n;
n--;
}
printf("%d\n", a);
return 0;
}
|
#include <stdio.h>
int main() {
int n;
long long a = 1;
scanf("%d", &n);
while (n > 1) {
a *= n;
n--;
}
printf("%lld\n", a);
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, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 53
| 6
|
#include <stdio.h>
int main(void) {
int f = 1;
int a = 0;
scanf("%d", &a);
while (a) {
f *= a;
a--;
}
printf("%d\n", f);
return 0;
}
|
#include <stdio.h>
int main(void) {
long long int f = 1;
int a = 0;
scanf("%d", &a);
while (a) {
f *= a;
a--;
}
printf("%lld\n", f);
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]]
| 0
| 55
| 4
|
#include <stdio.h>
int main() {
long long int a, n;
scanf("%lld", &n);
for (a = n; n > 0; n--)
a *= n;
printf("%lld\n", a);
return 0;
}
|
#include <stdio.h>
int main() {
unsigned long long int a, n;
scanf("%llu", &n);
for (a = 1; n > 0; n--)
a *= n;
printf("%llu\n", a);
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["-", 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, 11, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]]
| 0
| 55
| 7
|
#include <stdio.h>
int f(int a) {
if (a == 0) {
return 1;
}
return (f(a - 1) * a);
}
int main(void) {
int n;
scanf("%d", &n);
if (1 <= n && n <= 20) {
printf("%d\n", f(n));
}
return 0;
}
|
#include <stdio.h>
long long f(long long a) {
if (a == 0) {
return 1;
}
return (f(a - 1) * a);
}
int main(void) {
int n;
scanf("%d", &n);
if (1 <= n && n <= 20) {
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, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 81
| 8
|
#include <stdio.h>
int main(void) {
int n, ans;
int i;
scanf("%d", &n);
ans = n;
for (i = n - 1; i > 0; i--)
ans = ans * i;
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
long long ans;
int i;
scanf("%d", &n);
ans = n;
for (i = n - 1; i > 0; i--)
ans = ans * i;
printf("%lld\n", ans);
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, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 65
| 6
|
#include <stdio.h>
int factorial(int n) {
if (n <= 1)
return 1;
else
return n * factorial(n - 1);
}
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", factorial(n));
return 0;
}
|
#include <stdio.h>
long factorial(long n) {
if (n <= 1)
return 1;
else
return n * factorial(n - 1);
}
int main(void) {
long n;
scanf("%ld", &n);
printf("%ld\n", factorial(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], ["-", 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]]
| 0
| 66
| 10
|
#include <stdio.h>
int main() {
int n, i;
unsigned long long x = 1;
scanf("%d", &n);
for (i = 2; i <= n; i++)
x *= i;
printf("%d\n", x);
return 0;
}
|
#include <stdio.h>
int main() {
int n, i;
unsigned long long x = 1;
scanf("%d", &n);
for (i = 2; i <= n; i++)
x *= i;
printf("%llu\n", x);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 60
| 2
|
#include <math.h>
#include <stdio.h>
#include <string.h>
int main() {
int n, i;
scanf("%d", &n);
i = n - 1;
while (i > 1) {
n *= i;
i--;
}
printf("%d\n", n);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <string.h>
int main() {
long n;
int i;
scanf("%d", &n);
i = n - 1;
while (i > 1) {
n *= i;
i--;
}
printf("%lld\n", n);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 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
| 61
| 7
|
#include <stdio.h>
int main() {
int n, factorial = 1;
scanf("%d", &n);
while (n > 1) {
factorial *= n;
n--;
}
printf("%d\n", factorial);
return 0;
}
|
#include <stdio.h>
int main() {
int n;
double factorial = 1;
scanf("%d", &n);
while (n > 1) {
factorial *= n;
n--;
}
printf("%.0f\n", factorial);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 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
| 53
| 5
|
#include <stdio.h>
int factorial(int);
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", factorial(n));
return 0;
}
int factorial(int n) {
if (n > 1)
return (n * factorial(n - 1));
else
return n;
}
|
#include <stdio.h>
long int factorial(int);
int main(void) {
int n;
scanf("%d", &n);
printf("%ld\n", factorial(n));
return 0;
}
long int factorial(int n) {
if (n > 1)
return (n * factorial(n - 1));
else
return n;
}
|
[["+", 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], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 0
| 74
| 4
|
#include <stdio.h>
int main(void) {
int n;
unsigned ans;
scanf("%d", &n);
ans = n--;
while (n > 1) {
ans *= n--;
}
printf("%lld\n", ans);
return (0);
}
|
#include <stdio.h>
int main(void) {
int n;
long long ans;
scanf("%d", &n);
ans = n--;
while (n > 1) {
ans *= n--;
}
printf("%lld\n", ans);
return (0);
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 87], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 0
| 58
| 3
|
#include <stdio.h>
int main() {
int x, fact, i;
fact = 1;
scanf("%d", &x);
for (i = 2; i <= x; i++)
fact = fact * i;
printf("%d\n", fact);
return 0;
}
|
#include <stdio.h>
int main() {
int x, i;
double fact = 1;
scanf("%d", &x);
for (i = 2; i <= x; i++)
fact = fact * i;
printf("%.0lf\n", fact);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 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
| 61
| 5
|
#include <stdio.h>
int main() {
int a, sum = 1;
scanf("%d", &a);
for (; a > 0; a--)
sum *= a;
printf("%d\n", sum);
return 0;
}
|
#include <stdio.h>
int main() {
int a;
double sum = 1;
scanf("%d", &a);
for (; a > 0; a--)
sum *= a;
printf("%.0f\n", sum);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 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
| 52
| 5
|
#include <stdio.h>
int main() {
int i, j, a = 1;
scanf("%d", &i);
for (j = 1; j <= i; j++) {
a = a * j;
}
printf("%d\n", a);
return (0);
}
|
#include <stdio.h>
int main() {
long int i, j, a = 1;
scanf("%ld", &i);
for (j = 1; j <= i; j++) {
a = a * j;
}
printf("%ld\n", a);
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]]
| 0
| 63
| 5
|
#include <stdio.h>
main() {
int i, n, x = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
x = x * i;
}
printf("%d\n", x);
return 0;
}
|
#include <stdio.h>
main() {
long long int i, n, x = 1;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
x = x * i;
}
printf("%lld\n", x);
return 0;
}
|
[["+", 0, 30, 0, 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]]
| 0
| 61
| 6
|
#include <stdio.h>
int main() {
double n, i;
scanf("%d", &n);
for (i = n; i > 1; i--)
n *= i;
printf("%.0lf\n", n);
return 0;
}
|
#include <stdio.h>
int main() {
double n, i;
scanf("%lf", &n);
for (i = n - 1; i > 1; i--)
n *= i;
printf("%.0lf\n", n);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]]
| 0
| 53
| 4
|
#include <math.h>
#include <stdio.h>
int main(void) {
long long int a = 1;
int n, i;
scanf("%d", n);
for (i = 2; i <= n; i++) {
a *= i;
}
printf("%lld\n", a);
return 0;
}
|
#include <math.h>
#include <stdio.h>
int main(void) {
long long int a = 1;
int n, i;
scanf("%d", &n);
for (i = 2; i <= n; i++) {
a *= i;
}
printf("%lld\n", a);
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 0
| 64
| 1
|
#include <stdio.h>
int main() {
int n;
int i;
int fc = 1;
scanf("%d", &n);
for (i = 2; i < n + 1; i++)
fc *= i;
printf("%d\n", fc);
return 0;
}
|
#include <stdio.h>
int main() {
int n;
int i;
long fc = 1;
scanf("%d", &n);
for (i = 2; i < n + 1; i++)
fc *= i;
printf("%ld\n", fc);
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]]
| 0
| 61
| 4
|
#include <stdio.h>
int main(void) {
int n, ans = 1;
int i;
scanf("%d", &n);
for (i = 2; i <= n; i++) {
ans *= i;
}
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
long long int ans = 1;
int i;
scanf("%d", &n);
for (i = 2; i <= n; i++) {
ans *= i;
}
printf("%lld\n", ans);
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]]
| 0
| 61
| 7
|
#include <stdio.h>
int main() {
int num;
scanf("%d", &num);
int i = 1, result = 1;
for (; i <= num; i++)
result *= i;
printf("%d\n", result);
return 0;
}
|
#include <stdio.h>
int main() {
int num;
scanf("%d", &num);
int i = 1;
long int result = 1;
for (; i <= num; i++)
result *= i;
printf("%ld\n", result);
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]]
| 0
| 57
| 6
|
#include <stdio.h>
int main(void) {
int n, i;
unsigned int ans = 1;
scanf("%d", &n);
for (i = 2; i <= n; i++) {
ans *= i;
}
printf("%u\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, i;
unsigned long long ans = 1;
scanf("%d", &n);
for (i = 2; i <= n; i++) {
ans *= i;
}
printf("%llu\n", ans);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 39, 86, 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]]
| 0
| 62
| 5
|
#include <stdio.h>
int main() {
int a, total = 1;
scanf("%d", &a);
while (a) {
total *= a;
a--;
}
printf("%d\n", total);
return 0;
}
|
#include <stdio.h>
int main() {
int a;
long long total = 1;
scanf("%d", &a);
while (a) {
total *= a;
a--;
}
printf("%lld\n", total);
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, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 51
| 6
|
#include <stdio.h>
int main() {
int n, i;
long long int x = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++)
x *= i;
printf("%d\n", x);
return 0;
}
|
#include <stdio.h>
int main() {
int n, i;
long long int x = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++)
x *= i;
printf("%lld\n", x);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 60
| 2
|
#include <stdio.h>
int main(int argc, char const *argv[]) {
int n;
int i;
scanf("%d", &n);
if (n >= 1 && n <= 20) {
for (i = n - 1; i > 0; --i) {
n *= i;
}
printf("%d\n", n);
}
return 0;
}
|
#include <stdio.h>
int main(int argc, char const *argv[]) {
long int n;
int i;
scanf("%ld", &n);
if (n >= 1 && n <= 20) {
for (i = n - 1; i > 0; --i) {
n *= i;
// printf("%ld %d\n", n,i);
// デバッグ
}
printf("%ld\n", n);
}
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]]
| 0
| 79
| 5
|
#include <stdio.h>
int Factorial(int n) { return n == 1 ? 1 : n * Factorial(n - 1); }
int main() {
int n;
scanf("%d", &n);
printf("%d\n", Factorial(n));
return 0;
}
|
#include <stdio.h>
long long int Factorial(int n) { return n == 1 ? 1 : n * Factorial(n - 1); }
int main() {
int n;
scanf("%d", &n);
printf("%lld\n", Factorial(n));
return 0;
}
|
[["+", 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]]
| 0
| 61
| 4
|
#include <stdio.h>
int main(void) {
long long n, i, ans = 1;
scanf("%d", &n);
for (i = n; i > 1; i--)
ans *= i;
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
long long n, i, ans = 1;
scanf("%d", &n);
for (i = n; i > 1; i--)
ans *= i;
printf("%lld\n", ans);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 59
| 2
|
#include <stdio.h>
int fanc(int n, int buf) {
if (n != 1)
buf = fanc(n - 1, buf * n);
return buf;
}
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", fanc(n, 1));
return 0;
}
|
#include <stdio.h>
long fanc(long n, long buf) {
if (n != 1)
buf = fanc(n - 1, buf * n);
return buf;
}
int main(void) {
long n;
scanf("%ld", &n);
printf("%ld\n", fanc(n, 1));
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], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 73
| 12
|
#include <stdio.h>
int i = 1;
int kaizyou(int kazu) {
if (kazu == 1) {
return 0;
} else {
i *= --kazu;
kaizyou(kazu);
}
}
int main() {
scanf("%d", &i);
kaizyou(i);
printf("%d\n", i);
return 0;
}
|
#include <stdio.h>
long long i = 1;
int kaizyou(int kazu) {
if (kazu == 1) {
return 0;
} else {
i *= --kazu;
kaizyou(kazu);
}
}
int main() {
scanf("%d", &i);
kaizyou(i);
printf("%lld\n", i);
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]]
| 0
| 73
| 5
|
#include <stdio.h>
int main(void) {
int n, i, ans = 0;
scanf("%d", &n);
ans = n;
for (i = 1; n - i >= 1; i++) {
ans *= n - i;
}
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, i;
long long int ans = 0;
scanf("%d", &n);
ans = n;
for (i = 1; n - i >= 1; i++) {
ans *= n - i;
}
printf("%lld\n", ans);
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]]
| 0
| 68
| 7
|
#include <stdio.h>
int main(void) {
int a, b, c;
scanf("%d", &a);
c = 1;
for (b = 1; b <= a; b++) {
c *= b;
}
printf("%d\n", c);
return (0);
}
|
#include <stdio.h>
int main(void) {
double a, b, c;
scanf("%lf", &a);
c = 1;
for (b = 1; b <= a; b++) {
c *= b;
}
printf("%.0f\n", c);
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
| 64
| 6
|
#include <stdio.h>
int factrial(int n) {
if (n == 1)
return 1;
return n * factrial(n - 1);
}
int main(void) {
int n;
scanf("%d\n", &n);
printf("%d\n", factrial(n));
return 0;
}
|
#include <stdio.h>
long long int factrial(int n) {
if (n == 1)
return 1;
return n * factrial(n - 1);
}
int main(void) {
int n;
scanf("%d\n", &n);
printf("%lld\n", factrial(n));
return 0;
}
|
[["+", 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]]
| 0
| 66
| 4
|
#include <stdio.h>
int main(void) {
int i, n, j;
scanf("%d", &n);
j = 1;
for (i = 1; i <= n; i++) {
j *= i;
}
printf("%d\n", j);
return 0;
}
|
#include <stdio.h>
int main(void) {
double i, n, j;
scanf("%lf", &n);
j = 1;
for (i = 1; i <= n; i++) {
j *= i;
}
printf("%.0lf\n", j);
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
| 62
| 6
|
#include <stdio.h>
int main() {
int i, n, m = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++)
m *= i;
printf("%d\n", m);
return 0;
}
|
#include <stdio.h>
int main() {
int i, n;
long m = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++)
m *= i;
printf("%ld\n", m);
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, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 57
| 5
|
#include <stdio.h>
int fact(int n) {
if (n == 0)
return 1;
else
return n * fact(n - 1);
}
int main(void) {
int i;
while (scanf("%d", &i) != EOF)
printf("%d\n", fact(i));
return 0;
}
|
#include <stdio.h>
long fact(int n) {
if (n == 0)
return 1;
else
return n * fact(n - 1);
}
int main(void) {
int i;
while (scanf("%d", &i) != EOF)
printf("%ld\n", fact(i));
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 70
| 4
|
#include <stdio.h>
int main(void) {
int in, i;
int sum = 1;
scanf("%d", &in);
for (i = 1; i <= in; i++)
sum *= i;
printf("%d\n", sum);
return 0;
}
|
#include <stdio.h>
int main(void) {
int in, i;
long long int sum = 1;
scanf("%d", &in);
for (i = 1; i <= in; i++) {
sum *= i;
}
printf("%lld\n", sum);
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 59
| 6
|
#include <stdio.h>
int main(void) {
int n;
long long i;
scanf("%d", &n);
for (i = 1; n > 1; n--) {
i = n * i;
}
printf("%d\n", i);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
long long i;
scanf("%d", &n);
for (i = 1; n > 1; n--) {
i = n * i;
}
printf("%llu\n", i);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 60
| 2
|
//
// main.cpp
// kyougi
//
// Created by 寺林 一旭 on 2018/08/27.
// Copyright © 2018年 寺林 一旭. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int num;
int inputValue;
vector<int> list;
while (cin >> num) // getline(cin, num))
{
int ans = 1;
for (int i = 1; i <= num; i++) {
ans = ans * i;
}
cout << ans << endl;
// cout << digit << endl;
// cout << a-b <<endl;
}
return 0;
}
|
//
// main.cpp
// kyougi
//
// Created by 寺林 一旭 on 2018/08/27.
// Copyright © 2018年 寺林 一旭. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long num;
int inputValue;
vector<int> list;
while (cin >> num) // getline(cin, num))
{
long ans = 1;
for (int i = 1; i <= num; i++) {
ans = ans * i;
}
cout << ans << endl;
// cout << digit << endl;
// cout << a-b <<endl;
}
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 86
| 4
|
#include <iostream>
using namespace std;
int main() {
int n;
int x = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
x = x * i;
}
cout << x;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int x = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
x = x * i;
}
cout << x << 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
| 50
| 4
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 1;
for (int i = 1; i <= n; i++) {
ans = ans * i;
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int ans = 1;
for (int i = 1; i <= n; i++) {
ans = ans * i;
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 52
| 2
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
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 <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]]
| 1
| 90
| 4
|
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int f(int n) {
if (n == 1)
return 1;
else
return n * f(n - 1);
}
int main() {
int n;
while (cin >> n)
cout << f(n) << endl;
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long long f(int n) {
if (n == 1)
return 1;
else
return n * f(n - 1);
}
int main() {
int n;
while (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
| 65
| 3
|
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, f = 1, i;
scanf("%d", &n);
for (i = 2; i <= n; i++)
f = f * i;
if (n == 0)
printf("0\n");
else
printf("%d\n", f);
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
long long int n, f = 1, i;
scanf("%lld", &n);
for (i = 1; i <= n; i++)
f = f * i;
if (n == 0)
printf("0\n");
else
printf("%lld\n", f);
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], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]]
| 1
| 82
| 8
|
#include <iostream>
using namespace std;
int main() {
int n, sum = 1;
cin >> n;
for (int a = 1; a <= n; a++) {
sum = sum * a;
}
cout << sum << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long int n, sum = 1;
cin >> n;
for (int a = 1; a <= n; a++) {
sum = sum * a;
}
cout << sum << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 54
| 1
|
#include <iostream>
using namespace std;
int main() {
int answer = 1;
int n;
cin >> n;
for (int i = n; i != 0; i--) {
answer *= i;
}
cout << answer;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long answer = 1;
int n;
cin >> n;
for (int i = n; i != 0; i--) {
answer *= i;
}
cout << answer << 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, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 51
| 5
|
#include <iostream>
using namespace std;
int f(int n) {
if (n == 1)
return 1;
if (n == 2)
return 2;
return n * f(n - 1);
}
int main() {
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long sum(int n) {
if (n == 1)
return 1;
if (n == 2)
return 2;
return n * sum(n - 1);
}
int main() {
int n;
cin >> n;
cout << sum(n) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 36, 36, 0, 30, 0, 14, 49, 53, 49, 22], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96], ["+", 36, 36, 0, 30, 0, 14, 49, 53, 49, 22], ["-", 8, 9, 0, 37, 0, 16, 12, 2, 63, 22], ["+", 8, 9, 0, 37, 0, 16, 12, 2, 63, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22]]
| 1
| 67
| 9
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int 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;
cin >> n;
long long sum = 1;
for (int i = 1; i <= n; i++)
sum *= i;
cout << sum << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 51
| 3
|
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int factrial(int n) {
if (n == 1)
return 1;
else
return n * factrial(n - 1);
}
int main() {
int n;
cin >> n;
cout << factrial(n) << endl;
}
|
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
LL factrial(int n) {
if (n == 1)
return 1;
else
return n * factrial(n - 1);
}
int main() {
int n;
cin >> n;
cout << factrial(n) << endl;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 78]]
| 1
| 324
| 2
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define INF 100000000
using namespace std;
typedef long long ll;
int num[21] = {0};
long long int kai(int n) {
if (num[n] != 0)
return num[n];
else {
num[n] = n * kai(n - 1);
return num[n];
}
}
int main() {
int n;
num[0] = num[1] = 1;
cin >> n;
cout << kai(n) << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define INF 100000000
using namespace std;
typedef long long ll;
ll num[21] = {0};
long long int kai(ll n) {
if (num[n] != 0)
return num[n];
else {
num[n] = n * kai(n - 1);
return num[n];
}
}
int main() {
int n;
num[0] = num[1] = 1;
cin >> n;
cout << kai(n) << endl;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]]
| 1
| 122
| 4
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//??????
ll factmemo[/*num*/] = {1};
ll fact(int n) {
if (factmemo[n] != 0)
return factmemo[n];
return factmemo[n] = n * fact(n - 1);
}
int main() {
int n;
cin >> n;
cout << fact(n) << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//??????
ll factmemo[25] = {1};
ll fact(int n) {
if (factmemo[n] != 0)
return factmemo[n];
return factmemo[n] = n * fact(n - 1);
}
int main() {
int n;
cin >> n;
cout << fact(n) << endl;
}
|
[["+", 0, 30, 0, 43, 49, 50, 49, 80, 81, 13]]
| 1
| 116
| 1
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int ans;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << '\n';
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long int ans = 1;
for (int i = 1; i <= n; i++)
ans *= i;
cout << ans << '\n';
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 53
| 2
|
#include <cstdio>
#include <iostream>
using namespace std;
int factorial(int num) {
if (num == 1)
return (1);
return (num * factorial(num - 1));
}
int main(void) {
int num;
cin >> num;
cout << factorial(num) << endl;
return (0);
}
|
#include <cstdio>
#include <iostream>
using namespace std;
long factorial(int num) {
if (num == 1)
return (1);
return (num * factorial(num - 1));
}
int main(void) {
int num;
cin >> num;
cout << factorial(num) << endl;
return (0);
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 1
| 67
| 2
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define f(i, n) for (i = 1; i <= n; i++)
int main() {
int s = 1, n, i, a, b, k;
char c;
scanf("%d", &n);
f(i, n) s = s * i;
printf("%d", s);
cout << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define f(i, n) for (i = 1; i <= n; i++)
int main() {
long long s = 1, n, i, a, b, k;
char c;
scanf("%lld", &n);
f(i, n) s = s * i;
printf("%lld", s);
cout << endl;
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
| 84
| 7
|
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
cin >> n;
while (n > 0) {
ans *= n;
n--;
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int ans = 1;
cin >> n;
while (n > 0) {
ans *= n;
n--;
}
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], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40]]
| 1
| 44
| 5
|
#include <iostream>
using namespace std;
int main() {
int n;
int ans = 1;
cin >> n;
while (n) {
ans *= n;
n--;
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long int ans = 1;
cin >> n;
while (n) {
ans *= n;
n--;
}
cout << ans << endl;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 43
| 2
|
// 0019.cpp
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n, a = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
a *= i;
printf("%d\n", a);
return 0;
}
|
// 0019.cpp
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
long long int n, a = 1;
scanf("%lld", &n);
for (int i = 1; i <= n; i++)
a *= i;
printf("%lld\n", a);
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
| 63
| 6
|
#include <iostream>
using namespace std;
int factorial(int n) {
int ans = 1;
for (int i = n; i > 0; --i)
ans *= i;
return ans;
}
int main() {
int input;
cin >> input;
cout << factorial(input) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long factorial(int n) {
long ans = 1;
for (int i = n; i > 0; --i)
ans *= i;
return ans;
}
int main() {
int input;
cin >> input;
cout << factorial(input) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 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
| 4
|
#include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
int ans = 1;
for (int i = 0; i < n; i++) {
ans = ans * (i + 1);
}
printf("%d\n", ans);
}
|
#include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
long long ans = 1;
for (int i = 0; i < n; i++) {
ans = ans * (i + 1);
}
printf("%lld\n", ans);
}
|
[["-", 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
| 63
| 5
|
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int ans = 1;
for (int i = 1; i <= a; i++) {
ans = ans * i;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int a;
cin >> a;
long long int ans = 1;
for (int i = 1; i <= a; i++) {
ans = ans * i;
}
cout << ans << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 55
| 4
|
#include <iostream>
using namespace std;
int fact(int);
int main() {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
int fact(int n) {
if (n > 0) {
return n * fact(n - 1);
} else {
return 1;
}
}
|
#include <iostream>
using namespace std;
long fact(long);
int main() {
long n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
long fact(long n) {
if (n > 0) {
return n * fact(n - 1);
} else {
return 1;
}
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["-", 0, 43, 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], ["-", 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]]
| 1
| 69
| 10
|
#include <cstdio>
#include <iostream>
int main() {
int ans = 1, n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
ans *= i;
printf("%d\n", ans);
return 0;
}
|
#include <cstdio>
#include <iostream>
int main() {
long long int ans = 1;
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
ans *= i;
printf("%lld\n", ans);
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 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]]
| 1
| 58
| 7
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
double x = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
x *= i;
}
// cout << x << endl;
printf("%g", x);
}
|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
double x = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
x *= i;
}
// cout << x << endl;
printf("%.0f\n", x);
}
|
[["-", 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
| 56
| 3
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long Int;
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int F(int n) {
if (n == 1)
return 1;
return n * F(n - 1);
}
int main() {
int a;
cin >> a;
cout << F(a) << endl;
return 0;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long Int;
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
Int F(int n) {
if (n == 1)
return 1;
return n * F(n - 1);
}
int main() {
int a;
cin >> a;
cout << F(a) << endl;
return 0;
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 78]]
| 1
| 89
| 2
|
#include <iostream>
using namespace std;
int main() {
int n, i, ret = 1;
cin >> n;
for (i = n; i >= 1; i--) {
ret *= i;
}
cout << ret << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
long long int n, i, ret = 1;
cin >> n;
for (i = n; i >= 1; i--) {
ret *= i;
}
cout << ret << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]]
| 1
| 53
| 2
|
#include <stdio.h>
int main() {
int i, n, j = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
j = j * i;
}
printf("%d", j);
printf("\n");
return 0;
}
|
#include <stdio.h>
int main() {
long long i, n, j = 1;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
j = j * i;
}
printf("%lld", j);
printf("\n");
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
| 67
| 7
|
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n;
x = 1;
for (int i = 1; i <= n; i++) {
x *= i;
}
cout << x << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long x;
cin >> n;
x = 1;
for (int i = 1; i <= n; i++) {
x *= i;
}
cout << x << 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
| 4
|
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
cin >> n;
for (int i = 1; i <= n; i++)
ans = ans * i;
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
long long ans = 1;
cin >> n;
for (int i = 1; i <= n; i++)
ans = 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]]
| 1
| 52
| 4
|
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, ans = 1;
while (cin >> n) {
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int long long n, ans = 1;
while (cin >> n) {
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
}
return 0;
}
|
[["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 0, 42, 0, 22]]
| 1
| 60
| 2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.