题解 | #KiKi和酸奶#
KiKi和酸奶
https://www.nowcoder.com/practice/c7721f3a1b1a47a783974453e82cadbb
#include <stdio.h>
int main()
{
int n = 0; //n盒未打开
float h = 0; //每h分钟喝一盒
float m = 0; //经过m 分钟
scanf("%d %f %f", &n,&h,&m);
if (h <= m) //最起码能喝一盒 // 2 5 ==2.5盒
{
n=(int)(n-(m / h));
}
else { //一盒都没喝完
n = n - 1;
}
printf("%d", n);
return 0;
}
查看1道真题和解析