Advertisement
Farjana_akter

Untitled

Jun 30th, 2019
76
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.22 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4.  
  5. int main()
  6. {
  7. long long int n,sum,total,ans,spaceup,t=0,spacedown,i,j,k,rem,a,b,c,d,gcd;
  8. string sfd,sfu;
  9. while(cin>>n && n)
  10. {
  11. cout<<"Case "<<++t<<":"<<endl;
  12. int flag=0;
  13. sum=0;
  14. ans=0;
  15. for(i=0; i<n; i++)
  16. {
  17. cin>>d;
  18. sum+=d;
  19. }
  20.  
  21. if(sum<0)
  22. {
  23. flag=1;
  24. sum*=-1;
  25. }
  26. // cout<<sum<<endl;
  27.  
  28. gcd=__gcd(sum,n);
  29. // cout<<gcd<<endl;
  30. //bad diya dekhte hbe
  31. sum/=gcd;
  32. n/=gcd;
  33. // cout<<"sum by gcd"<<sum<<endl;
  34. // cout<<"n by gcd"<<n<<endl;
  35. if(sum%n==0)
  36. {
  37. if(flag==1)
  38. cout<<"- ";
  39. ans=sum/n;
  40. cout<<ans<<endl;
  41. }
  42.  
  43. else
  44. {
  45. sfu.clear();
  46. sfd.clear();
  47. rem=sum%n;
  48. // cout<<"rem: "<<rem<<endl;
  49. sum=sum/n;
  50. // cout<<"sum: "<<sum<<endl;
  51. a=0,b=0;
  52. if(flag==1)
  53. {
  54. sfu+=" ";
  55. }
  56. // cout<<"st for up"<<sfu<<endl;
  57. total=sum;
  58. while(total>0)
  59. {
  60. sfu+=' ';
  61. total/=10;
  62. }
  63. // cout<<"st for up "<<sfu<<endl;
  64. total=n;
  65.  
  66. while(total>0)
  67. {
  68. b++;
  69. total/=10;
  70. }
  71. // cout<<"B is"<<b<<endl;
  72. total=rem;
  73.  
  74. while(total>0)
  75. {
  76. a++;
  77. total/=10;
  78. }
  79. // cout<<"A IS:"<<a<<endl;
  80. a=b-a;
  81. // cout<<"st for up "<<sfu<<endl;
  82. sfd+=sfu;
  83. // cout<<"st for down "<<sfd<<endl;
  84. while(a--)
  85. sfd+=' ';
  86. // cout<<"st for down "<<sfd<<endl;
  87. cout<<sfd<<rem<<endl;
  88.  
  89. if(flag==1)
  90. {
  91. cout<<"- ";
  92. }
  93. if(sum!=0)
  94. cout<<sum;
  95.  
  96. while(b--)
  97. {
  98. cout<<"-";
  99. }
  100. cout<<endl;
  101. cout<<sfu<<n<<endl;
  102. }
  103.  
  104.  
  105. }
  106. return 0;
  107. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement