ne ti e mozen trijagolnikot deka nema vrska pomegu 337 i 598 i triagolnikot 4 6 11 ne e mozed deka nema vrska pomegu 6 i 11( vidi ja dadenata slika od mrezata )!!!!
samo sortiraja nizata od tocki i taka ke znaes deka tockata (i+1) e desno ili dolu od tockata (i), posle najdigi koordinatite na tockite vo matricata i proveri dali se povrzani i dali se na ednakvo rastojanie!!
Given a number base B (2 <= B <= 20 base 10), print all the integers N (1 <= N <= 300 base 10) such that the square of N is palindromic when expressed in base B; also print the value of that palindromic square. Use the letters 'A', 'B', and so on to represent the digits 10, 11, and so on.
Print both the number and its square in base B.
PROGRAM NAME: palsquare
INPUT FORMAT
A single line with B, the base (specified in base 10).
SAMPLE INPUT (file palsquare.in)
10
OUTPUT FORMAT
Lines with two integers represented in base B[b]. The first integer is the number whose square is palindromic; the second integer is the square itself.
SAMPLE OUTPUT (file palsquare.out)
ama taka moze nekoi koi ne znaat da resat nekoja zadaca da gi downlodiraat site tesst primeri i samo da napravat:
if(~~~~~)cout << ~~~~~~;
else if(~~~~~)cout << ~~~~~~;
else if(~~~~~)cout << ~~~~~~;
else if(~~~~~)cout << ~~~~~~;
ako ne mozes so dinamicko, probaj so DFS ili so brute forse da gi generiras site mozni kombinacii, najgolemata slozenost ke ti bide 2^n , a bidejki n<=20 ke ti pomine na vreme(slozenosta ke bide 1050000)
Da se zgolemi brojot na zadaci vo trening!!!!!!!!!!
i zadacite vo trening da se grupirani po tezina, a ne po koga se odrzale i na koj natprevar; ili pak da se grupiraat vo poveke kategorii, na pr, tezina, koga se odrzale, na koj natprevar, spored vremenski limit, memoriski limit, nacin na resavanje(dinamicko, gridi, brute force, bfs, dfs, rekurzija..... )