NKPATH - Đường đi trên lưới
Tác giả: happyboy99x
Ngôn ngữ: C++
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); i != _e; ++i)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)
#define INF 1000000000
#define N 105
#define MOD 1000000000
int f[N][N], a[N][N], m, n;
int gcd(int a, int b) {
int t;
while(b) { t = b; b = a % t; a = t; }
return a;
}
int main() {
//freopen( "input.txt", "r", stdin );
//freopen( "output.txt", "w", stdout );
scanf("%d%d",&m,&n);
rep(i,m) rep(j,n) scanf("%d",&a[i][j]);
rep(i,m) f[i][0] = 1;
rep(i,m) rep(j,n) rep(x,i+1) rep(y,j+1)
if( y < n-1 && x+y < i+j && gcd(a[x][y], a[i][j]) != 1)
f[i][j] = (f[i][j] + f[x][y]) % MOD;
int res = 0; rep(i,m) res = (res + f[i][n-1])%MOD;
printf("%d\n", res);
return 0;
}