UVA 12149 - Feynman UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { long n,i,m,s; while(scanf("%ld",&n)==1) { if(n==0) break; i=1; s=0; m=0; while(i<=n) { m=i*i; s+=m; i++; } printf("%ld\n",s); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/12149/12149.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