Tiêu đề: Re: Hà Quang Tất Đạt Thu Aug 25, 2022 9:08 pm
Code:
uses math; const fi = 'xau15c2.inp'; fo = 'xau15c2.out'; var s,t : string; k,i,x,rmax : longint; c : array[1..100] of longint; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(s); k:=0 ; s:= ' '+ s + ' '; for i:=1 to length(s) do if s[i] in ['0'..'9'] then t := t + s[i] else if t <> '' then begin val(t,x); k := k+1; c[k] := x; t := ''; end; for i:=1 to k do rmax:=max(rmax,c[i]); write(rmax); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Fri Aug 26, 2022 7:37 pm
Code:
const fi = 'xau17.inp'; fo = 'xau17.out'; var s,k : string; t : char; i,l,j: longint; //c : array[1..100] of char; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); read(s); l := length(s); for i:=1 to l-1 do for j:=i+1 to l do if s[i] > s[j] then begin t:=s[i]; s[i]:=s[j]; s[j]:=t; end; write(s); close(input);close(output); end.
Hà Quang Tất Đạt likes this post
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Fri Aug 26, 2022 7:47 pm
Code:
const fi = 'xau18.inp'; fo = 'xau18.out'; var s : string; i,d,l: longint; //c : array[1..100] of char; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); read(s); l := length(s); d:=0; for i:=1 to l do if s[i] = 'a' then inc(d); write(d); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Fri Aug 26, 2022 8:05 pm
Code:
const fi = 'xau19.inp'; fo = 'xau19.out'; var s,a : string; i,d,l,k: longint; c : array[1..100] of longint; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); read(s); a:=' '; s:=s+' '; l := length(s); d:=1; for i:=1 to l do if s[i] = s[i+1] then inc(d) else if s[i] <> s[i+1] then begin a:=a+s[i]; inc(k); c[k]:=d; d:=1; end; for i:=1 to k do write(a[i],c[i]); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Fri Aug 26, 2022 9:13 pm
Code:
const fi = 'xau20.inp'; fo = 'xau20.out'; var s,a,res,t : string; i,j,l,x,k : longint; c : array[1..100] of longint; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(s); l := length(s); t:=''; i:=1; k:=0; while i <= l+1 do begin if s[i] in ['0'..'9'] then begin t:=t+s[i]; inc(i); end else if t <> '' then begin val(t,x); inc(k); c[k]:= x; t:= ''; end else begin a:=a + s[i]; inc(i); end; end; res:=''; for i:=1 to k do begin for j:=1 to c[i] do res:=res+a[i]; end; write(res); close(input);close(output);
end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Tue Aug 30, 2022 8:08 pm
Code:
const fi = 'b1b10.inp'; fo = 'b1d10.out'; var i,n: longint; e : array[1..10000] of longint;
procedure xuli(); var i: longint; begin for i:=1 to n do write(e[i],#32); writeln(); end;
procedure thu(i:longint); var j:longint; begin for j:=0 to 1 do begin e[i] := j; if (i=n) then xuli() else thu(i+1); end; end; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); thu(1); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Tue Aug 30, 2022 8:37 pm
Code:
const fi = 'b2b10.inp'; fo = 'b2d10.out'; var i,n: longint; e : array[1..10000] of longint;
procedure xuli(); var i,p: longint; begin p:=1; for i:=1 to (n-2) do if e[i]+e[i+1]+e[i+2]=3 then begin p:=0; break; end; if p = 1 then begin for i:=1 to n do write(e[i]); writeln(); end; end;
procedure thu(i:longint); var j:longint; begin for j:=0 to 1 do begin e[i] := j; if (i=n) then xuli() else thu(i+1); end; end; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); thu(1); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Tue Aug 30, 2022 8:54 pm
Code:
[code]const fi = 'b3b10.inp'; fo = 'b3d10.out'; var n,k,i: longint; e : array[1..10000] of longint; b : array[1..10000] of longint; procedure xuli(); var i,s: longint; begin s:=0; for i:=1 to n do begin if e[i] = 1 then s:=s+b[i]; end; if s=k then begin for i:=1 to n do if e[i]=1 then write(b[i]); writeln(); end; end;
procedure thu(i:longint); var j:longint; begin for j:=0 to 1 do begin e[i] := j; if (i=n) then xuli() else thu(i+1); end; end; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n,k); for i:=1 to n do read(b[i]); thu(1); close(input);close(output); end.
[/code]
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Tue Aug 30, 2022 9:34 pm
Code:
const fi = 'b4b10.inp'; fo = 'b4d10.out'; var n,i,s: longint; e : array[1..10000] of longint; b : array[1..10000] of longint; procedure xuli(); var i,sa: longint; begin sa:=0; for i:=1 to n do if e[i] = 1 then sa := sa+b[i]; if 3*sa = s then begin for i:=1 to n do if e[i] = 1 then write(i,#32); writeln(); end; end;
procedure thu(i:longint); var j:longint; begin for j:=0 to 1 do begin e[i] := j; if (i=n) then xuli() else thu(i+1); end; end; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); s:=0; for i:=1 to n do begin read(b[i]); s:=s+b[i]; end; thu(1); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Wed Aug 31, 2022 3:06 pm
Code:
const fi = 'uocgcd.inp'; fo = 'uocgcd.out'; var n,i : longint; a : array[1..100] of longint; function nto( u : longint) : boolean; var j : longint; begin if u <= 1 then exit(false); for j:=2 to trunc(sqrt(u)) do if u mod j = 0 then exit(false); exit(true); end; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); for i:=2 to n do if n mod i = 0 then if nto(i) then write(i,#32); close(input);close(output); end.
i,n : longint; a : array [1..10000] of longint; fre : array[1..10000] of boolean; procedure xuli(); var i:longint; begin for i:=1 to n do write(a[i],#32); writeln(); end; procedure thu(i : longint); var j : longint; begin for j := 1 to n do if fre[j] then begin a[i]:=j; fre[j] := false; if i=n then xuli() else thu(i+1); fre[j]:=true; end; end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); for i:=1 to n do fre[i]:=true; thu(1); close(input);close(output); end.
[code][code] const fi = 'b2d11.inp'; fo = 'b2d11.out'; var
res,i,n,p : longint; a,b : array[1..10000] of longint; fre : array[1..10000] of boolean; procedure xuli(); var i,t:longint; begin inc(res); t:=0; for i:=1 to n do if b[i] = a[i] then inc(t); if t = n then begin write(res,#32); exit; end; end; procedure thu(i : longint); var j : longint; begin for j := 1 to n do if fre[j] then begin b[i]:=j; fre[j] := false; if i=n then xuli() else thu(i+1); fre[j]:=true; end; end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); for i:=1 to n do read(a[i]); for i:=1 to n do fre[i]:=true; thu(1); close(input);close(output); end.
res,i,n,k : longint; a,b : array[1..10000] of longint; fre : array[1..10000] of boolean; procedure xuli(); var i,t:longint; begin inc(res); if res = k then begin
for i:=1 to n do write(b[i],#32); exit(); end; end; procedure thu(i : longint); var j : longint; begin for j := 1 to n do if fre[j] then begin b[i]:=j; fre[j] := false; if i=n then xuli() else thu(i+1); fre[j]:=true; end; end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n,k); for i:=1 to n do fre[i]:=true; thu(1); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Sat Sep 03, 2022 8:58 pm
Code:
const fi = 'bai2d12.inp'; fo = 'bai2d12.out'; var n : longint; a,t : array[0..10000] of longint; fre: array[0..10000] of longint;
procedure xuli(k:longint); var j:longint; begin for j:=1 to k do begin write(a[j],#32); end; writeln(); end; procedure quaylui(i:longint); var j:longint; begin for j:=a[i-1] to (n - t[i-1]) div 2 do begin a[i] := j; t[i] := t[i-1] + j; quaylui(i+1); end; a[i] := n - t[i-1] ; xuli(i); end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); a[0]:=1; t[0]:=0; quaylui(1); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Sat Sep 03, 2022 8:58 pm
freopen("BAI1D12.INP","r",stdin); freopen("BAI1D12.OUT","w",stdout); cin >> n >> k ; a[0] = 0; quaylui(1);
return 0; }
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Sat Sep 03, 2022 9:26 pm
Code:
const fi = 'bai3d12.inp'; fo = 'bai3d12.out'; var n : longint; a,t : array[0..10000] of longint; fre: array[0..10000] of longint;
function nto(u:longint) : boolean; var i:longint; begin if u <= 1 then exit(false); for i:=2 to trunc(sqrt(u)) do if u mod i = 0 then exit(false); exit(true); end;
procedure xuli(k:longint); var j,p:longint; begin p:=1; for j:=1 to k do begin if nto(a[j])=false then p := 0 ;
end; if k=1 then p:=0; if p = 1 then begin for j:=1 to k do write(a[j],#32); writeln(); end; end; procedure quaylui(i:longint); var j:longint; begin for j:=a[i-1] to (n - t[i-1]) div 2 do begin a[i] := j; t[i] := t[i-1] + j; quaylui(i+1); end; a[i] := n - t[i-1] ; xuli(i); end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); a[0]:=1; t[0]:=0; quaylui(1); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Sat Sep 03, 2022 9:28 pm
Code:
const fi = 'bai4d12.inp'; fo = 'bai4d12.out'; var n : longint; a,t : array[0..10000] of longint; fre: array[0..10000] of longint;
function nto(u:longint) : boolean; var i:longint; begin if u <= 1 then exit(false); for i:=2 to trunc(sqrt(u)) do if u mod i = 0 then exit(false); exit(true); end;
procedure xuli(k:longint); var j,p:longint; begin p:=1; for j:=1 to k do begin if a[j] = a[j+1] then p:=0; if nto(a[j])=false then p := 0 ;
end; if k=1 then p:=0; if p = 1 then begin for j:=1 to k do write(a[j],#32); writeln(); end; end; procedure quaylui(i:longint); var j:longint; begin for j:=a[i-1] to (n - t[i-1]) div 2 do begin a[i] := j; t[i] := t[i-1] + j; quaylui(i+1); end; a[i] := n - t[i-1] ; xuli(i); end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); a[0]:=1; t[0]:=0; quaylui(1); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Sat Sep 03, 2022 9:39 pm
Code:
const fi = 'bai4d12c2.inp'; fo = 'bai4d12c2.out'; var n : longint; a,t : array[0..10000] of longint; fre: array[0..10000] of longint;
function nto(u:longint) : boolean; var i:longint; begin if u <= 1 then exit(false); for i:=2 to trunc(sqrt(u)) do if u mod i = 0 then exit(false); exit(true); end;
procedure xuli(k:longint); var j,p,p1:longint; begin p:=1; p1:=1; for j:=1 to k do begin if nto(a[j])=false then p := 0 ; break;
end; for j:=1 to k-1 do if a[j] = a[j+1] then begin p1:=0; break; end; if k=1 then p:=0; if (p = 1) and (p1 = 1) then begin for j:=1 to k do write(a[j],#32); writeln(); end; end; procedure quaylui(i:longint); var j:longint; begin for j:=a[i-1] to (n - t[i-1]) div 2 do begin a[i] := j; t[i] := t[i-1] + j; quaylui(i+1); end; a[i] := n - t[i-1] ; xuli(i); end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); a[0]:=1; t[0]:=0; quaylui(1); close(input);close(output); end.
Hà Quang Tất Đạt
Tổng số bài gửi : 131 Join date : 05/08/2022
Tiêu đề: Re: Hà Quang Tất Đạt Sun Sep 04, 2022 8:55 pm
Code:
[code]const fi = 'wavio.inp'; fo = 'wavio.out'; var
n,k,i,res : longint; a,b,c,d : array[1..10000] of longint;
procedure thu(); var i:longint; begin for i:=1 to res do write(d[i],#32); end;
function kt() : boolean; var i:longint; begin for i:=1 to (k div 2) do if c[i] >= c[i+1] then exit(false); for i:= (k div 2)+1 to k-1 do if c[i] <= c[i+1] then exit(false); exit(true); end;
procedure xuli(); var i:longint; begin k:=0; for i:=1 to n do if (b[i] =1) then begin inc(k); c[k]:=a[i]; end; if kt() then if res < k then begin res:=k; for i:=1 to k do d[i] := c[i]; end; end;
procedure sinh(i: longint); var j: longint; begin for j:=0 to 1 do begin b[i]:=j; if i = n then xuli() else sinh(i+1); end; end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); for i:=1 to n do read(a[i]); res:=0; sinh(1); thu();
const fi = 'sumx.inp'; fo = 'sumx.out'; var n,x,d,i,j : longint; a : array[1..10000] of longint; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); for i:=1 to n do read(a[i]); readln(x); for i:=1 to n do for j:=1 to n do if (1 <= i) and (i < j) and (j <= n) then begin if (a[i] + a[j] = x) then inc(d); end; write(d,#32); close(input);close(output); end.
const fi = 'numbers.inp'; fo = 'numbers.out'; var n,kk : longint; a,t : array[-3..100000] of longint;
function sodep(u,v : longint) : boolean; var h : longint; begin while u > 0 do begin h:=u mod 10; if (h <> 0) and ( h <> v) then exit(false); u:= u div 10; end; exit(true); end;
procedure xuli(l,q:longint); var pp,z : longint; begin z:=1; for pp:=1 to l do if sodep(a[pp],q) = false then begin z:=0; break; end; if z=1 then begin for pp:=1 to l do write(a[pp],#32); writeln(); end else writeln(-1);
end;
procedure thu( i,p : longint); var j:longint; begin for j:=a[i-1] to (n - t[i-1]) div 2 do begin a[i] := j; t[i] := t[i-1] + j; thu(i+1,p); end; a[i] := n - t[i-1]; xuli(i,p); end;
procedure solve( v : longint); begin a[0]:=1; t[0]:=0; thu(1,v); end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); while not(eof()) do begin readln(n,kk); solve(kk); end; close(input);close(output); end.
const fi = 'uocnto.inp'; fo = 'uocnto.out'; var n,i,k : longint; c : array[1..100000] of longint; function nto(u : longint) : boolean; var j : longint; begin if u <= 1 then exit(false); for j:=2 to trunc(sqrt(u)) do if u mod j = 0 then exit(false); exit(true); end; begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); for i:=1 to trunc(sqrt(n)) do
if n mod i = 0 then begin if nto(i) then begin inc(k); c[k]:=i; end; if (i <> n div i) and nto(n div i) then begin inc(k); c[k]:= n div i; end; end; for i:=1 to k do
const fi = 'uocntosub2.inp'; fo = 'uocntosub2.out'; var n,i,k,d : longint; c : array[1..100000] of longint; procedure pt(u : longint); var i:longint; begin i:=2; while i*i <= u do if u mod i = 0 then begin inc(k); c[k]:=i;; u := u div i; end else inc(i); if u > 1 then begin inc(k); c[k]:=u; end; end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n); k:=0; pt(n); d:=1; for i:=1 to k do if c[i] = c[i+1] then inc(d) else begin write(c[i],#32); d:=1; end; close(input);close(output); end.
const fi = 'chungkhoan.inp'; fo = 'chungkhoan.out'; var i,n,k1,res : longint; c,d,b,a : array[1..100000] of longint;
procedure xuli(); var i,k : longint; begin k:=0; for i:=1 to n do if b[i] = 1 then begin inc(k); c[k] := a[i]; end; for i:=1 to k-1 do if abs(c[i] - c[i+1]) < k1 then exit; if res < k then begin res := k; for i:=1 to k do d[i] := c[i]; end; end;
procedure thu(i:longint); var j : longint; begin for j := 0 to 1 do begin b[i] := j; if i = n then xuli() else thu(i+1); end; end;
begin assign(input,fi);reset(input); assign(output,fo);rewrite(output); readln(n,k1); for i:=1 to n do read(a[i]); res:=0; thu(1); xuli(); writeln(res); for i:=1 to res do write(d[i],#32); close(input);close(output); end.