Today is Caleb's birthday. His dad has surprised him with truly fruity gifts: 2 fruit baskets. The first basket contains N Avacados, and the second one contains M dragon fruits. Caleb likes Avacados and Dragon fruits very much but he likes them equally, and therefore, wants to have the minimum possible difference between the number of Avacados and Dragon fruits he has. To do so, he can purchase 1 Avacado or 1 Dragon fruit by paying exactly 1 gold coin (that's some expensive fruit, eh?). Caleb can purchase fruits at most K times (as he has only K gold coins in his pocket) to make the difference the minimum possible.

 #include <stdio.h>
int main()
{int t,n,m,k;
scanf("%d",&t);
while(t>0)
{scanf("%d %d %d",&n,&m,&k);
while(k>0)
{if(n>m)
{m++;}
else if(m>n)
{n++;}
k--;}
printf("%d\n",(n-m));
t--;}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Elavenil has a chessboard with N rows and M columns. In one step, he can choose two cells of the chessboard which share a common edge (that has not been cut yet) and cut this edge. Formally, the chessboard is split into two or more pieces if it is possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been cut.Elavenil does not want the board to split into two or more pieces. Compute the maximum number of steps he can perform while satisfying this condition.

 #include <stdio.h> int main() { int n,m; scanf("%d %d",&n,&m); printf("%d",(m-1)*(n-1)); return 0; }
Read more

Akash the die heart fan of AR Rahman went to the live concert happened in Bangalore with his family members.The event management firm responsible for the event arranged the seats for the audience in descending order of maximum number of tickets booked for single family.

 #include <stdio.h> int main() {int nooffamilymembers; scanf("%d",&nooffamilymembers); int r=nooffamilymembers; for(int i=1;i<=nooffamilymembers;i++){     for(int j=1;j<=r;j++){         printf("%d ",r);     }r--;     printf("\n");} return 0; }
Read more

Mahesh has given a two-dimensional 3*3 array starting from A [0][0]. You should add the alternate elements of the array and print its sum. It should print two different numbers the first being sum of A 0 0, A 0 2, A 1 1, A 2 0, A 2 2 and A 0 1, A 1 0, A 1 2, A 2 1.

 #include <stdio.h> int main() {   int A[3][3],i,j;     for(i=0;i<3;i++)     {for(j=0;j<3;j++)     {scanf("%d ",&A[i][j]);}}     int m=0,n=0;     for(i=0;i<3;i++){     for(j=0;j<3;j++){     if((i+j)%2==0)     m=m+A[i][j];     else     n=n+A[i][j];}}     printf("%d\n%d",m,n); return 0; }
Read more