GeeksforGeeksSolution ForSchoolDomain .Below You Can Find The Solution OfBasic ,Easy ,Medium ,Hard.You Can Also Direct Submit Your Solution toGeeksforgeeksSame Problem .You Need to login then you can submit you answers

**Problem :-**Given an integer N, denoting the number of cuts that can be made on a pancake, find the maximum number of pieces that can be formed by making N cuts.

**Submit Your Solution :-**

**Click Here**

**Solution :-**

**#include <iostream>**

#include <math.h>

using namespace std;

int main()

{

int t;

cin>>t;

while(t--)

{

int n,p;

cin>>n;

p=(pow(n,2)+n+2)/2;

cout<<p<<endl;

}

return 0;

}

**Output:-**

## 0 Comments: