program fprime; var f: array [-3..100000] of longint; i, res, p: longint; function hnt (u : longint) : boolean; var j : longint; begin if u <= 1 then exit(false); if ( u = 2 ) or ( u = 3 ) then exit(true); for j := 2 to trunc(sqrt(u)) do if ( u mod j = 0 ) then exit(false); exit(true); end; begin readln(p); f[1] := 1; f[2] := 1 ; i := 2 ; res := 0; while f[i - 1] + f[i - 2] <= p do begin f[i] := f[i-1] + f[i-2]; if hnt(f[i]) then res := res +1; inc(i); end; write(res) end.
program dcount; var d :Longint; function socs(a : Longint ): Longint; var i : Longint; s : Longint; begin s := 0; for i := 1 to a do begin s:= s + 1; end; exit(a) end; begin readln(d); writeln(socs(d)); end.
program bai3; uses crt; var n,s,k: Longint; function tongs(u : longint ): Longint; var s: Integer; begin s :=0; while (u > 0) do begin s := s + (u mod 10) ; u := u div 10; end; exit(s); end; begin readln(n); writeln(tongs(n)); end.
program xchance ; var a,res : Longint; const mg1 = 50; mg2 = 20; mg3 = 10; begin readln(a); if a mod 50 mod 20 mod 10 <> 0 then writeln('-1') else begin res := a div mg1; a := a mod mg1 ; res := res + a div mg2 ; a := a mod mg2 ; res := res + a div mg3 ; a := a mod mg3 ; writeln(res); end; end.
program xmax; uses math ; var a, res,i : Longint; function maxso(u : Longint): Longint; var t : Longint; begin t := 0; while u > 0 do begin t := max(t,(u mod 10)); u := u div 10 end; exit(t); end; begin res := 0; readln(a); for i := 1 to a do res := max(res,maxso(i)); writeln(res) end.
program sdiv; var s,n,i: Longint; function tonguc(u : Longint): Longint; var n,i : Longint; begin for i := 1 to u do begin if (u mod i = 0) then s := s + i ; end; exit(s) end; begin s := 0; readln(n); writeln(tonguc(n)); end.
program amux; var a,x,p : Longint; const l = trunc(1e9)+7; function amux (u,v : Longint): Longint; var t : Longint; begin if (v = 0) then exit(1); if (v = 1) then exit(u); t := amux(u,v div 2); exit((t*t*amux(u,v mod 2)) mod l) end; begin readln(a); readln(x); p := amux(a,x); writeln(p) end.
program squa; var x : Longint; function cb3 (u : Longint): real; var d,c,giua: real; begin d := 0; c := sqrt(u); while c - d >= 0.001 do begin giua := (d + c)/2; if (giua * giua * giua -u) > 0 then c := giua else d := giua; end; exit(giua); end; begin readln(x); writeln(cb3(x):0:3) end.
program ckpprime; var a : Longint; function sont(n : Longint): Boolean; var i: Integer; kq : Boolean; begin kq := true; if n = 1 then kq := false; for i := 1 to (n - 1) do if (i mod n = 0) then kq := false; exit(kq) ; end; begin readln(a); writeln(sont(a)) end.
program eratos; var n : Longint; i : Longint; function sont(n : Longint): Boolean; var i: Longint; kq : Boolean; begin kq := true; if i = 1 then kq := false; for i := 1 to (n - 1) do if (i mod n = 0) then kq := false; sont := kq ; end; begin readln(n); for i := 1 to n do begin if sont(i) = true then write(i,' '); end; end.
program tsnt; var n, i , k : longint; c:array[1..100000]of longint; procedure phantich ( u : longint); var i : longint; begin i := 2; k := 0; 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 > i then begin inc(k); c[k] := u; end; end; begin read(n); phantich(n); for i := 1 to k do write(c[i],#32); end.
program numberc; var n : longint; c:array [1..100000] of longint; function snt( u : longint ): boolean; var j : longint; begin if u <= 1 then exit(false); if ( u = 2 ) or ( u = 3 ) then exit(true); for j := 2 to trunc(sqrt(u)) do if ( u mod j = 0 ) then exit(false); exit(true); end;
begin readln(n); while ( snt(n) = false) and (n > 0 ) do begin n := n div 10; if n > 0 then writeln(n) else writeln('-1'); end; end.
program arrdel; var n,i,k : longint; a,c : array [1..100000] of longint; begin readln(n); for i := 1 to n do readln(a[i]); k := 0; for i := 1 to n do if a[i] = a[i+1] then begin inc(k); c[k] := a[i]; end; for i := 1 to k do write(c[i], #32) end.
program qsort; var i, n: Longint; a : array[1..10000000] of Longint; procedure sapsep (); var i, j, tam : Longint; begin for i := 1 to n-1 do for j := i+1 to n do if a[i] > a[j] then begin tam := a[i]; a[i] := a[j]; a[j] := tam; end; for i := 1 to n do write(a[i]); end; begin readln(n); for i := 1 to n do readln(a[i]); sapsep(); end.
program ilucky; var i , n, p : Longint; s1 , s2 : Int64; a : array[1..1000000] of Longint; begin readln(n); for i := 1 to n do readln(a[i]); s1 := 0; p := 0; for i := 1 to n-1 do begin s1 := s1 + a[i]; if 2 * s1 = s then begin write(i); p:=1; end;
program nfind; uses math; var i: longint; n: int64; st, res: string; function bbu(n: longint): string; begin if n = 0 then exit('10') else if n = 1 then exit('1'); i := 9; while (n > 1) and (i > 1) do begin while n mod i = 0 do begin str(i,st); res := st + res; n := n div i; end; dec(i); end; if n > 1 then exit('-1') else exit(res); end; begin readln(n); write(bbu(n)); end.
program PSECOND; uses math; var n, i: longint; a: array[1..1000000] of longint; min1: longint = high(longint); min2: longint = low(longint); begin readln(n); for i:=1 to n do begin read(a[i]); min1 := min(min1,a[i]); min2 := max(min2,a[i]); end; if min1 = min2 then begin write(-1); exit; end; for i:=1 to n do if (a[i] <= min2) and (a[i] > min1) then min2 := a[i]; for i:=1 to n do if a[i] = min2 then write(i,#32); end.
hoangphuc01122008
Tổng số bài gửi : 151 Join date : 03/06/2022
Tiêu đề: Re: Đỗ Hoàng Phúc Sat Jun 25, 2022 8:27 pm
gcd.pas
Code:
program gcd; var res,a, b, c : 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 read(a ,b, c); res := ucln(ucln(a,b),c); writeln(res); end.
var a : array[1..1000000,1..1000000] of Longint; m,n,i,j : Longint; s : Int64; begin read(m,n); for i := 1 to n do for j := 1 to n Do read(a[i,j]); for i := 1 to m do begin s := 0; for j := 1 to n do s := s + a[i,j]; write(s); end; for j := 1 to n do begin s := 0; for i := 1 to m do s := s + a[i,j]; write(s); end; end.
hoangphuc01122008
Tổng số bài gửi : 151 Join date : 03/06/2022
Tiêu đề: Re: Đỗ Hoàng Phúc Wed Aug 03, 2022 8:35 am
Code:
var i,n : Longint; res,s : real; begin assign(input, 'no1.inp');reset(input); assign(output, 'no1.out');rewrite(output);
read(n); s := 0; for i := 2 to n do begin res := (1/i) + (1/(i + 1)); s := s + res ; end; write(s:0:2); close(input);close(output); end.
hoangphuc01122008
Tổng số bài gửi : 151 Join date : 03/06/2022
Tiêu đề: Re: Đỗ Hoàng Phúc Wed Aug 03, 2022 8:45 am
Code:
var i,n : Longint; s : real; begin assign(input, 'no2.inp'); reset(input); assign(output,'no2.out'); rewrite(output);
read(n); s := 0; for i := 1 to n do s := s + 1/(2*i-1); write(s:0:3);
close(input);close(output); end.
hoangphuc01122008
Tổng số bài gửi : 151 Join date : 03/06/2022
Tiêu đề: Re: Đỗ Hoàng Phúc Wed Aug 03, 2022 8:55 am
Code:
var i,n: Longint; s : Int64; begin assign(input,'no3.inp');reset(input); assign(output,'no3.out');rewrite(output);
read(n); s := 1; for i := 1 to n do s := s * i; write(s);
close(input);close(output) end.
hoangphuc01122008
Tổng số bài gửi : 151 Join date : 03/06/2022
Tiêu đề: Re: Đỗ Hoàng Phúc Wed Aug 03, 2022 9:05 am
Code:
var i,n : Longint; begin assign(input,'no4.inp');reset(input); assign(output,'no4.out'); rewrite(output);
read(n); for i := 1 to n do if (i mod 2 = 0) and (i mod 3 <> 0) then write(i ,#32);