Concealed Square | Project Euler | Problem #206
URL to the problem page: https://projecteuler.net/problem=206 Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “_” is a single digit. #include <iostream> using namespace std ; long long int power ( long long int a , long long int b ) { long long int result = 1 ; for ( int i = 0 ; i < b; i++) { result *= a; } return result; } int main () { long long int i, j, digits [ 19 ] = { 0 }, a, cnt, number; for (i = 1000000000 ; i <= 100000000...
