Thursday, 9 February 2017

Geeksforgeeks Solution For " The Lazy Caterer’s Problem "

GeeksforGeeks Solution For School Domain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard .You Can Also Direct Submit Your Solution to Geeksforgeeks Same 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:-

Geeksforgeeks Solution For " The Lazy Caterer’s Problem "

No comments:
Write comments

Recommended Posts × +