import java.math.BigInteger; import java.util.Scanner; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while(scanner.hasNext()) { int n = scanner.nextInt(); int m = 0; int p = 0; if (n % 2 == 0) { m = n-1; p = n; }else { m = n; p = n-1; } BigInteger y1 = BigInteger.ZERO; BigInteger y2 = BigInteger.ZERO; for (int i = 1; i <= m; i++) { if (i % 2 != 0) { y1 = y1.add(factorial(i)); } } for (int i = 2; i <= p; i++) { if (i % 2 == 0) { y2 = y2.add(factorial(i)); } } System.out.println(y1.toString()+" "+y2.toString()); } } public static BigInteger factorial(int n) { if (n == 0 || n == 1) { return BigInteger.ONE; } return factorial(n-1).multiply(BigInteger.valueOf(n)); } }
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int y1 = 0; int y2 = 0; int j = 1; for (int i = 1; i <= n; i++) { j *= i; if (i % 2 == 0) y2 += j; else y1 += j; } System.out.println(y1 + " " + y2); } }
import java.util.Scanner; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); while(sc.hasNext()){ long n = sc.nextInt(); long sum1=0; long sum2=0; for(long i=1;i<=n;i+=2){ sum1+=mul(i); } for(long i=2;i<=n;i+=2){ sum2+=mul(i); } System.out.print(sum1+" "+sum2); } } public static long mul(long x){ long m = 1; for(long i=1;i<=x;i++){ m = m*i; } return m; } }
import java.util.Scanner; public class Main { @SuppressWarnings("resource") public static void main(String[] args) { Scanner in = new Scanner(System.in); int nextInt = in.nextInt(); int jiShu = 0; int ouShu = 0; for (int i = 1; i <= nextInt; i++) { if (i % 2 != 0) { jiShu += jieCheng(i); } else { ouShu += jieCheng(i); } } System.out.println(jiShu + " " + ouShu); } public static int jieCheng(int n) { if (n == 1) { return 1; } else { return jieCheng(n - 1) * n; } } }
* p是小于等于n的最大偶
import java.util.Scanner; public class Main { public static int mul(int n) { if (n > 0) { return n * mul(n - 1); } else { return 1; } } public static int add(int n) { int sum = 0; while (n > 0) { sum += mul(n); n = n - 2; } return sum; } public static void main(String[] args) { Scanner in = new Scanner(System.in); int y1 = 0, y2 = 0; while (in.hasNext()) { int n = in.nextInt(); if (n % 2 == 0) { y1 = add(n - 1); y2 = add(n); } else { y1 = add(n); y2 = add(n - 1); } System.out.println(y1+" "+y2); } } }
import java.util.Scanner; /* * 功能:输入整数,输出奇数和偶数的阶乘和(小于等于输入的数) */ public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); int inputNumber; while(sc.hasNext()){ //获得输入的整数 inputNumber = sc.nextInt(); int i = 1; int y1 = 0; //奇数阶乘和 int y2 = 0; //偶数阶乘和 int lastNumMul = 1; //用于循环的那个数(i)的上一个数的阶乘 while(i <= inputNumber){ lastNumMul = lastNumMul * i; if(i % 2 != 0){ //奇数 y1 += lastNumMul; } else { y2 += lastNumMul; } i++; } System.out.println(y1 + " " + y2); } } }
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main{ public static void main(String[] args) throws NumberFormatException, IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String line = null; Main m = new Main(); while ((line = br.readLine()) != null) { int number = Integer.parseInt(line); m.factorial(number); } } public void factorial(int n){ int temp,sum1,sum2; temp = 1; sum1 = 0; sum2 = 0; for(int i = 1; i <= n; i++){ temp *= i; if(i % 2 == 1){ sum1 += temp; }else{ sum2 += temp; } } System.out.println(sum1 + " " + sum2); } }
}
import java.util.Scanner;