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 <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(c/(b*b) >= 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;
int main(){
	int s=0;
	double w=0,h=0,BMI;
	while(scanf("%d,%lf,%lf",&s,&w,&h)!=EOF){
		BMI=w/(h*h);
		if(BMI>=25)cout<<s<<endl;
	}
	return 0;
}

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) != EOF ) {
    if( w / (h*h) >= 25.0 ) {
      cout << s << endl;
    }
  }
}

C++: #include <stdio.h>

int main(void)
{
	int num;
	double weight;
	double height;
	double bmi;
	
	while (scanf("%d,%lf,%lf", &num, &weight, &height) != EOF){
		bmi = weight / (height * height);
		if (bmi > 25.000000){
			printf("%d\n", num);
		}
	}
	
	return (0);
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stdio.h>
#include <sstream>
#include <stdlib.h>
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(){
	int id;
	float m,h;
	while(scanf("%d,%f,%f",&id,&m,&h)+1){
		Person p(id,m,h);
		if(p.bmi()>=25.0){
			cout << id << endl;
		}
	}
	return 0;	
}

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

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  int s;
  double w, h;
  char gomi;
  while (cin >> s >> gomi >> w >> gomi >> h) {
    if (w / h / h >= 25) cout << s << endl;
  }
}

C++: #include <iostream>

using namespace std;

void solve()
{
	int Digit;
	double weight, height;
	while(~scanf("%d,%lf,%lf", &Digit, &weight, &height))
	{
		if(weight / height / height >= 25)
		{
			cout << Digit << endl;
		}
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int>PA;
using namespace std;
#define MAX 1000
int main(){
    int num;double taijuu;double sintyou;char g;
    vi v;
    while(cin>>num>>g>>taijuu>>g>>sintyou)if((double)taijuu/(sintyou*sintyou)>=25) v.push_back(num);
    rep(k,v.size())cout<<v[k]<<endl;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int main(void){
#define MAX 250
    int s; //学籍番号
    double w, h; //体重、身長

    while(scanf("%d, %lf, %lf", &s, &w, &h) != EOF){
        //int count = 0; //測定した人数
        /*for(int i = 0; i < 50; i++){
            scanf("%d, %lf, %lf", &s[i], &w[i], &h[i]);
            count++;
        }*/

    double bmi; //BMI
    bmi = w / pow(h, 2);
    if(bmi >= 25)
        cout << s << endl;
    }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stdio.h>
#include <sstream>
#include <stdlib.h>
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;


int main(){
	int id;
	float m,h;
	while(scanf("%d,%f,%f",&id,&m,&h)+1){
		if(m/(h*h)>=25.0){
			cout << id << endl;
		}
	}
	return 0;	
}

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

int main()
{
	int id;
	double w, h;
	while (scanf("%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 n;
        double w,h;
        char c,d;
        while(cin >> n >> c >> w >> d >> h){ 
                if(w/h/h>=25) cout << n << endl;
        }   
}

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;
}