zoukankan      html  css  js  c++  java
  • The 2018 ACM-ICPC China JiangSu Provincial Programming Contest J. Set

    Let's consider some math problems.

    JSZKC has a set A=A={1,2,...,N}. He defines a subset of A as 'Meo set' if there doesn't exist two integers in this subset with difference one. For example, When A={1,2,3},{1},{2},{3},{1,3} are 'Meo set'.

    For each 'Meo set', we can calculate the product of all the integers in it. And then we square this product. At last, we can sum up all the square result of the 'Meo set'.

    So please output the final result.

    Input Format

    The input file contains several test cases, each of them as described below.

    • The first line of the input contains one integers N(1N100), giving the size of the set.

    There are no more than 100test cases.

    Output Format

    One line per case, an integer indicates the answer.

    样例输入

    3

    样例输出

    23

    题目来源

    The 2018 ACM-ICPC China JiangSu Provincial Programming Contest

     

     1 //要用java大数,规律为(n+1)!-1
     2 import java.io.*;
     3 import java.util.*;
     4 import java.math.BigInteger;
     5 public class a{
     6     public static void main(String args[]){
     7         Scanner cin=new Scanner (System.in);
     8         int  n;
     9         BigInteger a=BigInteger.valueOf(1);
    10         while(cin.hasNext()){
    11             n=cin.nextInt();
    12             BigInteger ans=BigInteger.valueOf(1);
    13             for(int i=1;i<=n+1;i++)
    14             {
    15                 ans=ans.multiply(BigInteger.valueOf(i));
    16                 //System.out.println(ans);
    17             }
    18             ans=ans.subtract(a);
    19             System.out.println(ans);
    20         }
    21     }
    22 }
  • 相关阅读:
    hihocoder1634 Puzzle Game
    hihocoder1580 Matrix
    BZOJ3036 绿豆蛙的归宿
    CF|codeforces 280C Game on Tree
    [SDOI2011] 计算器
    [SCOI2007] 修车
    [JSOI2008] 球形空间产生器sphere
    APIO2012 派遣dispatching | 左偏树
    OI数据结构&&分治 简单学习笔记
    BZOJ3307 雨天的尾巴
  • 原文地址:https://www.cnblogs.com/tingtin/p/9398281.html
Copyright © 2011-2022 走看看