Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int G[n];
- int Amin = RastiMinimaliaReiksme(A, n);
- int Bmin = RastiMaksimaliaReiksme(B, n);
- for(int i =0;i<n;i++)
- {
- G[i]=(Amin + Bmax)/(KurisMazesnis(A[i], B[i]))+B[i];
- }
- int RastiMinimaliaReiksme(int[] masyvas, int n)
- {
- int min=masyvas[0];
- for(int i=0;i<n;i++)
- {
- if(min > masyvas[i])
- min=masyvas[i];
- }
- return min;
- }
- int RastiMaksimaliaReiksme(int[] masyvas, int n)
- {
- int max=masyvas[0];
- for(int i=0;i<n;i++)
- {
- if(max < masyvas[i])
- max=masyvas[i];
- }
- return max;
- }
- int KurisMazesnis(int a, int b)
- {
- int maziausiasi = a;
- if( b< a)
- return b;
- else
- return a;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement