UVA294 - Divisors
2015-03-08 20:43
405 查看
用j*j==i 来降低复杂度
#include<stdio.h> int main(){ int T; scanf("%d",&T); while(T--){ int a, b; scanf("%d %d",&a,&b); int best=0,num=0,i,j; for(i =a; i<=b; i++){ int num_i=0; for(j = 1;j*j<=i ;j++){ if(i%j==0) num_i+=2; } if((j-1)*(j-1)==i) num_i--; if(num_i>num) best=i,num=num_i; } printf("Between %d and %d, %d has a maximum of %d divisors.\n",a,b,best,num); } return 0; }
相关文章推荐
- uva 294 ——Divisors
- UVA 294(p344)----Divisors
- UVa 294 - Divisors
- UVa 294 Divisors
- uva 294 divisors
- UVA 294 Divisors(唯一分解定理 + 除数函数)
- UVa 294-Divisors
- UVa 294 (因数的个数) Divisors
- UVA 294 - Divisors 因子个数
- uva294 Divisors
- 习题10-9 UVA 294 Divisors(约数)
- UVA 294 294 - Divisors (数论)
- UVA 294 Divisors( 因子分解)
- uva 294 Divisors 求因子个数
- UVa294 - Divisors
- Divisors UVA - 294
- UVa294 Divisors
- UVa 294 Divisors
- UVa 294 - Divisors
- UVa 294 - Divisors