fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. struct Fraction{
  5. long long p, q, pp, qq;
  6. Fraction(long long _p = 0LL, long long _q = 1LL) : p(_p), q(_q) {
  7. if(q < 0) {
  8. p = -p;
  9. q = -q;
  10. }
  11. long long g = __gcd(p, q);
  12. p /= g;
  13. q /= g;
  14. }
  15. bool operator < (const Fraction b) const {
  16. return p * b.q < q * b.p;
  17. }
  18. bool operator == (const Fraction b) const {
  19. return p * b.q == q * b.p;
  20. }
  21. Fraction operator + (const Fraction b) const {
  22. return Fraction(b.q * p + b.p * q, q * b.q);
  23. }
  24. Fraction operator - (const Fraction b) const {
  25. return Fraction(b.q * p - b.p * q, q * b.q);
  26. }
  27. Fraction operator * (const Fraction b) const {
  28. return Fraction(p * b.p, q * b.q);
  29. }
  30. Fraction operator / (const Fraction b) const {
  31. return Fraction(p * b.q, q * b.p);
  32. }
  33.  
  34. void print() {
  35. cout << p << '/' << q ;
  36. }
  37. }f[400000];
  38. int main() {
  39.  
  40. int t, n=0;
  41. string s;
  42. cin>>t;
  43. cout<<t;
  44. /*
  45.   getline(cin, s);
  46.   stringstream ss(s);
  47.   char c;
  48.  
  49.   while(ss >> f[n].p >> c >> f[n].q ){
  50.   ss >> c;
  51.   f[n].pp=f[n].p;
  52.   f[n].qq=f[n].q;
  53.   cout<<f[n].p <<"/"<<f[n].q<<" ";
  54.   n++;
  55.   }
  56.   for(int i=0;i<n;i++){
  57.   cout<<f[i].p <<"/"<<f[i].q<<" ";
  58.   }*/
  59.  
  60.  
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
Success #stdin #stdout 0.01s 16164KB
stdin
135
13256
35001
1001
stdout
135