FZU2264,2265,2266 Card Game 系列 （数学，规律）(第七届福建省大学生程序设计竞赛)

题目：

Problem 2264 Card Game (First Edition)

Accept: 5    Submit: 17
Time Limit: 1000 mSec    Memory Limit : 32768 KB

 Problem Description

Fat brother and Maze are playing a kind of special (hentai) game with some cards. There are N*2 cards in this game for the players to use, this is the card deck. The game goes for N rounds and in each round, Fat Brother would draw one card from the remaining card deck randomly and then Maze would draw one card from the remaining card deck randomly. Then they compare for the integers which is written on these two cards. The player with the higher number wins this round and score 1 victory point. And then these two cards are removed from the game such that they would not appear in the later rounds. As we all know, Fat Brother is very clever, so he would like to know the expect number of the victory points he could get if he knows all the integers written in these cards.

Note that the integers written on these N*2 cards are pair wise distinct. At the beginning of this game, each player has 0 victory point.

 Input

The first line of the data is an integer T (1 <= T <= 100), which is the number of the text cases.

Then T cases follow, each case contains an integer N (1 <= N<=10000) which described before. Then follow one line with N*2 integers, which indicate the integers in these cards.

All the integers are positive and no morethan 10000000.

 Output

For each case, output the case number first, and then output the expect number of the victory points Fat Brother could get in this game. The answer should be rounded to 2 digits after the decimal point.

 Sample Input

211 221 2 3 4

 Sample Output

Case 1: 0.50Case 2: 1.00

 Source

第七届福建省大学生程序设计竞赛-重现赛（感谢承办方闽江学院）

思路：

这一题是求胖子获胜的概率，直接去重以后除以4就是概率

代码：

#include <cstdio>
#include <cstring>
#include <cctype>
#include <string>
#include <set>
#include <iostream>
#include <stack>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define mod 1000007
#define N 80000
#define M 12357
#define ll long long
using namespace std;
int a[N],b[N];
int main()
{
	int t,n,q=1;
	scanf("%d",&t);
	while(t--)
	{
		mem(a,0);
		mem(b,0);
		scanf("%d",&n);
		for(int i=0; i<2*n; i++)
		{
			scanf("%d",&a[i]);
		}
		sort(a,a+2*n);
		int cnt=0;
		for(int i=2*n-1; i>=0; i--)
		{
			if(a[i]==a[i-1])
				continue;
			else
				cnt++;
		}
		printf("Case %d: %.2lf\n",q++,cnt*1.0/4);
	}
	return 0;
}

Problem 2265 Card Game (Second Edition)

Accept: 10    Submit: 29
Time Limit: 1000 mSec    Memory Limit : 32768 KB

 Problem Description

Fat brother and Maze are playing a kind of special (hentai) game with some cards. In this game, every player gets N cards at first and these are their own card deck. The game goes for N rounds and in each round, Fat Brother and Maze would draw one card from their own remaining card deck randomly and compare for the integer which is written on the cards. The player with the higher number wins this round and score 1 victory point. And then these two cards are removed from the game such that they would not appear in the later rounds. As we all know, Fat Brother is very clever, so he would like to know the expect number of the victory points he could get if he knows all the integers written in these cards.

Note that the integers written on these N*2 cards are pair wise distinct. At the beginning of this game, each player has 0 victory point.

 Input

The first line of the data is an integer T (1 <= T <= 100), which is the number of the text cases.

Then T cases follow, each case contains an integer N (1 <=N<=10000) which described before. Then follow two lines with N integers each. The first N integers indicate Fat Brother’s cards and the second N integers indicate Maze’s cards.

All the integers are positive and no more than 10000000.

 Output

For each case, output the case number first, and then output the expect number of victory points Fat Brother would gets in this game. The answer should be rounded to 2 digits after the decimal point.

 Sample Input

211221 32 4

 Sample Output

Case 1: 0.00Case 2: 0.50

 Source

第七届福建省大学生程序设计竞赛-重现赛（感谢承办方闽江学院）

思路：

这道题是求他们分别随机拿牌，胖子获胜的概率，思路就是把它们每一把的概率算出来然后加起来

我们用a数组存胖子的牌，用b存另一个的牌，先算出胖子不能获胜的概率，最后用n减去就行

实际上，我们只需要遍历一下a中的每一个元素，然后找出在b数组里面，有多少个数大于他，然后一直把a数组遍历完，得到的数是sum

然后求出：(n-sum/n)就是最后的答案

代码：

#include <cstdio>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <iostream>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define mod 10000007
#define debug() puts("what the fuck!!!")
#define N (10000+200)
#define ll long long
using namespace std;
int a[N];
int b[N];
int main()
{
	int t,n,q=1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(int i=0; i<n; i++)
			scanf("%d",&a[i]);
		for(int i=0; i<n; i++)
			scanf("%d",&b[i]);
		sort(a,a+n);
		sort(b,b+n);
		int sum=0;
		for(int i=0; i<n; i++)
		{
			int m=upper_bound(b,b+n,a[i])-b;
			sum+=n-m;
		}
		printf("Case %d: %.2lf\n",q++,double(n-(sum*1.0/n)));
	}
	return 0;
}

Problem 2266 Card Game (Third Edition)

Accept: 4    Submit: 6
Time Limit: 1000 mSec    Memory Limit : 32768 KB

 Problem Description

Fat brother and Maze are playing a kind of special (hentai) game with some cards. In this game, every player gets N cards at first and these are their own card decks. Each of these two decks of cards is stacking together at the beginning of the game, and their order would not change during this game. The game goes for N rounds and in each round, Fat Brother and Maze would draw one card from the top of their own remaining card deck and sum these two integers together. If this number is greater than 10, Fat Brother would score 1 victory point and otherwise Maze would score 1 victory points. And then these two cards are removed from the game such that they would not appear in the later rounds. As we all know, Fat Brother is very clever, so he would like to know the number of the victory points he could get if he knows all the integers written in these cards. At the beginning of this game, each player has 0 victory point.

 Input

The first line of the date is an integer T (1 <= T <= 100), which is the number of the text cases.

Then T cases follow, each case contains an integer N (1 <= N <= 10000) which described before. Then follow two lines with N integers each. The first N integers indicate the cards which Fat Brother gets from top to bottom, and the second N integers indicate the cards which Maze gets from top to bottom.

All the integers are positive and least than 10.

 Output

For each case, output the case number first, and then output the number of victory points Fat Brother would gets in this game.

 Sample Input

215623 43 4

 Sample Output

Case 1: 1Case 2: 0

 Source

第七届福建省大学生程序设计竞赛-重现赛（感谢承办方闽江学院）

思路：

这道题就是水题了，统计一下对应的有多少个大于10就行了

代码：

#include <cstdio>
#include <cstring>
#include <cctype>
#include <string>
#include <set>
#include <iostream>
#include <stack>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define mod 1000007
#define N 20200
#define M 12357
#define ll long long
using namespace std;
int a[N],b[N];
int main()
{
	int t,n,q=1;
	scanf("%d",&t);
	while(t--)
	{
		mem(a,0);mem(b,0);
		scanf("%d",&n);
		for(int i=0; i<n; i++)
		{
			scanf("%d",&a[i]);
		}
		for(int i=0; i<n; i++)
		{
			scanf("%d",&b[i]);
		}
		int sum=0;
		for(int i=0;i<n;i++)
		{
			if(a[i]+b[i]>10)
				sum++;
		}
		
		
		printf("Case %d: %d\n",q++,sum);


	}
	return 0;
}