### sntmessages's blog

By sntmessages, 9 years ago,

i have some doubt about this problem. it is written in the problem statement that "Vova needs the pipeline to have exactly n pipes with flowing out water."

considering this statement the answer for test case : 21 8 is '-1' . since for k=8 number of pipes can be 1,8,14,19,23,26,28,29 and it is written that pipeline should have exactly n pipes with flowing out water, therefore, 21 cant be possible.

i have run custom test and it is showing me o/p as '4'. am i missing something? please help.

• 0

 » 9 years ago, # |   0 You can take the 8-way, 7-way, 6-way, and 3-way splitters to get 21 pipes in total.
•  » » 9 years ago, # ^ |   0 you are right..thank you
 » 11 days ago, # | ← Rev. 2 →   0 `long long n,k,mid,x,c,ans; cin>>n>>k; long long total=((k*(k-1))/2)+1; long long low=0,high=k-1; if(total=n) { ans=min(mid,LLONG_MAX); high=mid-1; } else { low=mid+1; } } cout<