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
|
|---|---|---|---|---|
import java.util.Scanner;
public class Main {
public static int factorial(int n) {
if (n == 0) {
return 1;
}
return n * factorial(n - 1);
}
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
System.out.println(factorial(n));
}
}
|
import java.util.Scanner;
public class Main {
public static long factorial(int n) {
if (n == 0) {
return 1;
}
return n * factorial(n - 1);
}
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int n = stdIn.nextInt();
System.out.println(factorial(n));
}
}
|
[["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96]]
| 3
| 87
|
import java.util.Scanner;
public class Main {
public static void main(String arg[]) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
System.out.println(fact(n));
}
public static int fact(int n) {
if (n <= 1)
return 1;
n = n * fact(n - 1);
return n;
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String arg[]) {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
System.out.println(fact(n));
}
public static long fact(long n) {
if (n <= 1)
return 1;
n = n * fact(n - 1);
return n;
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96], ["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 0, 195, 54, 495, 0, 496, 39, 506, 0, 96]]
| 3
| 89
|
import java.util.Scanner;
public class Main {
private static Scanner scan;
public static void main(String[] args) {
scan = new Scanner(System.in);
int a = Integer.parseInt(scan.next());
System.out.println(factorial(a));
System.exit(0);
}
static int factorial(int i) { return i == 0 ? 1 : i * factorial(i - 1); }
}
|
import java.util.Scanner;
public class Main {
private static Scanner scan;
public static void main(String[] args) {
scan = new Scanner(System.in);
long a = Integer.parseInt(scan.next());
System.out.println(factorial(a));
System.exit(0);
}
static long factorial(long i) { return i == 0 ? 1 : i * factorial(i - 1); }
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96], ["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 0, 195, 54, 495, 0, 496, 39, 506, 0, 96]]
| 3
| 97
|
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n;
int sum = 1;
n = sc.nextInt();
while (0 < n) {
sum *= n;
n--;
}
System.out.println(sum);
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n;
long sum = 1;
n = sc.nextInt();
while (0 < n) {
sum *= n;
n--;
}
System.out.println(sum);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 75
|
import java.util.Scanner;
public class Main {
static int Fact(int n) { return n == 0 ? 1 : n * Fact(n - 1); }
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int m = in.nextInt();
System.out.println(Fact(m));
in.close();
}
}
|
import java.util.Scanner;
public class Main {
static long Fact(int n) { return n == 0 ? 1 : n * Fact(n - 1); }
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int m = in.nextInt();
System.out.println(Fact(m));
in.close();
}
}
|
[["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96]]
| 3
| 87
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.close();
System.out.println(fact(n));
}
static int fact(int x) {
int sum = 1;
if (x == 0) {
return 1;
} else {
for (int i = x; i > 0; i--) {
sum *= i;
}
return sum;
}
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
sc.close();
System.out.println(fact(n));
}
static long fact(long x) {
long sum = 1;
if (x == 0) {
return 1;
} else {
for (long i = x; i > 0; i--) {
sum *= i;
}
return sum;
}
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96], ["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 0, 195, 54, 495, 0, 496, 39, 506, 0, 96], ["-", 75, 196, 0, 7, 502, 503, 39, 506, 0, 507], ["+", 75, 196, 0, 7, 502, 503, 39, 506, 0, 96]]
| 3
| 113
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] a) {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
String tmpString = null;
try {
if (null != (tmpString = bf.readLine())) {
int ans = qa(Integer.parseInt(tmpString));
System.out.println(ans);
}
} catch (IOException e) {
}
}
private static int qa(int number) {
if (number == 1)
return number;
return number * qa(number - 1);
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] a) {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
String tmpString = null;
try {
if (null != (tmpString = bf.readLine())) {
long ans = qa(Integer.parseInt(tmpString));
System.out.println(ans);
}
} catch (IOException e) {
}
}
private static long qa(int number) {
if (number == 1)
return number;
return number * qa(number - 1);
}
}
|
[["-", 0, 57, 64, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 57, 64, 196, 0, 503, 39, 506, 0, 96], ["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96]]
| 3
| 135
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
int n = Integer.parseInt(str);
System.out.println(fac(n));
}
static int fac(int n) {
if (n == 0) {
return 1;
} else {
return n * fac(n - 1);
}
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str = br.readLine();
int n = Integer.parseInt(str);
System.out.println(fac(n));
}
static long fac(int n) {
if (n == 0) {
return 1;
} else {
return n * fac(n - 1);
}
}
}
|
[["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96]]
| 3
| 119
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int ans = 1;
for (int i = 0; i < n; i++)
ans *= (n - i);
System.out.println(ans);
sc.close();
}
}
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long ans = 1;
for (int i = 0; i < n; i++)
ans *= (n - i);
System.out.println(ans);
sc.close();
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 86
|
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n = 0;
try {
n = new Scanner(System.in).nextInt();
} catch (InputMismatchException e) {
e.printStackTrace();
} catch (NoSuchElementException e) {
e.printStackTrace();
}
System.out.println(fractal(n));
}
static int fractal(int n) {
if (n > 1)
return n * fractal(n - 1);
else
return 1;
}
}
|
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n = 0;
try {
n = new Scanner(System.in).nextInt();
} catch (InputMismatchException e) {
e.printStackTrace();
} catch (NoSuchElementException e) {
e.printStackTrace();
}
System.out.println(fractal(n));
}
static long fractal(int n) {
if (n > 1)
return n * fractal(n - 1);
else
return 1;
}
}
|
[["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96]]
| 3
| 127
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLine()) != null && !line.isEmpty()) {
int n = Integer.parseInt(line);
int m = n;
for (int i = n - 1; i > 0; i--) {
m *= i;
}
System.out.println(m);
}
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = "";
while ((line = br.readLine()) != null && !line.isEmpty()) {
int n = Integer.parseInt(line);
long m = n;
for (int i = n - 1; i > 0; i--) {
m *= i;
}
System.out.println(m);
}
}
}
|
[["-", 0, 52, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 52, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 130
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int m = n;
for (int i = n - 1; i > 0; i--) {
m *= i;
}
System.out.println(m);
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
long m = n;
for (int i = n - 1; i > 0; i--) {
m *= i;
}
System.out.println(m);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 105
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
private static BufferedReader br = null;
static { br = new BufferedReader(new InputStreamReader(System.in)); }
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int nNum = parseNum();
int nFact = 1;
for (int n = 2; n <= nNum; n++) {
nFact *= n;
}
System.out.println(nFact);
}
private static int parseNum() {
int nNum = -1;
try {
String line = br.readLine();
if (line != null) {
if (!line.isEmpty()) {
nNum = Integer.parseInt(line);
}
}
} catch (IOException e) {
}
return nNum;
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
private static BufferedReader br = null;
static { br = new BufferedReader(new InputStreamReader(System.in)); }
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int nNum = parseNum();
long nFact = 1;
for (int n = 2; n <= nNum; n++) {
nFact *= (long)n;
}
System.out.println(nFact);
}
private static int parseNum() {
int nNum = -1;
try {
String line = br.readLine();
if (line != null) {
if (!line.isEmpty()) {
nNum = Integer.parseInt(line);
}
}
} catch (IOException e) {
}
return nNum;
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["+", 8, 196, 0, 1, 0, 11, 12, 74, 0, 24], ["+", 0, 1, 0, 11, 12, 74, 39, 506, 0, 96], ["+", 8, 196, 0, 1, 0, 11, 12, 74, 0, 25]]
| 3
| 169
|
import java.util.Scanner;
public class Main {
private int a = 1;
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
for (int i = n; i > 0; i--) {
a *= i;
}
System.out.println(a);
}
private void debug() { System.out.println(); }
}
|
import java.util.Scanner;
public class Main {
private long a = 1;
public static void main(String[] args) { new Main().run(); }
private void run() {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
for (int i = n; i > 0; i--) {
a *= i;
}
System.out.println(a);
}
private void debug() { System.out.println(); }
}
|
[["-", 0, 235, 8, 498, 0, 124, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 124, 39, 506, 0, 96]]
| 3
| 110
|
import java.util.*;
public class Main {
static Scanner kbd = new Scanner(System.in);
public static void main(String[] args) {
while (kbd.hasNext()) {
solve();
}
}
static void solve() {
int n = kbd.nextInt();
int ans = fact(n);
System.out.println(ans);
}
static int fact(int n) {
if (n == 1)
return 1;
return n * fact(n - 1);
}
}
|
import java.util.*;
public class Main {
static Scanner kbd = new Scanner(System.in);
public static void main(String[] args) {
while (kbd.hasNext()) {
solve();
}
}
static void solve() {
long n = kbd.nextInt();
long ans = fact(n);
System.out.println(ans);
}
static long fact(long n) {
if (n == 1)
return 1;
return n * fact(n - 1);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96], ["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 0, 195, 54, 495, 0, 496, 39, 506, 0, 96]]
| 3
| 111
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNextInt()) {
int n = sc.nextInt();
int a = 1;
if (n == 0)
a = 0;
for (; 0 < n; n--) {
a *= n;
}
System.out.println(a);
}
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNextInt()) {
int n = sc.nextInt();
long a = 1;
if (n == 0)
a = 0;
for (; 0 < n; n--) {
a *= n;
}
System.out.println(a);
}
}
}
|
[["-", 0, 52, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 52, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 94
|
import java.util.Scanner;
public class Main {
public static void main(String... args) {
Scanner scan = new Scanner(System.in);
int f = scan.nextInt();
int tmp = 1;
for (int i = 1; i <= f; i++) {
tmp *= i;
}
System.out.println(tmp);
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String... args) {
Scanner scan = new Scanner(System.in);
int f = scan.nextInt();
long tmp = 1;
for (int i = 1; i <= f; i++) {
tmp *= i;
}
System.out.println(tmp);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 77
|
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
void run() {
int n = sc.nextInt();
int ans = 1;
while (n > 0)
ans *= n--;
System.out.println(ans);
}
public static void main(String[] args) { new Main().run(); }
}
|
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
void run() {
int n = sc.nextInt();
long ans = 1;
while (n > 0)
ans *= n--;
System.out.println(ans);
}
public static void main(String[] args) { new Main().run(); }
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 84
|
import java.math.*;
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
System.out.println(fact(n));
}
private static int fact(int n) {
if (n == 1) {
return 1;
}
return n * fact(n - 1);
}
}
|
import java.math.*;
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextInt();
System.out.println(fact(n));
}
private static long fact(long n) {
if (n == 1) {
return 1;
}
return n * fact(n - 1);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96], ["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 0, 195, 54, 495, 0, 496, 39, 506, 0, 96]]
| 3
| 93
|
import java.util.Scanner;
class Main {
public static void main(String[] a) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int num = n;
while (n > 1) {
n--;
num *= n;
}
System.out.println(num);
}
}
|
import java.util.Scanner;
class Main {
public static void main(String[] a) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
long num = n;
while (n > 1) {
n--;
num *= n;
}
System.out.println(num);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 72
|
import java.io.*;
class Main {
public static void main(String[] args) {
try {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(reader.readLine());
int fact = 1;
for (int i = n; i >= 1; i--) {
fact *= i;
}
System.out.println(fact);
} catch (IOException e) {
System.out.println(e);
}
}
}
|
import java.io.*;
class Main {
public static void main(String[] args) {
try {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(reader.readLine());
long fact = 1;
for (int i = n; i >= 1; i--) {
fact *= i;
}
System.out.println(fact);
} catch (IOException e) {
System.out.println(e);
}
}
}
|
[["-", 0, 246, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 246, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 105
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
int x = 1;
for (int i = 2; i <= n; i++) {
x = x * i;
}
System.out.println(x);
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
long x = 1;
for (int i = 2; i <= n; i++) {
x = x * i;
}
System.out.println(x);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 80
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println(factrial(n));
}
static int factrial(int n) {
if (n == 0)
return 1;
return n * factrial(n - 1);
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
System.out.println(factrial(n));
}
static long factrial(Long n) {
if (n == 0)
return 1;
return n * factrial(n - 1);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96], ["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 8, 498, 0, 195, 54, 495, 0, 496, 39, 78]]
| 3
| 84
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int kaijyou = 1;
int n = sc.nextInt();
int k = n;
if (n == 0) {
System.out.println("1");
break;
}
for (int i = 0; i < n; i++) {
kaijyou = kaijyou * k;
k--;
}
System.out.println(kaijyou);
}
}
}
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
long kaijyou = 1;
int n = sc.nextInt();
long k = n;
if (n == 0) {
System.out.println("1");
break;
}
for (int i = 0; i < n; i++) {
kaijyou = kaijyou * k;
k--;
}
System.out.println(kaijyou);
}
}
}
|
[["-", 0, 52, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 52, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 119
|
import java.io.*;
class Main {
public static void main(String args[]) throws IOException {
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(input.readLine());
int x = 1;
for (int i = n; i > 0; i--) {
x *= i;
}
System.out.println(x);
}
}
|
import java.io.*;
class Main {
public static void main(String args[]) throws IOException {
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(input.readLine());
long x = 1;
for (int i = n; i > 0; i--) {
x *= i;
}
System.out.println(x);
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 88
|
import java.util.Scanner;
public class Main {
static int Factrial(int num) {
if (num == 1)
return (1);
else {
return (num * Factrial(num - 1));
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner stdIn = new Scanner(System.in);
int num = stdIn.nextInt();
System.out.println(Factrial(num));
}
}
|
import java.util.Scanner;
public class Main {
static long Factrial(int num) {
if (num == 1)
return (1);
else {
return (num * Factrial(num - 1));
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner stdIn = new Scanner(System.in);
int num = stdIn.nextInt();
System.out.println(Factrial(num));
}
}
|
[["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96]]
| 3
| 92
|
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public int factorial(int n) {
if (n == 1)
return 1;
else
return n * factorial(n - 1);
}
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
Main m = new Main();
while (sc.hasNext()) {
System.out.println(m.factorial(sc.nextInt()));
}
}
}
|
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public long factorial(long n) {
if (n == 1)
return 1;
else
return n * factorial(n - 1);
}
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
Main m = new Main();
while (sc.hasNext()) {
System.out.println(m.factorial(sc.nextLong()));
}
}
}
|
[["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96], ["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 0, 195, 54, 495, 0, 496, 39, 506, 0, 96], ["-", 3, 4, 0, 492, 3, 4, 0, 492, 141, 22], ["+", 3, 4, 0, 492, 3, 4, 0, 492, 141, 22]]
| 3
| 116
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println(fact(n));
}
static int fact(int n) {
if (n == 0) {
return 1;
} else {
return n * fact(n - 1);
}
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextInt();
System.out.println(fact(n));
}
static long fact(long n) {
if (n == 0) {
return 1;
} else {
return n * fact(n - 1);
}
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 0, 235, 8, 498, 0, 195, 39, 506, 0, 507], ["+", 0, 235, 8, 498, 0, 195, 39, 506, 0, 96], ["-", 0, 195, 54, 495, 0, 496, 39, 506, 0, 507], ["+", 0, 195, 54, 495, 0, 496, 39, 506, 0, 96]]
| 3
| 89
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n, y;
n = scan.nextInt();
y = 1;
for (int i = n; i > 1; i--) {
y *= i;
}
System.out.println(y);
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n;
long y;
n = scan.nextInt();
y = 1;
for (int i = n; i > 1; i--) {
y *= i;
}
System.out.println(y);
}
}
|
[["-", 8, 498, 0, 195, 8, 196, 0, 503, 0, 21], ["+", 8, 498, 0, 195, 8, 196, 0, 503, 0, 35], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96]]
| 3
| 81
|
import java.io.*;
public class Main {
public static void main(String[] args) {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String s;
int n;
int ans = 1;
try {
while ((s = reader.readLine()) != null) {
n = Integer.parseInt(s);
for (int i = 1; i <= n; i++) {
ans *= i;
}
System.out.println(ans);
ans = 1;
}
} catch (IOException e) {
System.out.println(e);
}
}
}
|
import java.io.*;
public class Main {
public static void main(String[] args) {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String s;
int n;
Long ans = 1L;
try {
while ((s = reader.readLine()) != null) {
n = Integer.parseInt(s);
for (int i = 1; i <= n; i++) {
ans *= i;
}
System.out.println(ans);
ans = 1L;
}
} catch (IOException e) {
System.out.println(e);
}
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 8, 498, 0, 195, 8, 196, 0, 503, 39, 78], ["-", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499], ["-", 0, 52, 8, 196, 0, 1, 0, 11, 12, 499], ["+", 0, 52, 8, 196, 0, 1, 0, 11, 12, 499]]
| 3
| 127
|
#include <stdio.h>
int main(void) {
int n, k = 1;
scanf("%d", &n);
for (int i = n; i >= 1; i--) {
k *= i;
}
printf("%d\n", k);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
unsigned long long k = 1;
scanf("%d", &n);
for (int i = n; i >= 1; i--) {
k *= i;
}
printf("%lld\n", k);
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, 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
| 59
|
#include <stdio.h>
int factorial(int n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", factorial(n));
return 0;
}
|
#include <stdio.h>
long unsigned int factorial(int n) {
if (n == 0)
return 1;
return n * factorial(n - 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]]
| 0
| 65
|
#include <stdio.h>
int main() {
int get;
scanf("%d", &get);
int result = 1;
while (get > 0) {
result *= get;
get--;
}
printf("%d\n", result);
return 0;
}
|
#include <stdio.h>
int main() {
int get;
scanf("%d", &get);
long result = 1;
while (get > 0) {
result *= get;
get--;
}
printf("%ld\n", result);
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
| 54
|
#include <stdio.h>
int main() {
int n;
float result = 1;
scanf("%d", &n);
while (n >= 1) {
result = result * n;
n--;
}
printf("%.0f\n", result);
return 0;
}
|
#include <stdio.h>
int main() {
int n;
double result = 1;
scanf("%d", &n);
while (n >= 1) {
result = result * n;
n--;
}
printf("%.0lf\n", result);
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
| 56
|
#include <stdio.h>
int main() {
int n, i, fact = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
fact = fact * i;
}
printf("%d\n", fact);
return 0;
}
|
#include <stdio.h>
int main()
{
int n, i;
long fact = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
fact = fact * i;
}
printf("%ld\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, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 61
|
#include <math.h>
#include <stdio.h>
int main() {
long long i, n;
long long rslt = 1;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
rslt = i;
}
printf("%lld\n", rslt);
return 0;
}
|
#include <math.h>
#include <stdio.h>
int main() {
long long i, n;
long long rslt = 1;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
rslt *= i;
}
printf("%lld\n", rslt);
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 108]]
| 0
| 64
|
#include <stdio.h>
int main() {
int n, f = 1, i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
f = f * i;
}
printf("%d", f);
return 0;
}
|
#include <stdio.h>
int main() {
long long int n, f = 1, i;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
f = f * i;
}
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, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 60
|
#include <stdio.h>
int main(void) {
int n, i;
while (scanf("%d", &n) != EOF) {
int sum = 1;
for (i = 1; i <= n; i++) {
sum = sum * i;
}
printf("%d\n", sum);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, i;
while (scanf("%d", &n) != EOF) {
long long sum = 1;
for (i = 1; i <= n; i++) {
sum = sum * i;
}
printf("%lld\n", sum);
}
return 0;
}
|
[["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 0, 52, 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
| 69
|
#include <stdio.h>
int main(void) {
int a, i, ans = 1;
scanf("%d", &a);
for (i = 1; i <= a; i++) {
ans = ans * i;
}
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
long long int a, i, ans = 1;
scanf("%lld", &a);
for (i = 1; i <= a; i++) {
ans = ans * i;
}
printf("%lld\n", ans);
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
| 62
|
#include <stdio.h>
int main() {
int n, m = 1;
scanf("%d", &n);
while (n > 0)
m *= n--;
printf("%d\n", m);
return 0;
}
|
#include <stdio.h>
int main() {
int n;
long m = 1;
scanf("%d", &n);
while (n > 0)
m *= n--;
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
| 49
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define DEBUG 1
main() {
int input;
int i;
int ans = 1;
scanf("%d", &input);
for (i = 1; i <= input; i++) {
ans *= i;
}
#ifdef DEBUG
printf("%d\n", ans);
#endif
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define DEBUG 1
main() {
int input;
int i;
double ans = 1;
scanf("%d", &input);
for (i = 1; i <= input; i++) {
ans *= i;
}
#ifdef DEBUG
printf("%.0f\n", ans);
#endif
return 0;
}
|
[["-", 36, 36, 0, 30, 0, 9, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 0, 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
| 71
|
#include <stdio.h>
int main(void) {
int i, j;
scanf("%d", &i);
j = 1;
for (; i > 0; i--) {
j *= i;
}
printf("%d", j);
return 0;
}
|
#include <stdio.h>
int main(void) {
int i;
long long int j;
scanf("%d", &i);
j = 1;
for (; i > 0; i--) {
j *= i;
}
printf("%lld\n", j);
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, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 56
|
#include <stdio.h>
int main() {
int n, i = 1;
scanf("%d", &n);
while (n != 0) {
i = i * n;
n--;
}
printf("%d\n", i);
return 0;
}
|
#include <stdio.h>
int main() {
long int n, i = 1;
scanf("%ld", &n);
while (n != 0) {
i = i * n;
n--;
}
printf("%ld\n", i);
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
|
#include <stdio.h>
int main(void) {
float a = 1;
int n;
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
a = a * i;
}
printf("%.0f\n", a);
return 0;
}
|
#include <stdio.h>
int main(void) {
long long int a = 1;
int n;
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
a = a * i;
}
printf("%lld\n", a);
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, 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
| 64
|
#include <stdio.h>
int main(void) {
int n;
int answer;
scanf("%d", &n);
answer = n;
while (--n)
answer *= n;
printf("%d\n", answer);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
long int answer;
scanf("%d", &n);
answer = n;
while (--n)
answer *= n;
printf("%ld\n", answer);
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
| 51
|
#include <stdio.h>
int f(int a) {
if (a == 1 || a == 0)
return 1;
else
return a * f(a - 1);
}
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", f(n));
return 0;
}
|
#include <stdio.h>
long f(int a) {
if (a == 1 || a == 0)
return 1;
else
return a * f(a - 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]]
| 0
| 70
|
#include <stdio.h>
int main() {
int n, i, a = 1;
scanf("%d", &n);
for (i = n; i > 1; i--) {
a *= i;
}
printf("%d\n", a);
return 0;
}
|
#include <stdio.h>
int main() {
int n, i;
long int a = 1;
scanf("%d", &n);
for (i = n; i > 1; i--) {
a *= i;
}
printf("%ld\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, 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
| 59
|
#include <stdio.h>
int main(void) {
int n, i, f;
f = 1;
scanf("%d", &n);
if (n != 0 && n != 1) {
for (i = 2; i <= n; i++) {
f = f * i;
}
}
printf("%d\n", f);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, i;
long int f = 1;
scanf("%d", &n);
if (n != 0 && n != 1) {
for (i = 2; i <= n; i++) {
f = f * i;
}
}
printf("%ld\n", f);
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], ["+", 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
| 76
|
#include <stdio.h>
int factorial(int n);
int main() {
int n;
while (scanf("%d", &n) != EOF) {
printf("%d\n", factorial(n));
}
return 0;
}
int factorial(int n) {
if (n > 1) {
return n * factorial(n - 1);
} else if (n == 1) {
return n;
} else {
return 0;
}
}
|
#include <stdio.h>
long int factorial(int n);
int main() {
int n;
while (scanf("%d", &n) != EOF) {
printf("%ld\n", factorial(n));
}
return 0;
}
long int factorial(int n) {
if (n > 1) {
return n * factorial(n - 1);
} else if (n == 1) {
return n;
} else {
return 0;
}
}
|
[["+", 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
| 94
|
#include <stdio.h>
void clear(int a[], int num) {
int i;
for (i = 0; i < num; i++) {
a[i] = 0;
}
}
void array_in(int a[], int num) {
int i;
for (i = 0; num != 0; i++) {
a[i] = num % 10;
num /= 10;
}
}
void func(int ans[], int num[]) {
int i, j, a, b, n, p[200];
clear(p, 200);
for (i = 0; i < 7; i++) {
for (j = 0; j < 20; j++) {
p[i + j] += ans[j] * num[i];
if (p[i + j] >= 10) {
p[i + j + 1] += p[i + j] / 10;
p[i + j] = p[i + j] % 10;
}
}
}
for (i = 0; i < 20; i++) {
ans[i] = p[i];
}
}
void divide(int a[], int num) {
int i;
while (a[0] == 0) {
for (i = 0; i < num - 1; i++) {
a[i] = a[i + 1];
}
}
}
int main(void) {
int a, n, i, j, cnt;
int ans[20];
int num[7];
clear(ans, 20);
ans[0] = 1;
scanf("%d", &a);
for (i = a; i >= 1; i--) {
n = i;
clear(num, 7);
array_in(num, n);
// divide(num,7);
func(ans, num);
// divide(ans,20);
}
for (i = 8; i >= 0; i--) {
if (ans[i] != 0) {
printf("%d", ans[i]);
break;
}
}
i--;
for (; i >= 0; i--) {
printf("%d", ans[i]);
}
printf("\n");
return 0;
}
|
#include <stdio.h>
void clear(int a[], int num) {
int i;
for (i = 0; i < num; i++) {
a[i] = 0;
}
}
void array_in(int a[], int num) {
int i;
for (i = 0; num != 0; i++) {
a[i] = num % 10;
num /= 10;
}
}
void func(int ans[], int num[]) {
int i, j, a, b, n, p[200];
clear(p, 200);
for (i = 0; i < 7; i++) {
for (j = 0; j < 20; j++) {
p[i + j] += ans[j] * num[i];
if (p[i + j] >= 10) {
p[i + j + 1] += p[i + j] / 10;
p[i + j] = p[i + j] % 10;
}
}
}
for (i = 0; i < 20; i++) {
ans[i] = p[i];
}
}
void divide(int a[], int num) {
int i;
while (a[0] == 0) {
for (i = 0; i < num - 1; i++) {
a[i] = a[i + 1];
}
}
}
int main(void) {
int a, n, i, j, cnt;
int ans[100];
int num[7];
clear(ans, 100);
ans[0] = 1;
scanf("%d", &a);
for (i = a; i >= 1; i--) {
n = i;
clear(num, 7);
array_in(num, n);
// divide(num,7);
func(ans, num);
// divide(ans,20);
}
for (i = 99; i >= 0; i--) {
if (ans[i] != 0) {
printf("%d", ans[i]);
break;
}
}
i--;
for (; i >= 0; i--) {
printf("%d", ans[i]);
}
printf("\n");
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, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]]
| 0
| 470
|
#include <stdio.h>
int main(void) {
int n, i;
long ans;
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) {
int n, i;
long ans;
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
| 65
|
#include <stdio.h>
int main(void) {
int i;
int n;
int factorial = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
factorial *= i;
}
printf("%d\n", factorial);
return (0);
}
|
#include <stdio.h>
int main(void) {
int i, j;
int n;
long long factorial = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
factorial *= i;
}
printf("%lld\n", factorial);
return (0);
}
|
[["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 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
| 64
|
#include <stdio.h>
int main(void) {
int n;
int i;
long beki;
scanf("%d", &n);
beki = 1;
for (i = 1; i <= n; i++) {
beki *= i;
}
printf("%d\n", beki);
return (0);
}
|
#include <stdio.h>
int main(void) {
int n;
int i;
long beki;
scanf("%d", &n);
beki = 1;
for (i = 1; i <= n; i++) {
beki *= i;
}
printf("%ld\n", beki);
return (0);
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 66
|
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
long long fact(int n) {
int res = 1, i;
for (i = 1; i <= n; i++) {
res *= i;
}
return res;
}
int main() {
int n;
scanf("%d", &n);
printf("%lld", fact(n));
return 0;
}
|
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
long long fact(int n) {
long long res = 1, i;
for (i = 1; i <= n; i++) {
res *= i;
}
return res;
}
int main() {
int n;
scanf("%d", &n);
printf("%lld\n", fact(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, 44]]
| 0
| 82
|
#include <stdio.h>
int main() {
int n, i;
long long int kotae = 1;
scanf("%d", &n);
for (i = n; i > 1; i--) {
kotae *= i;
}
printf("%d\n", kotae);
return 0;
}
|
#include <stdio.h>
int main() {
int n, i;
long long int kotae = 1;
scanf("%d", &n);
for (i = n; i > 1; i--) {
kotae *= i;
}
printf("%lld\n", kotae);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 62
|
#include <stdio.h>
int factorial(long n) {
if (n > 0) {
return n * factorial(n - 1);
} else {
return 1;
}
}
int main(void) {
long n;
scanf("%ld", &n);
printf("%ld\n", factorial(n));
return 0;
}
|
#include <stdio.h>
long long factorial(long long n) {
if (n > 0) {
return n * factorial(n - 1);
} else {
return 1;
}
}
int main(void) {
long long n;
scanf("%lld", &n);
printf("%lld\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], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 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
| 70
|
#include <stdio.h>
long long factorial(long long n) {
if (n > 0) {
return n * factorial(n - 1);
} else {
return 1;
}
}
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", factorial(n));
return 0;
}
|
#include <stdio.h>
long long factorial(int n) {
if (n > 0) {
return n * factorial(n - 1);
} else {
return 1;
}
}
int main(void) {
int n;
scanf("%d", &n);
printf("%lld\n", factorial(n));
return 0;
}
|
[["-", 49, 53, 54, 55, 0, 56, 39, 86, 0, 96], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 72
|
#include <stdio.h>
int main() {
int n, k, a = 1;
scanf("%d", &n);
for (k = 0; k < n; k++) {
a *= k + 1;
}
printf("%d\n", a);
return 0;
}
|
#include <stdio.h>
int main() {
int n, k;
long long a = 1;
scanf("%d", &n);
for (k = 0; k < n; k++) {
a *= k + 1;
}
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
| 61
|
#include <stdio.h>
int main(void) {
int n, i, s = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
s *= i;
}
printf("%d\n", s);
return (0);
}
|
#include <stdio.h>
int main(void) {
long n, i, s = 1;
scanf("%ld", &n);
for (i = 1; i <= n; i++) {
s *= i;
}
printf("%ld\n", s);
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
|
#include <stdio.h>
int main(void) {
int n, i, ans;
scanf("%d", &n);
ans = 1;
for (i = 1; i <= n; i++)
ans *= i;
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
long long int n, i, ans;
scanf("%lld", &n);
ans = 1;
for (i = 1; i <= n; i++)
ans *= i;
printf("%lld\n", ans);
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
| 60
|
#include <stdio.h>
int main() {
double n, i, kai = 1;
scanf("%.0f\n", &n);
for (i = 1; i <= n; i++) {
kai = kai * i;
}
printf("%.0f\n", kai);
return 0;
}
|
#include <stdio.h>
int main() {
int n, i;
double kai = 1;
scanf("%d\n", &n);
for (i = 1; i <= n; i++) {
kai = kai * i;
}
printf("%.0f\n", kai);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 62
|
#include <stdio.h>
int main() {
int n, ans = 1;
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++)
ans *= i;
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main() {
double n, ans = 1;
int i;
scanf("%lf", &n);
for (i = 1; i <= n; i++)
ans *= i;
printf("%0.f\n", ans);
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
| 58
|
#include <stdio.h>
int factorial(int a);
int main() {
int a;
scanf("%d", &a);
printf("%d\n", factorial(a));
return 0;
}
int factorial(int a) {
if (a == 1)
return 1;
else
return a * factorial(a - 1);
}
|
#include <stdio.h>
long long factorial(int a);
int main() {
int a;
scanf("%d", &a);
printf("%lld\n", factorial(a));
return 0;
}
long long factorial(int a) {
if (a == 1)
return 1;
else
return a * factorial(a - 1);
}
|
[["-", 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], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 0
| 72
|
#include <stdio.h>
int factorial(int a) {
int i, fac = 1;
for (i = a; i > 0; i--) {
fac = fac * i;
}
return fac;
}
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", factorial(n));
return 0;
}
|
#include <stdio.h>
long long factorial(int a) {
int i;
long long fac = 1;
for (i = a; i > 0; i--) {
fac = fac * i;
}
return fac;
}
int main(void) {
int n;
scanf("%d", &n);
printf("%lld\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, 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
| 77
|
#include <stdio.h>
int main(void) {
int n;
int i;
int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%d\n", re);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
int i;
long int re = 1;
while (1) {
scanf("%d", &n);
if (1 <= n && n <= 20)
break;
}
for (i = 0; i < n; i++) {
re *= n - i;
}
printf("%ld\n", re);
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
| 82
|
#include <stdio.h>
int main(void) {
int n, i, temp = 1;
scanf("%d", &n);
for (i = n; i > 0; i--) {
temp *= i;
}
printf("%d\n", temp);
return 0;
}
|
#include <stdio.h>
int main(void) {
long int n, i, temp = 1;
scanf("%ld", &n);
for (i = n; i > 0; i--) {
temp *= i;
}
printf("%ld\n", temp);
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
| 60
|
#include <math.h>
#include <stdio.h>
#include <string.h>
int factorial(int);
int main() {
int n, ans;
scanf("%d", &n);
ans = factorial(n);
printf("%d\n", ans);
return 0;
}
int factorial(int x) {
if (x == 0)
return 1;
else
return x * factorial(x - 1);
}
|
#include <math.h>
#include <stdio.h>
#include <string.h>
long factorial(int);
int main() {
int n;
long ans;
scanf("%d", &n);
ans = factorial(n);
printf("%ld\n", ans);
return 0;
}
long factorial(int x) {
if (x == 0)
return 1;
else
return x * factorial(x - 1);
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 0, 30, 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, 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], ["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 96]]
| 0
| 81
|
#include <stdio.h>
int main(void) {
int i;
long long int k = 1;
int j;
scanf("%d", &i);
j = i;
while (i > 0) {
k *= i;
i--;
}
printf("%d\n", k);
return (0);
}
|
#include <stdio.h>
int main(void) {
int i;
long long int k = 1;
int j;
scanf("%d", &i);
j = i;
while (i > 0) {
k *= i;
i--;
}
printf("%lld\n", k);
return (0);
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 66
|
#include <stdio.h>
int factorial(int n) {
if (n == 1)
return 1;
else
return n * factorial(n - 1);
return 0;
}
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", factorial(n));
return 0;
}
|
#include <stdio.h>
long factorial(int n) {
if (n == 1)
return 1;
else
return n * factorial(n - 1);
return 0;
}
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, 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
| 69
|
#include <stdio.h>
int factorial(long n) {
if (n == 1)
return 1;
return n * factorial(n - 1);
}
int main(void) {
long n;
do {
scanf("%d", &n);
} while (1 > n || 20 < n);
printf("%d\n", factorial(n));
return 0;
}
|
#include <stdio.h>
long long factorial(long long n) {
if (n == 1)
return 1;
return n * factorial(n - 1);
}
int main(void) {
long n;
do {
scanf("%d", &n);
} while (1 > n || 20 < n);
printf("%lld\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], ["+", 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
| 79
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rad M_PI / 3
#define N 2147483647
#define Max 500000
#define NTL -1
#define min(a, b) ((a > b) ? b : a)
#define max(a, b) ((a < b) ? b : a)
#include <stdio.h>
int main() {
int i, n, ans = 1;
scanf("%d", &n);
for (i = n; i >= 1; i--) {
ans *= i;
}
printf("%d\n", ans);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rad M_PI / 3
#define N 2147483647
#define Max 500000
#define NTL -1
#define min(a, b) ((a > b) ? b : a)
#define max(a, b) ((a < b) ? b : a)
#include <stdio.h>
int main() {
int i, n;
long long int ans = 1;
scanf("%d", &n);
for (i = n; i >= 1; 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
| 95
|
#include <stdio.h>
int main() {
int i, n, fact = 1;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
fact = fact * i;
}
printf("%d\n", fact);
return 0;
}
|
#include <stdio.h>
int main() {
long long int i, n, fact = 1;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
fact = fact * i;
}
printf("%lld\n", fact);
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
| 61
|
#include <stdio.h>
int main(void) {
int n;
int r = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
r = r * i;
}
printf("%d\n", r);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
long long int r = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
r = r * i;
}
printf("%lld\n", r);
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
| 62
|
#include <stdio.h>
int factorial(int num) {
if (num > 0)
return num * factorial(num - 1);
else
return 1;
}
int main(void) {
long long int n;
scanf("%lld", &n);
printf("%lld", factorial(n));
return 0;
}
|
#include <stdio.h>
long long int factorial(long long int num) {
if (num > 0)
return num * factorial(num - 1);
else
return 1;
}
int main(void) {
long long int n;
scanf("%lld", &n);
printf("%lld\n", factorial(n));
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, 44]]
| 0
| 67
|
#include <stdio.h>
int main(void) {
int n;
long ans;
scanf("%d", &n);
for (ans = 1; n > 0; n--) {
ans *= n;
}
printf("%d", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
long ans;
scanf("%d", &n);
for (ans = 1; n > 0; n--) {
ans *= n;
}
printf("%ld\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, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 56
|
#include <stdio.h>
int main(void) {
int n, i;
scanf("%d", &n);
for (i = n - 1; i >= 1; i--) {
n = n * i;
}
printf("%d\n", n);
return 0;
}
|
#include <stdio.h>
int main(void) {
long int n, i;
scanf("%ld", &n);
for (i = n - 1; i >= 1; i--) {
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
| 60
|
while True:
try:
b = input()
except:
break
if 'the' in c or 'this' in c or 'that' in b:
print(c)
for i in range(1,26):
c = ''
for j in b:
if(j == 'z'):
c += ('a')
elif(str.isalpha(j) == 1):
c += (chr(ord(j) + 1))
else:
c += j
if 'the' in c or 'this' in c or 'that' in c:
print(c)
break
b = c
|
while True:
try:
b = input()
except:
break
if 'the' in b or 'this' in b or 'that' in b:
print(b)
for i in range(1,26):
c = ''
for j in b:
if(j == 'z'):
c += ('a')
elif(str.isalpha(j) == 1):
c += (chr(ord(j) + 1))
else:
c += j
if 'the' in c or 'this' in c or 'that' in c:
print(c)
break
b = c
|
[["-", 0, 57, 15, 679, 31, 679, 31, 666, 0, 22], ["+", 0, 57, 15, 679, 31, 679, 31, 666, 0, 22], ["-", 0, 57, 15, 679, 31, 679, 12, 666, 0, 22], ["+", 0, 57, 15, 679, 31, 679, 12, 666, 0, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22]]
| 5
| 128
|
#!/usr/bin/env python2
# coding: utf-8
def casar(s, n):
d = {}
for c in (65, 97):
for i in range(26):
d[chr(i+c)] = chr((i+n) % 26 + c)
return "".join([d.get(c, c) for c in s])
try:
while True:
encrypttxt = input()
for i in range(26):
t = casar(encrypttxt, i)
if "the" in t or "this" in t or "that" in t:
print(t)
except EOFError:
break
|
#!/usr/bin/env python2
# coding: utf-8
def caesar(s, n):
d = {}
for c in (65, 97):
for i in range(26):
d[chr(i+c)] = chr((i+n) % 26 + c)
return "".join([d.get(c, c) for c in s])
while True:
try:
encrypttxt = input()
for i in range(26):
t = caesar(encrypttxt, i)
if "the" in t or "this" in t or "that" in t:
print(t)
except EOFError:
break
|
[["-", 36, 36, 36, 36, 0, 656, 0, 14, 141, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 14, 141, 22], ["-", 36, 36, 36, 36, 0, 656, 0, 246, 0, 247], ["-", 36, 36, 36, 36, 0, 656, 0, 246, 0, 102], ["+", 36, 36, 36, 36, 0, 656, 0, 52, 0, 102], ["+", 0, 656, 0, 52, 8, 196, 0, 246, 0, 247], ["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22]]
| 5
| 127
|
from sys import stdin
def ascii2num(ascii):
return ord(ascii) - 96
def num2ascii(num):
return chr(num + 96)
def slide(word,num):
return ''.join([num2ascii((ascii2num(ascii) + num) % 26) if ascii != '.' else '.' for ascii in word])
def includekeyword(words):
for word in words:
if word in keywords:
return True
return False
keywords = ['the', 'this', 'that']
decode = []
for row in stdin:
words = row.split()
for num in range(1,27):
tmp = [slide(word,num) for word in words]
if includekeyword(tmp):
decode = tmp
print(' '.join(decode))
|
from sys import stdin
def ascii2num(ascii):
return ord(ascii) - 96
def num2ascii(num):
return chr(num + 96)
def slide(word,num):
return ''.join([num2ascii((ascii2num(ascii) - num) % 26 + 1) if ascii != '.' else '.' for ascii in word])
def includekeyword(words):
for word in words:
if word in keywords:
return True
return False
keywords = ['the', 'this', 'that']
decode = []
for row in stdin:
words = row.split()
for num in range(1,27):
tmp = [slide(word,num) for word in words]
if includekeyword(tmp):
decode = tmp
print(' '.join(decode))
break
|
[["-", 3, 4, 0, 657, 31, 23, 0, 657, 17, 72], ["+", 0, 657, 31, 657, 31, 23, 0, 657, 17, 33], ["+", 8, 41, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 8, 41, 0, 652, 3, 4, 0, 657, 12, 612], ["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94]]
| 5
| 169
|
import sys
a = 'abcdefghijklmnopqrstuvwxyz'
for s in sys.stdin:
for n in range(1, 27):
t = s[:-1].translate(str.maketrans(a, a[n:] + a[:n]))
print(t)
if 'the' in t or 'this' in t or 'that' in t: break
print(t)
|
import sys
a = 'abcdefghijklmnopqrstuvwxyz'
for s in sys.stdin:
for n in range(1, 27):
t = s[:-1].translate(str.maketrans(a, a[n:] + a[:n]))
if 'the' in t or 'this' in t or 'that' in t: break
print(t)
|
[["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]]
| 5
| 82
|
import sys
a='abcdefghijklmnopqrstuvwxy'
for b in sys.stdin:
b=input()
for i in range(26):
c=''.join(a[ord(e)-97-i]if e in a else e for e in b)
if any(('the'in c,'this'in c,'that'in c)):print(c)
|
import sys
a='abcdefghijklmnopqrstuvwxyz'
for b in sys.stdin:
b=b.strip()
for i in range(26):
c=''.join(a[ord(e)-97-i]if e in a else e for e in b)
if any(('the'in c,'this'in c,'that'in c)):print(c)
|
[["-", 0, 656, 0, 1, 0, 662, 12, 557, 0, 6], ["+", 0, 656, 0, 1, 0, 662, 12, 557, 0, 6], ["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 500, 22], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 0, 131], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22]]
| 5
| 84
|
import sys
a='abcdefghijklmnopqrstuvwxy'
for b in sys.stdin:
for i in range(26):
c=''.join(a[ord(e)-97-i]if e in a else e for e in b)
if any(('the'in c,'this'in c,'that'in c)):print(c)
|
import sys
a='abcdefghijklmnopqrstuvwxyz'
for b in sys.stdin:
for i in range(26):
c=''.join(a[ord(e)-97-i]if e in a else e for e in b)
if any(('the'in c,'this'in c,'that'in c)):print(c.strip())
|
[["-", 0, 656, 0, 1, 0, 662, 12, 557, 0, 6], ["+", 0, 656, 0, 1, 0, 662, 12, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 652, 63, 319, 0, 131], ["+", 0, 652, 3, 4, 0, 652, 63, 319, 319, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]]
| 5
| 79
|
b = ["the", "this", "that"]
while True:
try:
a = input()
except IndexError:
break
for y in range(26):
for x in b:
if x in a:
print(a)
break
a = list(a)
print(a)
for x in range(len(a)):
if a[x] == "z":
a[x] = "a"
elif "a" <= a[x] < "z":
a[x] = chr(ord(a[x])+1)
a = "".join(a)
|
b = ["the", "this", "that"]
while True:
try:
a = input()
except EOFError:
break
for y in range(26):
for x in b:
if x in a:
print(a)
break
a = list(a)
for x in range(len(a)):
if a[x] == "z":
a[x] = "a"
elif "a" <= a[x] < "z":
a[x] = chr(ord(a[x])+1)
a = "".join(a)
|
[["-", 0, 52, 8, 196, 0, 246, 0, 671, 0, 22], ["+", 0, 52, 8, 196, 0, 246, 0, 671, 0, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22]]
| 5
| 131
|
# -*- coding: utf-8 -*-
import sys
lineNumber = 0
#for line in [ "xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt." ]:
for line in sys.stdin.readlines():
lineNumber += 1
# get data
# List = map(float, line.strip().split(","))
s = line.strip()
for i in range(1, 26+1):
for idx in range( len(s) ):
n = ord(s[idx])
if n < 97 or n >= 97+26: continue
n += - 97 + 1
n %= 26
s = s[:idx] + chr(n + 97) + s[idx+1:]
if "this" in s or "that" in s: break
print(s)
|
import sys
lineNumber = 0
#for line in [ "xlmw mw xli tmgxyvi xlex m xsso mr xli xvmt." ]:
for line in sys.stdin.readlines():
lineNumber += 1
# get data
# List = map(float, line.strip().split(","))
s = line.strip()
for i in range(1, 26+1):
for idx in range( len(s) ):
n = ord(s[idx])
if n < 97 or n >= 97+26: continue
n += - 97 + 1
n %= 26
s = s[:idx] + chr(n + 97) + s[idx+1:]
if "this" in s or "that" in s or "the" in s: break
print(s)
|
[["+", 0, 7, 8, 196, 0, 57, 15, 679, 17, 354], ["+", 0, 57, 15, 679, 12, 666, 0, 557, 0, 654], ["+", 0, 57, 15, 679, 12, 666, 0, 557, 0, 6], ["+", 0, 57, 15, 679, 12, 666, 0, 557, 0, 655], ["+", 8, 196, 0, 57, 15, 679, 12, 666, 667, 267], ["+", 8, 196, 0, 57, 15, 679, 12, 666, 0, 22]]
| 5
| 123
|
console.log(require("fs")
.readFileSync("/dev/stdin")
.trim()
.split(' ')
.sort(function(a, b) { return b - a })
.join(' '))
|
console.log(require("fs")
.readFileSync("/dev/stdin", "utf8")
.trim()
.split(' ')
.sort(function(a, b) { return b - a })
.join(' '))
|
[["+", 500, 2, 63, 558, 500, 2, 3, 3, 0, 21], ["+", 63, 558, 500, 2, 3, 3, 0, 557, 0, 62], ["+", 63, 558, 500, 2, 3, 3, 0, 557, 0, 491]]
| 2
| 52
|
let fs = require('fs');
const yourAnswerFunctionComesHere =
data => {
var Arr = (input.trim()).split(" ").map(Number);
Arr.sort(function(a, b) { return b - a; });
console.log(Arr.join(" "));
}
const readFile =
path => {
fs.readFile(path, 'utf8',
(err, data) => { yourAnswerFunctionComesHere(data); });
}
const readFileWithoutArg =
() => {
const data = require('fs').readFileSync('/dev/stdin', 'utf8');
yourAnswerFunctionComesHere(data);
}
let sampleInputPath = "";
if (process.argv.length > 2) {
sampleInputPath = process.argv[2];
readFile(sampleInputPath);
} else {
readFileWithoutArg();
}
|
let fs = require('fs');
const yourAnswerFunctionComesHere =
data => {
var Arr = (data.trim()).split(" ").map(Number);
Arr.sort(function(a, b) { return b - a; });
console.log(Arr.join(" "));
}
const readFile =
path => {
fs.readFile(path, 'utf8',
(err, data) => { yourAnswerFunctionComesHere(data); });
}
const readFileWithoutArg =
() => {
const data = require('fs').readFileSync('/dev/stdin', 'utf8');
yourAnswerFunctionComesHere(data);
}
let sampleInputPath = "";
if (process.argv.length > 2) {
sampleInputPath = process.argv[2];
readFile(sampleInputPath);
} else {
readFileWithoutArg();
}
|
[["-", 63, 558, 500, 23, 0, 2, 63, 558, 500, 22], ["+", 63, 558, 500, 23, 0, 2, 63, 558, 500, 22]]
| 2
| 178
|
function main() {
var arr = input.split(' ').map(parseFloat);
arr.sort(function(a, b) { return a - b; });
console.log(arr.join(' '));
}
var input = '';
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) { input += chunk; });
process.stdin.on('end', function() { main(); });
|
function main() {
var arr = input.split(' ').map(parseFloat);
arr.sort(function(a, b) { return b - a; });
console.log(arr.join(' '));
}
var input = '';
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) { input += chunk; });
process.stdin.on('end', function() { main(); });
|
[["-", 0, 63, 8, 556, 0, 37, 0, 16, 31, 22], ["-", 0, 63, 8, 556, 0, 37, 0, 16, 17, 33], ["+", 0, 63, 8, 556, 0, 37, 0, 16, 17, 33], ["+", 0, 63, 8, 556, 0, 37, 0, 16, 12, 22]]
| 2
| 124
|
<?php
// Here your code !
$inputs = fgets(STDIN);
$values = explode(' ', $inputs);
rsort($values);
echo implode(' ', $values);
?>
|
<?php
$inputs = trim(fgets(STDIN));
$values = explode(' ', $inputs);
rsort($values);
echo implode(' ', $values);
?>
|
[["+", 0, 493, 0, 1, 0, 11, 12, 613, 63, 141], ["+", 0, 1, 0, 11, 12, 613, 3, 3, 0, 24], ["+", 3, 3, 0, 28, 0, 613, 3, 3, 0, 25]]
| 6
| 41
|
<?php
$a=explode(' ', fgets(STDIN));
rsort($a);
echo trim(implode(' ',$a)).PHP_EOL;
|
<?php
$a=explode(' ', trim(fgets(STDIN)));
rsort($a);
echo trim(implode(' ',$a)).PHP_EOL;
|
[["+", 12, 613, 3, 3, 0, 28, 0, 613, 63, 141], ["+", 3, 3, 0, 28, 0, 613, 3, 3, 0, 24], ["+", 3, 3, 0, 28, 0, 613, 3, 3, 0, 25]]
| 6
| 38
|
<?php
$a = explode(' ', fgets(STDIN) );
rsort($a);
echo implode(' ',$a).PHP_EOL;
|
<?php
$a = explode(' ', trim(fgets(STDIN)) );
rsort($a);
echo implode(' ',$a).PHP_EOL;
|
[["+", 12, 613, 3, 3, 0, 28, 0, 613, 63, 141], ["+", 3, 3, 0, 28, 0, 613, 3, 3, 0, 24], ["+", 3, 3, 0, 28, 0, 613, 3, 3, 0, 25]]
| 6
| 35
|
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String s;
String[] t;
int[] n;
int number;
while ((s = reader.readLine()) != null) {
t = s.split(" ");
number = t.length;
n = new int[number];
for (int i = 0; i < number; i++) {
n[i] = Integer.parseInt(t[i]);
}
Arrays.sort(t);
for (int j = number - 1; j >= 0; j--) {
System.out.print(n[j]);
if (j != 0) {
System.out.print(" ");
}
}
System.out.println("");
}
}
}
|
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
String s;
String[] t;
int[] n;
int number;
while ((s = reader.readLine()) != null) {
t = s.split(" ");
number = t.length;
n = new int[number];
for (int i = 0; i < number; i++) {
n[i] = Integer.parseInt(t[i]);
}
Arrays.sort(n);
for (int j = number - 1; j >= 0; j--) {
System.out.print(n[j]);
if (j != 0) {
System.out.print(" ");
}
}
System.out.println("");
}
}
}
|
[["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]]
| 3
| 202
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
private Scanner sc;
public static void main(String[] args) { new Main(); }
public Main() {
sc = new Scanner(System.in);
int[] numbers = new int[5];
for (int i = 0; i < numbers.length; i++) {
numbers[i] = Integer.parseInt(sc.next());
}
Arrays.sort(numbers);
StringBuilder sb = new StringBuilder();
sb.append(numbers[4]);
for (int i = 1; i < numbers.length; i++) {
sb.insert(0, numbers[i] + " ");
}
System.out.println(sb.toString());
}
}
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
private Scanner sc;
public static void main(String[] args) { new Main(); }
public Main() {
sc = new Scanner(System.in);
int[] numbers = new int[5];
for (int i = 0; i < numbers.length; i++) {
numbers[i] = Integer.parseInt(sc.next());
}
Arrays.sort(numbers);
StringBuilder sb = new StringBuilder();
sb.append(numbers[0]);
for (int i = 1; i < numbers.length; i++) {
sb.insert(0, numbers[i] + " ");
}
System.out.println(sb.toString());
}
}
|
[["-", 0, 1, 0, 492, 3, 4, 0, 504, 71, 499], ["+", 0, 1, 0, 492, 3, 4, 0, 504, 71, 499]]
| 3
| 173
|
import java.util.*;
public class Main {
private static final Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int[] nums = new int[5];
for (int i = 0; i < 5; i++) {
nums[i] = scan.nextInt();
}
for (int i = 0; i < 5 - 1; i++) {
for (int j = 5 - 1; j > i; i--) {
if (nums[i] < nums[j]) {
int big = nums[j];
nums[j] = nums[i];
nums[i] = big;
}
}
}
System.out.printf("%d %d %d %d %d\n", nums[0], nums[1], nums[2], nums[3],
nums[4]);
}
}
|
import java.util.*;
public class Main {
private static final Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int[] nums = new int[5];
for (int i = 0; i < 5; i++) {
nums[i] = scan.nextInt();
}
for (int i = 0; i < 5 - 1; i++) {
for (int j = 5 - 1; j > i; j--) {
if (nums[i] < nums[j]) {
int big = nums[j];
nums[j] = nums[i];
nums[i] = big;
}
}
}
System.out.printf("%d %d %d %d %d\n", nums[0], nums[1], nums[2], nums[3],
nums[4]);
}
}
|
[["-", 0, 7, 8, 196, 0, 7, 26, 27, 0, 22], ["+", 0, 7, 8, 196, 0, 7, 26, 27, 0, 22]]
| 3
| 188
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int a[] = new int[5];
int x;
for (int i = 0; i < 5; i++) {
a[i] = scn.nextInt();
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (a[j] < a[j + 1]) {
x = a[j];
a[j] = a[j + 1];
a[j + 1] = x;
}
}
}
for (int i = 0; i < 5; i++) {
if (i == 4)
System.out.println(a[i]);
System.out.print(a[i] + " ");
}
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int a[] = new int[5];
int x;
for (int i = 0; i < 5; i++) {
a[i] = scn.nextInt();
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (a[j] < a[j + 1]) {
x = a[j];
a[j] = a[j + 1];
a[j + 1] = x;
}
}
}
for (int i = 0; i < 5; i++) {
if (i == 4) {
System.out.println(a[i]);
break;
}
System.out.print(a[i] + " ");
}
}
}
|
[["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 45], ["+", 8, 196, 0, 57, 64, 196, 0, 1, 0, 35], ["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94], ["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 46]]
| 3
| 202
|
import java.util.*;
/*
Main class for AOJ where there is no input.
*/
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
String[] arr = str.split(" ");
int[] list = new int[arr.length];
for (int i = 0; i < arr.length; i++) {
list[i] = Integer.parseInt(arr[i]);
}
Arrays.sort(list);
for (int i = arr.length - 1; i >= 0; i--) {
System.out.print(arr[i]);
if (i != 0) {
System.out.print(" ");
}
}
System.out.println();
} // main
} // class
|
import java.util.*;
/*
Main class for AOJ where there is no input.
*/
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
String[] arr = str.split(" ");
int[] list = new int[arr.length];
for (int i = 0; i < arr.length; i++) {
list[i] = Integer.parseInt(arr[i]);
}
Arrays.sort(list);
for (int i = list.length - 1; i >= 0; i--) {
System.out.print(list[i]);
if (i != 0) {
System.out.print(" ");
}
}
System.out.println();
} // main
} // class
|
[["-", 502, 503, 49, 200, 51, 16, 31, 509, 500, 22], ["+", 502, 503, 49, 200, 51, 16, 31, 509, 500, 22], ["-", 0, 1, 0, 492, 3, 4, 0, 504, 516, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 504, 516, 22]]
| 3
| 173
|
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int[] n = new int[5];
for (int i = 0; i < 5; i++)
n[i] = sc.nextInt();
Arrays.sort(n);
for (int i = 4; i > 0; i++)
System.out.print(n[i] + " ");
System.out.print(n[0] + "\n");
}
}
}
|
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int[] n = new int[5];
for (int i = 0; i < 5; i++)
n[i] = sc.nextInt();
Arrays.sort(n);
for (int i = 4; i > 0; i--)
System.out.print(n[i] + " ");
System.out.print(n[0] + "\n");
}
}
}
|
[["-", 0, 52, 8, 196, 0, 7, 26, 27, 0, 29], ["+", 0, 52, 8, 196, 0, 7, 26, 27, 0, 68]]
| 3
| 150
|
#include <stdio.h>
void sort(int *data, int n);
int main(void) {
int data[5];
int i;
for (i = 0; i < 5; i++) {
scanf("%d", &data[i]);
}
sort(data, 5);
for (i = 0; i < 5; i++) {
if (i != 0) {
printf(" ");
}
printf("%d", data[i]);
}
printf("\n");
return (0);
}
void sort(int *data, int n) {
int i, j;
int temp;
for (i = 0; i < n; i++) {
for (j = n - i - 1; j > i; j--) {
if (data[j] > data[j - 1]) {
temp = data[j];
data[j] = data[j - 1];
data[j - 1] = temp;
}
}
}
}
|
#include <stdio.h>
void sort(int *data, int n);
int main(void) {
int data[5];
int i;
for (i = 0; i < 5; i++) {
scanf("%d", &data[i]);
}
sort(data, 5);
for (i = 0; i < 5; i++) {
if (i != 0) {
printf(" ");
}
printf("%d", data[i]);
}
printf("\n");
return (0);
}
void sort(int *data, int n) {
int i, j;
int temp;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (data[j] > data[j - 1]) {
temp = data[j];
data[j] = data[j - 1];
data[j - 1] = temp;
}
}
}
}
|
[["-", 0, 7, 10, 11, 12, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33]]
| 0
| 216
|
#include <stdio.h>
int main(void) {
int i, j;
int array[5] = {0};
for (i = 0; i < 5; i++)
scanf("%d", array + i);
for (i = 0; i < 4; i++)
for (j = 0; j < 4 - i; j++)
if (array[j] > array[j + 1])
array[j] ^= array[j + 1] ^= array[j] ^= array[j + 1];
for (i = 0; i < 5; i++)
printf("%d%c", array[i], 10 + 22 * (i < 4));
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, j;
int array[5] = {0};
for (i = 0; i < 5; i++)
scanf("%d", array + i);
for (i = 0; i < 4; i++)
for (j = 0; j < 4 - i; j++)
if (array[j] < array[j + 1])
array[j] ^= array[j + 1] ^= array[j] ^= array[j + 1];
for (i = 0; i < 5; i++)
printf("%d%c", array[i], 10 + 22 * (i < 4));
return 0;
}
|
[["-", 8, 7, 8, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 7, 8, 57, 15, 23, 0, 16, 17, 18]]
| 0
| 152
|
#include <stdio.h>
int main(void) {
int a[10], i, j, k, l, m, run;
for (i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
for (j = 0; j < 5; j++) {
for (k = 0; k < 5; k++) {
if (a[k] < a[k + 1]) {
run = a[k];
a[k] = a[k + 1];
a[k + 1] = run;
}
}
}
for (l = 0; l < 5; l++) {
printf("%d", a[l]);
if (l < 4)
printf(" ");
else
printf("\n");
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int a[10], i, j, k, l, m, run;
for (i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
for (j = 0; j < 5; j++) {
for (k = 0; k < 4; k++) {
if (a[k] < a[k + 1]) {
run = a[k];
a[k] = a[k + 1];
a[k + 1] = run;
}
}
}
for (l = 0; l < 5; l++) {
printf("%d", a[l]);
if (l == 4)
printf("\n");
else
printf(" ");
}
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 180
|
#include <stdio.h>
int main(void) {
int i, j, t, a[5];
for (i = 0; i < 5; i++)
scanf("%d", &a[i]);
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++) {
if (a[j] < a[j + 1]) {
t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}
}
}
printf("%d %d %d %d %d\n", a[0], a[1], a[2], a[3], a[4]);
return (0);
}
|
#include <stdio.h>
int main(void) {
int i, j, t, a[5];
for (i = 0; i < 5; i++)
scanf("%d", &a[i]);
for (i = 0; i < 5; i++) {
for (j = 0; j < 4; j++) {
if (a[j] < a[j + 1]) {
t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}
}
}
printf("%d %d %d %d %d\n", a[0], a[1], a[2], a[3], a[4]);
return (0);
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 159
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.