Mal’umotlar

QIDIRUV ALGORITMLARI: CHIZIQLI VA BINARY QIDIRUV

15-variant.11ga butun bo’linuvchi eng katta sonni toping (agar bunday sonlar ko’p bo’lsa, u holda ularning eng kichigini toping; agar bunday son mavjud bo’lmasa – shunga mos ma’lumot chiqaring ).

#include

#include

#include

using namespace std;

int main()

{

srand(time(NULL));

int N, min=-11;

cout<<"\n\n______\nElementlar sonini kiriting: "; cin>>N;

int M[N];

for(int i=0; i

{

M[i]=rand(); cout<min && M[i]%11==0) min=M[i];

}

if(min!=-11) cout<<"\n ----> "<

else cout<<"\nBunday son topilmadi!\n";

return main();

}