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<stdio.h>

int main(){

double y,z;
int x;
while(scanf("%d,%lf,%lf",&x,&y,&z)!=EOF){
if((y/z/z)>=25)printf("%d\n",x);
}
return 0;
}

C++: #include<stdio.h>
int i,n;
double x,y,z;
int seito[100],kekka[100];

void BMI(double x,double y,int i)
{
	z = x/(y*y);
	if(z >= 25)
	{
		kekka[i] = 1;
		return ;
	}
	return ;
}


int main()
{
	while(scanf("%d,%lf,%lf",&seito[i],&x,&y)!=EOF){
		BMI(x,y,i);
		if(kekka[i] == 1)
		{
			printf("%d\n",seito[i]);
		}
		else
		{
		}
		i++;
	}
	
	return 0;
}

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

int main(){
    int id;
    double w, h;
    while( scanf("%d,%lf,%lf", &id, &w, &h) != EOF ){
        if( w/h/h >= 25 ) printf("%d\n", id);
    }
    return 0;
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
#include <set>
#include <iostream>
#include <map>
#include <functional>
#include <cstdlib>
#include <numeric>
#include <queue>

using namespace std;

#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)

typedef vector<int> vi;
typedef pair<int, int> pii;

int main()
{
	int n;
	double w, h;
	while(scanf("%d,%lf,%lf", &n, &w, &h) != EOF){
		if(w/h/h >= 25.0)
			printf("%d\n", n);
	}

	return 0;
}

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

int main(){
    int a;
    double h, l;
    int cnt = 0;
    while(~scanf("%d,%lf,%lf", &a, &h, &l)){
	if(h >= 25 * l * l){
	    printf("%d\n", a);
	    cnt++;
	}
    }
    if(cnt == 0){
	puts("該当なし");
    }
    return 0;
}

C++: // 2011/04/02 Tazoe

#include <iostream>
#include <string>
#include <sstream>
using namespace std;

int main()
{
	while(!cin.eof()){
		string str;
		getline(cin, str);
		if(str.empty())
			continue;

		for(int i=0; i<str.size(); i++)
			if(str[i]==',')
				str[i] = ' ';

		istringstream ist(str);
		int n;
		double w, h;
		ist >> n >> w >> h;

		double bmi = w/(h*h);
		if(bmi>=25.0)
			cout << n << endl;
	}

	return 0;
}

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

int main()
{
	int id;
	double w, h;
	while (scanf_s("%d,%lf,%lf",&id,&w,&h) != EOF) {
		double bmi = w / (h*h);
		if (bmi >= 25.0) {
			cout << id << endl;
		}
	}
    return 0;
}

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

int main()
{
	int id;
	double kg, m;

	while (scanf("%d,%lf,%lf", &id, &kg, &m) != EOF) {
		if (kg/m/m > 25.0) cout<<id<<endl;
	}

	return 0;
}

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

int main(){
  int no;
  double w, h, bmi;
  while(~scanf("%d,%lf,%lf", &no, &w, &h)) {
    if(w / h / h >= 25)
      printf("%d\n", no);
  }
  return 0;
}

C++: #include<bits//stdc++.h>
using namespace std;
int main(){
	int a;
	double b,c;
	while(true){
		scanf("%d,%lf,%lf",&a,&b,&c);
		if(cin.fail())break;
		if(b/(c*c)>=25) cout<<a<<endl;
	}
}

C++: #include<iostream>
#include<cstdio>
#define eps 10e-10
using namespace std;
int main()
{
	int n;
	double w,h;
	while(scanf("%d,%lf,%lf",&n,&w,&h)!=EOF)
	{
		if(25.0+eps<w/(h*h)) cout<<n<<endl;
	}
  return 0;
}

C++: #include <cstdio>
#include <iostream>
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 <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
using namespace std;
 
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,s,n) for(int i=s; i<n; i++)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define foreach(it,con) for(auto it=con.begin();it!=con.end();it++)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

struct Person{
	Person(int _id,int _m,int _h):h(_h),m(_m),id(_id){
	}
	int id;
	float m;
	float h;
	float bmi(){
		return m/h*h;
	}
};

int main(){
	stringstream str;
	while(cin>>str){
		int id;
		char split;
		float m,h;
		str >>id >> split >> m >> split >> h;
		Person p(id,m,h);
		if(p.bmi()>=25.0){
			cout << id << endl;
		}
	}
	return 0;	
}

C++: #include <iostream>
using namespace std;
int main(){
	int NUM ; double H,W ; char ch;
	while(cin >> NUM >>ch>> W >>ch>> H ){
		double BMI=W/(H*H);
		if(BMI<25) continue;
		else cout << NUM << '\n' ;
	};
}

C++: #include<stdio.h>

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

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld",a)

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//char ch;
//string S, T, U;
ll i, j, k, a, b, c, d, f, g,  l, m, n, p, q, r,  t,  y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;
double w,h, x;
int s;
int main()
{
    //ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);

    while(cin>>s>>w>>h)
    {
          if(w/(h*h)>=25.00)
          {
              printf("%d", s);
          }
    }

    return 0;
}

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

using namespace std;

double BMI(double height, double weight)
{
	return weight / pow(height / 100.0, 2);
}

int main()
{
	const int DATASETS = 1000;

	int Number[DATASETS], C = 0; double H[DATASETS], W[DATASETS]; char ch;

	while (cin >> Number[C] >> ch >> H[C] >> ch >> W[C])
	{
		C++;
	}

	for (int i = 0; i < C; i++)
	{
		if (BMI(H[i] * 100.0, W[i]) >= 25.0)
		{
			cout << Number[i] << endl;
		}
	}

	return 0;
}

C++: #include <cstdio>

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

        while (scanf("%d,%lf,%lf", &s, &w, &h) != EOF) {
                double bmi = w / (h * h);
                if (bmi >= 25.0) {
                        printf("%d\n", s);
                }
        }

        return 0;
}