HDU 1049 Climbing Worm

xiaoxiao2021-02-28  14

#include <iostream> using namespace std; int main() { int i,j,k,n,m,t; while(cin>>i>>j>>k){ if(i==0&&j==0&&k==0) break; int t=((i-k-1)/(j-k))*2+1; cout<<t<<endl; } return 0; }
转载请注明原文地址: https://www.6miu.com/read-2630559.html

最新回复(0)