Advertisement
Guest User

Untitled

a guest
Jun 25th, 2023
93
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.62 KB | None | 0 0
  1. #include <iostream>
  2. #include <vector>
  3.  
  4. void solve(const std::pair<uint32_t, uint32_t>& left, const std::pair<uint32_t, uint32_t>& right, const uint32_t& max, uint32_t count = 2) {
  5.     if (count >= max)
  6.         return;
  7.  
  8.     std::pair<uint32_t, uint32_t> result = { left.first + right.first, left.second + right.second };
  9.  
  10.     solve(left, result, max, count + 1);
  11.     std::cout << result.first << "/" << result.second << " ";
  12.     solve(result, right, max, count + 1);
  13. }
  14.  
  15. int main()
  16. {
  17.     uint32_t n;
  18.     std::cin >> n;
  19.  
  20.     uint32_t max = 2;
  21.     for (uint32_t i = 2; i <= n; i++)
  22.         max += 2 * i - 1;
  23.  
  24.     solve({ 0,1 }, { 1,0 }, max);
  25.  
  26.     return 0;
  27. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement