02.二維對數器

#include<iostream>
#include<cstdlib>
#include<ctime>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;

#define testtime   5000	/*測試輪數*/
#define vectorlenm 20	/*二維vector m行*/
#define vectorlenn 20	/*二維vector n列*/
#define datalen    100	/*數據長度範圍*/

void rightmethod(vector<vector<int> >&a)
{
}
void testmethod(vector<vector<int> >&a)
{
}

void print(vector<vector<int> >a)
{
	for(int i=0;i<(int)a.size();++i)
		for(int j=0;j<(int)a[0].size();++j)
			cout<<a[i][j]<<",";
}
int main()
{
    srand((unsigned)time(NULL));
    for(int j=0;j<testtime;++j)
    {
		int m = rand()%vectorlenm;
        int n = rand()%vectorlenn;
        vector<vector<int> >pre(m, vector<int>(n, 0));//原始數組
        for(int i=0;i<m;++i)
			for(int j=0;j<n;++j)
            	pre[i][j]=rand()%datalen-rand()%datalen;

        vector<vector<int> >test(pre);
        vector<vector<int> >right(pre);
        /*st此爲止三個數組創建完畢*/

        rightmethod(right);//正確解法
        testmethod(test);//測試解法

        if(right!=test)
        {
            print(pre);//打印原始數組
            while(1);
        }
    }
    cout<<"right"<<endl;
    while(1);
    return 0;
}