Number of Steps

Problem

You are given two arrays a1,a2...an  and b1,b2...bn . In each step, you can set  if ai=ai-bi if ai>=bi . Determine the minimum number of steps that are required to make all  a's equal.


C  Solution:


  1. #include<stdio.h>
  2. int main()
  3. {
  4. int n,k,steps=0;
  5. scanf("%d",&n);
  6. int i,a[n],b[n];
  7. for(i=0;i<n;i++)
  8. scanf("%d",&a[i]);
  9. for(i=0;i<n;i++)
  10. scanf("%d",&b[i]);
  11. for(i=0;i<n-1;i++)
  12. {
  13. if(a[i]<a[i+1])
  14. {
  15. k=a[i];
  16. a[i]=a[i+1];
  17. a[i+1]=k;
  18. k=b[i];
  19. b[i]=b[i+1];
  20. b[i+1]=k;
  21. } 
  22. }
  23. for(i=0;i<n-1;i++)
  24. {
  25. while(a[n-1]!=a[i]) {
  26. if(a[i]<=0)
  27. {
  28. printf("-1");
  29. exit(0);
  30. }
  31. if(a[n-1]<a[i]) {
  32. a[i]=a[i]-b[i];
  33. steps++; }
  34. if(a[n-1]>a[i]) 
  35. a[n-1]=a[n-1]-b[n-1];
  36. steps++; }
  37. }
  38. }
  39. printf("%d",steps);
  40. return 0;
  41. }
Note:
       We Are Providing Every Content in this Blog Inspired From Many People and Provide it Open To All People Who Are Willing Gain Some Stuff in Computer Science.

Comment Below If You Have Doubts& queries