Guruh talabasi Abdukarimov Javohir dasturlash fanidan 2-mustaqil labaratoriya ishi

216-21 guruh talabasi Abdukarimov Javohir dasturlash fanidan 2-mustaqil labaratoriya ishi

a) Berilgan k sonini q darajasini topuvchi funksiya yarating. Ushbu funksiya yordamida a ning b-darajasini va c ning d-darajasini toping
#include
#include
using namespace std;
int daraja( int a , int b){
int d=pow(a,b);
return d;
}
int main(){

int x,y;
cin>>x;

cin>>y;
cout<}
b) Berilgan a va b sonlari orasidagi tub sonlarni topuvchi dastur yarating. Ushbu dasturni yaratish uchun tub funksiyasini yaratib undan foydalaning.
#include
#include

using namespace std;

int tub(int a, int b){
for (int i = 2; i <= b; i++)

{
bool tub = true;

for (int j = 2; j <= sqrt(i); j++)
{
if (i % j == 0)
{
tub = false;
break;
}
}
if (tub == true)
if(i>=a){

cout << i << endl;
}}
}
int main()
{
int x,y;
cout << "Son Kiriting = "; cin >> x>>y;
cout << x << " dan "<< y<<" gacha bo'lgan TUB sonlar :" << endl;
cout<

return 0;

}

23. Berilgan natural sonning barcha tub bo‘luvchilari chop etilsin.

#include
#include

using namespace std;

int main()

{
int n;

cout << "Son Kiriting = "; cin >> n;

cout << n << " ning tub bo'luvchilari:':" << endl;

for (int i = 2; i <= n; i++)

{
bool tub = true;
for (int j = 2; j <= sqrt(i); j++)
{
if (i % j == 0)
{
tub = false;
break;
}
}
if (tub == true){
if(n%i==0){

cout << i << endl;
}}}
return 0;
}
23.Butun m va n sonlar berilgan. Umumiy bo‘luvchiga ega bo‘lmagan n /m  q /p shartni

#include

using namespace std;
int main()
{
int a, b,p,q,c;
cout << "A = "; cin >> a;
cout << "B = "; cin >> b;
p=a;
q=b;
while (a != b)
{
if (a > b) a %= b;
else b %= a;
if (a == 0) a = b;
if (b == 0) b = a;
}
cout << a << endl;
cout<<"p="<
cout<<"q="<return 0;
}
3.Kiritilgan n butun sonlar ketma-ketligi ichidan toq sonlar ko’paytmasi va manfiy sonlar orasidagi eng kattasi o’rtasidagi farqni toping
#include
#include
using namespace std;
int main(){
int n,i,s=1,max1=-1000000,a[15],x;
cin>>n;
for (i=0;i cout<<"a["<>a[i];
if(a[i]%2==1){
s*=a[i];
}
if(a[i]<0){
max1=max(a[i],max1);
}

}
cout<<"Toq sonlar ko'paytmasi="< cout<<"Eng katta manfiy son="< cout<<"ularning farqi="<}