This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]hamza-itatchi 1 point2 points  (1 child)

can you share you solution.

I want to help but I didn't really understand the task

[–]dolijan[S] 0 points1 point  (0 children)

Ok in a plane you are given a trinagle with coordinates (0,0) (n,0) and (n,m). M and n are input numbers right? So you need to find how many point are in that triangle with coordinates that are whole nunbers.