Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"fmt"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		a, _ := strconv.ParseFloat(scanner.Text(), 64)
			t := a/9.8
			x := t*t*4.9
			fmt.Printf("%d\n", int(x))
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

int main()
{
    double v;
    while (cin >> v) {
        cout << (int)(v * v / 98 + 2) << endl;
    }        
    return 0;
}

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

using namespace std;

int main(void)
{
	double v, y, t, h, n;
	
	while(cin >> v){
		t = v / 9.8;
		y = 4.9 * t * t;
		n = (y + 5) / 5;
		n = (int) (ceil (n) );
		cout << n << endl;
	}
	
	return 0;
}

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

using namespace std;

int main()
{
        double v;

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

        return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ld = long double;
const ld eps = 1e-8;

int main()
{
	ld v;
	while (cin >> v) {
		cout << ((int)floor(v * v / 19.6 - eps) + 4) / 5 + 1 << endl;
	}
	return 0;
}

C++: import java.util.*;class Main{public static void main(String[]g){float t,s,v;for(Scanner S=new Scanner(System.in);S.hasNext();System.out.printf("%d\n",(int)(4.9*t*t-5)/5))for(t=0,s=0,v=S.nextFloat();s<=v;t++)s+=9.8;}}

C++: #include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>

using namespace std;

int main(void)
{
    double v;
    while(cin>>v) {
        double t = v / 9.8;
        double y = 4.9 * t * t;
        double n = (y+5) / 5;
        printf("%d\n", (int)(n + 1));
    }

    return 0;
}

C++: #include<iostream>
#include<cmath>
using namespace std;
double s;
int main() {
	while (cin >> s) {
		cout << (int)((pow((1.0*s / 9.8), 2)*4.9) / 5) + 2 << endl;
	}
}

C++: // -*- coding: utf-8 -*-
// Last-Updated : <2014/06/19 00:38:29 by samui>

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#define MP(a, b) make_pair(a, b)
#define X first
#define Y second
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); ++(i))
#define rer(i,l,n) for(int (i) = l; (i) <= (int)(n); ++(i))
#define reu(i,l,n) for(int (i) = l; (i) < (int)(n); ++(i))
template<typename T,typename U> inline void amin(T &x,U y){ if(y<x) x = y;}
template<typename T,typename U> inline void amax(T &x,U y){ if(x<y) x = y;}
template<typename TYPE,std::size_t SIZE>
std::size_t len(const TYPE (&array)[SIZE]){return SIZE;}
void abc(float x);
int main(int argc, char *argv[])
{
  float a;
  while(std::cin>>a){
    abc(a);
  }
  return 0;
}
void abc(float x)
{

  float t = x/9.8;
  float y = t*t*4.9;;
  float ans = int((y+5)/5);
  float a = (y+5)/5-ans;
  if(a>0)
    ans++;
  std::cout<<ans<<std::endl;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  int n;
  cin>>n;
  while(n--){
    double xa,ya,xb,yb;
    double ra,rb;
    cin>>xa>>ya>>ra;
    cin>>xb>>yb>>rb;
    double dist = sqrt((xb-xa)*(xb-xa)+(yb-ya)*(yb-ya));
    if(dist > ra+rb){
      cout<<0<<endl;
    }else if(dist+rb < ra){
      cout<<2<<endl;
    }else if(dist+ra < rb){
      cout<<-2<<endl;
    }else{
      cout<<1<<endl;
    }
  }
  return 0;
}

C++: #include <cstdio>

using namespace std;

int main()
{
	// v = 9.8t y = 4.9t^2
	
	double t,y,x;
	int n;
	
	while(scanf("%lf", &x) != EOF){
	
		t = x / 9.8;
		y = 4.9 * t * t;
		
		n = y;
		
		n += 5;
		n = n / 10 * 10;
		n += 10;
		n /= 5;
		printf("%d\n", n);
	}
	return(0);
}

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

main()
{
  long double v,floar;
  int    i=0;

  while( scanf("%Lf",&v)!=EOF || i<50){
    floar = (v*v/98) + 1;
    if((floar-(int)floar) > LDBL_EPSILON){
      floar++;
    }
    printf("%d\n", (int)floar);
    i++;
  }

  return 0;
}

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

int main(){
	while(true){
		int floor = 1;
		double vc;
		cin >> vc;
		if(cin.eof()) break;
		for(floor;vc*vc>19.6*(5*(double)floor-5);floor++) ;
		cout << floor << endl;
	}
	return 0;
}

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

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

C++: #define scanf_s scanf
//#define gets_s gets
#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
using namespace std;
#define MAX 50//00
#define MIN -100001
#define _MAX 100
#define g 9.8
#define d 4.9
int main(void)
{
	int ans;
	double v, y, a, t;
	while (scanf_s("%lf", &a) != EOF) {
		t = a / g;
		y = d * t * t;
		ans = y / 5;
		if (y > ans * 5) ++ans;
		printf("%d\n", ans + 1);
	}
}

C++: // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve

int main(int argc, char const* argv[])
{
  double v;
  while(cin >> v){
    double t = v / 9.8;
    double y = 4.9 * t * t;
    ll n = (y + 5.0) / 5;
    if(5 * n - 5 < y)n++;
    cout << n << endl;
  }
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int main()
{
	double v;
	while(cin >> v)
		cout << ceil((4.9 * pow(v / 9.8, 2.0) + 5) / 5) << endl;	
}

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

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

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

int main(){
	float v, h;
	int n, a;
	while (true){
		cin >> v;
		if (cin.eof()) { break; }
		h = v * v / 19.6;
		for (n = 0;;n++){
			a = 5 * n - 5;
			if (a >= h) { break; }
		}
		cout << n << endl;
	}
	return 0;
}