#include<cstdio> using namespace std; const int MOD = 1e9 + 7; int dp[1010]; int main(){ int t = 1,n; dp[1] = 1; for(int i = 2;i < 1001;i++){ for(int j = 1;j < i;j++){ if((i - 1) % j == 0){ dp[i] = (dp[i] + dp[j]) % MOD; } } } while(scanf("%d",&n) == 1){ printf("Case %d: %d\n",t++,dp[n]); } }
uva 1645
猜你喜欢
转载自blog.csdn.net/sky_zdk/article/details/79456620
今日推荐
周排行