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++: #define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <sstream>
#include <climits>
#include <cmath>
#include <functional>
#include <map>
#include <stack>
using namespace std;
#define M_PI 3.141592
#define FOR(i,n) for(int i=0;i<(int)n;i++)
#define FORI(i,k,n) for(int i=k;i<(int)n;i++)
#define toRad 2.0*M_PI/360.0
#define inin(x) int x;cin>>x;
#define all(x) x.begin(),x.end()
#define debug(x) cout<<#x<<" "<<x<<endl;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define EPS 1e-12
#define pri_max 60000
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

/*
bool memo[pri_max] = {};
vector<int> pri;
void calc()
{
	for (int i = 2; i < pri_max; i++)
	{
		if (memo[i] == false)
		{
			pri.push_back(i);
			for (int l = i; l < pri_max; l += i)
			{
				memo[l] = true;
			}
		}
	}
}*/

int main()
{
	vector<int> ans;
	int id;
	double hei, wei;
	while (scanf("%d,%lf,%lf", &id, &wei, &hei) != EOF)
	{
		if (wei / (hei*hei) >= 25.0)ans.push_back(id);
	}
	for (int i = 0; i < ans.size(); i++)
	{
		cout << ans[i] << endl;
	}

}

C++: #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back 
#define pf push_front 
#define mp make_pair
#define fr first
#define sc second
#define Rep(i,n) for(int i=0;i<(n);i++)
#define All(v) v.begin(),v.end()
typedef pair<int, int> Pii; typedef pair<int, Pii> Pip;
const int INF = 1107110711071107;


main()
{
  double s, w, h;
  while( scanf("%lf,%lf,%lf", &s, &w, &h) ) {
    if( w / (h*h) >= 25.0 ) {
      cout << s << endl;
    }
  }
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
  int n;
  cin>>n;
  for(int i=0;i<n;i++){
    double a,b,c;
    scanf("%f,%f,%f",&a,&b,&c);
    if((b)/(c*c)>=25)
      cout<<a<<endl;
  }
  return 0;
}

C++: #include <cstdio>

main(){
     int n,c=0;
     float w,h;
     while(~scanf("%d,%f,%f ",&n,&w,&h)){
	  if(w/h/h >= 25){
	       printf("%d\n", n);
	       c++;
	  }
     }
     if(!c){
	  puts("ツ該ツ督鳴づ按つオ");
     }
}

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

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

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

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

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

while(cin>>s>>p>>w>>p>>h){
    BMI=w/(h*h);

    if(BMI>25){
        cout<<s<<endl;
    }
}
    return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
  int n;
  double w,h;
  while(scanf("%d,%lf,%lf",&n,&w,&h)+1){
    if(w>=h*h*25.0)cout<<n<<endl;
  }
}

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

int main(){
	float weight, height;
	int id;
	bool hoge = false;
	while(scanf("%d,%f,%f", &id, &weight, &height) != EOF){
		if(25 <= weight / pow(height, 2)){
			hoge = true;
			cout << id << endl;
		}
	}
	if(!hoge) cout << "該当なし" << endl;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;

int main()
{
//	cut here before submit 
//	freopen("testcase.bmi", "r", stdin);
	string str = "";
	while (getline (cin, str ) ){
		if (str.empty() ){
			break;
		} // end if
		while (str.find(',') != string::npos ){
			str = str.replace(str.find(','), 1, " ");
		} // end while
		int index;
		double hight, wight, bmi;
		stringstream ss(str);
		ss >> index >> wight >> hight;
//		cout << "index: " << index << " hight: " << hight << " wight: " << wight;
//		bmi = (double)wight/((double)hight*(double)hight);
//		cout << " bmi: " << bmi << endl;
		if ((double)wight >= 25.0*(double)hight*(double)hight){
			cout << index << endl;
		} // end if
	} // end loop

	return 0;
}

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

int main()
{
	list<int> noList;
	int i, no;
	double w, h;
	char c;

	while (1)
	{
		cin >> no;
		if (cin.eof()) break;
		cin >> c >> w >> c >> h;
		if (w / (h * h) >= 25)
			noList.push_back(no);
	}

	while (!noList.empty())
	{
		cout << noList.front() << endl;
		noList.pop_front();
	}
	return 0;
}

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

int main(){
	int n;
	double wei, hei;
	while( scanf("%d,%lf,%lf", &n, &wei, &hei) ){
		double bmi = wei / (hei*hei);
		printf("bmi:%f\n", bmi);
		if( bmi >= 25.0 ){
			printf("%d\n", n);
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int num; double h, w; char a;
int main() {
	while (cin >> num >> a >> w >> a >> h) {
		if (h*h * 25 <= w) {
			cout << num << endl;
		}
	}
}

C++: #include <cstdio>
#include <vector>
using namespace std;
double bmi(double w, double h) {
  return w / (h * h);
}
int main() {
  vector<int> s;
  int id;
  float w, h;
  while(~scanf("%d,%f,%f", &id, &w, &h)) {
	if(bmi(w, h) >= 25) {
	  s.push_back(id);
	}
  }
  for(int i = 0; i < (int)s.size(); ++i) {
	printf("%d\n", s[i]);
  }
  return 0;
}

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

using namespace std;

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

C++: #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

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

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

int main(){
    int n;
    double w, h;
    while(scanf("%d,%lf,%lf", &n, &w, &h) != -1){
        if((w / (h * h)) >= 25.0) cout <<n <<endl;
    }
    return 0;
}

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

int main(){

	int n;
	double w, h;

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

	return 0;

}