Muhammad al-Xorazimiy nomidagi

Download 0.73 Mb.
Sana	29.03.2024
Hajmi	0.73 Mb.
	#180811

Bog'liq
Rasulov Abdukamol 3-labaratoriya ishi.docx qayta o\'qish
MENING 1- PAPKAM, MENING 1-PAPKAM, ЗАМОНАВИЙ ДАРС БЕРИШ МЕТОДЛАРИ 2 китобча 2020 йил иш н, MENING 1-HUJJATIM, 6-sinf, 558-Sonli qaror, 6-sinf informatika nazorat ishi, @AKT Official 8-sinf 2-Nazorat ishi test, Zaryad aloqali asboblar qurilmalari, Islomjon matem, Allow me to introduce myself

Muhammad al-Xorazimiy nomidagi
Toshkent axborot texnologiyalari universiteti talabasi Rasulov Abdukamolning Dasturlash 1 fanidan bajargan 3-labaratoriya ishi
18-variant
1-jadval

#include
#include

using namespace std;

int main()
{
int a[5] = {-5, 25, 17, 18, 28};
int b[5] = {-17, -8, 10, 12, 23};
int c[5];
for(int i = 0; i < 5; i ++)
{
c[i] = a[i] + b[i];
}
cout << "\n \n c[i] massivning elementlari: \n " << endl;
for(int i = 0; i < 5; i ++)
{
cout << " " << c[i] << " ";
}
int min;
min = c[0];
for( int i = 0; i < 5; i++ )
{
if( c[i] < min )
min = c[i];
}
cout << "\n \n c[i] massivning eng kichig qiymati = " << min << endl;
}

2-jadval

// 2 chi topshiriq

#include

using namespace std;

int main()
{
int N;
cout << "\n N sonini kiriting: "; cin >> N;
int Z[N];
cout << endl;
for( int i = 0; i < N; i ++ )
{
cout << " Z[ " << i + 1 << " ] = "; cin >> Z[i];
}
int mankup = 1, manyig = 0;
for(int i = 0; i < N; i ++)
{
if( Z[i] < 0 )
mankup *= Z[i];
}
for(int i = 0; i < N; i ++)
{
if( Z[i] < 0 )
manyig += Z[i];
}
cout << "\n \n Z[N] massivning manfiy elementlari kupaytmasi = " << mankup << endl;
cout << "\n Z[N] massivning manfiy elementlari yigindisi = " << manyig << endl;
}

3-jadval

// 3 topshiriq

#include

using namespace std;

int random(int a, int b)
{
return a + rand() % ( a - b + 1);
}

int main()

{
srand(time(NULL));
int n, m;
cout << "\n Ikki olchovli massivning qatorlar sonini kiritng: "; cin >> n;
cout << " Ikki olchovli massivning ustunlar sonini kiritng: "; cin >> m;
int a[n][m];
for(int i = 0; i < n; i++ )
{
for(int j = 0; j < m; j++ )
{
a[i][j] = random(-10000, 10000);
}
}
cout << endl;
cout << endl;
for(int i = 0; i < n; i++ )
{
for(int j = 0; j < m; j++ )
{
cout << a[i][j] << " ";
}
cout << endl;
}
cout << endl;
int ketti;
ketti = a[0][0];
for(int i = 0; i < n; i++ )
{
for(int j = 0; j < m; j++ )
{
if( a[i][j] < 0 )
ketti = a[i][j];
}
}
if( ketti > 0 )
cout << "\n Manfiy son yoq!!! " << endl;
else
cout << " " << ketti << endl;
system("pause");
return 0;
}

Download 0.73 Mb.