.
: , , .
.
1. ' .
2. ' .
3. ϳ .
.
1. .
2.
.
5.1
x ,
A[0]=3, A[1]=-5, A[2]=6, A[3]=12, A[4]=-3
| int n=5; float x=0; for (i=0;;i<n;i++) x=x+A[i]; | int n=5; for (j=1; j<n;j++) if (A[j]<0 x=A[j]; | ||||
| int t=2;int n=3; float x=A[1]; for (j=0; i<n;j++) x=x*t+A[j] | int n=4; float x=A[n]; for (j=n-1;j>=0;i--) x=A[j]+1/x; | ||||
| float x=0; int n=5; int i=2; while(i<n) { x=x+A[i]; i+=2; }; | int n=5; float x=A[1]; int i=0; while(i<n){ if (A[i]<x) x=A[i]; i+=2; }; | ||||
| int n=4; float x=A[1]; for (int j=2; j<n;j++) if (A[j]<x x=A[j]; | int t=3,n=5; float x=A[n+1]; for (int i=1; i<n;i+=2) x=x+A[j]****; | ||||
| int n=5; float x=0; for (int i=0; i<n;i++) if (A[i]<0 x=x+1; | float x=0; int i=0; while(i<5){ if (A[i]>0 x=x+A[i]; i++; }; | ||||
| int n=5; int m=n%2; int k=n; for(j=0;j<=m;j++){ y=A[j]; A[j]=A[k]; A[k]=y; k--; } x=A[1]; | int n=4; float x=0; int k=0; for (j=0;i<n;i++) if (A[j]>0 { x=x+A[j]; k++ }; if (k<>0 x=x/k; | ||||
| int n=5; float x=1; M=A[0]; for (int i=1; i<n;i++){ if (A[i]<M){ M=A[i]; x=i; }; | float x=0; int k=0; for(int i=0; i<5;i++) if (A[i]>0 { x=x+A[i]; k++; }; | ||||
| int t=2; int n=5; float x=A[0]; int j=0; do{ x*=t+A[j+1]; J++;} while(j<n); | int n=4; float x=A[0]; for (int j=0; i<n;j++) if (A[j]<x) x=A[j]; | ||||
| int i=0; float count=0; while(i<5){ if (A[i]<0){ count++; i++; }; | int n=5; float x=A[0]; for (int i=1; i<n;i++) if (A[i]>x x=A[i]; | ||||
| int n=4; float x=0; int k=0; for (j=0;i<n;i++) if (A[j]>0){ x+=A[j]; k++; } if (k!=0 x=x/K; | int n=5; float x=0; for (j=n-1;j>=0;j--) x+=A[j]; | ||||
| int n=5; float x=A[0]; int i=1; while(i<n){ if (A[i]<x) x=A[i]; i++; } | i=0; x=0; n=5; while(i<n){ x=x+A[i]; i=i+2; } | ||||
| int n=5; float x=A[n]; int j=n-1 do{ x=A[j]+1/x; j--;} while(j>=0); | n=5; x=0; j=1 While(j<n){ X+=A[j]; j=j+1 }; | ||||
| int i=0; int n=5; float x=0; while(i<n){ x=x+A[i]; i++; }; | int n=5; float x=0; float M=A[0]; for (i=0; i<n;i++) if (A[i]<M)[ M=A[i]; x=i; } | ||||
| int N=5; float x=0; for(j=n-1;j>=0;j--) x=x+A[j]; | int t=2; int n=3; float x=A[0]; int j=1; do{ x=x*t+A[j+1]; j++;} while(j<n); | ||||
| float x=0; int k=0; for (int i=0;i<5){ x=x+A[i];k++; } x=x/k; | int n=5; float x=0; for(i=0;i<n;i++) if (A[i]<0 x=x+1; | ||||
| int cnt=0,n=5;float x=0; int j=0; while(int j<n){ if (A[j]>0){ x=x+A[j]; j++;cnt++; } } x/=cnt; | int n=5; x=A[n]; int j=n-1 do{ x=A[j]+1/x; j--;} while(j!=0); |
|
|
|
5.2
, .
| ij | |||
| (10) | |||
| (7) | |||
| (15) | |||
| (12) | , | ||
| (6) | |||
| (17) | |||
| (9) | ' | ||
| (20) | ' | ||
| (21) | |||
| (14) | ' | ||
| (18) | |||
| (10) (10) | , | ||
| (16) | |||
| (8) (8) | , | ||
| (5) | ' | ||
| (10) | |||
| (11) | |||
| (13) | , | ||
| (18) | , n | ||
| (7) | y=sin(x) [- p; p] h=0,5 . | ||
| (10) | , k | ||
| (16) | |||
| (25) | |||
| (17) | |||
| (10) | ' | ||
| (8) | +1 , 1 | ||
| (15) | |||
| (19) | N, ' |
5.1
int n=4; int x=A[0];
for (int i=0;i<n;i++)
if (fabs(A[i]<x)) x=fabs A[i]);
|
|
|
,
A[0]=3, A[1]=-5, A[2]=4, A[3]=-3.
'
().
a ={3;-5;4;-3}, x=min|ai |, (i=0;,2,3,4)
ϳ x =5.
5.2
'
a={2, -5, -10, 4, 6, 7, -13, -11, -9, 5},
.
.
, ((10)).
' , (=1,3,5,,9)
2. '
:
²' ( n, A[1:n], S)
n,A
S
i=0; S=0
i<n
A[i]<0
S=S+A[i]
i=i+2
ʳ
-
2 , 3 .
4 S, ' , .
5 .
6 .
(), , A[i] ' ( 7).
' ( ), S ( 8).
9 .
10 .
.
// 5
//
//
//
#include <stdio.h>
#include <conio.h>
int main(){
const int n=10;//
int A[n];
int i,S=0;
//
printf("\n Input elements array\n\n");
for (i=0;i<n;i++){
printf("A[%i] -->\t",i+1);
scanf("%i",&A[i]);
}
printf("\n Sourse array:");
for (i=0;i<n;i++)
printf("%4i",A[i]);
printf("\n");
for(i=0;i<n;i+=2){
if (A[i]<0)
S+=A[i];
}
printf("\n Suma negative elements: %7i",S);
getch();
return 0;
}
:
1. ?
2. ?
3. ?
4. A[6] :
A[0]= 7; A[1]= -1; A[2]= 0; A[3]= 4; A[4]= 15; A[5]= 3;
:
int A[6];
int i,j,q;
) q=A[4]+A[1];
A[5]=q;
) A[4]=A[2]+A[2+1];
A[1]=A[6-1]+A[5-2];
) i=1;
j=i+3;
A[i]=A[j]+A[j+1];
) for (int i=0;i<5;i++)
A[i]=A[i+1];
5. ? ?
int [5];
int y;
...
x[0]=2; x[1]=2;
x[2]=1; x[3]=3; x[4]=1;
y=x[2]+1;
printf(\n%i,y);
x[5]=4;
printf(\n%i, x[x[5]]));
y=y+2;
printf(\n y=%i x[y]=%i,y,x[y]);
...
