Bajardi: Diyor Qabul qildi: Saidov Samandar

Bajardi: Diyor
Qabul qildi: Saidov Samandar

30-variant

1. 
   topshiriq
   

30	N1 dan N2 gacha bo'lgan ketma-ketlikda 3 karra bo’lmagan sonlaring ko’paytmasini toping

#include

using namespace std;
int main(){
int n1,n2,k=1;
cout<<"n1=";
cin>>n1;
cout<<"n2=";
cin>>n2;
if(n1<=n2){
for(int i=n1;i if(i%3!=0){
k*=i;
}
}
}
if(n1>n2){
for(int i=n2;i if(i%3!=0){
k*=i;
}
}
}
cout<<"k="< return 0;
}
30.2 topshiriq.

30	Musbat va manfiy elementlardan tashkil topgan z = (10; -5; -8; -6; 17; 25; 31; 10; 12; 38), (j = 1,..., 10) massivi berilgan. Massivning musbat elementlari soni va ularning indekslarini chop etish dasturini tuzing.

#include

using namespace std;
int main(){
int z[10]={10, -5, -8, -6, 17, 25, 31, 10, 12, 38},m=0;
cout<<"musbat sonlar indeksi :";
for (int i=0;i<10;i++){
if(z[i]>0){
m++;
cout< }
}
cout<<"musbat sonlar N:"< return 0;
}