题目: | 麦森数 | |
来源: | Noip2003p4 | |
题目大意: | 输出2^p-1这个数的位数及后500位,输出一行50个数 | |
数据范围: | 1000<P<3100000 | |
样例: | 1279 | 386 00000000000000000000000000000000000000000000000000 00000000000000000000000000000000000000000000000000 00000000000000104079321946643990819252403273640855 38615262247266704805319112350403608059673360298012 23944173232418484242161395428100779138356624832346 49081399066056773207629241295093892203457731833496 61583550472959420547689811211693677147548478866962 50138443826029173234888531116082853841658502825560 46662248318909188018470682222031405210266984354887 32958028878050869736186900714720710555703168729087 |
做题思路: | 这题无非就是快速幂+高精乘,然后计算后500位就好。。悲剧了,我好不容易打完了结果被我删 了,从网上搜了个好的。那个数的位数原来有公式啊。。。晓得了 | |
知识点: | 快速幂、高精乘、换底公式 |
type
hp=array[0..10000]of longint;
var
q,i:longint;
t,s,y:hp;
procedure chen(a,b:hp;var c:hp); {<带参高精乘运算>}
var i,j,len:integer;
begin
fillchar(c,sizeof(c),0);
fori:=1 to 500 do
forj:=1 to 500 do
begin
inc(c[i+j-1],a[i]*b[j]);
inc(c[i+j],c[i+j-1] div 10);
c[i+j-1]:=c[i+j-1] mod 10;
end;
end;
begin
readln(q);
writeln(trunc(q*ln(2)/ln(10))+1); {<糊里糊涂的就能出来,晓得了>}
t[1]:=2;
s[1]:=1;
whileq>0 do{<快速幂>}
begin
ifodd(q) then begin chen(s,t,y);
s:=y;end;
chen(t,t,y);t:=y;
q:=qshr 1;
end;
s[1]:=s[1]-1;
fori:=500 downto 1 do
begin
write(s[i]);
if imod 50=0 then writeln;
end;
end.
题目来源:
http://yuanti.tyvj.cn:8080/Problem_Show.asp?id=1037