ճ
:
1. m=10;
2. int: kilk=0, i, I,min;
3. new m int k.
4. min= 100*10.8*sin((2000)+1.4) sum=0 float;
5. ϳ 2000-2009 , :
5.1. - - =0;
5.2. i<n;
5.3. ++;
5.4. ϳ k[i]=100*10.8*sin((2000+i)+1.4) ;
5.5. ;
5.6. k[i]:
5.6.1. k[i]<0, 1;
5.6.2. k[i]<min, min , imin ;
6. min:
6.1. min<0, : imin, min, kilk, sum, .
| k[i]=100*10.8*sin((2000+i)+1.4); |
| m=10, i, imin,kilk |
| i |
| *k=new int[m] |
| k[i] |
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
i=0; i<m; i++
| imin |
| sum |
| k[i]<min |
| kilk++ |
| min = k[i] |
| imin = i |
| k[i]<0 |
| min<0 |
| min |
| kilk |
| ʳ |
true false
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
#include<iostream.h>
#include<conio.h>
#include<math.h>
int main()
{
clrscr();
int kilk=0,m=10,i,imin;
int *k=new int[m];
float min=100*10.8*sin((2000)+1.4);
float sum=0;
cout<<"Tytchyna V.E. p-23, V-15";
cout<<"\n\t_________________________________\t\n";
cout<<"\t|\trik\t|\tprybutok\t|\n";
cout<<"\n\t_________________________________\t\n";
for(i=0;i<m;i++){
k[i]=100*10.8*sin((2000+i)+1.4);
cout<<"\n\t|\t"<<i<<"\t|\t"<<k[i]<<"\t|\t\n";
cout<<"\n\t---------------------------------\t\n";
if(k[i]<0){
sum+=k[i];
kilk++;
if(k[i]<min){min=k[i];imin=i;}
}}
if(min<0){cout<<"\nzbytok za 200"<<imin<<"rik"<<min;
cout<<"\nzbytkovyh rokiv:"<<kilk;
cout<<"\nsuma zbytkiv:"<<sum;}
|
|
|
else cout<<"\nzbytkiv ne maje";
delete []k;
getch ();
return 0;
}
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
-2-
. yk=fi+10(k), - , k = 1, 2,..., 10. . .
:
' ?
ճ :
:
1. m=10;
2. int: kilk=0, i, Imin;
3. new m int k.
4. min= 100*10.8*sin((2000)+1.4), min2=100*10.8*sin((2000)+1.4) sum=0 float;
5.
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
5.1. - - =0;
5.2. i<n;
5.3. ++;
5.4. ϳ k[i]=100*10.8*sin((2000+i)+1.4) ;
5.5. k[i]<0.
5.6. k[i]>min, min , imin , ;
5.7. k[i]<min;
5.8. k[i]>min2, , min2 ;
6. min:
6.1. min<0, : imin, min, .
7. min2:
7.1. min2==min, min2, , .
-:
| min2=100*10.8*sin((2000)+1.4) |
| m=10, i, imin |
| *k=new int[m] |
| min=100*10.8*sin((2000)+1.4) |
| Sum=0 |
| i |
| k[i] |
| imin |
| k[i]>min |
| min=k[i];imin=i; |
| min2=k[i] |
| k[i]<0 |
| min<0 |
| min |
| k[i]=100*10.8*sin((2000+i)+1.4) |
| k[i]<min |
| k[i]>min2 |
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
I=0;i<m;i++
| min2 |
| ʳ |
| min2==min |
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
˳ :
#include<iostream.h>
#include<conio.h>
#include<math.h>
int main(){
clrscr();
int m=10,i,imin;
int *k=new int[m];
float min=100*10.8*sin((2000)+1.4);
float min2=100*10.8*sin((2000)+1.4);
float sum=0;
cout<<"Tytchyna V.E. p-23, V-15";
cout<<"\n\t_________________________________\t\n";
cout<<"\t|\trik\t|\tprybutok\t|\n";
|
|
|
cout<<"\n\t_________________________________\t\n";
for(i=0;i<m;i++){
k[i]=100*10.8*sin((2000+i)+1.4);
cout<<"\n\t|\t"<<i<<"\t|\t"<<k[i]<<"\t|\t\n";
cout<<"\n\t---------------------------------\t\n";
if(k[i]<0){
if(k[i]>min){min=k[i];imin=i;}}
if(k[i]<min){
if(k[i]>min2){min2=k[i];}}}
if(min<0){cout<<"\nzbytok za 200"<<imin<<"rik"<<min;}
else cout<<"\nzbytkiv ne maje";
if(min2==min){cout<<min2;}
else cout<<"\npovtoriv ne maje";
delete []k;
getch ();
return 0;
}
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
-3-
.
Y 15 , G - 20. , 0 31. d y.o. 20%. , g, . . , .
:
?
. ?
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
:
1. int: kilk1=0,kilk2=0,kilk=0, m=15,n=20,d=1000,max=0,imax;
2. float: ser=0,sumY, sumG;
3. new m int y.
4. new n int g.
5. new m int zar1.
6. new n int zar2.
7. new 32 int vd.
8. VD :
8.1. - - =0;
8.2. i<32;
8.3. ++;
8.4. vd[i] .
9. y[m] :
9.1. - - =0;
9.2. i<m;
9.3. ++;
9.4. y[i] 32.
10. g[n] :
10.1. - - =0;
10.2. i<n;
10.3. ++;
10.4. g[i] 32.
11. ϳ Y :
11.1. - - =0;
11.2. i<m;
11.3. ++;
11.4. zar1;
12. ϳ G :
12.1. - - =0;
12.2. i<n;
12.3. ++;
12.4. zar2;
13. ϳ ;
14. Y, :
14.1. - - =0;
14.2. i<m;
14.3. ++;
14.4. zar1[i]>ser, kilk1 1;
|
|
|
15.
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
15.1. - - =0;
15.2. i<n;
15.3. ++;
15.4. zar2[i]>ser, kilk2 1;
16. , ;
17. kilk==0, ົ, Y G:
17.1. - - =0;
17.2. i<m;
17.3. ++;
17.4. zar1;
17.5. - - =0;
17.6. i<m;
17.7. ++;
17.8. zar2;
18. Y:
18.1. - - =0;
18.2. i<m;
18.3. ++;
18.4. vd[y[i]] 1;
19. G:
19.1. - - =0;
19.2. i<n;
19.3. ++;
19.4. vd[g[i]] 1
20. VD:
20.1. - - =0;
20.2. i<32;
20.3. ++;
20.4. vd[i];
20.5. vd[i]>max, , max , imin-.
21. : max, imax, ser, sumY, sumG, kilk;
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
| kilk1=0,kilk2=0,kilk=0, m=15,n=20,d=1000,max=0,imax=0 |
| ser=0,sumY, sumG |
| *y=new int[m] |
| *g=new int[n] |
| *zar1=new int[m] |
| *zar2=new int[n] |
| *vd=new int[32]; |
| i=0; i<32; i++ |
| vd[i]=0 |
| vd[31]=0 |
| i=0; i<m; i++ |
| y[i]=random(32) |
| i=0; i<n; i++ |
| g[i]=random(32) |
| y[i] |
| g[i] |
| i=0; i<m; i++ |
| zar1[i]=(y[i]*d)*0.8 |
| i=0; i<n; i++ |
| zar2[i]=(g[i]*d)*0.8 |
| sumY+=zar1[i] |
| sumG+=zar2[i] |
| ser=(sumY+sumG)/(m+n) |
| i=0; i<m; i++ |
| kilk=kilk1+kilk2 |
| kilk1++ |
| zar1[i]>ser |
| i=0; i<n; i++ |
| Kilk2++ |
| zar1[i]>ser |
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
| kilk==0 |
| i=0; i<m; i++ |
| vd[y[i]]++ |
| vd[i]>max |
| zar1[i] |
| i=0; i<n; i++ |
| zar2[i] |
| i=0; i<m; i++ |
| i=0; i<n; i++ |
| vd[g[i]]++ |
| i=0; i<32; i++ |
| i |
| vd[i] |
| max=vd[i]; imax=I; |
| max |
| imax |
| ser |
| sumY |
| kilk |
| sumG |
| ʳ |
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
|
|
|
#include<iostream.h>
#include<conio.h>
#include<math.h>
#include<stdlib.h>
int main(){clrscr();
int kilk1=0,kilk2=0,kilk=0, m=15,n=20,d=1000,max=0,imax=0;
float ser=0,sumY, sumG;
int *y=new int[m];
int *g=new int[n];
int *zar1=new int[m];
int *zar2=new int[n];
int *vd=new int[32];
for (int i=0;i<32;i++)vd[i]=0;vd[31]=0;
cout<<"Tytchyna V.E. p-23, V-15";
randomize();
cout<<"\nKilkist vidpr. dniv gidrozdilu Y:";
for(int i=0;i<m;i++){y[i]=random(32);cout<<" "<<y[i];}
cout<<"\nKilkist vidpr. dniv gidrozdilu G:";
for(int i=0;i<n;i++){g[i]=random(32);cout<<" "<<g[i];}
for(int i=0;i<m;i++){
zar1[i]=(y[i]*d)*0.8;
sumY+=zar1[i];}
for(int i=0;i<n;i++){
zar2[i]=(g[i]*d)*0.8;
sumG+=zar2[i];}
ser=(sumY+sumG)/(m+n);
for(int i=0;i<m;i++){
if(zar1[i]>ser)kilk1++;}
for(int i=0;i<n;i++){
if(zar2[i]>ser)kilk2++;}
kilk=kilk1+kilk2;
if (kilk==0)cout<<"\nne maje zarpl. bilsoi za ser.";
else{cout<<"\nZarplta pidrozdilu Y:";
for (int i=0;i<m;i++){
cout<<"\n"<<zar1[i];}
cout<<"\nZarplta pidrozdilu G:";
for (int i=0;i<n;i++){
cout<<"\n"<<zar2[i];} }
cout<<"\nnajchastushe vidp. dniv: ";
for(int i=0;i<m;i++)vd[y[i]]++;
for(int i=0;i<n;i++)vd[g[i]]++;
for (int i=0;i<32;i++){
cout<<i<<" "<<vd[i]<<" "<<endl;
if (vd[i]>max){max=vd[i];imax=i;}}
cout<<"\nkilkist najchast. vid.d:"<<max<<"\nden'"<<imax;
cout<<"\nSerednje znachennja:"<<ser; cout<<"\nsuma pidrozdilu Y:"<<sumY;
cout<<"\nsuma pidrozdilu G:"<<sumG; cout<<"\nkilkist:"<<kilk;
delete []y; delete []g; delete []zar1; delete []zar2;
getch ();
return 0;
}
| . |
| . |
| . |
| ϳ |
| . |
| 18 |
: . , .
