794B - Cutting Carrot - CodeForces Solution


geometry math *1200

Please click on ads to support us..

Python Code:

n,h=map(int,input().split())
for i in range(1,n):print(h*(i/n)**.5)
		 				 	 		 	  		 		  		

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
  long double n, h; cin >> n >> h;
  long double del = h/2.0/n;
  for(int i = 1; i < n; i++) {
    long double l = 0, r = h;
    int ct = 0;
    while(ct < 100) {
      long double x = (l+r)/2.0;
      long double b = x/h;
      if((b*x*0.5) < (del*i*1.0)) l = x;
      else r = x;
      ++ct;
    }
    cout << setprecision(20) << fixed << l << endl;
  }

  return 0;
}

			   		   			   				  	 		  		


Comments

Submit
0 Comments
More Questions

1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+