.


:




:

































 

 

 

 





. ..

-

 

-

 

 

.

 

 

 

 


 

519.682

 

. / . .. , .. .. , .. . - .: - , 2002. - 56 .

 

- .

 

:

. . .. ( 1,2),

..-.., .. ( 3,7),

..-., .. ( 8),

..., .. ( 3,4,5,6)

 

:

 

 

. .. ,


 

1. .. 3

2. .. 6

3. .. 15

4. .. 18

5. .. 23

6. .. 28

6.1 .. 28

6.2 .. 29

7. . 32

8. .. 39

9. .. 41

.. 55


1. . x n (n ).

 

#include <stdio.h>

#include <math.h>

main()

{int n;

float x;

char yn,temp;

do {

printf(" n-................");

scanf("%i",&n);

printf(" x-...........");

scanf("%g",&x);

if (fabs(x)<5)

printf(".........y(%g,%i)=%g\n",x,n,exp(log(log10(26-x*x))/n));

else if ((fabs(x)>5)&&(fabs(x)<sqrt(26))&&(n % 2))

printf(".........y(%g,%i)=%g\n",x,n,-exp(log(-log10(26-x*x))/n));

else if ((fabs(x)==5)&&(n>0))

printf(".........y(%g,%i)=%g\n",x,n,0/n);

else

printf(" \n");

printf(" -y, -n\n");

temp=getchar();

yn=getchar();

temp=getchar();

} while ((yn!='n')&&(yn!='N'));

}

 

:

n x y
  -4.8 0.912448
  5.05 -0.787677
  -4  
   
     

 

y x. x a b ( a , b , ):

1. x=3,5; a=0.2; -1,5 b=2; 3

2. ; x=0.3; a=2,1; 9,8 b=1; 6;

3. ; x=1.03; a=2,5; 0,3; b=2; 3

4. ; x=0.3; a=0,2; -1,2 b=6; -1

5. ; x=1.3; a=0,2; 3,1; b=2; 3;

6. ; x=2.3; a=1,2; -1,5; b=2; 3;

7. ; x=1.03; a=1,2; 4,5; b=4; 1;

8. ; x=1.03; a=-4; -5.2; b=6; 1

9. ; x=2.3; a=-1.2; 0,3 b=2; 3

10. ; x=-1.3; a=-2,2; 1,1 b=2; 3 11. ; x=1.03; a=-1,2; 2,3 b=3; 2

12. x=3,5; a=0.2; -1,5 b=2; 3

13. ; x=0.3; a=2,1; 9,8 b=1; 6;

14. ; x=1.03; a=2,5; 0,3; b=2; 3

15. ; x=0.3; a=0,2; -1,2 b=6; -1

16. ; x=1.3; a=0,2; 3,1; b=2; 3;

17. ; x=2.3; a=1,2; -1,5; b=2; 3;

18. ; x=1.03; a=1,2; 4,5; b=2; 3;

19. ; x=1.03; a=-4; -5.2; b=6; 1

20. ; x=2.3; a=-1.2; 0,3 b=2; 3

21. ; x=-1.3; a=-2,2; 1,1 b=2; 3

22. ; x=1.03; a=-1,2; 2,3 b=3; 2

23. ; x=1.3; a=0,2; 3,1; b=4; 5;

24. ; x=2.3; a=1,2;-1,5; b=4; 5;

25. ; x=1.03; a=1,2; 4,5; b=2; 3;

 

 

. x,y :

 

#include <stdio.h>

#include <math.h>

#define sq(t) ((t)*(t))

main()

{float x,y; char yn,temp;

do {

printf(" x...............");

scanf("%g",&x);

printf(" y...............");

scanf("%g",&y);

if (!(x==0)&&(((sq(x-1)+sq(y-1)<=1)&&((y>=x)&&(y>=1/x)||

(y<=x)&&(y<=1/x)))||((sq(x-1)+sq(y-1)>=1)&&((y>=x)&&

(y<=1/x)&&(x<0)||(y<=x)&&(y>=1/x)&&(x>0)))))

printf("........\n");

else

printf("... ....\n");

printf(" -y, -n\n");

temp=getchar(); yn=getchar(); temp=getchar();

} while ((yn!='n')&&(yn!='N')); }

:

x y
  0.5
  1.5
   
   
-5 -1
-2 -0.01
-1  

 

x,y :

 

1. 2.

 

 

3. 4.

 

5. 6.

 

7. 8.

 

9. 10.

 

 

11. 12.

 

 

13. 14.

 

15. 16.

 

 

17. 18.

19. 20.

 

 

21. 22.

 

23. 24.

 

 

25.


. S= . , , ,

, :

. , , .

 

#include <iostream.h>

main()

{ long double eps,s,y,x;

int n;

n=0;

eps=1.e-5;

s=0;

y=1.;

cin>>x;

while(fabs(y)>eps)

{ s=s+y;

n=n+2;

y=(-1)*y*x*x/(n*(n-1));

}

cout<<s<<" "<<n-2;

}

 

:

) x n ( ), S

;

) x n ( ), S ;

) x , S n. , :

1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

15.

16.

17.

18.

19.

20.

21.

22.

23.

24.

25.

 

 

1. .

: n=ak-110k-1+ ak-210k-2+...+a1101+a0. n 10 a0. n 10, n1: n1= ak-110k-2+ ak-210k-3+...+a2101+a1. n1 10 a1. , 0, n. . mk=mk-110+ ak-1, .

 

#include <iostream.h>

