Advertisement
Korotkodul

физтех отбор 3

Jan 30th, 2022
63
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.17 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 vec vector
  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. ll ans=0;
  38.  
  39. void dfs(int v, int cnt){
  40. //cout<<"v = "<<v<<'\n';
  41. //if (cnt <= 100) cout<<cnt<<"\n";
  42. if (cnt == 28 && v == 0) {
  43. //cout<<"one\n";
  44. ans++;
  45. return;
  46. }
  47. if (cnt == 28) return;
  48. //cout<<"two\n";
  49. for (int i = 0; i < 3 ; ++i){
  50. //cout<<"i = "<<i<<"\n";
  51. if (i == v) continue;
  52. dfs(i, cnt + 1);
  53. }
  54. }
  55.  
  56. int main()
  57. {
  58. /*ios::sync_with_stdio(0);
  59. cin.tie(0);
  60. cout.tie(0);*/
  61. //cout.precision(1);
  62. dfs(0, 0);
  63. cout<<"ans = "<<ans<<"\n";
  64. }
  65.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement