Diskret tuzilmalar

312-19 guruh talabasi Axmedov Ravshanbekning ”Diskret tuzilmalar” fanidan 7-amaliy ishi

2.5 Takroriy guruhlash, o’rinlashtirish, o’rin almashtirish formulalarini qo’llab

misollar yechish

Masala: Quyida berilgan tengsizliklar nechta musbat butun yechimga ega?

2.5.18. 5
Ishlanishi

1. 
   #include
   
2. 
   using namespace std;
   
3. 
   int main(){
   
4. 
   int count=0;
   
5. 
   for(int i=1; i<9; i++){
   
6. 
   for(int j=1; j<9; j++){
   
7. 
   for(int k=1; k<9; k++){
   
8. 
   for(int l=1; l<9; l++){
   
9. 
   if(i+j+k+l>5 && i+j+k+l<=8){
   
10. 
    count++;
    
11. 
    cout<
12. 
    }
    
13. 
    }
    
14. 
    }
    
15. 
    }
    
16. 
    }
    
17. 
    cout<<"\ncount="<
18. 
    }
    

Javob: 65ta

2.4 Takrorlanuvchi o‘rin almashtirishlar

So‘z – o‘zbek alifbosidagi ixtiyoriy chekli harflar ketmaketligidir. Quyida berilgan so‘zlardagi harflardan nechta so‘z yasash mumkin?

2.4.18. PARALELOPIPED;

Ishlanishi

“PARALELOPIPED” so‘zidagi harflardan nechta so‘z yasash mumkin?

k₁=3 (“P”- harfi), k₂ =2 (“A” – harfi), k₃=1 (“R”-harfi),

k₄ =2 (“L” - harfi), k₅=2 (“E” - harfi), k₆=1 (“O”- harfi),

k₇=1 (“I”- harfi), k₈=1 (“D”- harfi),

n=13 (so‘zdagi harflar soni)

Javob: PARALELOPIPED” so‘zining harflaridan 75600ta so’z yasash mumkin

2.6. Кombinatorik tenglamalar

2.6.18.









x=4