CodeForces-460A-Vasya And Socks
2014-10-28 19:05
387 查看
A. Vasya and Socks
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Vasya has n pairs of socks. In the morning of each day Vasya has to put on a pair of socks before he goes to school. When he comes home in the
evening, Vasya takes off the used socks and throws them away. Every m-th day (at days with numbersm, 2m, 3m, ...)
mom buys a pair of socks to Vasya. She does it late in the evening, so that Vasya cannot put on a new pair of socks before the next day. How many consecutive days pass until Vasya runs out of socks?
Input
The single line contains two integers n and m (1 ≤ n ≤ 100; 2 ≤ m ≤ 100),
separated by a space.
Output
Print a single integer — the answer to the problem.
Sample test(s)
input
output
input
output
Note
In the first sample Vasya spends the first two days wearing the socks that he had initially. Then on day three he puts on the socks that were bought on day two.
In the second sample Vasya spends the first nine days wearing the socks that he had initially. Then he spends three days wearing the socks that were bought on the third, sixth and ninth days. Than he spends another day wearing the socks that were bought on
the twelfth day.
想法:解此题时没有用到特别的数学算法,通过do while循环,按照正常的逻辑顺序进行循环,求得答案,过程较为直观明了,因为第一天肯定有袜子穿,接着袜子数-1,若是m的倍数天,则又会新添一双袜子。
!重点在于第一次循环一定会通过
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Vasya has n pairs of socks. In the morning of each day Vasya has to put on a pair of socks before he goes to school. When he comes home in the
evening, Vasya takes off the used socks and throws them away. Every m-th day (at days with numbersm, 2m, 3m, ...)
mom buys a pair of socks to Vasya. She does it late in the evening, so that Vasya cannot put on a new pair of socks before the next day. How many consecutive days pass until Vasya runs out of socks?
Input
The single line contains two integers n and m (1 ≤ n ≤ 100; 2 ≤ m ≤ 100),
separated by a space.
Output
Print a single integer — the answer to the problem.
Sample test(s)
input
2 2
output
3
input
9 3
output
13
Note
In the first sample Vasya spends the first two days wearing the socks that he had initially. Then on day three he puts on the socks that were bought on day two.
In the second sample Vasya spends the first nine days wearing the socks that he had initially. Then he spends three days wearing the socks that were bought on the third, sixth and ninth days. Than he spends another day wearing the socks that were bought on
the twelfth day.
想法:解此题时没有用到特别的数学算法,通过do while循环,按照正常的逻辑顺序进行循环,求得答案,过程较为直观明了,因为第一天肯定有袜子穿,接着袜子数-1,若是m的倍数天,则又会新添一双袜子。
!重点在于第一次循环一定会通过
#include<iostream> using namespace std; int main() { int m, n, x = 0; cin >> n >> m; do { x++; n--; if (x%m == 0) n++; } while (n); cout << x; return 0; }
相关文章推荐
- Problem--460A--Codeforces--A. Vasya and Socks
- 460A - Vasya and Socks
- codeforces水题100道 第十五题 Codeforces Round #262 (Div. 2) A. Vasya and Socks (brute force)
- CodeForce 460A :Vasya and Socks
- CodeForces 460 A. Vasya and Socks(379A.New Year Candles)
- CodeForces 354A - Vasya and Robot 简单思维..赋初值一定不能随便了T_T
- Codeforces 780A-Andryusha and Socks
- (尺取法)Codeforces 676C - Vasya and String
- 【codeforces 782A】Andryusha and Socks
- CF460 A. Vasya and Socks
- 460 A. Vasya and Socks
- 【Codeforces Round 262 (Div 2)A】【水题】Vasya and Socks 妈妈买袜子 最多穿几天
- Codeforces 355C Vasya and Robot【贪心+前缀和】
- Codeforces 584 C. Marina and Vasya (Codeforces Round #324 (Div. 2))
- Codeforces 782 Andryusha and Socks
- [思路题] Codeforces 354C #206 (Div. 1) C. Vasya and Beautiful Arrays
- Codeforces 676 C. Vasya and String
- codeforces 354C C. Vasya and Beautiful Arrays( 数论+枚举)
- Codeforces 676C - Vasya and String 详解(二分前缀和+尺取两种写法)
- Codeforces A. Vasya and Socks