Advertisement
Korotkodul

N5_отбор

Nov 11th, 2022
666
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.39 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4. #include <queue>
  5. #include <algorithm>
  6. #include <string>
  7. #include <stack>
  8. #include <set>
  9. #include <map>
  10. #define pii pair <int, int>
  11. #define pb(x) push_back(x)
  12. using namespace std;
  13. using ll = long long;
  14. using ld = long double;
  15. using db = double;
  16. void cv(vector <int> &v) {
  17.     for (auto x : v) cout << x << ' ';
  18.     cout << "\n";
  19. }
  20.  
  21. void cvl(vector <ll> &v) {
  22.     for (auto x : v) cout << x << ' ';
  23.     cout << "\n";
  24. }
  25.  
  26.  
  27. void cvv(vector <vector <int> > &v) {
  28.     for (auto x : v) cv(x);
  29.     cout << "\n";
  30. }
  31.  
  32. void cvb(vector <bool> v) {
  33.     for (bool x : v) cout << x << ' ';
  34.     cout << "\n";
  35. }
  36.  
  37. void cvs(vector <string>  v) {
  38.     for (auto a : v) {
  39.         cout << a << "\n";
  40.     }
  41. }
  42.  
  43. void cvp(vector <pii> a) {
  44.     for (auto p : a) {
  45.         cout << p.first << ' ' << p.second << "\n";
  46.     }
  47.     cout << "\n";
  48. }
  49.  
  50. vector <int> h = {9, 1, 30, 4, 24, 12, 8, 23, 18, 7, 16, 15, 21, 26, 10, 17, 19, 22, 13, 28, 14, 11, 2, 29, 3, 6, 27, 0, 5, 25, 31, 20};
  51.  
  52.  
  53. bool sh = 0;
  54. int k;
  55.  
  56. pii g(pii cd,int cnt) {
  57.     int c = cd.first, d = cd.second;
  58.     if (sh) {
  59.         cout << "cd\n";
  60.         cout << c << ' ' << d << "\n";
  61.         cout << "cnt = " << cnt << "\n";
  62.     }
  63.     if (cnt == 128) {
  64.         return cd;
  65.     }
  66.     if (sh) {
  67.         //cout << "";
  68.     }
  69.     pii p = {d, (c + h[ (d + k) % 32 ]) % 32 };
  70.     return g(p, cnt + 1);
  71. }
  72.  
  73. int main() {
  74.     ios::sync_with_stdio(0);
  75.     cin.tie(0);
  76.     cout.tie(0);
  77.  
  78.     vector <pii> fr = {
  79.         {
  80.             23, 0
  81.         },
  82.         {
  83.             10, 4
  84.         },
  85.         {
  86.             0, 6
  87.         },
  88.         {
  89.             1, 29
  90.         }
  91.     },
  92.     to = {
  93.         {
  94.             25, 9
  95.         },
  96.         {
  97.             7, 13
  98.         },
  99.         {
  100.             9, 7
  101.         },
  102.         {
  103.             14, 14
  104.         }
  105.     };
  106.     for (int i = 0; i <= 31; ++i) {
  107.         k = i;
  108.         bool ok = 1;
  109.         for (int j = 0; j < 4; ++j) {
  110.             pii res = g(fr[j], 0);
  111.             if (sh) {
  112.                 cout << "k = " << k << "\n";
  113.                 cout << "res\n";
  114.                 cout << res.first << ' ' << res.second << "\n";
  115.             }
  116.             if (res != to[j]) {
  117.                 ok = 0;
  118.             }
  119.         }
  120.         if (ok) {
  121.             cout << "k = " << k << "\n";
  122.             cout << "OK\n";
  123.         }
  124.     }
  125. }
  126.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement