CodeForces - 1343A - Candies

最新推荐文章于 2024-11-07 23:24:07 发布

iPeach_

最新推荐文章于 2024-11-07 23:24:07 发布

阅读量416

点赞数

文章标签：算法 c++ acm竞赛

本文链接：https://blog.csdn.net/iPeach_/article/details/108371411

版权

博客详细介绍了CodeForces的一道题目，1343A - Candies。Vova发现了n个糖果包装纸，他记得每天购买的糖果数量构成一个等比数列，但忘记了基数x和天数k。题目要求找到满足条件的正整数x。博主提供了一个解决方案，通过枚举k，判断n是否能被2k-1整除，如果能则x为n/(2k-1)。

摘要由CSDN通过智能技术生成

链接：https://codeforc.es/contest/1343/problem/A

原题

Recently Vova found nn candy wrappers. He remembers that he bought x candies during the first day, 2x candies during the second day, 4x candies during the third day, ……, 2k−1x candies during the k-th day. But there is an issue: Vova remembers neither x nor k but he is sure that xx and kk are positive integers and k>1.
Vova will be satisfied if you tell him any positive integer xx so there is an integer k>1 that x+2x+4x+⋯+2k−1x=n. It is guaranteed that at least one solution exists. Note that k>1.
You have to answer tt independent test cases.
InputThe first line of the input contains one integer tt (1≤t≤104) — the number of test cases. Then tt test cases follow.
The only line of the test case contains one intege