Hoài Phan by Hoài Phan

hoai

hsgtin — 2023-11-26 06:22:32 UTC

bai buoc di ngan nhat day thay tien

hsgtin — 2023-11-26 09:00:41 UTC

hsgtin — 2023-11-26 09:03:31 UTC

hsgtin — 2023-11-26 09:03:52 UTC

hsgtin — 2023-11-26 09:04:19 UTC

hsgtin — 2023-11-26 09:04:41 UTC

lien phan so

2023-11-30 01:05:26 UTC

So lien sau

hsgtin — 2023-12-14 08:18:26 UTC

2023-12-31 06:25:00 UTC

2023-12-31 06:25:26 UTC

hsgtin — 2023-12-31 06:47:03 UTC

2023-12-31 07:19:15 UTC

dtkyukivn20212/Hoahocnap123@1/sielan_thwdayy/nguyenhoaithuong2112011

languyengiahuy2502_ — 2023-12-31 09:18:53 UTC

program ucnt;

languyengiahuy2502_ — 2024-01-14 08:21:45 UTC

uses crt;

var i:longint; n,d:int64;

Begin

clrscr;

readln(n);

for i:=2 to trunc(sqrt(n div 2)) do

begin

if n mod i=0 then

begin

inc(d);

while n mod i=0 do

begin

n:=n div i;

end

end;

write(d);

readln

end.

chon sach

2024-01-14 08:49:17 UTC

uses crt;

var i,j,z,n,d,max,r,k:longint;

a,b,s:array[1..999999] of longint;

t,f:text;

begin

assign(t,'chonsach.inp');reset(t);

assign(f,'chonsach.out');rewrite(f);

readln(t,n);

for i:=1 to n do readln(t,a[i],b[i]);

for i:=1 to n-1 do

for j:=i+1 to n do

if a[i]>a[j] then

begin

z:=a[i];

a[i]:=a[j];

a[j]:=z;

z:=b[i];

b[i]:=b[j];

b[j]:=z;

end;

for i:=1 to n-1 do

begin

d:=1;

r:=a[i];

k:=b[i];

for j:=i+1 to n do

if (r

begin

inc(d);

r:=a[j];

k:=b[j];

end;

if d>max then max:=d;

end;

if max=0 then write(f,1) else write(f,max);

close(t);close(f);

end.

chon sac cua thay tien`

2024-01-14 08:54:05 UTC

uses math;

type SACH = record

dai, rong : longint;

end;

function xeptruoc(x, y : SACH) : boolean;

begin

if x.dai < y.dai then exit(true);

exit((x.dai=y.dai) and (x.rong

end;

var a : array[1..200000] of SACH;

n, i, j, fmax : longint;

tmp : SACH;

f : array[1..200000] of longint;

input, output:text;

begin

assign(input,'chonsach.inp'); reset(input);

assign(output,'chonsach.out'); rewrite(output);

readln(input,n);

for i:= 1 to n do readln(input, a[i].dai, a[i].rong);

for i:=1 to n-1 do

for j:=i+1 to n do

if xeptruoc(a[j], a[i]) then begin

tmp:=a[i];

a[i]:=a[j];

a[j]:= tmp;

end;

fmax:=0;

for i:= 1 to n do begin

f[i]:=1;

for j:= 1 to i-1 do

if (a[j].dai

f[i] := max(f[i], f[j]+1);

fmax := max(fmax, f[i]);

end;

write(output,fmax);

close(input);close(output);

end.

SỐ LƯỢNG TAXI

2024-01-21 02:27:08 UTC

uses crt;

2024-01-21 03:00:17 UTC

var a,b,i,uc,k:longint;

q:array[0..10000] of integer;

function ucln(n,m:longint):longint;

var r:longint;

begin

r:=n mod m;

while r<>0 do

begin

n:=m;

m:=r;

r:=n mod m;

end;

ucln:=m;

end;

procedure lienphan;

begin

k:=0;

repeat

if a>b then

begin

q[k]:=a div b;

a:=a mod b;

end

else

begin

q[k]:=b div a;

b:=b mod a;

end;

inc(k);

until (a=1) or (b=1);

if a<>1 then q[k]:=a else q[k]:=b;

for i:=0 to k do write(q[k],' ');

end;

begin

clrscr;

write('NHAP A= '); readln(a);

write(' B= '); readln(b);

uc:=ucln(a,b);

a:=a div uc;

b:=b div uc;

if a<=b then write(0,' ',b) else lienphan;

readln

end.

duong di lon nhat

2024-01-21 06:27:43 UTC

uses crt;

var i,j,m,n,s,d,max:longint;

a,b:array[0..100,0..100]of longint;

t,f:text;

begin

assign(t,'maxdd.inp');reset(t);

assign(f,'maxdd.out');rewrite(f);

readln(t,m,n);

for i:=1 to n do

for j:=1 to m do read(t,a[i,j]);

for i:=1 to m do

b[i,1]:=a[i,1];

for j:=2 to n do

for i:=1 to m do

if (b[i-1,j-1]>b[i,j-1]) and (b[i-1,j-1]>b[i+1,j-1]) then b[i,j]:=a[i,j]+b[i-1,j-1]

else

if (b[i,j-1]>b[i-1,j-1]) and (b[i,j-1]>b[i+1,j-1]) then b[i,j]:=a[i,j]+b[i,j-1]

else

if (b[i+1,j-1]>b[i-1,j-1]) and (b[i+1,j-1]>b[i,j-1]) then b[i,j]:=a[i,j]+b[i+1,j-1];

max:=b[1,n];

for i:=2 to m do

if b[i,n]>max then max:=b[i,n];

write(f,max);

close(t);close(f);

end.

DEMSACH

2024-01-21 09:29:34 UTC

bt o khoa

2024-01-28 09:23:14 UTC

KITU

2024-02-01 03:25:43 UTC

2024-02-25 00:56:28 UTC

Đề 32

hsgtin — 2024-02-25 09:21:37 UTC

2024-03-03 03:27:45 UTC

2024-03-03 03:27:55 UTC

2024-03-03 03:28:04 UTC

2024-03-03 03:28:17 UTC

2024-03-03 03:28:28 UTC

var fi,fo:text; i,j,k,h,c,n,m,t,d:longint; a:array[1..10000,1..10000] of longint;

tothanhnam3004 — 2024-03-03 08:01:11 UTC

b:array[1..10000] of longint;

begin

assign(fi,'MATTHU.INP'); RESET(fi);

assign(fo,'MATTHU.OUT'); rewrite(fo);

readln(fi,h,c);

for i:=1 to h do begin

for j:=1 to c do

begin

d:=d+1;

read(fi,b[d]);

end; readln(fi);

end;

for i:=1 to d-1 do

for j:=i+1 to d do

if b[i]>b[j] then

begin

t:=b[i];

b[i]:=b[j];

b[j]:=t;

end;

j:=1; m:=h-1; n:=c-1; i:=1; j:=1; k:=1;

while m>0 do

begin

for t:=1 to n do begin

a[i,j]:=b[k];

j:=j+1; k:=k+1;

end;

for t:=1 to m do begin

a[i,j]:=b[k];

i:=i+1; k:=k+1;

end;

for t:=1 to n do begin

a[i,j]:=b[k];

j:=j-1; k:=k+1;

end;

for t:=1 to m do begin

a[i,j]:=b[k];

i:=i-1; k:=k+1;

end;

i:=i+1; j:=j+1;m:=m-2; n:=n-2;

end;

if (m=0) and (h=c) then a[n div 2+1,n div 2+1]:=b[n*n];

for i:=1 to h do

begin

for j:=1 to c do

write(fo,a[i,j],' ');

writeln(fo);

end;

close(fi);

close(fo);

end.

hungdangcap — 2024-03-03 08:54:50 UTC

2024-03-10 02:14:28 UTC

zxcvbnmasdfghjklqwertyuiop

hungdangcap — 2024-03-10 06:52:39 UTC

2024-03-10 07:05:06 UTC

powerpoint

2024-04-05 07:19:31 UTC

ve nha lam

2024-04-05 07:30:08 UTC

Bvmt

2024-04-05 16:03:07 UTC

Bvmt chính

2024-04-05 22:13:20 UTC

2025-03-07 02:03:31 UTC

#include

using namespace std;

int main()

{

unsigned long long n,t,i,j,max,d,a[1001];

cin>>n;

for (i=1;i<=n;i++) cin>>a[i];

max=0;

for (i=1;i<=n;i++)

{

t=a[i];

d=1;

for (j=i+1;j<=n;j++)

{

if (a[j]>t)

{

t=a[j];

d++;

if (max

}

cout<

}

2025-03-07 02:06:33 UTC

#include

using namespace std;

int main()

{

unsigned long long n,t,i,j,max,d,a[1001];

cin>>n;

for (i=1;i<=n;i++) cin>>a[i];

if (n==2) max=1; else max=0;

for (i=1;i<=n;i++)

{

t=a[i];

d=1;

for (j=i+1;j<=n;j++)

{

if (a[j]>t)

{

t=a[j];

d++;

if (max

}

cout<

}

2025-03-07 02:19:28 UTC

#include

using namespace std;

int main()

{

long long n,t,i,j,d,a[1001],dp[1001];

cin>>n;

for (i=1;i<=n;i++) cin>>a[i];

if (n==2) t=1; else t=0;

dp[1]=1;

for (i=1;i<=n;i++)

{

dp[i]=1;

for (j=1;j<=i-1;j++)

{

if (a[i]>a[j]) dp[i]=max(dp[i],dp[j]+1);

}

t=max(t,dp[i]);

}

cout<

}

https://marisaoj.com/problem/159

2025-03-07 02:49:53 UTC

2025-03-12 07:58:26 UTC

2025-08-16 10:34:06 UTC

2025-09-12 08:54:52 UTC

web

2025-09-18 07:10:16 UTC

quychaucoder

CHIA MANG

2025-09-18 07:12:06 UTC

#include

using namespace std;

#define MAX 1010

int a[MAX];

main()

{

long n;

cin>>n;

long i,j,t,d,c;

d=0;

for (i=1;i<=n;i++) cin>>a[i];

for (i=1;i<=n;i++)

{

c=0;

t=0;

for (j=1;j<=i;j++)

{

c+=a[j];

}

for (j=i+1;j<=n;j++) t+=a[j];

if (c==t) d=i;

}

cout<

}

t doan

2025-09-18 07:12:37 UTC

#include

using namespace std;

#define MAX 2010

int a[MAX];

main()

{

long n,i,j,k,d,l,q,kt,t,c;

cin>>n>>k;

for (i=1;i<=n;i++) cin>>a[i];

q=0;i=0;j=0;kt=1;

while (kt==1)

{

q++;

for (i=1;i<=n;i++)

{

t=0;

for (j=i;j<=i+q-1;j++) t+=a[j];

if (t==k)

{

d=i;l=q;

kt=0;

break;

}

cout<

}

SỐ GẦN HOÀN HẢO

2025-09-18 08:55:57 UTC

#include 
using namespace std;
#define MAX 1000000
long a[MAX+5];
long i,j;
     void process()
     {         fill(a+1,a+MAX+1,1);
         for (i=2;i<=1000;i++)
         {
             for (j=i*i;j<=MAX;j+=i)
             {
                 a[j]+=i;

                 if (i*i!=j) a[j]+=j/i;
             }
         }
     }
main()
 {
     long i,j,t,d,n,x;
     process();

     cin>>n;

     for (i=1;i<=n;i++)
     {
         cin>>x;

          if (a[x]>=x) cout<<"1"<



độ cao
2025-09-18 08:56:44 UTC
#include 
using namespace std;
long ts(long n)
     {
        long s=0;
        while (n!=0)
        {
            s+=n%10;
            n=n/10;
        }
        return s;
     }
bool nt(long long n)
 {
     if (n<2) return(false);
     for (int i=2;i<=sqrt(n);i++)
        if (n%i==0) return(false);
     return(true);
 }
main()
{
    long n,h,i,d;
    cin>>n>>h;
    for (i=2;i<=n;i++)
    {
        if (nt(i) &&ts(i)==h)
        {
            cout<



tro choi
2025-09-19 08:12:24 UTC
#include 
using namespace std;
main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    long i,j,c,n,sum=0,m=LLONG_MAX;
    cin>>n;
    vector  a(n),b(n);
    for (i=0;i>a[i];
    for (i=0;i>b[i];
    sort(b.begin(),b.end());
    for (long long x : a)
    {
        auto it=lower_bound(b.begin(),b.end(),-x);
        if (it!=b.end())
        {
            sum=x+*it;
            if (m>abs(sum)) m=abs(sum);
        }
        if (it!=b.begin())
        {
            it--;
            sum=x+*it;
            if(m>abs(sum)) m=abs(sum);
        }
    }
    cout<
}




HSG hà giang 2021 2022
2025-09-19 09:04:29 UTC
bai 4.  kiến thức cần có: https://wiki.vnoi.info/algo/data-structures/Stack




đề tham khảo
tothanhnam3004 — 2025-09-19 12:08:47 UTC



2025-10-05 13:09:36 UTC



https://www.facebook.com/share/1Gn8XUSs8T/
2025-12-09 11:45:47 UTC



https://meet.google.com/iia-yody-mbx
2026-03-02 11:55:26 UTC



04011877
2026-03-02 11:56:05 UTC



2026-03-02 12:50:20 UTC



2026-03-02 13:31:58 UTC



2026-03-05 11:32:22 UTC



2026-03-05 11:32:36 UTC