Go: package main

import (
        "fmt"
        "math"
)

func main() {
        var v, t, h float64
        for {
                _, err := fmt.Scanf("%f", &v)
                if err != nil {
                        break
                }
                t = v / 9.8
                h = 4.9 * t * t
                n := math.Floor(h/5+1.0) + 1.0
                fmt.Printf("%d\n", int(n))
        }
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <functional>
#include <sstream>
#include <complex>
#include <climits>
using namespace std;

#define REP(i,a,n) for(int i=(a);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define EPS 1e-8

/*
	N = 5*(N - 1)
	1 = 0
	2 = 5
	v = 9.8t
	y = 4.9t^2
	y = 4.9(v/9.8)^2 = 4.9 * (v^2 / (9.8)^2 )
*/
int main(){
	double v;
	while(~scanf("%lf",&v)){
		printf("%d\n",(int)(ceil((4.9*v*v/9.8/9.8)/5.0)+EPS)+1);
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
long double v,n;
long long int N;
while(cin>>v)
{
n=(4.9*((v/9.8)*(v/9.8)))/5+1;
N=n*100000000000000;	
if(N%100000000000000==0)
{
	cout<<N/100000000000000<<endl;
}
else if(N%100000000000000!=0)
{
	cout<<N/100000000000000+1<<endl;
}
}
return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
	double n;
	while(scanf("%lf",&n)!=EOF){
	for(int i=1;i<=10009;i++){
	int y=i*5-5;
	double t=sqrt((double)y/4.9);
	if(t*9.8>=n){cout<<i<<endl;break;}
	}
	}
	return 0;
}

C++: //06
#include<iostream>
#include<cmath>

using namespace std;

int main(){
  for(double m;cin>>m;){
    cout<<ceil((4.9/9.8/9.8*m*m+5)/5)<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;

int main(){
  double min;
  double t,y;
  int i;

  while( cin>>min ){
    t = min/9.8;
    y = 4.9*t*t;

    i=0;
    while( y > 5*i-5 ) i++;
    cout << i << endl;
  }

  return 0;
}

C++: #include <cstdio>
#include <cmath>

using namespace std;

bool testcase_ends() {
    double v;
    if (scanf("%lf", &v) == EOF) return 1;

    int N;
    for (N=1; v>9.8*sqrt(5*(N-1)/4.9); ++N);

    printf("%d\n", N);
    return 0;
}

int main() {
    int solved=0;
    while (!testcase_ends())
        ++solved;

    return !solved;
}

C++: #include <iostream>
using namespace std;

int main(){
	double v,y,n;
	double t=0;
	while(cin >> n){
		for(t=1;t*9.8<n;t++);
		t = t*t*4.9/5.0;
		if(t<1)cout << 1 << endl;
		else cout << (int)t << endl;
	}
}

C++: #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

#include <array>

using namespace std;

int main ()
{
	double x;
	while( cin >> x )
	{
		cout <<(int) ( pow ( x  , 2.0 )/(2*9.8) + 5 +5-(1e-19)) / 5 << endl;
	}
}

C++: #include <stdio.h>
#include<math.h>
using namespace std;
 
int main(){
    double v,N;
 
    while(scanf("%lf",&v)!=EOF){
        for(int N=0;;N+=1){
            if(N >= (v*v+98)/98){
                printf("%d\n",(int)N);
                break;
            }
        }
    }
 
    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <math.h>

using namespace std;

int main(void){
    double v;
    
    while (cin>>v)
    {
        double n,k;
        n = (4.9*(v/9.8)*(v/9.8)+5)/5;
        k=n-(int)n;
        if(0==k);
        else {n++;}
        cout<<n<<endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main() {

  double v;
  while(cin >> v) {
  double t = v/9.8;
  double y = 4.9*t*t;
  int n = 0;
  while(1) {
    if(y < 5*n-5) break;
    n++;
  }
  cout << n  <<endl;
  }

  return 0;
}

C++: #include<iostream>
#include<math.h>
using namespace std;

int main(){
	double limit;
	double t;
	double y;
	double n;
	while(cin >> limit){
		t = limit / 9.8;
		y = 4.9 * t * t;
		n = ceil(y/5.0+1.0);
		cout << n << endl;
	}
	return 0;
}

C++: #include<stdio.h>
int main(){
	double v;
	while(~scanf("%lf",&v)){
		double t,x;
		t=v/9.8;
		x=4.9*t*t;
		for(int n=408;n>=0;n--){
			if(x>(n*5)){
				printf("%d\n",(n+2));
				break;}}}
	return 0;}

C++: #include<iostream>
#include<math.h>
using namespace std;

int main(){
	double limit;
	double t;
	double y;
	double n;
	while(cin >> limit){
		t = limit / 9.8;
		y = 4.9 * t * t;
		n = (int)ceil(y/5.0+1.0);
		cout << n << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <cmath>


using namespace std;

int main(){
  double minv;
  while(cin >> minv){
    double y = 4.9*pow((minv/9.8), 2.0);
    int N = 1;
    while(true){
      if(y <= 5*N-5){
	break;
      }
      N++;
    }
    cout << N << endl;
  }
}

C++: #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;

int main()
{
    int N;
    double v,g=9.8,t;
    while(cin >> v){
        t=v/g;
        for(N=1 ;; N++){
            if(N*5-5 > 1.0/2.0*g*t*t){
                break;
            }
        }
        cout << N << endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main() {
	double v;
	while(cin>>v){
		double t=v/9.8;
		double y=4.9*t*t;
		for(int i=1;;i++){
			if(y>5*(i-1)-5&&y<5*i-5){ 
				cout<<i<<endl; break;
			}
		}
	}
	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;


int main(){
	double a;
	while(cin >> a){
		double i = 1;
		while(1){
			double h =((a*a)/19.6);
			double y = (5*i-5);
			if(y >= h)break;
			i++;
		}
		cout << i<<endl;

	}
		return 0;

}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
	double n;
	while(scanf("%lf",&n)!=EOF){
	for(int i=1;i<=10009;i++){
	int y=i*5-5;
	double t=sqrt((double)y/4.9);
	if(t*9.8>=n){cout<<i<<endl;break;}
	}
	}
	return 0;
}

C++: #include <stdio.h>
#include <math.h>

int height(int n){
	return 5*n-5;
}

int rheight(double h){
	return (int)ceil(h / 5 + 1);
}

int main(void){
	double v = 0.0;
	double t, y;
	while(scanf("%lf", &v) != EOF){
		y = v * v / 9.8 / 2;
		printf("%d\n", rheight(y));
	}
	return 0;
}