#291134 (C++14) No.220 世界のなんとか2

• 問題: No.220 世界のなんとか2
• ユーザー: daleksprinter
• 提出日時: 2018-10-10 09:13:17
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2 ms / 1,000 ms
• コード長: 2,667 bytes
• コンパイル時間: 1,497 ms
• コンパイル使用メモリ: 167,344 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-20 19:23:30
• 合計ジャッジ時間: 2,182 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	1 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;


/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define Sort(v) sort(all(v))


/* constant */
const int inf = 100100100100100100;
const int mod = 1000000007;
int dx[8]={1,0,-1,0,-1,1,-1,1};
int dy[8]={0,1,0,-1,-1,-1,1,1};


/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
string readline(){string s;getline(cin, s);return s;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
vector<int> cs(vector<int> arr){
    vector<int> tmp;
    if(arr.size() == 0) return tmp;
    tmp.push_back(arr[0]);
    rep(i,1,arr.size()){
        tmp.push_back(tmp.back() + arr[i]);
    }
    return tmp;
}

/* math_library */
int gcd(int a, int b){ if(b == 0) return a; return gcd(b, a % b);}
int lcm(int a, int b){ return a * b / gcd(a,b);}
int ceil(int a, int b){
    if(a % b == 0) return a/b;
    else return a/b + 1;
}

int digitlen(int n){
    int t = n;
    int cnt = 0;
    while(t){
        cnt++;
        t /= 10;
    }
    return cnt;
}

/* main */


int n;
vector<int> arr;

int dp[20][2][3];

int dfs(int i, int three, int mod3){

    if(dp[i][three][mod3] > -1) return dp[i][three][mod3];
    
    if(i == n) return (three == 1 || mod3 == 0 ? 1 : 0);

    int ans = 0;
    rep(j,0,10){
        ans += dfs(i + 1, (three == 1 || j == 3 ? 1 : 0), (mod3 + j) % 3);
    }

    return dp[i][three][mod3] = ans;
    



}




signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);

    n = input();
    memset(dp, -1 ,sizeof(dp));

    print(dfs(0, 0, 0) - 1);

    

    

    
   
    
    

    








}