NYOJ 216-A problem is easy
2012-08-03 08:01
204 查看
#include<stdio.h> #include<math.h> int main() { int i,m,n,k,t; scanf("%d",&n); while(n--) { scanf("%d",&m); t=sqrt(m+1); for(i=2,k=0;i<=t;i++) if((m+1)%i==0) k++; printf("%d\n",k); } return 0; }
相关文章推荐
- nyoj-216-A problem is easy
- NYOJ 题目216 A problem is easy【推数学公式】
- [原]NYOJ-216-A problem is easy
- NYOJ-216 A problem is easy
- [原]NYOJ-216-A problem is easy
- NYOJ-216-A problem is easy-2013年10月17日13:57:33
- NYOJ-216-A problem is easy
- NYOJ 216-A problem is easy
- nyoj 216 A problem is easy
- NYOJ 216 A problem is easy
- nyoj-216-A problem is easy
- NYOJ 216 A problem is easy
- nyoj 216 A problem is easy
- NYOJ 216 A problem is easy
- nyoj_216_A problem is easy_201312051117
- NYOJ-216-A problem is easy
- NYOJ216 A problem is easy
- NYOJ216--A problem is easy【数学】
- NYOJ216 A problem is easy
- NYOJ 题目216 A problem is easy