POJ 2488 题解

题目地址

这是地址

AC代码

#include <iostream>
#include <algorithm>
#include <cstring>


using namespace std;

int list[27][27],ans[27][27];

bool tell(int x,int y){
   
    for (int i = 1; i <= y; ++i) {
   
        for (int j = 1; j <= x; ++j) {
   
            if(list[i][j]==0)return false;
        }
    }
    return true;
}

void cmp(int x,int y){
   
    int max1 = 0,max2=0;
    for (int i = 1; i <= y; ++i) {
   
        for (int j = 1; j <= x; ++j) {
   
            if(list[i][j]>max1)max1=list[i][j];
            if(ans[i][j]>max2)max2=ans[i][j];
        }
    }
    pair<int,int>a,b;
    b.first=99,b.second=99;
    for (int k = 1; k <= max(max1,max2); ++k) {
   
        for (int i = 1; i <= y; ++i) {