#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll i, j, n, a[1000005], dem = 0, m;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] % 3 == 0)
        {
            n--;
            i--;
        }
    }
    for (i = 1; i <= n; i++)
    {
        cout << a[i] << " ";
    }
    cout<<endl;
    for(i=1;i<=n;i++)
    {
        if(a[i]%5==0)
        {
            for(j=i;j<=n;j++)
            {
                a[j]=a[j+1];
            }
            n--;
            i--;
        }    
    }
    for(i=1;i<=n;i++)
    {
        cout<<a[i]<<" ";
    }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

long long a[1000],i,n,x;

int main()

{

cin>>n;

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

sort(a+1,a+n+1);

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

{

int x=sqrt(a[i]);

if (x*x==a[i]) 

{

cout<<x;

return 0;

}

}

cout<<"Ko co so chinh phuong trong day";

return 0;

}

uses crt;
var x，i，max，n，dem，dem1，dem2，dem3，t，t1:integer;
a，b，c，d，e:array[-32000..32000]of integer;
tbca，tbcd:real;
begin
clrscr;
write(‘n=’); readln(n);
for i:=1 to n do
begin
write(‘a[‘，i，’]=’); readln(a[i]);
inc(b[a[i]]);
end;
{———————————-cau-a—————————-}
max:=0;
for i:=1 to n do
if max<b[a[i]] then
begin
max:=b[a[i]];
x:=a[i];
end;
writeln(‘phan tu co so lan xuat hien nhieu nhat trong mang la: ‘，x);
{——————————–cau-b——————————-}
dem:=0;
for i:=1 to n do
if a[i]>=0 then
begin
dem:=dem+1;
c[dem]:=a[i];
end;
dem1:=0;
for i:=1 to dem do
if trunc(sqrt(c[i]))=sqrt(c[i]) then inc(dem1);
writeln(‘so luong so chinh phuong trong day la: ‘，dem1);
{——————————–cau-c—————————–}
dem2:=0;
dem3:=0;
for i:=1 to n do
begin
if a[i]>0 then
begin
inc(dem2);
d[dem2]:=a[i];
end;
if a[i]<0 then
begin
inc(dem3);
e[dem3]:=a[i];
end;
end;
t:=0;
t1:=0;
for i:=1 to dem2 do
t:=t+d[i];
tbcd:=t/dem2;
for i:=1 to dem3 do
t1:=t1+e[i];
tbca:=t1/dem3;
writeln(‘trung binh cong cac so am la: ‘，tbca:4:2);
writeln(‘trung binh cong cac so duong la: ‘，tbcd:4:2);
readln;
end.

#include <bits/stdc++.h>

using namespace std;

long long a[20],i,j,dem;

bool kt;

int main()

{

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

dem=0;

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

if (a[i]>1) 

{

kt=true;

for (j=2; j<=sqrt(a[i]); j++)

if (a[i]%j==0) kt=false;

if (kt==true) dem++;

}

cout<<dem;

return 0;

}

uses crt;

var

n,i,dem:integer;

a:array[1..20] of integer;

function ngto(n:integer):boolean;

var i:integer; ok:boolean;

begin

if n<2 then ok:=false;

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

if n mod i=0 then ok:=false else ok:=true;

ngto:=ok;

end;

begin

clrscr;

write('nhap so phan tu cua day: '); readln(n);

for i:=1 to n do

begin

write('nhap phan tu thu [',i,']= ]); readln(a[i]);

end;

dem:=0;

for i:=1 to n do

if ngto(a[i]) then inc(dem);

write("trong day co ',dem,' phan tu la so nguyen to');

readln

end.

Var a:array[1..100] of integer;

i,n:integer;

s:longint;

Begin

Write('n = ');readln(n);

For i:=1 to n do

Begin

Write('Nhap phan tu thu ',i,' = ');readln(a[i]);

s:=s+a[i];

End;

Write('Cac phan tu vua nhap la ');

For i:=1 to n do

Write(a[i]:8);

Writeln;

Write('Tong cua chung la ',s);

Readln

End.

#include <bits/stdc++.h>

using namespace std;

long long n,i,a[1000];

int main()

{

cin>>n;

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

sort(a+1,a+n+1);

for (i=n; i>=1; i--) cout<<a[i]<<" ";

return 0;

}

Câu 1:

var i,n:integer;

s:longint;

begin

Write('n = ');readln(n)

for i:=1 to n do

s:=s+2*i+1;

write('tong la: ',s);

readln

end.

Câu 2

Bài 5:

Var b:array:[1..1000] of integer;

i,n,max:integer;

Begin

Write('n = ');readln(n);

For i:=1 to n do

Begin

Write('Nhap so thu ',i,' = ');readln(b[i]);

End;

Write('Cac phan tu am la: ');

For i:=1 to n dko

if b[i]<0 then write(b[i]:8);

writeln;

max:=b[1];

For i:=2 to n do

If b[i] > max then max:=b[i];

write('So lon nhat la ',max);

Readln

End.