代码搜索结果

program ural1048; const maxn=1000000; var d:array[1..maxn div 2]of byte; n,i,p:longint; x,y,f:byte; begin fillchar(d,sizeof(d),0); readln(n); for i:=n downto 1 do begin p:

program ural1011; var p,q:real; a,b,c:integer; begin readln(p,q); a:=round(p*100);b:=round(q*100); c:=1; repeat inc(c); until (c*a div 10000

program ural1051; var m,n,t:integer; begin readln(m,n); if m>n then begin t:=m;m:=n;n:=t;end; if m=1 then if odd(n) then writeln(n div 2+1) else writeln(n div 2) else if (m

program ural1068; var n:integer; begin readln(n); writeln((1+n)*(abs(n-1)+1) div 2); end.

program ural1150; var c:array[0..9]of int64; n,d,x,y:int64; a,i:byte; begin fillchar(c,sizeof(c),0); readln(n); d:=1; repeat x:=n div (d*10); y:=n mod d; a:=n d

program ural1194; var n,k:integer; begin readln(n,k); writeln(n*(n-1) div 2-k); end.

program ural1120; const zero=1e-6; var n,p:longint; begin readln(n); for p:=trunc(sqrt(2*n)) downto 1 do if (n-p*(p-1) div 2) mod p=0 then begin writeln((n-p*(p-1) div 2) di

program ural1169; const maxn=100; maxk=maxn*(maxn-1) div 2; var sol:array[0..maxk,0..maxn div 3]of shortint; n:byte; k,d,i,j:integer; begin read(n,k); k:=n*(n-1) div 2-k; so

program ural1289; var n,i:longint; begin read(n); if n=2 then writeln(10) else begin for i:=1 to n div 2-1 do write(1); write(0); for i:=1 to n div 2-2 do write(8);

program ural1355; var t,u,a,b,ans:longint; begin read(t); for u:=1 to t do begin read(a,b); if b mod a>0 then begin writeln(0);continue;end; ans:=1;b:=b div a; while not