- 博客(5)
- 收藏
- 关注
RSS订阅转载 3199 Hamming Problem
#include using namespace std; __int64 humble[100000]; __int64 _min(__int64 a, __int64 b, __int64 c) { __int64 m; if(a c) m = c; return m; } int main() { int e1=0, e2=0, e3=0; __int64 a1, a2, a3; int p1, p2, p3, n; while(scanf("%d %d %d %d", &p1, &p2, &p3,
2010-10-20 10:30:00
371
转载 2048 错排
#include int main(){ int n,i,j,a; double x[100],s; x[0]=x[1]=0; for(s=1.0,j=1,i=2;i { s*=i; x[i]=x[i-1]+j/s; j*=-1; printf("%.2lf%%/n",x[i]*100.0); }}f(4)=1
2010-10-12 20:06:00
226
转载 2049 错排
二维递推 我是一维#include int main(void){ int i, m, n; __int64 a[21][2] = {{1,0},{1,0},{2,1},{6,2}}; for (i = 4; i { a[i][0] = i * a[i-1][0]; a[i][1] = (i-1) * (a[i-1][1] + a[i-2][1]); } scanf("%d", &i); while (i-- && scanf("%d%
2010-10-07 12:35:00
319
原创 1085
#include #include #define N 1001 #define M 8 int main () { int a[3][5*N],sum[2*M*N],temp[M*N],i,j,k,b[3],p[3]={1,3,8},q[3]={1,2,5}; while(scanf("%d%d%d",b,b+1,b+2),b[0]||b[1]||b[2]) { memset(sum,0,M*N*sizeof(int));
2010-10-06 21:24:00
322
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人