Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

func nextFloat64() (float64, error) {
	return strconv.ParseFloat(nextString(), 64)
}

func main() {
	scanner.Split(bufio.ScanWords)

	for {
		var s int
		var w, h float64
		_, err := fmt.Scanf("%d,%f,%f", &s, &w, &h)

		if err != nil {
			break
		}

		if w/(h*h) >= 25 {
			fmt.Println(s)
		}
	}
}

C++: #include <cstdio>
#include <vector>
#include <map>
using namespace std;

double IMB(double w,double t){
	return w/t*t;
}

int main(){
	int No;
	double w,t;
	vector<int> vc;
	map<int,double> f;

	while( ~scanf("%d,%lf,%lf", &No , &w , &t ) ){
		//printf("%d %f %f\n" , No , w , t );
		//if( No == -1 ) break;
		vc.push_back( No );
		f[ No ] = IMB( w, t );
	}
	for(int i=0 ; i<vc.size() ; ++i )
		if( f[i] >= 25.0 )
			printf("%d\n", i );
}

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

int main(){

  int num;
  double w,h;

  while(scanf("%d,%lf,%lf",&num,&w,&h)!=EOF){
    if(w/(h*h)>=25.0)cout << num << endl;
  }

  return 0;
}

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

int main(){
	int num;
	char c;
	double w, h, bmi;
	pair<int, double> p;
	while(cin >> num >> c >> w >> c >> h){
		bmi = w / (h*h);
		p.first = num;
		p.second = bmi;

		if(p.second >= 25) cout << p.first << endl;
	}
}

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

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)

int main()
{
  int s;
  double w, l;

  while (scanf("%d,%lf,%lf", &s, &w, &l) != EOF){
    if (w / (l * l) >= 25.0) cout << s << endl;
  }
}

C++: #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

int main() {
	int no;
	double w, h;
	while (scanf("%d,%lf,%lf", &no, &w, &h) != EOF) {
		if ((w / pow(h, 2)) >= 25.0)
			cout << no << endl;
	}
	return 0;
}

C++: //56
#include<iostream>

using namespace std;

int main(){
  int sn;
  double w,h;
  while(((cin>>sn).ignore()>>w).ignore()>>h){
    if(w/h/h>=25){
      cout<<sn<<endl;
    }
  }
  return 0;
}

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

using namespace std;

int main(void)
{
	int num;
	double weight, height, bmi;
	
	while( cin >> num >> weight >> height ){
		bmi = weight / (height * height);
		
		if(bmi >= 25)
		cout << num << endl;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int n;
	while(cin >> n, !cin.eof())
	{
		double hg, wg;
		char c;
		cin >> c;
		cin >> wg;
		cin >> c;
		cin >> hg;
		
		if( wg / (hg*hg) >= 25.0 )
			cout << n << endl;
	}
	
	return 0;
}

C++: float w,h;main(n,a){for(;~scanf("%[^,],%f,%f ",a,&w,&h);)w<24*h*h||puts(a);}

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

int main() {
	int s;
	double w, h;
	char t;

	vector<int> v;
	while (cin >> s) {
		cin >> t >> w >> t >> h;

		if (w / (h * h) >= 25) v.push_back(s);
	}

	for (int var : v) {
		cout << var << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
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

#define INF 1000000000

typedef long double Real;
#define EPS 1e-11
#define EQ(x) (-EPS<x && x<EPS)
typedef complex<Real> P;
Real dot(P a,P b){return real(conj(a)*b);}
Real cross(P a,P b){return imag(conj(a)*b);}

int main(){
  int a;
  float b,c;
  while(~scanf("%d,%f,%f",&a,&b,&c)){
    float bmi = b/c/c;
    if(bmi>=25-1e-12){
      cout<<a<<endl;
    }
  }
  return 0;
}

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

int main() {
	int s; double w, h;
	while (scanf("%d,%lf,%lf",&s, &w, &h) != EOF) {
		if (w / h / h > 25) cout << s << endl;
	}
}

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

using namespace std;

int main() {
	vector<int> ans;
	int a;
	float b,c;
	while(scanf("%d,%f,%f",&a,&b,&c) != EOF){
		if((b/(c*c)) >= 25){
			ans.push_back(a);
		}
	}
	for(int i=0; i<ans.size(); i++){
		cout<<ans[i]<<endl;
	}
	return 0;
}

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

using namespace std;
#define rep2(x,from,to) for(int x = (from); x < (to); ++(x))
#define rep(x,to) rep2(x,0,to)
int main() {
	int n;
	double w, h;
	char a, b;
	while(cin >> n >> a >> w >> b >> h) {
		if(w/pow(h,2.0) >= 25) cout << n << endl;
	}
	return 0;
}

C++: #include<stdio.h>

int main(){
	int l,i=0;
	double m,n;
	while(scanf("%d,%lf,%lf",&l,&m,&n)!=EOF){
		if(25.0<=m/(n*n)){printf("%d\n",l);i++;}
	}
	if(i==0)printf("????????????\n");
		return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
	int a=0;
	double b,c;
	while((scanf("%d,%lf,%lf",&a,&b,&c)) != EOF){
		if(b/(c*c) >= 25)
			cout << a << endl;
	}
}

C++: #include<iostream>
#include<iomanip>
#include<sstream>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<numeric>

using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define repc(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto n :(array))

typedef long long ll ;
typedef vector<int> vi ;
typedef vector<ll> vl ;
typedef map<string,int> dict;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
double eps = 1e-10 ;

template <typename T>
void out(vector < T > v)
{
  for(size_t i = 0; i < v.size(); i++)
  {
    debug(v[i]);
  }
}

template<typename T>
string ntos( T i ) {
  ostringstream s ;
  s << i ;
  return s.str() ;
}

template<typename T>
T ston(string str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int num;
  char a;
  double wei, hei;
  while(cin >> num >>a >> wei >> a >> hei){
    if(wei/(hei*hei) >= 25){
      cout << num << endl;
    }
  }
  return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

int main() {
	char d;
	int a; double  b, c;
	while (cin >> a >> d >> b >> d >> c) {
		double bmi = b / c / c;
		if (bmi >= 25)cout << a << endl;
	}
	return 0;
}

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

int main(void){
	vector<int> num;
	int n;
	double w;
	double h;
	double bmi;

	while(scanf("%d,%lf,%lf", &n, &w, &h) != EOF){
		bmi = w/(h*h);
		if(bmi >= 25) num.push_back(n);
	}

	for(int i=0; i<num.size(); i++){
		printf("%d\n", num[i]);
	}
	
	return 0;
}

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

int main()
{
	int n;
	char c1,c2;
	double w,h;
	while(cin >> n >> c1 >> w >> c2 >> h)
	{
		if(25.0 <= w/(h*h))
		{
			cout << n << endl;
		}
	}
	return 0;
}