H - Climbing Worm解题报告（陈渊）

关注

原创最新推荐文章于 2026-03-04 00:36:17 发布 5.2k 阅读 AI 写同款· GEO 优化 ›

KG²RAG框架：知识图谱增强大模型检索生成技术解析知识图谱（Knowledge Graph）作为结构化知识表示的重要方式，与向量检索技术结合形成了新一代检索增强生成（RAG）框架。其核心原理是通过图神经网络编码器提取子图特征，并与文本向量空间对齐，实现结构化与非结构化知识的协同检索。这种技术显著提升了专业领域问答的事实准确性，在医疗诊断、金融分析等需要高可靠性响应的场景中具有重要价值。KG²RAG框架创新性地采用双通道处理架构，结合Neo4j等图数据库与Milvus向量数据库，通过动态检索调度器智能选择最优检索路径。实测表明该方案能降低40%以上的事实错误阅读详情

H - Climbing Worm

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 1049

Description

An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it slips down d inches. The process of climbing and resting then repeats. How long before the worm climbs out of the well? We'll always count a portion of a minute as a whole minute and if the worm just reaches the top of the well at the end of its climbing, we'll assume the worm makes it out.

Input

There will be multiple problem instances. Each line will contain 3 positive integers n, u and d. These give the values mentioned in the paragraph above. Furthermore, you may assume d < u and n < 100. A value of n = 0 indicates end of output.

Output

Each input instance should generate a single integer on a line, indicating the number of minutes it takes for the worm to climb out of the well.

Sample Input

Sample Output

       
        17
19

#include<iostream>
using namespace std;
int main()
{
	int n,b,u,sum=0,num=0;
	while(cin>>n>>b>>u&&n!=0&&b!=0&&u!=0)
	{
		sum=0;
		num=0;
		while(num<n)
		{
			num=num+b;
			sum++;
			if(num>=n)
				goto end;
			else
			{
				num=num-u;
				sum++;
			}
		}
		end:
		cout<<sum<<endl;
	}
	return 0;
}