zoukankan      html  css  js  c++  java
  • codeforces 57 C Array(简单排列组合)

    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Chris the Rabbit has been interested in arrays ever since he was a child. At the moment he is researching arrays with the length of n, containing only integers from 1 to n. He is not good at math, that's why some simple things drive him crazy. For example, yesterday he grew keen on counting how many different beautiful arrays there are. Chris thinks that an array is beautiful if it meets one of the two conditions:

    • each elements, starting from the second one, is no more than the preceding one
    • each element, starting from the second one, is no less than the preceding one

     

    Having got absolutely mad at himself and at math, Chris came to Stewie and Brian to ask them for help. However, they only laughed at him and said that the answer is too simple and not interesting. Help Chris the Rabbit to find the answer at last.

    Input

    The single line contains an integer n which is the size of the array (1 ≤ n ≤ 105).

    Output

    You must print the answer on a single line. As it can be rather long, you should print it modulo 1000000007.

    Sample test(s)
    input
    2
    output
    4
    input
    3
    output
    17





     1 #include <stdio.h>
     2 const long long mo = 1000000007;
     3 typedef long long ll;
     4 ll cc[200000];
     5 
     6 ll ext_gcd(ll a,ll b,ll &x,ll &y)
     7 {
     8     if(b==0){x=1;y=0;return a;}
     9     ll d=ext_gcd(b,a%b,x,y),t;
    10     t=x;x=y;y=t-a/b*y;
    11     return d;
    12 }
    13 ll inv(int a,int mo)
    14 {
    15     ll x,y,dx,g;
    16     g=ext_gcd(a,mo,x,y);
    17     dx=mo/g;
    18     return (x%dx+dx)%dx;
    19 }
    20 int main()
    21 {
    22     ll n, i;
    23     for (i = 1; i <= 100000; i++)
    24         cc[i] = inv(i, mo);
    25     scanf("%lld", &n);
    26     ll hh;
    27     ll ans;
    28     hh = 2 * n - 1;
    29     ans = 1;
    30     for (i = 1; i <= n; i++,hh--)
    31         ans = ans * hh %mo* cc[i] % mo;//保险点,宁可多mod一下的!! 
    32     ans = (2 * ans - n + mo) % mo;
    33     printf("%lld
    ", ans);
    34     return 0;
    35 }
    View Code
  • 相关阅读:
    MYSQL数据库查看被锁状态以及解锁
    MongoDB命令
    代码重构
    笔试常见之C类型转换
    WeakReference(弱引用)(转)
    Linux ubuntu16.04下vim的安装与配置
    mysql Access denied for user root@localhost之错误解决方法(错误码:1045)
    mysql服务无法启动报错1067解决办法 (mysql启动错误1067)
    js的ajax封装
    windows下apache tomcat整合
  • 原文地址:https://www.cnblogs.com/skykill/p/3264771.html
Copyright © 2011-2022 走看看