摘要: long change(long a) { int my[MAX_SIZE]; int i=0; long tmp=0; while (a) { my[i++]=a%8; a/=8; } int j=i; for (i=0;i<j;++i) tmp=tmp+my[i]*(long)p... 阅读全文
posted @ 2016-09-05 17:26 随风9 阅读(259) 评论(0) 推荐(0) 编辑