UVa 382 Perfection
Special case 1 = DEFICIENT
試著把一些特例抽出來做最佳化，結果反而更糟:(
所以還是回歸最一般的狀況來解了。
試著把一些特例抽出來做最佳化，結果反而更糟:(
所以還是回歸最一般的狀況來解了。
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * UVa 382 Perfection | |
| * Author: chchwy | |
| * Last Modified: 2010.01.31 | |
| */ | |
| #include<iostream> | |
| #include<cmath> | |
| int factorSum(int n) | |
| { | |
| if (n == 1) return 0; | |
| int sum = 1; //1¥²¬°¦]¼Æ | |
| int sqrt_n = sqrt(n); | |
| for (int i = 2; i <= sqrt_n; ++i) | |
| { | |
| if ( n % i == 0 ) | |
| { | |
| sum += i; | |
| sum += n / i; | |
| } | |
| } | |
| return sum; | |
| } | |
| int main() | |
| { | |
| #ifndef ONLINE_JUDGE | |
| freopen("382.in", "r", stdin); | |
| #endif | |
| puts("PERFECTION OUTPUT"); | |
| int n; | |
| while (scanf("%d", &n) == 1) | |
| { | |
| if (n == 0) break; | |
| int sum = factorSum(n); | |
| if (sum == n) | |
| printf("%5d PERFECT\n", n); | |
| else if (sum < n) | |
| printf("%5d DEFICIENT\n", n); | |
| else | |
| printf("%5d ABUNDANT\n", n); | |
| } | |
| puts("END OF OUTPUT"); | |
| return 0; | |
| } |
留言
張貼留言