const fi='gcd.inp'; fo='gcd.out'; var a,b:longint; function ucln(u,v:longint):longint; var r:longint; begin while v>0 do begin r:=u mod v; u:=v; v:=r; end; exit(u); end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(a,b); write(ucln(a,b)); close(input); close(output); end.
const fi='arradd2.inp'; fo='arradd2.out'; var a,b,c:array [0..1000] of longint; i,j,n,m,k:longint; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,m); for i:=1 to n do read(a[i]); for i:=1 to m do read(b[i]); i:=1; j:=1; while (i<=n) or (j<=m) do begin inc(k); if (a[i]<=b[j]) and (i<=n) then begin c[k]:=a[i]; inc(i); end else if j<=m then begin c[k]:=b[j]; inc(j); end; end; for i:=1 to m+n do write(c[i],#32); close(input); close(output); end.
const fi='arrcount.inp'; fo='arrcount.out'; var n,k,ii:longint; a:array [0..1000] of longint; procedure qsort(l, r: longint); var i,j,chot,tam: longint; begin i:= l; j:= r; chot:=a[(i+j) div 2]; while i<= j do begin while a[i] < chot do inc(i); while a[j] > chot do dec(j); if i <= j then begin tam:=a[i]; a[i]:=a[j]; a[j]:=tam; inc(i); dec(j); end; end; if i < r then qsort(i,r); if l < j then qsort(l,j); end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n); for ii:=1 to n do read(a[ii]); qsort(1,n); k:=1; for ii:=1 to n do if a[ii]=a[ii+1] then inc(k) else begin writeln(a[ii],#32,k); k:=1; end; close(input); close(output); end.
const fi='bins.inp'; fo='bins.out'; var i,n,x,k:longint; a:array [0..1000] of longint; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); read(n,x); for i:=1 to n do begin read(a[i]); if x=a[i] then begin write(i,#32); k:=1; end; end; if k<>1 then write(-1); close(input); close(output); end.
uses math; const fi='upseq.inp'; fo='upseq.out'; var i,n,res,k:longint; a:array[0..1000] of longint; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n); for i:=1 to n do read(a[i]); k:=1; for i:=1 to n do if a[i]<=a[i+1] then inc(k) else begin res:=max(res,k); k:=1; end; write(res); close(input); close(output); end.
const fi='arr2d.inp'; fo='arr2d.out'; var i,j,m,n,s:longint; a:array [0..1000,0..1000] of longint; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(m,n); for i:=1 to m do begin for j:=1 to n do begin read(a[i,j]); s:=s+a[i,j]; end; write(s,#32); s:=0; end; writeln; for j:=1 to n do begin for i:=1 to m do s:=s+a[i,j]; write(s,#32); s:=0; end; close(input); close(output); end.
uses math; const fi='arr2dpri.inp'; fo='arr2dpri.out'; var f:array [0..1000] of boolean; a:array [0..1000,0..1000] of longint; n,m,i,j,res,k:longint; procedure sangnt(n:longint); var i,k:longint; begin for i:=1 to n do f[i]:=true; i:=2; f[1]:=false; while i<=sqrt(n) do if f[i] then begin k:=2; while k*i<=n do begin f[i*k]:=false; inc(k); end; inc(i); end else inc(i); end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,m); for i:=1 to n do for j:=1 to m do begin read(a[i,j]); res:=max(res,a[i,j]); end; sangnt(res); for i:=1 to n do for j:=1 to m do if f[a[i,j]] then begin writeln(i,#32,j); k:=1; end; if k<>1 then write(-1); close(input); close(output); end.
uses math; const fi='arr2dsqu.inp'; fo='arr2dsqu.out'; var fx,fm,a:array [0..1000,0..1000] of longint; n,m,k,res:longint; procedure doc; var f:text; i,j:longint; begin assign(f,fi); reset(f); readln(f,n,m,k); for i:=1 to n do for j:=1 to m do read(f,a[i,j]); for i:=1 to n do for j:=1 to m do fx[i,j]:=a[i,j]+fx[i-1,j]+fx[i,j-1]-fx[i-1,j-1]; close(f); end; procedure xuly; var i,j:longint; begin for i:=1 to n-k+1 do for j:=1 to m-k+1 do begin fm[i,j]:=fx[i+k-1,j+k-1]-fx[i+k-1,j-1]-fx[i-1,j+k-1]+fx[i-1,j-1]; res:=max(res,fm[i,j]); end; end; procedure ghi; var f:text; i,j:longint; begin assign(f,fo); rewrite(f); writeln(f,res); for i:=1 to n-k+1 do for j:=1 to m-k+1 do if fm[i,j]=res then writeln(f,i,#32,j); close(f); end; begin res:=low(longint); doc; xuly; ghi; end.
uses math; const fi='ddb.inp'; fo='ddb.out'; var f:array [0..2000000] of 0..1; a,s:array [0..2000000] of longint; t,i,j,res,p:longint; procedure sangnt(n:longint); var i,k:longint; begin for i:=1 to n do f[i]:=1; f[1]:=0; i:=2; while i<=sqrt(n) do if f[i]=1 then begin k:=2; while k*i<=n do begin f[k*i]:=0; inc(k); end; inc(i); end else inc(i); end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(t); for i:=1 to t do begin readln(a[i]); res:=max(res,a[i]); end; sangnt(2*res); for i:=1 to 2*res do s[i]:=s[i-1]+f[i]; for i:=1 to t do begin p:=s[2*a[i]]-s[a[i]]; writeln(p); end; close(input); close(output); end.
const fi='numdivs.inp'; fo='numdivs.out'; var p,a,b,n,i,s:longint; function uoc(n:longint):longint; var i,k:longint; begin k:=0; for i:=1 to trunc(sqrt(n)) do if n mod i =0 then begin inc(k); if i<> n div i then inc(k); end; exit(k); end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,a,b); for i:=1 to n do begin p:=uoc(i); if (p>=a) and (p<=b) then inc(s); end; write(s); close(input); close(output); end.
uses math; const fi='bonsai.inp'; fo='bonsai.out'; var i,k,n,res:longint; a,s,smax:array [0..1000000] of longint; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,k); for i:=1 to n do readln(a[i]); for i:=1 to n do s[i]:=s[i-1]+a[i]; for i:=n downto 1 do smax[i]:=max(s[i],smax[i+1]); res:=low(longint); for i:=1 to n-k+1 do res:=max(res,smax[i+k-1]-s[i-1]); write(res); close(input); close(output); end.
const fi='mm.inp'; fo='mm.out'; var n,i,k,j:longint; a:array [0..100] of longint; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n); i:=n; while i>0 do begin for k:=1 to n do write(a[k],#32); writeln; i:=n; while a[i]=1 do dec(i); a[i]:=1; for j:=i+1 to n do a[j]:=0; end; close(input); close(output); end.
const fi='mm.inp'; fo='mm.out'; var n,k,d,p:longint; f:array [-7..100] of longint; procedure xuat; var i:longint; begin if d=k then begin for i:=1 to n do write(f[i],#32); writeln; p:=1; end; end; procedure try(i:longint); var j:longint; begin for j:=0 to 1 do begin f[i]:=j; if j=1 then inc(d); if i=n then xuat else try(i+1); if j=1 then dec(d); end; end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,k); try(1); if p=0 then write(-1); close(input); close(output); end.
uses math; const fi='dayconk.inp'; fo='dayconk.out'; var i,n,res,s,k:longint; f:array [0..1000] of longint; procedure xuat; var j,i:longint; begin for i:=1 to k do write(f[i],#32); writeln; end; procedure try(i:longint); var j:longint; begin for j:=f[i-1]+1 to n-k+i do begin f[i]:=j; if i=k then xuat else try(i+1); end; end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,k); try(1); close(input); close(output); end.
uses math; const fi='dayconk2.inp'; fo='dayconk2.out'; var i,n,s,k,p:longint; f,a:array [0..100] of longint; procedure xuat; var i:longint; begin if p=s then begin for i:=1 to k do write(f[i],#32); writeln; end; end; procedure try(i:longint); var j:longint; begin for j:=f[i-1]+1 to n-k+i do begin f[i]:=j; p:=p+a[f[i]]; if p>s then begin p:=p-a[f[i]]; break; end; if i=k then xuat else try(i+1); p:=p-a[f[i]]; end; end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,k,s); for i:=1 to n do read(a[i]); try(1); close(input); close(output); end.
[code]uses math; const fi='dayconk2.inp'; fo='dayconk2.out'; var i,n,s,k,p:longint; f,a:array [0..100] of longint; procedure xuat; var i:longint; begin if p=s then begin for i:=1 to k do write(f[i],#32); writeln; end; end; procedure try(i:longint); var j:longint; begin for j:=f[i-1]+1 to n-k+i do begin f[i]:=j; p:=p+a[f[i]]; if p>s then begin p:=p-a[f[i]]; break; end; if i=k then xuat else try(i+1); p:=p-a[f[i]]; end; end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,k,s); for i:=1 to n do read(a[i]); try(1); close(input); close(output); end. [/code]
uses math; const fi='dayconk3.inp'; fo='dayconk3.out'; var n,k,i,res,p,t,g,s:longint; f,a,c:array [0..1000] of longint; function pali(m:longint):boolean; begin if m<=9 then exit(true) else begin p:=m; g:=0; t:=0; while m<>0 do begin inc(g); c[g]:=m mod 10; m:=m div 10; end; for i:=1 to g do t:=t*10+c[i]; if p=t then exit(true); exit(false); end; end; procedure xuat; begin if pali(s) then res:=max(res,s); end; procedure try(i:longint); var j:longint; begin for j:=f[i-1]+1 to n-k+i do begin f[i]:=j; s:=s+a[f[i]]; if i=k then xuat else try(i+1); s:=s-a[f[i]]; end; end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,k); for i:=1 to n do read(a[i]); try(1); write(res); close(input); close(output); end.
quanttk33
Tổng số bài gửi : 60 Join date : 23/06/2022 Age : 16 Đến từ : Vietnam
const fi='sum.inp'; fo='sum.out'; var n,a,b,c,d,k:longint; procedure dak; begin if (a<=b) and (b<=c) and (c<=d) then writeln(a,#32,b,#32,c,#32,d) else k:=1; end; procedure xuly(x:longint); begin a:=1; b:=1; c:=1; d:=x-3; writeln(a,#32,b,#32,c,#32,d); while (a<=b) and (b<=c) and (c<=d) do begin dec(d); inc(c); dak; if k=1 then exit; dec(d); inc(b); dak; if k=1 then exit; dec(d); inc(a); dak; if k=1 then exit; end; end; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n); if n<=3 then write(0) else xuly(n); close(input); close(output); end.
const fi='financial.inp'; fo='financial.out'; var i,j,n,k,res:longint; a,fx,tr:array [0..100000] of longint; begin assign(input,fi); reset(input); assign(output,fo); rewrite(output); readln(n,k); for i:=1 to n do read(a[i]); for i:=1 to n do begin fx[i]:=1; for j:=1 to i-1 do if (abs(a[j]-a[i])>=k) and (fx[i]<fx[j]+1) then begin fx[i]:=fx[j]+1; tr[i]:=j; end; end; for i:=1 to n do if res<fx[i] then begin res:=fx[i]; j:=i; end; writeln(res); while j<>0 do begin write(a[j],#32); j:=tr[j]; end; close(input); close(output); end.