Advertisement
Guest User

Untitled

a guest
Nov 26th, 2014
149
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.28 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. class Pair{
  5. public:
  6. int a;
  7. int b;
  8.  
  9. Pair():a(0), b(0) {}
  10. void mult(int c)
  11. {
  12. a = a*c;
  13. b = b*c;
  14. }
  15. Pair operator+(Pair rv)
  16. {
  17. Pair tmp;
  18.  
  19. tmp.a = a + rv.a;
  20. tmp.b = b + rv.b;
  21. return tmp;
  22. }
  23.  
  24. };
  25.  
  26. class Money: public Pair
  27. {
  28. public:
  29. Pair operator+( Pair rv)
  30. {
  31. Pair tmp;
  32.  
  33. tmp.a = a + rv.a;
  34. tmp.b = b + rv.b;
  35. while (b >= 100)
  36. {
  37. tmp.b = tmp.b - 100;
  38. tmp.a = tmp.a + 1;
  39. }
  40. return tmp;
  41. }
  42. Pair operator-( Pair rv)
  43. {
  44. Pair tmp;
  45.  
  46. tmp.b = b + a*100 - rv.b - rv.a*100;
  47. tmp.a = 0;
  48.  
  49. while (b >= 100)
  50. {
  51. tmp.b = tmp.b - 100;
  52. tmp.a = tmp.a + 1;
  53. }
  54. return tmp;
  55. }
  56.  
  57. };
  58. int main(){
  59. freopen("input.txt","r",stdin);
  60. freopen("output.txt","w",stdout);
  61. int n;
  62. scanf("%ld",&n);
  63. Pair** a = new Pair*[n];
  64. for (int i = 0; i < n; i++)
  65. {
  66. a[i] = new Pair();
  67. scanf("%ld%ld",&a[i]->a,&a[i]->b);
  68. }
  69. int p=5;
  70. Pair* k = new Pair();
  71. k->a=1;
  72. k->b=1;
  73.  
  74. for (int i = 0; i < n; i++)
  75. {
  76. printf("Mult 5*Pair\n");
  77. a[i]->mult(p);
  78. printf("%ld %ld\n",a[i]->a,a[i]->b);
  79. /*printf("Add Pair[i]+(Pair[i]\n");
  80. Pair* tmp = new Pair();
  81. tmp = a[i] + a[i];*/
  82. printf("%ld %ld\n",a[i]->a,a[i]->b);
  83. }
  84. return 0;
  85. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement