UVA 382 - Perfection UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { int n,i,j,k,l,m,sum; printf("PERFECTION OUTPUT\n"); while(scanf("%d",&n)==1) { if(n==0) break; sum=0; for(i=1;i<=n/2;i++) { if(n%i==0) sum=sum+i; printf("%d",sum); } if(sum==n) { printf("%5d PERFECT\n",n); } else if(sumhttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/382/382.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read