Hilo a[n][m] massiv elementlarini [0; 10000] oraliqdagi sonlar bilan toldiring. Uning eng katta va eng kichik elementini topi…

Random bilan ishlang

Qaysi dasturlash tilida

class Program { static void Main(string[] args) { int[,] a = new int[,] { { 10, 5000, 7000 }, { 2000, 8000, 10000 }, { 3000, 4000, 9000 } }; int minElement = int.MaxValue; int maxElement = int.MinValue; // Massivni elementlarini tekshirish for (int i = 0; i < a.GetLength(0); i++) { for (int j = 0; j < a.GetLength(1); j++) { int currentElement = a[i, j]; // Eng kichik elementni topish if (currentElement < minElement) { minElement = currentElement; } // Eng katta elementni topish if (currentElement > maxElement) { maxElement = currentElement; } } } // Eng katta va eng kichik elementni chiqarish Console.WriteLine("Eng kichik element: " + minElement); Console.WriteLine("Eng katta element: " + maxElement); // Eng kichik va eng katta element bir xil bo'lsa, ularning sonini chiqarish if (minElement == maxElement) { Console.WriteLine("Eng kichik va eng katta elementlar soni: " + minElement); } } }