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.

# Project Euler #218: Perfect right-angled triangles

# Project Euler #218: Perfect right-angled triangles

Contest ends in

#### Sort by

recency

#### |

#### 104 Discussions

#### |

Please Login in order to post a comment

int main() { int q;cin>>q; while(q--)cout<<0<

Solve On your own Because it took me over 7 hours 6mins i am willing to give answer in C++ simple one. Don't waste time :)

how can i slove to optmise the time , for me one test case is sucess remaining are al failed ?? how should i slove the problem ??

how can i slove to optmise the time , for me one test case is sucess remaining are al failed ?? how should i slove the problem ??

Okay correct me if I am wrong!! A triangle is called a super perfect triangle if it satifies the below two conditions 1) If the right angled triangle is perfect 2) The area of the triangle must be a multiple of 6 and 28

In 1) itself they mentioned that to be a super perfect triangle the triangle should be perfect. And the question is "How many perfect right-angled triangles with exist that are not super-perfect?" which makes it 0 obviously.