- 论坛徽章:
- 0
|
第一题的矩阵解法，把以前PKU3070的代码改了以下发上来
#include <iostream>
#include <assert.h>
#include<cstdlib>
#include<cstring>
#ifndef _MYMATRIX_HPP_
#define _MYMATRIX_HPP_
#include <vector>
using namespace std;
namespace myLib{
template <class __elemT>
class myMatrix{
private:
int m;//How many columns does the matrix have
int n;//How many rows does the matrix have
__elemT **table;//The elements in the matrix
public:
myMatrix(int,int);
myMatrix(const myMatrix<__elemT> & ;
myMatrix<__elemT>& operator= (const myMatrix<__elemT>&;
myMatrix<__elemT> operator* (const myMatrix<__elemT>&;
myMatrix<__elemT> pow(const int &k);
bool setValue(vector<__elemT *> matrix);
bool setValue(int v);
void print();
~myMatrix();
};
};
#endif
#include <cstdlib>
template <class __elemT>
myLib::myMatrix<__elemT>::myMatrix(int m=0,int n=0){
assert( (m >= 0) && (n>=0) );
this->m=m;
this->n=n;
this->table=new __elemT*[this->m];
for(int i=0;i<m;i++){
this->table=new __elemT[n];
memset(this->table,0,sizeof(__elemT)*n);
}
}
template <class __elemT>
myLib::myMatrix<__elemT>::myMatrix(const myLib::myMatrix<__elemT> &in){
this->m=in.m;
this->n=in.n;
this->table=new __elemT*[in.m];
for(int i=0;i<m;i++){
this->table=new __elemT[n];
memcpy(this->table,in.table,sizeof(__elemT)*n);
}
}
template <class __elemT>
myLib::myMatrix<__elemT>::~myMatrix(){
assert( (m >= 0) && (n>=0) );
for(int i=0;i<m;i++){
delete this->table;
}
delete this->table;
}
template <class __elemT>
myLib::myMatrix< __elemT>& myLib::myMatrix<__elemT>: perator=(const myMatrix<__elemT> &in){
if(this==&in)
return *this;// identity test: if a self-assignment,
assert(this->m>=0 && this->n>=0);
for(int i=0;i<m;i++){
delete this->table;
}
delete this->table;
this->m=in.m;
this->n=in.n;
this->table=new __elemT*[m];
for(int i=0;i<m;i++){
this->table=new __elemT[n];
memcpy(this->table,in.table,sizeof(__elemT)*n);
}
return *this;
}
template <class __elemT>
bool myLib::myMatrix<__elemT>::setValue(vector<__elemT *> matrix)
{
if( this->m != matrix.size() )
{
return false;
}
for(int i = 0; i < this->m ; i++ )
{
for( int j = 0; j < this->n ; j++ ){
this->table[j] = matrix.at(i)[j];
}
}
return true;
}
template <class __elemT>
bool myLib::myMatrix<__elemT>::setValue(int v)
{
for(int i = 0; i < this->m ; i++ )
{
for( int j = 0; j < this->n ; j++ ){
this->table[j] = v;
}
}
return true;
}
template <class __elemT>
void myLib::myMatrix<__elemT>::print(){
cout<<this->table[0][0]<<endl;
/*
for(int i=0;i<this->m;i++){
for(int j=0;j<this->n;j++){
cout<<this->table[j]<<" ";
}
cout<<endl;
}*/
}
template <class __elemT>
myLib::myMatrix<__elemT>
myLib::myMatrix<__elemT>:perator * (const myLib::myMatrix<__elemT> & in)
{
assert(this->n == in.m);
myMatrix re(this->m,in.n);
for(int i=0;i<this->m;i++){
for(int j=0;j<in.n;j++){
for(int k=0;k<in.m;k++){
int t=this->table[k]*in.table[k][j]%10000;
re.table[j]=(re.table[j]+t)%10000;
}
}
}
return re;
}
//ToDo The E=M^0 is not implemented.
template <class __elemT>
myLib::myMatrix<__elemT>
myLib::myMatrix<__elemT>::pow(const int &k)
{
assert(this->m==this->n);
myLib::myMatrix<__elemT> re;
bool start=false;
for(int i=1<<30;i;i>>=1){
if(start)
re=re*re;
if(i&k)
if(start) re=re*(*this);
else {re=(*this);start=true;}
}
return re;
}
using namespace std;
using namespace myLib;
int main(){
int m=2,n=2;
vector<int *> matrix;
for(int i=0;i<m;i++){
int *t=new int[n];
for(int j=0;j<n;j++){
t[j]=1;
}
matrix.push_back(t);
}
matrix.at(1)[1]=0;
myMatrix<int> M=myMatrix<int>(m,n);
M.setValue(matrix);
int c;
while(cin>>c){
if(c==-1)
break;
if(c==0)
cout<<c<<endl;
else if(c==1)
cout<<c<<endl;
else {M.pow(c).print();}
}
for(int i=0;i<matrix.size();i++){
delete matrix.at(i);
}
} |
|
免费注册
楼主: 吴秦
发表于 2009-07-19 00:50
