Ruudukko

#include <iostream>
#include <fstream>
#include <stdlib.h>
#include <string>
#include <algorithm>
#include <iterator>
 
 
using namespace std;
 
int main(){
  int num;
  cin >> num;
 
  int arr[101][101];
 
  for (int x = 0; x < num; x++){
    for (int y = 0; y < num; y++){
      int smallestX = 0;
      bool Xfound = false;
      int smallestY = 0;
      bool Yfound = false;
      int arrX[101];
      int arrY[101];
      for(int i = 0; i < num; i++){
        arrX[i] = arr[i][y];
      }
      for(int i = 0; i < num; i++){
        arrY[i] = arr[x][i];
      }
      while(!Xfound){
        smallestX++;
        int *xPointer = std::find(std::begin(arrX), std::end(arrX), smallestX);
        if(xPointer == std::end(arrX)){
          Xfound = true;
        }
        if(x == 0){
          Xfound = true;
        }
      }
      while(!Yfound){
        smallestY++;
        int *yPointer = std::find(std::begin(arrY), std::end(arrY), smallestY);
        if(yPointer == std::end(arrY)){
          Yfound = true;
        }
        if(y == 0){
          Yfound = true;
        }
      }
      if(smallestY > smallestX){
        arr[x][y] = smallestY;
      }else{
        arr[x][y] = smallestX;
      }
 
    }
  }
 
  for(int x2 = 0; x2 < num; x2++)
  {
    for(int y2 = 0; y2 < num; y2++)
    {
          cout<<" "<<arr[x2][y2]<<" ";
    }
    cout<<"\n";
  }
 
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER