UVA Fractions Again?! UVA - 10976
2017-01-20 11:21
316 查看
#include <stdio.h> int main(void) { int n, x, y; int a[10000], b[10000]; while(scanf("%d", &n) != EOF){ int count = 0; for(y = n + 1; y <= 2 * n; y ++){ if((n * y) % (y - n) == 0){ x = (n * y) / (y - n); a[count] = x; b[count] = y; count++; } } printf("%d\n", count); int i; for(i = 0; i < count; i++) printf("1/%d = 1/%d + 1/%d\n", n, a[i], b[i]); } return 0; }
反省:读题认真一些!!
相关文章推荐
- UVa 10976 Fractions Again?
- UVA-10976 Fractions Again?!
- UVa10976-Fractions Again?!(枚举)
- UVa--10976 Fractions Again(枚举)
- [Day Zero] 7.1-3 分数拆分 (Fractions Again?!,UVa 10976)
- uva 10976 - Fractions Again?!
- UVA 10976 - Fractions Again?!
- UVA 10976-Fractions Again?!
- UVA 10976(p183)----Fractions Again?!
- UVA10976-Fractions Again?!
- (暴力枚举) UVa 10976 Fractions Again?!
- UVA 10976:Fractions Again?!
- Uva10976——Fractions Again?!
- UVa 10976 - Fractions Again?!
- UVa 10976 Fractions Again?!
- 分数拆分( Fractions Again, UVA 10976)-ACM
- UVA10976 Fractions Again?!
- UVA-10976 Fractions Again?!
- Fractions Again?! -UVA 10976