Kanal manzili:
Toifalar:
Faktlar
Til: Oʻzbek tili
Obunachilar:
42
Kanalning ta’rifi
Algoritm - dasturlashga ilk qadam !
Shikoyat va takliflar uchun @asadbek_ganiyev2
Ratings & Reviews
Reviews can be left only by registered users. All reviews are moderated by admins.
5 stars
0
4 stars
0
3 stars
1
2 stars
0
1 stars
1
Oxirgi xabar
2023-03-25 15:28:15
#massiv 36
#include
using namespace std;
int main() {
int massiv[100], n, nolokal[50], k = 0, max;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
nolokal[k++] = massiv[0];
for (int i = 0; i < n; ++i) {
if ((massiv[i] < massiv[i + 1] && massiv[i + 2] < massiv[i + 1]) ||
(massiv[i] > massiv[i + 1] && massiv[i + 2] > massiv[i + 1])) {
continue;
} else {
nolokal[k++] = massiv[i + 1];
}
}
max = nolokal[0];
nolokal[k++] = massiv[n - 1];
for (int i = 0; i < k; ++i) {
if (max < nolokal[i]) {
max = nolokal[i];
}
}
cout << "Lokal maksimumlar va Lokal minumumlarga kirmagan elementlar " << endl;
for (int i = 0; i < k - 1; ++i) {
cout << nolokal[i] << " ";
}
cout << endl;
cout << "Lokal maksimumlar va Lokal minumumlarga kirmagan elementlar orasidagi eng katta element = " << max << endl;
return 0;
}
22 views12:28
2023-03-25 14:46:03
#massiv 35
#include
using namespace std;
int main() {
int massiv[100], n, lokal[50], k = 0, minimum;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
for (int i = 0; i < n; ++i) {
if (massiv[i] < massiv[i + 1] && massiv[i + 2] < massiv[i + 1]) {
lokal[k++] = massiv[i + 1];
}
}
minimum = lokal[0];
for (int i = 0; i < k; ++i) {
if (lokal[i] < minimum) {
minimum = lokal[i];
}
}
cout << "Lokal maksimumlar " << endl;
for (int i = 0; i < k - 1; ++i) {
cout << lokal[i] << " ";
}
cout << endl;
cout << "Massiv lokal maksimumlari orasidagi eng kichik element = " << minimum << endl;
return 0;
}
19 views11:46
2023-03-25 14:38:38
#massiv 34
#include
using namespace std;
int main() {
int massiv[100], n, lokal[50], k = 0, maksimum;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
for (int i = 0; i < n; ++i) {
if (massiv[i] > massiv[i + 1] && massiv[i + 2] > massiv[i + 1]) {
lokal[k++] = massiv[i + 1];
}
}
maksimum = lokal[0];
for (int i = 0; i < k; ++i) {
if (lokal[i] > maksimum) {
maksimum = lokal[i];
}
}
cout << "Massiv lokal minimumlari orasidagi eng katta element = " << maksimum << endl;
return 0;
}
18 views11:38
2023-03-16 13:59:25
#massiv 33
#include
using namespace std;
int main() {
int massiv[10], n, lokal = 0, index = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
for (int i = 0; i < n; i += 3) {
if (massiv[i] < massiv[i + 1] && massiv[i + 1] > massiv[i + 2]) {
lokal = massiv[i + 1];
index = i + 1;
}
}
cout << "Oxirgi uchragan lokal maxsimum = " << lokal << endl;
cout << "Oxirgi uchragan lokal maxsimum indeksi = " << index << endl;
return 0;
}
45 views10:59
2023-03-16 13:57:21
#massiv 32
#include
using namespace std;
int main() {
int massiv[10], n, lokal = 0, index = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
for (int i = 0; i < n; i += 3) {
if (massiv[i] > massiv[i + 1] && massiv[i + 1] < massiv[i + 2]) {
lokal = massiv[i + 1];
index = i + 1;
break;
}
}
cout << "Birinchi uchragan lokal minimum = " << lokal << endl;
cout << "Birinchi uchragan lokal minimum indeksi = " << index << endl;
return 0;
}
38 views10:57
2023-03-16 12:41:57
#massiv 31
#include
using namespace std;
int main() {
int massiv[10], n, soni = 0, index[10], k = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
for (int i = 1; i < n; ++i) {
if (massiv[i] < massiv[i + 1]) {
index[k++] = i;
soni++;
}
}
for (int i = k - 1; i >= 0; --i) {
cout << massiv[i] << " ";
}
cout << endl;
cout << "chap qo'shinisidan katta elementlar soni = " << soni << endl;
return 0;
}
37 views09:41
2023-03-16 12:34:21
#massiv 30
#include
using namespace std;
int main() {
int massiv[10], n, soni = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
for (int i = 0; i < n - 1; ++i) {
if (massiv[i] > massiv[i + 1]) {
cout << i << " ";
soni++;
}
}
cout << endl;
cout << "o'ng qo'shinisidan katta elementlar soni = " << soni << endl;
return 0;
}
32 views09:34
2023-03-16 12:23:13
#massiv 29
#include
using namespace std;
int main() {
int massiv[10], n, max;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
max = massiv[0];
for (int i = 1; i < n; i += 2) {
if (massiv[i] > max) {
max = massiv[i];
}
}
cout << "Massivning toq indekslari orasidagi eng katta son = " << max << endl;
return 0;
}
28 views09:23
2023-03-16 12:19:43
#massiv 28
#include
using namespace std;
int main() {
int massiv[10], n, min;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
min = massiv[0];
for (int i = 0; i < n; i += 2) {
if (massiv[i] < min) {
min = massiv[i];
}
}
cout << "Massivning juft indekslari orasidagi eng kichik son = " << min << endl;
return 0;
}
28 views09:19
2023-03-16 12:04:45
#massiv 27
#include
using namespace std;
int main() {
int massiv[10], n, index = 0;
bool ketma_ketlik = true;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> massiv[i];
}
for (int i = 0; i < n; i += 2) {
if (massiv[i] < 0) {
ketma_ketlik = false;
index = i;
break;
}
if (massiv[i + 1] > 0) {
ketma_ketlik = false;
index = i + 1;
break;
}
}
if (ketma_ketlik) {
cout << "Ketma ketlik to'g'ri tartibda " << endl;
} else {
cout << "Ketma-ketlikni buzgan element indeksi = " << index << endl;
}
return 0;
}
28 views09:04
C
