GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Max rope cutting
Submit Your Solution :- Click Here
Solution :-
#include<iostream>
using namespace std;
long long Max_rope_cutting(int ) ;
int main()
{
int t,no ;
long long ans ;
cin>>t ;
while(t--)
{
cin>>no ;
ans=Max_rope_cutting(no) ;
cout<<ans<<endl ;
}
return 0;
}
long long Max_rope_cutting(int no)
{
long long multi=1 ;
if(no==1||no==2||no==3)
return no-1 ;
while(no>4)
{
no=no-3 ;
multi=multi*3 ;
}
multi=multi*no ;
return multi ;
}
Output:-
0 Comments: