求爱因斯坦数学题.有一条长阶,若每步跨2阶,则最后剩1阶;若每步跨阶,
则最后剩2阶;若每步跨5阶,则最后剩4阶;若每步跨7阶,则最后正好一阶不剩.
答;
#include
int main(void)
{
int steps = 29,i = 1;
while ( steps % 7 )
{
steps = (30 * ++i) - 1;
}
printf("Total steps:%d\n",steps);
return 0;
}
这是书上的答案,我看不懂它的算法,