Codeforces Round #262 (Div. 2)460A. Vasya and Socks(简单数学题)
题目链接:http://codeforces.com/contest/460/problem/A
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 numbers m, 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?
InputThe single line contains two integers n and m (1 ≤ n ≤ 100; 2 ≤ m ≤ 100), separated by a space.
OutputPrint a single integer — the answer to the problem.
Sample test(s) input2 2output
3input
9 3output
13Note
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.
代码例如以下:
//#pragma warning (disable:4786) #include <cstdio> #include <cmath> #include <cstring> #include <string> #include <cstdlib> #include <climits> #include <ctype.h> #include <queue> #include <stack> #include <vector> #include <utility> #include <deque> #include <set> #include <map> #include <iostream> #include <algorithm> using namespace std; const double eps = 1e-9; #define INF 1e18 //typedef long long LL; //typedef __int64 LL; int main() { int n, m; while(~scanf("%d%d",&n,&m)) { int i, j; int sum = 0; int tt = 0; for(i = n,j = 1; i > 0; j++,i--) { if(j%m == 0) i++; sum++; } printf("%d\n",sum); } return 0; }
- Codeforces Round #262 (Div. 2)460A. Vasya and Socks(简单数学题)
- codeforces #230 (Div. 2) B(简单数学)
- Codeforces #262 (Div. 2) B. Little Dima and Equation(数学:简单)
- Codeforces Round #188 (Div. 2) / 318A Even Odds(简单数学)
- Codeforces Round #426 (Div. 2) C. The Meaningless Game(简单数学)
- Codeforces Round #239 (Div. 2) C. Triangle(简单数学+暴力)
- Codeforces Round #387 (Div. 2)A. Display Size(简单数学)
- Codeforces Round #327 (Div. 2) (A. Wizards' Duel 简单数学)
- Codeforces Beta Round #92 (Div. 2) / 124A The number of positions (简单数学)
- SGU - 105 - Div 3 (简单数学题!)
- 对DIV的一些简单控制
- 简单一道数学题 剿灭100%垃圾邮件
- 有一道十分简单的数学题,但是我就是没想出来,不得以发在首页求助
- 数学之美系列五 -- 简单之美:布尔代数和搜索引擎的索引(转载)
- 对DIV的一些简单控制
- 数学之美 系列五 简单之美:布尔代数和搜索引擎的索引
- 数学之美系列之五:简单之美--布尔代数和搜索引擎的索引
- 一道简单数学题!10人有11个人算错!!
- js实现DIV的一些简单控制
- 最简单的方法解决div被select遮挡的问题