| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
SHU B题用高精也WA了,无语了,是不是数据有问题啊?我用DP做的。#include <stdio.h>
#include <string.h>
#include <iostream.h>
int p;
int cnt[101];
int f[101][101][101];
void add1(int a,int b,int c,int d){
int i;
for(i=0;i<=100;i++){
f[a][b][i]+=f[c][d][i];
if(f[a][b][i]>=10) { f[a][b][i]-=10; f[a][b][i+1]++; }
}
}
void add2(int a,int b){
int i;
for(i=0;i<=100;i++){
cnt[i]+=f[a][b][i];
if(cnt[i]>=10) { cnt[i]-=10;cnt[i+1]++; }
}
}
int Is(int a,int b){
int i;
for(i=0;i<=100;i++)
if(f[a][b][i]) return 1;
return 0;
}
void DP(){
int i,j,k;
memset(f,0,sizeof(f));
memset(cnt,0,sizeof(cnt));
f[0][0][0]=1;
for(i=0;i<p;i++){
for(j=0;j<p;j++){
if(Is(i,j)){
//f[i+1][j]+=f[i][j];
add1(i+1,j,i,j);
k=(j+i+1)%p;
if(k==0) //cnt+=f[i][j];
add2(i,j);
//f[i+1][k]+=f[i][j];
add1(i+1,k,i,j);
}
}
}
}
int main()
{
int i,j;
//freopen("in.txt","r",stdin);
//freopen("out1.txt","w",stdout);
while(cin>>p){
DP();
//cout<<p<<" "<<cnt<<endl;
for(i=100;i>=0;i--)
if(cnt[i]) break;
for(j=i;j>=0;j--) printf("%d",cnt[j]);
printf("\n");
}
return 0;
}
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator