poj 1528 Perfection

#include <iostream>#include <cmath>#define F(i,a,b) for (int i=a;i<=b;i++)using namespace std;int main(){int n;printf("PERFECTION OUTPUTn");while (cin >> n && n ){printf("%5d  ", n);if (n == 1){printf("DEFICIENTn");continue;}int sum = 1, tmn = (int)sqrt((double)n);F(i,2,tmn){if (n%i == 0)sum += i + n/i;}if (sum==n)printf("PERFECTn");elseif (sum > n)printf("ABUNDANTn");elseprintf("DEFICIENTn");}printf("END OF OUTPUTn");return 0;}