CodeForces - 630H Benches (组合数学)

CodeForces - 630H
Time Limit: 500MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u

 Status

Description

The city park of IT City contains n east to west paths and n north to south paths. Each east to west path crosses each north to south path, so there are n2 intersections.

The city funded purchase of five benches. To make it seems that there are many benches it was decided to place them on as many paths as possible. Obviously this requirement is satisfied by the following scheme: each bench is placed on a cross of paths and each path contains not more than one bench.

Help the park administration count the number of ways to place the benches.

Input

The only line of the input contains one integer n (5 ≤ n ≤ 100) — the number of east to west paths and north to south paths.

Output

Output one integer — the number of ways to place the benches.

Sample Input

Input
5
Output
120

Source

//题意:
有n条东西向的路,有n条南北向的路,并且东西向的每条路都与南北向的每条路相交,也就形成了n*n个十字路口,现在要在这么多个路口放5条长椅,并且每条路上最多能放一条长椅,问有多少种放法。
//思路sum=A(5,5)*C(n,5)*C(5,5)。
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define INF 0x3f3f3f3f
#define ll long long
#define N 10010
#define M 1000000007
using namespace std;
ll C(int n,int x)
{
	int i,j;
	ll s=1;
	for(i=n,j=1;i>n-x;i--,j++)
		s*=i,s/=j;
	return s;
}
int main()
{
	int i,n;
	while(scanf("%d",&n)!=EOF)
	{
		ll sum=120*C(n,5)*C(n,5);
		printf("%lld\n",sum);
	}
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值