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