May 2024 | Mon | Tue | Wed | Thu | Fri | Sat | Sun |
---|
| | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | | | Calendar |
|
Top posting users this week | |
| | Nguyễn Phúc Tâm | |
| | |
Tác giả | Thông điệp |
---|
Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Thu Aug 25, 2022 8:37 am | |
| - Code:
-
//DQCKN52 uses math; var n, k, i, rmin, rmax, res: longint; a, b: array[-7..100007] of longint; procedure xuli1(); var q: longint; begin rmin := b[a[1]];rmax := b[a[1]]; for q := 2 to k do begin rmin := min(rmin, b[a[q]]); rmax := max(rmax, b[a[q]]); end; res := min(res, abs(rmax - rmin)); end; procedure thu1(i: longint); var j: longint; begin for j := a[i-1]+1 to n-k+i do begin a[i] := j; if i = k then xuli1() else thu1(i+1); end; end; procedure xuli2(); var q: longint; begin rmin := b[a[1]];rmax := b[a[1]]; for q := 2 to k do begin rmin := min(rmin, b[a[q]]); rmax := max(rmax, b[a[q]]); end; if abs(rmax - rmin) = res then begin for q := 1 to k do write(b[a[q]],#32); writeln(); end; end; procedure thu2(i: longint); var j: longint; begin for j := a[i-1]+1 to n-k+i do begin a[i] := j; if i = k then xuli2() else thu2(i+1); end; end; begin assign(input,'dqckn52.inp');reset(input); assign(output,'dqckn52.out');rewrite(output); readln(n, k); res := high(longint); for i := 1 to n do read(b[i]); thu1(1); thu2(1); writeln(res); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Mon Aug 29, 2022 8:52 pm | |
| - Code:
-
//DQCKN7 uses math; var n, k, i, res: longint; a, b, c: array[-7..100007] of longint; procedure xuli(); var p: longint; s: int64; begin s := 0; for p := 1 to k do s := s + b[a[p]] + c[a[p]]; res := max(res, s); end; procedure thu(i: longint); var j: longint; begin for j :=a[i-1]+1 to n-k+i do begin a[i] := j; if i = k then xuli() else thu(i+1); end; end; begin assign(input,'dqckn7.inp');reset(input); assign(output,'dqckn7.out');rewrite(output); readln(n, k); for i := 1 to n do read(b[i]); readln; for i := 1 to n do read(c[i]); res := low(longint); thu(1); writeln(res); close(input);close(output); end.
Được sửa bởi Nguyễn Phúc Tâm ngày Mon Aug 29, 2022 9:08 pm; sửa lần 1. | |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Mon Aug 29, 2022 9:08 pm | |
| - Code:
-
//DQCKN8 uses math; var n, k, m, v, i, res: longint; a, b, c, d: array[-7..100007] of longint; procedure xuli(); var p: longint; sb, sc, sd: int64; begin sb := 0;sc := 0;sd := 0; for p := 1 to k do begin sb := sb + b[a[p]]; if sb > m then exit(); sc := sc + c[a[p]]; sd := sd + d[a[p]]; if sd > v then exit(); end; res := max(res, sc); end; procedure thu(i: longint); var j: longint; begin for j :=a[i-1]+1 to n-k+i do begin a[i] := j; if i = k then xuli() else thu(i+1); end; end; begin assign(input,'dqckn8.inp');reset(input); assign(output,'dqckn8.out');rewrite(output); readln(n, k, m, v); for i := 1 to n do read(b[i]); readln; for i := 1 to n do read(c[i]); readln; for i := 1 to n do read(d[i]); res := low(longint); thu(1); writeln(res); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Mon Aug 29, 2022 9:37 pm | |
| - Code:
-
//DQCKN9 uses math; var n, k, m, v, p, i, res: longint; a, b, c, d: array[-7..100007] of longint; procedure xuli1(); var q: longint; sb, sc, sd: int64; begin sb := 0;sc := 0;sd := 0; for q := 1 to k do begin sb := sb + b[a[q]]; if sb > m then exit(); sc := sc + c[a[q]]; if sc > p then exit(); sd := sd + d[a[q]]; if sd > v then exit(); end; if sc = p then begin for q := 1 to k do write(c[a[q]],#32); writeln(); end; end; procedure thu1(i: longint); var j: longint; begin for j :=a[i-1]+1 to n-k+i do begin a[i] := j; if i = k then xuli1() else thu1(i+1); end; end; begin assign(input,'dqckn9.inp');reset(input); assign(output,'dqckn9.out');rewrite(output); readln(n, k, m, v, p); for i := 1 to n do read(b[i]); readln; for i := 1 to n do read(c[i]); readln; for i := 1 to n do read(d[i]); res := low(longint); thu1(1); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Fri Sep 02, 2022 8:04 pm | |
| - Code:
-
// Hoán vị 1 var n, i: longint; a: array[-7..1000007] of longint; f: array[-7..1000007] of boolean; procedure xuli(); var p: longint; begin for p := 1 to n do write(a[p],#32); writeln(); end; procedure thu(i: longint); var j: longint; begin for j := 1 to n do if f[j] then begin a[i] := j; f[j] := false; if i = n then xuli() else thu(i+1); f[j] := true; end; end; begin assign(input,'dqhv0.inp');reset(input); assign(output,'dqhv0.out');rewrite(output); readln(n); for i := 1 to n do f[i] := True; thu(1); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Fri Sep 02, 2022 8:21 pm | |
| - Code:
-
//DQHV2 var n, i, q, d: longint; a, b: array[-7..1000007] of longint; f: array[-7..1000007] of boolean; procedure xuli(); var p, tam: longint; begin inc(d);tam := 0; for p := 1 to n do if a[p] <> b[p] then tam := 1; if tam = 0 then q := 1; end; procedure thu(i: longint); var j: longint; begin for j := 1 to n do if f[j] then begin if q = 1 then exit(); b[i] := j; f[j] := false; if i = n then xuli() else thu(i+1); f[j] := true; end; end; begin assign(input,'dqhv2.inp');reset(input); assign(output,'dqhv2.out');rewrite(output); readln(n); for i := 1 to n do read(a[i]); for i := 1 to n do f[i] := True; q := 0;d := 0; thu(1); writeln(d); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Fri Sep 02, 2022 8:24 pm | |
| - Code:
-
//DQHV3 var n, i, q, d, k: longint; a, b: array[-7..1000007] of longint; f: array[-7..1000007] of boolean; procedure xuli(); var p: longint; begin inc(d); if d = k then begin for p := 1 to n do write(b[p],#32); q := 1; end; end; procedure thu(i: longint); var j: longint; begin for j := 1 to n do if f[j] then begin if q = 1 then exit(); b[i] := j; f[j] := false; if i = n then xuli() else thu(i+1); f[j] := true; end; end; begin assign(input,'dqhv3.inp');reset(input); assign(output,'dqhv3.out');rewrite(output); readln(n, k); for i := 1 to n do read(a[i]); for i := 1 to n do f[i] := True; q := 0;d := 0; thu(1); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Fri Sep 02, 2022 8:48 pm | |
| - Code:
-
//DQHV4 var n, i, d, k, q: longint; a, b: array[-7..100007] of longint; f: array[-7..100007] of boolean; procedure xuli1(); var p, tam: longint; begin inc(d);q := 1; for p := 1 to n do if a[p] <> b[p] then q := 0; if q = 1 then k := d; if d = k+1 then begin for p := 1 to n do write(b[p],#32); writeln(); end; end; procedure thu(i: longint); var j: longint; begin for j := 1 to n do if f[j] then begin b[i] := j; f[j] := false; if (i = n) then xuli1() else thu(i+1); f[j] := True; end; end; begin assign(input,'dqhv4.inp');reset(input); assign(output,'dqhv4.out');rewrite(output); readln(n, k); for i := 1 to n do read(a[i]); for i := 1 to n do f[i] := True; d := 0; thu(1); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Fri Sep 02, 2022 9:06 pm | |
| - Code:
-
//DQHV5 var n, i: longint; res: int64; a, b, c: array[-7..100007] of longint; f: array[-7..100007] of boolean; procedure xuli1(); var p: longint; sa: int64; begin sa := 0; for p := 1 to n-1 do sa := sa + abs(a[b[p]] - a[b[p]+1]); if sa < res then begin res := sa; for p := 1 to n do c[p] := a[b[p]]; end; end; procedure thu(i: longint); var j: longint; begin for j := 1 to n do if f[j] then begin b[i] := j; f[j] := false; if (i = n) then xuli1() else thu(i+1); f[j] := True; end; end; begin assign(input,'dqhv5.inp');reset(input); assign(output,'dqhv5.out');rewrite(output); readln(n); for i := 1 to n do read(a[i]); for i := 1 to n do f[i] := True; res := high(longint); thu(1); writeln(res); for i := 1 to n do write(c[i],#32); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Fri Sep 02, 2022 9:14 pm | |
| - Code:
-
//DQHV6 var n, i: longint; res: int64; a, b, c: array[-7..100007] of longint; f: array[-7..100007] of boolean; procedure xuli1(); var p: longint; sa: int64; begin sa := 0; for p := 1 to n-1 do sa := sa + abs(a[b[p]] - a[b[p]+1] + a[b[p]+2]); if sa > res then begin res := sa; for p := 1 to n do c[p] := a[b[p]]; end; end; procedure thu(i: longint); var j: longint; begin for j := 1 to n do if f[j] then begin b[i] := j; f[j] := false; if (i = n) then xuli1() else thu(i+1); f[j] := True; end; end; begin assign(input,'dqhv6.inp');reset(input); assign(output,'dqhv6.out');rewrite(output); readln(n); for i := 1 to n do read(a[i]); for i := 1 to n do f[i] := True; res := low(longint); thu(1); writeln(res); for i := 1 to n do write(c[i],#32); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Sun Sep 04, 2022 8:58 pm | |
| - Code:
-
//WAVIO-c1 uses math; var n, i, res: longint; a, b, c, d: array[-7..100007] of longint; procedure xuli(); var p, k, h, g: longint; begin k := 0;g := 0; for p := 1 to n do if b[p] = 1 then begin inc(k); c[k] := a[p]; end; if k mod 2 = 0 then exit(); h := (k div 2) + 1; for p := 1 to h-2 do if c[p] >= c[p+1] then exit(); for p := h to k-1 do if c[p] <= c[p+1] then exit(); if k > res then begin res := k; for p := 1 to n do begin inc(g); d[g] := c[p]; end; 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,'wavio.inp');reset(input); assign(output,'wavio.out');rewrite(output); readln(n); for i := 1 to n do read(a[i]); res := low(longint); thu(1); writeln(res); for i := 1 to res do write(d[i],#32); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Thu Sep 08, 2022 8:18 pm | |
| - Code:
-
//SUM var x, d: longint; a, t: array[-7..100007] of longint; f: array[-7..100007] of boolean; procedure snt(u: longint); var i, j: longint; begin for i := 1 to x do f[i] := true; f[1] := false; i := 2; while i*i <= u do if f[i] then begin j := 2; while i*j <= u do begin f[i*j] := false; inc(j); end; inc(i); end else inc(i); end; procedure xuli(u: longint); var p: longint; begin if u <> 4 then exit(); for p := 1 to u do if f[a[p]] = false then exit(); inc(d); end; procedure thu(i: longint); var j: longint; begin for j := a[i-1] to (x - t[i-1]) div 2 do begin a[i] := j; t[i] := t[i-1] + j; thu(i+1); end; a[i] := x - t[i-1]; xuli(i); end; begin assign(input,'sumprime.inp');reset(input); assign(output,'sumprime.out');rewrite(output); readln(x); t[0] := 0; a[0] := 1; d := 0; snt(x); thu(1); writeln(d); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Thu Sep 08, 2022 8:20 pm | |
| - Code:
-
//SUMPRIME var x, d: longint; a, t: array[-7..100007] of longint; f: array[-7..100007] of boolean; procedure snt(u: longint); var i, j: longint; begin for i := 1 to x do f[i] := true; f[1] := false; i := 2; while i*i <= u do if f[i] then begin j := 2; while i*j <= u do begin f[i*j] := false; inc(j); end; inc(i); end else inc(i); end; procedure xuli(u: longint); var p: longint; begin if u <> 4 then exit(); for p := 1 to u do if f[a[p]] = false then exit(); inc(d); end; procedure thu(i: longint); var j: longint; begin for j := a[i-1] to (x - t[i-1]) div 2 do begin a[i] := j; t[i] := t[i-1] + j; thu(i+1); end; a[i] := x - t[i-1]; xuli(i); end; begin assign(input,'sumprime.inp');reset(input); assign(output,'sumprime.out');rewrite(output); readln(x); t[0] := 0; a[0] := 1; d := 0; snt(x); thu(1); writeln(d); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Thu Sep 08, 2022 8:22 pm | |
| - Code:
-
//SUM var x, d: longint; a, t: array[-7..100007] of longint; procedure xuli(u: longint); var p: longint; begin if u <> 4 then exit(); inc(d); end; procedure thu(i: longint); var j: longint; begin for j := a[i-1] to (x - t[i-1]) div 2 do begin a[i] := j; t[i] := t[i-1] + j; thu(i+1); end; a[i] := x - t[i-1]; xuli(i); end; begin assign(input,'sum.inp');reset(input); assign(output,'sum.out');rewrite(output); readln(x); t[0] := 0; a[0] := 1; d := 0; thu(1); writeln(d); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Tue Sep 20, 2022 9:31 pm | |
| - Code:
-
//DFS1 var n, m, i, u, v, k, k0, ii, res: longint; fre: array[1..100000] of boolean; a: array[-7..307,-7..307] of longint; c, d: array[-7..100007] of longint; procedure duyet(i: longint); var j: longint; begin fre[i] := false; inc(k); c[k] := i; for j := 1 to n do if fre[j] and (a[i,j] = 1) then duyet(j); end; begin assign(input,'DFS1.inp');reset(input); assign(output,'DFS1.out');rewrite(output); readln(n, m); for i := 1 to n do begin readln(u, v); a[u,v] := 1; a[v,u] := 1; end; for i := 1 to n do fre[i] := true; res := 0; for i := 1 to n do if fre[i] then begin duyet(i); inc(res); //for ii := 1 to k do write(c[ii],#32); for ii := 1 to k do d[ii] := c[ii]; k0 := k; k := 0; end; writeln(res); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Tue Sep 20, 2022 9:42 pm | |
| - Code:
-
//DFS2 var n, m, i, u, v, k, k0, ii, res: longint; fre: array[1..100000] of boolean; a: array[-7..307,-7..307] of longint; c, d: array[-7..100007] of longint; procedure duyet(i: longint); var j: longint; begin fre[i] := false; inc(k); c[k] := i; for j := 1 to n do if fre[j] and (a[i,j] = 1) then duyet(j); end; begin assign(input,'DFS2.inp');reset(input); assign(output,'DFS2.out');rewrite(output); readln(n, m); for i := 1 to n do begin readln(u, v); a[u,v] := 1; a[v,u] := 1; end; for i := 1 to n do fre[i] := true; res := 0; for i := 1 to n do if fre[i] then begin duyet(i); inc(res); for ii := 1 to k do write(c[ii],#32); writeln(); for ii := 1 to k do d[ii] := c[ii]; k0 := k; k := 0; end; close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Tue Sep 20, 2022 9:42 pm | |
| - Code:
-
//DFS3 var n, m, i, u, v, k, k0, ii, res: longint; fre: array[1..100000] of boolean; a: array[-7..307,-7..307] of longint; c, d: array[-7..100007] of longint; procedure duyet(i: longint); var j: longint; begin fre[i] := false; inc(k); c[k] := i; for j := 1 to n do if fre[j] and (a[i,j] = 1) then duyet(j); end; begin assign(input,'DFS3.inp');reset(input); assign(output,'DFS3.out');rewrite(output); readln(n, m); for i := 1 to n do begin readln(u, v); a[u,v] := 1; a[v,u] := 1; end; for i := 1 to n do fre[i] := true; res := 0; for i := 1 to n do if fre[i] then begin duyet(i); if res < k then begin res := k; for ii := 1 to k do d[ii] := c[ii]; k := 0; end; end; writeln(res); for ii := 1 to res do write(d[ii],#32); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Thu Sep 22, 2022 8:00 pm | |
| - Code:
-
//STRINGS var s, t, s0: ansistring; i, j, p, d: longint; c: array[-7..1000007] of string; begin assign(input,'STRINGS.INP');reset(input); assign(output,'STRINGS.OUT');rewrite(output); readln(s); readln(t); if pos(t, s) = 0 then writeln('NO SOLUTION') else begin p := length(t); d := 0; for i := 1 to length(s)-p+1 do for j := i+p-1 to length(s) do begin s0 := copy(s, i, j-i+1); if pos(t, s0) > 0 then begin inc(d); c[d] := s0; end; end; writeln(d); for i := 1 to d do write(c[i],#32); end; close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Thu Sep 22, 2022 9:10 pm | |
| - Code:
-
//LUCKY var s, s1: string; k: longint; function tang(u: string): string; var tam, p, nho, j: longint; begin nho := 0; for j := length(u) downto 1 do begin val(u[j], tam); if j = length(u) then tam := tam + 1; p := (tam + nho) mod 10; nho := (tam + nho) div 10; u[j] := chr(p+48); end; if nho > 0 then u := '1' + u; exit(u); end; function kt(u: string): boolean; var p1, p2, tam, j: longint; begin p1 := 0; p2 := 0; for j := 1 to length(u) do begin val(u[j], tam); if j mod 2 = 0 then p1 := p1 + tam else p1 := p1 - tam; end; exit(p1=0) end; begin assign(input,'lucky.inp');reset(input); assign(output,'lucky.out');rewrite(output); readln(s); s1 := tang(s); k := 0; while (kt(s1) = false) do s1 := tang(s1); writeln(s1); close(input);close(output); end.
| |
| | | Nguyễn Phúc Tâm
Tổng số bài gửi : 96 Join date : 07/07/2022
| Tiêu đề: Re: Nguyễn Phúc Tâm Thu Sep 22, 2022 9:30 pm | |
| - Code:
-
//MISTAKE var a, b: int64; function fmax(u, v: int64): int64; var i, u3, v3: longint; u2, v2: string; begin str(u, u2);str(v, v2); for i := 1 to length(u2) do if u2[i] = '5' then u2[i] := '6'; for i := 1 to length(v2) do if v2[i] = '5' then v2[i] := '6'; val(u2, u3);val(v2, v3); exit(u3+v3); end; function fmin(u, v: int64): int64; var i, u3, v3: longint; u2, v2: string; begin str(u, u2);str(v, v2); for i := 1 to length(u2) do if u2[i] = '6' then u2[i] := '5'; for i := 1 to length(v2) do if v2[i] = '6' then v2[i] := '5'; val(u2, u3);val(v2, v3); exit(u3+v3); end; begin assign(input,'mistake.inp');reset(input); assign(output,'mistake.out');rewrite(output); readln(a, b); writeln(fmin(a, b),#32,fmax(a, b)); close(input);close(output); end.
| |
| | | Sponsored content
| Tiêu đề: Re: Nguyễn Phúc Tâm | |
| |
| | | | Nguyễn Phúc Tâm | |
|
Similar topics | |
|
| Permissions in this forum: | Bạn không có quyền trả lời bài viết
| |
| |
| |