4
:
:
1
: . . -12-02
: ...,
..
2 2013 .
, 2013
充 3
1.1 1.2 | ... 腅 充.. | |||
1.3 | - 腅... | |||
1.4 | ....... | |||
1.5 | ||||
2.1 | 腅.... | |||
2.2 2.3 | ... ............ | |||
充. | ||||
, 1970- Bell Labs . UNIX. . . . . , , . .
, , . .
|
|
. , . . , . , , .
. , -, , MS Excel.
: , , , -, .
. - . , .
:
A[ N]. B[N] A[N] : , . k , k- .
1.2 :
1. ;
2. A[n]
3. ch=0
4. i=1
5. : A[i] %2== 0, 6 7
6. A[i]=A[i]+A[0],
7. i=i+1. i<n 5, .
8. i=1
9. =A[n-1]
10. j=n-1
11. A[j]=A[j-1]
12. j=j-1. j>0 11, .
13. A[0]=c
14. i=i+1. i<ch 9 .
15. A[n]
16.
1.3 - :
1.4 :
#include<stdio.h>
#include<math.h>
#include<conio.h>
#include<stdlib.h>
#define n 8
main()
{
clrscr();
int a[n],b[n];
int i,c,ch,j;
printf("**************************************************\n");
printf(" Laboratornaya rabota 4\n");
printf(" Tema:Odnomernie massivi i ukazateli\n");
printf(" varinat n1 ");
for(i=0;i<n;i++)
a[i]=rand()%9-3;
ch=0;
j=0;
printf("\n\n sgeneririvan massiv a[n] \n");
for(i=0;i<n;i++)
printf(" %d",a[i]);
printf("\n________________________________________");
printf("\n\n izm massiv b[n] \n");
j=0;
for(i=0;i<n;i=i+2){
b[j]=a[i];
j++;}
for(i=1;i<n;i=i+2){
b[j]=a[i];
j++; }
for(i=0;i<n;i++)
printf(" %d",b[i]);
printf("\n________________________________________________________\n");
printf("\n\nchislo polozhitelnih elementov \n");
ch=0;
for(i=0;i<n;i++)
if(a[i]>0)
ch++;
printf(" %d",ch);
printf("\n_________________________________________________________\n");
|
|
for(i=0;i<ch;i++)
{c=b[n-1];
for(j=n-1;j>0;j--)
b[j]=b[j-1];
b[0]=c;}
printf("\n\n sdvig na %d elementov \n",ch);
for(i=0;i<n;i++)
printf(" %d",b[i]);
printf("\n______________________________________________________\n");
getch();
}
1.5 :
MS Excel: