fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. //* 1  /  2  /  4  /  6 
  31.  
  32. int consistency(int n){
  33. 	if(n==0) return 0;
  34.  
  35. 	vector<vector<int>> dp(n+1, vector<int>(3, 0));
  36.  
  37. 	dp[0][0] = 1;
  38. 	dp[0][1] = 0;
  39. 	dp[0][2] = 0;
  40.  
  41. 	dp[1][0] = 1;
  42. 	dp[1][1] = 0;
  43. 	dp[1][2] = 0;
  44.  
  45. 	for(int i=2; i<=n; i++){
  46.  
  47. 		dp[i][0] = dp[i-1][0] + dp[i-2][0];
  48. 		if(i-6>=0) dp[i][0] += dp[i-6][0];
  49.  
  50. 		dp[i][1] = dp[i-1][1] + dp[i-2][1];
  51. 		if(i-4>=0) dp[i][1] += dp[i-4][0];
  52. 		if(i-6>=0) dp[i][1] += dp[i-6][1];
  53.  
  54. 		dp[i][2] = dp[i-1][2] + dp[i-2][2];
  55. 		if(i-4>=0) dp[i][2] += dp[i-4][1];
  56. 		if(i-6>=0) dp[i][2] += dp[i-6][2];
  57. 	}
  58.  
  59. 	return dp[n][0] + dp[n][1] + dp[n][2];
  60. }
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76. int practice(int n){
  77.  
  78.  
  79.     return 0;
  80. }
  81.  
  82.  
  83.  
  84.  
  85.  
  86. void solve() {
  87.  
  88.     int n;
  89.     cin>> n;
  90.  
  91.     cout << consistency(n) << endl;
  92.  
  93.  
  94. }
  95.  
  96.  
  97.  
  98.  
  99.  
  100. int32_t main() {
  101.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  102.  
  103.     int t = 1;
  104.     // cin >> t;
  105.     while (t--) {
  106.         solve();
  107.     }
  108.  
  109.     return 0;
  110. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
12
stdout
copy 
609
https://ideone.com/xucW4B
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!