Q256: Quirksome Squares

//Q256 Quirksome Squares
//Accepted 2008-04-19 12:29:19
#include <iostream>
#include <iomanip>
#include <cmath>

using namespace std;

int main(void)
{
int n, c, k = 0;
while(cin >> n)
{
c = static_cast<int>(pow(10.0, n/2));
for (int i = 0; i < c * c - 1; i++)
if (((i % c) + (i / c)) * ((i % c) + (i / c)) == i)
cout << setw(n) << setfill('0') << i << endl;
}
return 0;
}