【优先队列】CQU SUMMER14 WARMING UP _20140720

新生晚会

5
3 2
5 3
4 4
3 6
8 0

3
10
1
0
1

#include <cmath>   
#include <cstdio>  
#include <string>  
#include <cstring>  
#include <iostream>  
#include <algorithm>
using namespace std;
typedef __int64 ll;
/*
ll jc[31];
void j_init()
{
	memset(jc,0LL,sizeof jc);
	jc[0]=1LL;
	for(int i=1;i<31;i++)
		jc[i]=jc[i-1]*(ll)i;
}
*/

ll C(int n,int m)
{
	ll ans=1LL;
	if(n<m)			return 0;
	if(n==m||m==0)	return 1LL;
	if(m==1||n-m==1)return (ll)n;
	for(int i=1;i<=m;i++)
	{
		ans*=(ll)(n-i+1);
		ans/=(ll)i;
	}
	return ans;
}

int main()
{
	int T;
	cin>>T;
	//j_init();
	//cout<<jc[30];
	for(int i=1;i<=T;i++)
	{
		int N,M;
		cin>>N>>M;
		cout<<C(N,M)<<endl;
	}
	return 0;
} 

Wooden Sticks

3 
5 
4 9 5 2 2 1 3 5 1 4 
3 
2 2 1 1 2 2 
3 
1 3 2 2 3 1

2
1
3

#include <cmath>   
#include <queue>
#include <vector>
#include <cstdio>  
#include <string>  
#include <cstring>  
#include <iostream>  
#include <algorithm>
using namespace std;
const int inf=99999;
const int _sign=89757;
int main()
{
	int T;
	cin>>T;
	for(int cs=1;cs<=T;cs++)
	{
		int n;
		cin>>n;
		priority_queue <pair<int, int> > pq;
		queue < pair<int, int> > q;
		for(int ns=0;ns<n;ns++)//sort in pq
		{
			pair<int,int> tmp;
			cin>>tmp.first>>tmp.second;
			pq.push(tmp);
		}
		while(!pq.empty())//trans into q
		{
			pair<int,int> tmp=pq.top();
			q.push(tmp);
			pq.pop();
		}
		q.push(make_pair(_sign,_sign));
		int len=inf,wht=inf,ans=0;
		pair<int,int> temp;
		while(1)
		{
			temp=q.front();q.pop();
			//cout<<"#"<<temp.first<<"\t"<<temp.second<<endl;
			if(temp.first==_sign&&temp.second==_sign)
			{
				if(len==inf&&wht==inf){break;}
				len=wht=inf;
				q.push(temp);
				ans++;
			}
			else if(temp.first<=len&&temp.second<=wht)
			{
				len=temp.first;
				wht=temp.second;
			}
			else q.push(temp);
			//cout<<temp.first<<"\t"<<temp.second<<endl;
		}
		cout<<ans<<endl;
	}	
	return 0;
} 

Bone Collector

Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …
The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?

1
5 10
1 2 3 4 5
5 4 3 2 1

14

#include<iostream>
#include<algorithm>
using namespace std;
int dp[1000][1000];
int main()
{
    int t,n,v,i,j;cin>>t;
    int va[1000],vo[1000];
    while(t--)
    {
        cin>>n>>v;
        for(i=1;i<=n;i++) cin>>va[i];
        for(i=1;i<=n;i++) cin>>vo[i];
        memset(dp,0,sizeof(dp));
         for(i=1;i<=n;i++)
            for(j=0;j<=v;j++)
            {
                if(vo[i]<=j)//ith item will into j-size bag
                    dp[i][j]=max(dp[i-1][j],dp[i-1][j-vo[i]]+va[i]);//consider about if ith in it then others beyond the limit
                else //ith item can not be into it
                    dp[i][j]=dp[i-1][j];
            }
        cout<<dp[n][v]<<endl;
    }
    return 0;
}

Rightmost Digit

2
3
4

7
6

Hint
In the first case, 3 * 3 * 3 = 27, so the rightmost digit is 7.
In the second case, 4 * 4 * 4 * 4 = 256, so the rightmost digit is 6.
 

问N的N次方末尾数是什么，枚举找循环节，取模即可。

#include <cmath>   
#include <cstdio>  
#include <string>  
#include <cstring>  
#include <iostream>  
#include <algorithm>
using namespace std;
//int num[10]={1,4,4,2,1,1,4,4,2,1};
int main()
{
	int T;
	cin>>T;
	int ans2[4]={6,2,4,8},ans3[4]={1,3,9,7},ans7[4]={1,7,9,3},ans8[4]={6,8,4,2};
	int ans4[2]={6,4},ans9[2]={1,9};
	for(int i=0;i<T;i++)
	{
		int N;
		cin>>N;
		int r=N%10;
		switch(r)
		{
			case 0:
				cout<<"0"<<endl;
				break;
			case 1:
				cout<<"1"<<endl;
				break;
			case 2:
				cout<<ans2[N%4]<<endl;
				break;
			case 3:
				cout<<ans3[N%4]<<endl;
				break;
			case 4:	
				cout<<ans4[N%2]<<endl;
				break;
			case 5:
				cout<<"5"<<endl;
				break;
			case 6:
				cout<<"6"<<endl;
				break;
			case 7:
				cout<<ans7[N%4]<<endl;
				break;
			case 8:
				cout<<ans8[N%4]<<endl;
				break;
			case 9:
				cout<<ans9[N%2]<<endl;
				break;
		}
	}
	return 0;
}