N o`lchamli A

N o`lchamli A massiv berilgan. Uning juft nomerli elementlarining ichidan eng kichigi topilsin.

#include

using namespace std;

int main(int argc, char** argv) {

int N[]={6,1,6,5,3,4,5};
int A;
int min;
while(A<=6){
cout<A=A+2;
if(N[A] < min){
min = N[A];
}
}
cout << "Kichkina element\n" << min;

return 0;

}
//6
6
3
5
Kichkina element
3