1
.
: .
, . . , , ; , . . , . , , . , , .
: , , .
. , 1 .
. , 10 :
Int i, [10];
for (i=0; i<10; i++){printf( \n );scanf ("%d", &X[i]);}
for (i=0; i<10; i++) {cout<< <<endl;cin >> X[[i]};
endl ( end line) .
. [10] :
for (i=0; i<10; i++) printf ("%6d", [i]);
for (i=0; i<10; i++) cout << [i];
:
printf ("%6d \n", a[i]); cout << [i] << endl;
. : . . , , : , , . .
. 4.1 .
. [i] [i+1] , . , . , .
|
|
|
4.2.
4.2
( ) . . () n-1 . . , () . .
1. .
2. :
50 . .
# include <stdio.h>
# define n 50 // n=50
int max, nom, a[n]; // n
main(){
for (i=0; i<n; i++) {printf( \n ); scanf ("%d", &a[i]);}
max= a[0]; nom=1; //
for (i=1; i<n; i++)
if (max<a[i]) {nom=i+1; max=a[i];}
printf("\n : \n");
for (i=0; i<n; i++) printf ("%6d", a[i]);
printf ("\n %d, %d\n", max, nom);
return 0;}
. max , , nom . .
3. 1 2, , . .
4.1 1 2
| 1) , 7 20, . 2) N . | |
| 1) , . 2) N . | |
| 1) [0:N]. . 2) N . | |
| 1) . . , , . 2) N . | |
| 1) A[0:N]. , . . 2) N . | |
| 1) A[0:N]. 0. . 2) N . | |
| 1) , . 2) N . | |
| 1) [0:N]. . 2) N . | |
| 1) [0:N]. 2) N . | |
| 1) A[0:N]. . . 2) N . | |
| 1) A[0:N]. , 2) N . 15 | |
| 1) [0:N]. , , . 2) N . 15 | |
| 1) A[0:N]. , , . 2) N . 10 | |
| 1) [0:N]. . 2) N . 20 | |
| 1) A[0:N]. 2) N . 20 | |
| 1) N . . 2) N . , 3 . | |
| 1) [0:N]. , , , . 2) N . , 4 . . | |
| 1) . 2) N . . , | |
| 1). [0:N]. , 2) N . . , | |
| 1) [0:N]. , . 2) N . . . | |
| 1) 2) N . . , |
|
|
|
|
|
|
, , :
- , ;
- , , 1 2.
1. , ?
2. ?
3. ?
4. ?
5. .
, .
| # include <stdio.h> int sum, nom, a[n]; // n cout" - "; cin n; main(){ for (i=0; i<n; i++) {printf( \n ); scanf ("%d", &a[i]);} printf("\n : \n"); for (i=0; i<n; i++) printf ("%6d", a[i]) if(a[i]<0) {int sum = 0; for (int i = 0; i<n; i++) sum += A[i];} else {if(i/2=%d){ couti; a[i]}}; cin n; return 0;} |
