华佗小知识
您的当前位置:首页CodeforcesRound#194(Div.2)A.CandyBags

CodeforcesRound#194(Div.2)A.CandyBags

来源:华佗小知识


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.

显示全文