If your dp only AC #2

#include<bits/stdc++.h>
using namespace std;
const int M=1000;
int n,dp[9][2],w[8]={2,8,3,7,4,6,5,1};
int main()
{
    cin>>n;
    dp[1][0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<8;j++)dp[w[j]][1]=dp[(w[j]%8+1)==5?0:(w[j]%8+1)][0]+dp[w[j]==1?8:(w[j]==6?0:w[j]-1)][0]%M;
        for(int j=1;j<9;j++)dp[j][0]=dp[j][1];
    }
    cout<<dp[5][1];
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int M=1000;
int n,dp[9][2],w[8]={2,8,3,7,4,6,5,1};
int main()
{
    cin>>n;
    dp[1][0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<8;j++)dp[w[j]][1]=dp[(w[j]%8+1)==5?0:(w[j]%8+1)][0]+dp[w[j]==1?8:(w[j]==6?0:w[j]-1)][0]%M;
        for(int j=1;j<9;j++)dp[j][0]=dp[j][1]%M;
    }
    cout<<dp[5][1]%M;
    return 0;
}