hiho week 43 register

Ended

Participants:830

Verdict:Accepted
Score:100 / 100
Submitted:2015-04-29 17:21:53

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream> 
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue> 
#define eps 1e-5
#define oo 12357
#define MAXN 130
using namespace std;     
int dp[MAXN][MAXN];
class Matrix
{
       private:
       int a[MAXN][MAXN];
       int n;
       public:
       Matrix(){
              memset(a,0,sizeof(a)); 
       }
       int initial(int x) {
              n=x; 
              for (int i=0;i<x;i++) a[i][i]=1;
       }
       void copy(int s[MAXN][MAXN]){
              for (int i=0;i<n;i++)
                for (int j=0;j<n;j++)
                  a[i][j]=s[i][j];
       }
       Matrix operator *(Matrix x) const{
              Matrix ans;
              ans.n=n;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX