# How can I find triplets faster?

by Sahil Silare   Last Updated September 11, 2019 18:20 PM - source

Given the condition $$b^2 and upper bounds of a,b and c as $$10^9,1000$$ and $$10^9$$, Is there any way I can find triplets from the given constraints?

I can't think about any process except brute force, but that doesn't seem to work here. I am looking for a combinatorics approach.

Tags :