Vector Masalaning qo’yilishi

2-tajriba ishi
Mavzu: Konteynerlar.
Ishdan maqsad: C++ dasturlash tilida vector, Ro’yxat, Stek, Navbat kabi tuzilmalardan foydalanishni o’rganish.

1. 
   Vector
   

Masalaning qo’yilishi: Butun sonlar kеtma-kеtligi bеrilgan. Ushbu kеtmakеtlikni undagi mavjud takrorlanuvchi sonlarni olib tashlab qayta tuzing, Agar bitta son ketma-ketlikda ikki yoki undan ko‗p marta uchrasa uni birinchi marta uchraganini olib qolib qolganini o‗chirib tashlash lozim.

A.pop_back()

A vectorning oxirdagi elementni o‗chiradi

#include

#include
#include
#include
using namespace std;
bool Tub(int n){
bool f = true;
for(int i=2; i<=sqrt(n); i++){
if(n%i==0) {
f = false;
break;
}
}
return f;
}
vector A;
int main()
{
int n, k;
cin >> n;
for (int i = 0; i < n; i ++)
{
cin >> k;
A.push_back(k);
}
for (int i = 0; i < A.size(); i ++)
{
if(Tub(A[i])) cout<}
}
5
16 17 9 5 3
17 5 3
Process returned 0 (0x0) execution time : 11.286 s
Press any key to continue.