Ares2333的博客

#include<stdio.h>#define N 10007#define maxn 1000005int dp[maxn];int main(){ dp[1]=1,dp[2]=2,dp[3]=4; for(int i=4;i<maxn;i++) dp[i]=dp[i-1]%N+dp[i-2]%N+dp[i-3]%N; int n; wh

解法一：简单搜索肯定被踢，只是单纯的想写一发搜索练练手#include<cstdio>#include<cstring>#define maxn 1005using namespace std;int i,j,k,n,ans;int c[maxn][maxn];int dir[2][2]={{0,1},{1,0}};bool can(int i,int j){ if(i<0|