摘要: http://acm.timus.ru/problem.aspx?space=1&num=1057View Code const int MM = 22222;int64 L, R, K, B, len;int64 C[33][33];int64 p[111];void get_p() { int64 i,j,k; p[0]=1; len=(int64)((log(1.0*R)/log(1.0*B))+1.0);// printf("%d\n",len); for(i=1;i<=len;i++) p[i]=p[i-1]*B;// for(i=0;i<=l 阅读全文
posted @ 2013-04-08 14:40 zhang1107 阅读(129) 评论(0) 推荐(0) 编辑