MrImmortal09 / GitGrindGDSC

0 stars 2 forks source link

solved Codeforces problem 610A issue #5 #6

Closed ArshiaAdhya closed 11 months ago

ArshiaAdhya commented 11 months ago

Applied basic combinatorics to find whether a particular integral division is possible or not. First, divided the total length of the stick by 2, stored it in a variable m, and ran a for loop to increment a count variable for every pair of unequal positive integers that added up to m. Lastly, the output is actually the value of the count variable divided by 2, keeping in mind the repetitions that have occurred in the for loop.