求愛因斯坦數學題.有一條長階,若每步跨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;
}
這是書上的答案,我看不懂它的算法,