FZU 1911 Construct a Matrix

题目链接：http://acm.fzu.edu.cn/problem.php?pid=1911

题意：F(n)是斐波那契数列1, 1, 2, 3, 5, 8, 13, 21, 34...

 S(n) = (F₁ + F₂ + … + F_n) % m。

现在要构造一个S(n)*S(n)的矩阵，只含0,1,-1,而且每一行每一列的元素和不能一样。

思路：首先S(n)很容易求出来，∑Fi = F(i+2) - 1（ 先借一个F2 ， 最后再减去 ）。

难点在于构造矩阵，这里参考http://www.cnblogs.com/Torrance/p/5412802.html写的很详细。

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;

#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff

int T;
int n,m;

struct node
{
    int a[2][2];
    void E()
    {
        Clean(a,0);
        a[0][0] = a[1][1] = 1;
    }
    void P()
    {
        a[0][0] = 0;
        a[0][1] = a[1][0] = a[1][1] = 1;
    }
};
node multi( node &x , node &y )
{
    node ans;
    rep(i,0,1)
        rep(j,0,1)
        {
            ans.a[i][j] = 0;
            rep(k,0,1)
                ans.a[i][j] = ( ans.a[i][j] + x.a[i][k] * y.a[k][j] ) % m;
        }
    return ans;
}
int g()
{
    node temp,ans;
    ans.E();
    temp.P();
    n++;
    while( n )
    {
        if ( n & 1 ) ans = multi( ans , temp );
        temp = multi( temp , temp );
        n>>=1;
    }
    int s = 0;
    s = ( ans.a[0][0] + ans.a[1][0] - 1 + m ) % m;
    return s;
}

void out( int k )
{
    int mid = k/2;
    int a[205][205];
    Clean(a,-1);
    rep( i , mid + 1 , k )
        rep( j , mid + 1 , k )
            a[i][j] = 1;
    rep(i,mid+1,k)
    {
        int j = i - mid;
        a[i][j] = 0;
    }
    rep(i,mid+2,k)
        rep(j,1,i-mid-1) a[i][j] = 1;
    rep(i,1,mid)
        rep(j,k-i+1,k) a[i][j] = 1;
    rep(i,1,k)
        rep(j,1,k) printf("%d%c",a[i][j],(j==k)?'\n':' ');
}

int main()
{
    cin>>T;
    rep(kase,1,T)
    {
        scanf("%d%d",&n,&m);
        printf("Case %d: ",kase);
        int k = g();
        if ( k & 1 || k == 0 )
            puts("No");
        else
        {
            puts("Yes");
            out(k);
        }
    }
    return 0;
}