跳到主要內容

uva 430

舉手投票問題

//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 1000005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int vote[1000];
int dp[M];
int need;
int power[1000];
int n;
int main() {
ios_base::sync_with_stdio(0);
char str[1000];
int x,i;
while(gets(str)){
Set(power,0);
if(sscanf(str,"%d%n",&need,&x)<1)continue;
int z=0;
for(i=0,z=x;sscanf(str+z,"%d%n",&vote[i],&x)>0;i++,z+=x);//debug("%d\n",x);
n=i;
for(int k=0;k<n;k++){
Set(dp,0);
dp[0]=1;
for(int i=0;i<n;i++){
if(k==i)continue;
for(int j=need-1;j>=vote[i];j--){
dp[j]+=dp[j-vote[i]];
}
}
for(int a=max(0,need-vote[k]);a<need;a++){
power[k]+=dp[a];
}
}
printf("%d",power[0]);
for(int i=1;i<n;i++){
printf(" %d",power[i]);
}Pln();
}

















}

留言