#include <stdio.h> int main() { //设初始任务量为x,增速y,需要n台 //经典牛吃草问题,可以设评测机处理速度为1,不影响结果 int x,n; //由于t有小数,故用浮点型 double t; //再用数学方法解方程 t=((8.0*30)-(10*6))/(30-6); x=10*6-6*t; n=(x+10*t)/10; printf("%d",n); return 0; }
By signing up a QFNU-OJ universal account, you can submit code and join discussions in all online judging services provided by us.
Using your QFNU-OJ universal account