Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

// func read() string {
// 	sc.Scan()
// 	return sc.Text()
// }

func main() {
	sc.Split(bufio.ScanLines)
	for sc.Scan() {
		n := strings.Split(sc.Text(), ",")
		id, _ := strconv.Atoi(n[0])
		weight, _ := strconv.ParseFloat(n[1], 64)
		height, _ := strconv.ParseFloat(n[2], 64)
		bmi := weight / (height * height)
		if bmi >= 25.0 {
			fmt.Println(id)
		}
	}
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

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

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
  int n, bmi;
  double w, h;
  char c1, c2;
  VI num;

  while(cin >> n >> c1 >> w >> c2 >> h) {
    bmi = w / (h*h);
    if(bmi >= 25) num.PB(n);
  }
  if(num.empty()) cout << "該当なし" << endl;
  else {
    VI::iterator it = num.begin();
    while(it != num.end()) {
      cout << *it << endl;
      it++;
    }
  }
}

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

int main() {
	int s;
	double w, h;
	char c;
	std::vector <int> fat;
	while (std::cin >> s >> c >> w >> c >> h) {
		if (w / h / h >= 25){
			fat.push_back(s);
		}
	}
	for (int i = 0; i < fat.size(); i++){
		cout << fat[i] << endl;
	}
	cin >> c;
	return 0;
}

C++: #include<iostream>
#include<string>
#include<stdio.h>
#include<cstdio>
#include<math.h>
using namespace std;
int main(){
    double s,w,h;
    char ch;
    while(cin>>s>>ch>>w>>ch>>h){
        if(w/(h*h)>=25){
            cout<<s<<endl;
        }
    }
    return 0;
}

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

C++: #include<cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main(){

    vector<int>a;
    while (1){
        int num;
        double weight,height;
        char c;
        cin >> num >> c >> weight >> c >> height;
        if(cin.eof()) break;
        double bmi;
        bmi = weight/(height*height);
        if(bmi>=25){
		a.push_back(num);
	}
     }
     if(a.size()==0) {cout<<"該当なし"<<endl;
     }else {
	  for(int i=0;i<a.size();i++){
		cout<<a[i]<<endl;
	   }
     }
}

C++: #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pii;

int main(){
	int n;
	double h,w,bmi;
	while(scanf("%d,%lf,%lf",&n,&w,&h)!=EOF){
		bmi=w/(h*h);
		if(bmi>=25) o(n);
	}
}

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 mass/h*h;
	}
};

int main(){
	list<Person> pers;
	while(cin>>n,n){
		rep(i,n){
			int id; float m,h;
			cin>>id,m,h;
			Person p(id,m,h);
			if(p.bmi()>=25.0){
				cout << id << endl;
			}
		}
	}
	return 0;	
}

C++: #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
    vector<int>ans;
    double s,w,h;
    while(scanf("%d,%f,%f",s,w,h)){
        if(w/(h*h)>=25){
            ans.push_back(s);
        }
    }
    for(auto a:ans){
        cout<<a<<endl;
    }
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	double n,w,m;
	char z;
	while(cin>>n>>z>>w>>z>>m){
		if(w/m/m>=25)
			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)
			cout << num << endl;
	}

	return 0;

}

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


using namespace std;

string s,a="";
int n;
double x,h;
int p=0;


void string_num(string str) {
	stringstream sstream;
	sstream << str;
	sstream >> n;
}

void string_x(string str) {
	stringstream sstream;
	sstream << str;
	sstream >> x;
}

void string_h(string str) {
	stringstream sstream;
	sstream << str;
	sstream >> h;
}



int main(){
	while(cin >> s){

		while(s[p] != ','){
			a += s[p];
			p++;
			if(s[p] == ','){
				p++;
				string_num(a);
				a="";
				break;
			}
		}

		while(s[p] != ','){
			a += s[p];
			p++;
			if(s[p] == ','){
				p++;
				string_x(a);
				a="";
				break;
			}
		}


		while(s[p] != '\0'){
			a += s[p];
			p++;
			if(s[p] == '\0'){
				p=0;
				string_h(a);
				a="";
				break;
			}
		}

		if((x/(h*h)) >= 25){
			cout << n << endl;
		}


	}

}

C++: #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
int main(){
	int num;
	double wei,hig;
	char x;
	while(cin>>num>>x>>wei>>x>>hig){
		if(wei/(hig*hig)>=25) cout<<num<<endl;
	}
}

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