Buying Shovels CodeForces - 1360D（数论+找因子）题意：题目：分析：AC代码：
题意：想买n个铲子，一共有k种包装，第i种包装里有i个铲子（1<=i<=k），问如何才能正好买n个铲子,要求买相同包装的，而且买的包书数最少题目：Polycarp wants to buy exactly n shovels. The shop sells packages with shovels. The store has k types of packages: the package of the i-th type consists of exactly
