将以下代码

    while(1)
    {
    	f[n+1] = (f[n] + f[n-1]) % m;
    	if(f[n] == 0 && f[n+1] == 1)
    	{
    		break;
		}
		n++;
	}

改为

    while(1)
    {
    	f[n+1] = f[n] + f[n-1];
    	if(f[n] % m == 0 && f[n+1] % m == 1)
    	{
    		break;
		}
		n++;
	}

就会出现WA和RE