We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
PLEASE IF SOMEONE COULD HELP ME WITH THE BELOW CODE:::
double d=Math.sqrt((double)n);
int y=(int)d;
for(int g=(int)d;g>=3;g--)
{
int p=g*g;
if(g%2==0)
{
int v=2;
int fl=v*v;
while(fl
Project Euler #173: Using up to one million tiles how many different "hollow" square laminae can be formed?
You are viewing a single comment's thread. Return to all comments →
PLEASE IF SOMEONE COULD HELP ME WITH THE BELOW CODE::: double d=Math.sqrt((double)n); int y=(int)d; for(int g=(int)d;g>=3;g--) { int p=g*g; if(g%2==0) { int v=2; int fl=v*v; while(fl