#include<math.h>

main()

{ int n,m,k;

m=0;

k=0;

cin>>n;

while(n>0)

{ m=10*m+n%10;

n=n/10;

k=k+1;

}

cout<<" :"<<k<<endl;

cout<<":"<<m<<endl;

 

2. n. n 0 5, .

10 . 10 . 10 .

 

#include <iostream.h>

#include<math.h>

main()

{ long int n,m,k,l;

m=0;

k=1;

cin>>n;

while(n>0)

{ l=n%10;

if(l!=5 && l!=9)

{ m=m+k*l;

k=k*10;

}

n=n/10;

}

cout<<m<<endl;

}

 

3. ,

. .

 

#include <iostream.h>

main()

{int n;

int i,j,k;

do

cin>>n;

while(n<=0 && n>27);

for(i=0;i<=9;i++)

for(j=0;j<=9;j++)

{ k=n-i-j;

if(k>=1 && k<=9)

cout<<i+j*10+k*100<<endl;

}

 

}

1. , N..

2. , .

3. N.

4. () L.

5. N : .

6. , N,

7. , N, .

8. , * , ( , , 38 83).

9. N.

10. , 13.

11. N. . N. . , LMN. , L, , N - , : L - N =+L++N

12. , : , .

13. 2. , . .

14. , . : [1] []; [] [I]. :[A][1]/[1][A]=3

15. , . .

16. . 7, . .

17. , 1 2, 2 3, 3 4, 4 5.

18. , 2 1, 3 - 2, 4 - 3, 5.

19. , 2 8, 3 - 4.

20. 7, 7. .

21. N. N 0 5, . , 1509 19..

22. N , , N- , (, 153 = I3 + 53 + 3). , .

23. 000000 999999. , : N1+N2+N3=N4+N5+N6.

24. , , .

25. - , , , , (), . , 34697 2 (3+4+6+9+7=29; 2+9=11; 1+1=2). N

26. L. , . , 6, 36 6, 25 - 625.

27. . , . , , .., . , , ( < 1.). , , , ,

28. , :

29. ;

30. ( ), .

31. k-

32. ) 12345678910111213, ;

33. ) 110100100010000100000, 10;

34. )149162536, , ;

)1123581321,

1. n.

1. n 1,2,3,..., n. , , [n/2+1,n-1] n .

#include <iostream.h>

main()

{ int n,d;

cin>>n;

for (d=1;d<=n/2;d++)

if(n%d==0)

cout<<d<<endl;

}

 

2. n, n. n .

 

#include <iostream.h>

main()

{ int n,d;

cin>>n;

for (d=1;d*d<n;d++)

if(n%d==0)

cout<<d<<", "<<n/d<<endl;

if(d*d==n)

cout<<d<<endl;

}

2. .

, :

n=q*m+r0,

m=q0*r0+r1,

r0=q1*r1+r2

..........................

rk-1=qk*rk+rk+1,

...........

rj-1=qj*rj,

rj .

#include <iostream.h>

main()

{ long int n,m,r,tmp;

cin>>n>>m;

if(m>n)

{ tmp=m; m=n; n=tmp;}

while(m>0)

{ r=n%m; n=m; m=r; }

cout<<n;

}

 

3. , n.

1.

, n.. , .

 

#include <iostream.h>

main()

{ int d,k,n;

cin>>n;

cout<<1<<endl<<2<<endl<<3<<endl;

k=5;

while (k<=n)

{ for (d=2;d*d<=k && k%d!=0;d++)

;

if(d*d>k)

cout<<k<<endl;

k=k+2;

}

}

1. N. .

2. N. ?

3. N.

4. 1 200, N.

5. 1 200, 5

6. 100 300, .

7. 1 10000 .

8. L, .

9. N.

10. 1 200, N.

11. N. .

12. ax3+bx2+cx+d=0, a,b,c,d .

13. p q q, p

14. n.

15. (1000, 9999) , , .

16. , ( < ). I, : < I < , .

17. N > 2. . L k , k- , , N Lk Lk+1;

18. N > 2. .

19. () , (,L,) = ((, L), M)

20. , N. , N

21. L (), : (K,L)=KL/ (K,L) M ( > 2) : N1,N2,..., N. (N1,N2,..., N), (N1,N2,..., N)= ((N1,N2,..., N-1), N) ..

22. , 0 1, 7 ( - )

23.. . -

24. , N. , ( , ). , 28 - , .. 28 = 1 + 2 + 4 + 7 + 14..

25. N. . , N . , ( )..

, . . .

 

1. .

#include <iostream.h>

main()

{ const int n=5;

int m[n]={-1,-2,-1,3,-5};

int I;

for (I=0;I<n && m[I]<=0;I++)

;

if(I>=n)

cout<<no;

else

cout<<m[I];

}

 

2. , n.

2.

. . , .

#include <iostream.h>

main()

{ long d,k,n,m,i;

long p[100];

cin>>n;

k=5; m=0;

p[0]=3;

cout<<1<<endl<<2<<endl<<3<<endl;

while (k<=n)

{ for (i=0;i<=m && p[i]*p[i]<=k && k%p[i]!=0;i++)

;

if(i>m || p[i]*p[i]>k)

{ cout<<k<<endl;

m=m+1;

p[m]=k;

}

k=k+2;

}

}





:


: 2016-12-17; !; : 397 |


:

:

, - , ; , - .
==> ...

1608 - | 1615 -


© 2015-2024 lektsii.org - -

: 0.166 .