当前位置:Gxlcms > mysql > CodeforcesRound#194(Div.2)A.CandyBags

CodeforcesRound#194(Div.2)A.CandyBags

时间:2021-07-01 10:21:17 帮助过:30人阅读

Gerald has n younger brothers and their number happens to be even. One day he bought n 2 candy bags. One bag has one candy, one bag has two candies, one bag has three candies and so on. In fact, for each integer k from 1 to n 2 he has exac

Gerald has n younger brothers and their number happens to be even. One day he bought n2 candy bags. One bag has one candy, one bag has two candies, one bag has three candies and so on. In fact, for each integer k from 1 to n2 he has exactly one bag with kcandies.

Help him give n bags of candies to each brother so that all brothers got the same number of candies.

人气教程排行