USACO/Money System.c at master · sunheehnus/USACO · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
ID: sunheco1
LANG: C
TASK: money
*/
#include<stdio.h>

long long money[33][11111];

int tar[26];

int N,V;

void quicksort(int s,int e)
{
	int i,j,mid,temp;
	if(s<e)
	{
		i=s;
		j=e;
		mid=(i+j)>>1;
		temp=tar[mid];
		tar[mid]=tar[s];
		while(i<j)
		{
			while(i<j&&tar[j]>=temp)
				j--;
			tar[i]=tar[j];
			while(i<j&&tar[i]<=temp)
				i++;
			tar[j]=tar[i];
		}
		tar[i]=temp;
		quicksort(s,i-1);
		quicksort(i+1,e);
	}
}


int main()
{
	int i,j,k,temp;
	long long result=0;
	FILE *fin  = fopen ("money.in", "r");
    FILE *fout = fopen ("money.out", "w");
	fscanf(fin,"%d %d",&V,&N);
	for(j=1;j<=V;j++)
	{
		fscanf(fin,"%d",tar+j);
	}
	quicksort(1,V);
	for(j=1;j<=V;j++)
	{
		money[j][tar[j]]=1;
	}
	for(i=tar[1]+1;i<=N;i++)
	{
		for(j=1;tar[j]<=i>>1;j++)
		{
			temp=i-tar[j];
			for(k=j;k<=V;k++)
				money[j][i]+=money[k][temp];
		}
	}
	for(i=1;i<=V;i++)
		result+=money[i][N];
	fprintf(fout,"%lld\n",result);
	return 0;
}
//3 10 1 2 5