spoj BCGCD


SUBMITTED BY: Guest

DATE: Feb. 16, 2014, 5:02 a.m.

FORMAT: C++

SIZE: 1.1 kB

HITS: 1178

  1. //Haha TTpro
  2. //BCGCD
  3. //http://www.spoj.com/PTIT/problems/BCGCD/
  4. #include <iostream>
  5. void doi ( long long int &a, long long int &b);
  6. long long int GCD (long long int a,long long intb);
  7. long long int BCNN(long long int a,long long int b, long long int c);
  8. using namespace std;
  9. int main()
  10. {
  11. long long int a,b,c,d;
  12. while (true)
  13. {
  14. cin >>a>>b;
  15. if ((a==0)&&(b==0)) break;
  16. c=GCD(a,b);
  17. d=BCNN(a,b,c);
  18. cout<<c<<" "<<d<<endl<<endl;
  19. }
  20. return 0;
  21. }
  22. long long int GCD (long long int a,long long int b)
  23. {
  24. if (a<b)
  25. {
  26. doi(a,b);
  27. }
  28. long long int r;
  29. while (true)
  30. {
  31. r=a%b;
  32. if (r==0) return b;
  33. a=b;
  34. b=r;
  35. }
  36. }
  37. void doi( long long int &a, long long int &b)
  38. {
  39. long long int c;
  40. c=a;
  41. a=b;
  42. b=c;
  43. }
  44. long long int BCNN(long long int a,long long int b, long long int c)
  45. {
  46. long long int s;
  47. s=a*b;
  48. s=s/c;
  49. return s;
  50. }

comments powered by Disqus