NumPy numerical calculationLazy frog

最新推荐文章于 2024-09-23 20:52:09 发布

本可奈何

最新推荐文章于 2024-09-23 20:52:09 发布

阅读量141

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/qq_40165417/article/details/89222795

版权

算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

NumPy numerical calculationLazy frog

Time Limit: 1000 MS Memory Limit: 65536 K

NumPy数值计算Description
There was once a frog who live in the depth of the unknown wells, one day he wanted to walk out. But he was lazy, climb three meters daytime and night will fall two meters.
If given the well depth x, you calculate the number of days after the frog from the well out.
Input
Input a series of test data.
Each line including a integer x (x<=1000)…
Output
Output there is an integer representing the number of days required.
Sample Input
3
2
4
Sample Output
1
1
2

代码:

#include<stdio.h>
int main()
{
	int x;
	int day=0;
	scanf("%d",&x);
	while(x>0)
	{
		x=x-3;
		day++;
		if(x>0)
		{
			x=x+2;
		}
	}
	printf("%d",day);
	return 0;
 }