#UVa：256－Quirksome Squares

照題目做完用表記錄下來，之後就把它輸出即可。

C++(0.919)

/*******************************************************/
/* UVa 256 Quirksome Squares                           */
/* Author: Maplewing [at] knightzone.studio            */
/* Version: 2014/08/21                                 */
/*******************************************************/
#include <iostream>
#include <cstdio>
using namespace std;

int main(){
  int dp[4][50], size[4] = {0};
  for( int i = 0 ; i < 10000 ; ++i ){
    for( int j = 0 ; j < 10000 ; ++j ){

      int length = 10;
      for( int k = 0 ; k < 4 ; ++k, length *= 10 ){
        if( (i+j)*(i+j) == i * length + j &&
            i / length == 0 && j / length == 0 ){
          dp[k][size[k]++] = i * length + j;
        }
      }
    }
  }

  int n;
  while( scanf( "%d", &n ) != EOF ){
    int dp_index = n / 2 - 1;
    for( int i = 0 ; i < size[dp_index] ; ++i ){
      printf( "%0*d\n", n, dp[dp_index][i] );
    }
  }

  return 0;
}