Jump to content

CleanUp Lines


patis

Recommended Posts

Hi, It was solved by using neighbourcount :)  Thank you!

 

int primPoints[] = primpoints(0,@primnum);

foreach( int point; primPoints)

{

int neighbourcount = neighbourcount(0,point);

if (neighbourcount>2)removeprim(0,@primnum,0);

}

Edited by patis
Link to comment
Share on other sites

On 12/8/2020 at 3:19 PM, patis said:

Hi, It was solved by using neighbourcount :)  Thank you!

 

int primPoints[] = primpoints(0,@primnum);

foreach( int point; primPoints)

{

int neighbourcount = neighbourcount(0,point);

if (neighbourcount>2)removeprim(0,@primnum,0);

}

shouldn't the test be neighbourcount>1 ?

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...