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 <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <sstream>
#include <vector>
#include <string>
#include <iomanip>
#include <bitset>
using namespace std;
#define INF	100000000
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define lb lower_bound
#define ub upper_bound
#define SS stringstream
#define rep(i,n) for(int i = 0; i < n; i++)
#define sz(x) ((int)(x).size())
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define clr(a,b) memset((a),(b),sizeof(a))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<P> Vp;
typedef priority_queue<P, vector<P>, greater<P> > PQ;

int num;
double weight,height;
char trash;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	while(cin >> num >> trash >> weight >> trash >> height){
		if(weight >= height*height*25) cout << num << endl;
	}
}

C++: #include <cstdio>
int main(){
	int i;
	double w,t;

	while( ~scanf("%d,%lf,%lf", &i , &w , &t ) ){
		if( w/t/t >= 25.0 )
			printf("%d\n", No );
	}
}

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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
using namespace std;

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

	while(scanf("%d, %lf,%lf", &n, &kg, &m)){
		if (kg / (m * m) >= 25)
		{
			cout << n << endl;
		}
	}

}

C++: float h,w,k;main(i){for(;~scanf("%d%c%f%c%f",&i,&k,&w,&k,&h);25*h*h>w?:printf("%d\n",i));}

C++: #include<cstdio>
int numcheck[10000]={0};
using namespace std;
int main(){
    int num;
    double kg,m;
    int x = 0;
    while(scanf("%d,%lf,%lf",&num,&kg,&m)!=EOF){
        if(kg /(m*m) >= 25.0){
            numcheck[x] = num;
            x++;
        }
    }
    for(int i = 0;i < x; i++)printf("%d\n",numcheck[i]);
    return 0;
}

C++: #include <stdio.h>

int main(void){
    int num[100],i;
    double hvy[100],hight[100];
    for(i=0;scanf("%d,%lf,%lf",&num[i],&hvy[i],&hight[i])!=EOF;i++){
        if(hvy[i]/hight[i]/hight[i]>=25){
            printf("%d\n",num[i]);
        }
        
    }
    
    return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>	
#include<cmath>
#include<map>
#include<vector>
#define int long long
using namespace std;
int test[51];
signed main() {
    int n; double a, b; char x, y;
    while (cin >> n >> x >> a >> y >> b) {
        if (a / b / b >= 25) {
            cout << n << endl;
        }
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(void) {
    int s;
    char c;
    double w,h,bmi;
    while (cin>>s>>c>>w>>c>>h) {
        bmi = w/(h*h);
        if (bmi>=25) {
            cout<<s<<endl;
        }
    }
}

C++: #include <iostream>

using namespace std;

int main()
{
    long long stdno;
    double w, h;
    char ch;

    while (cin >> stdno >> ch >> w >> ch >> h) {
        if (w / (h * h) >= 25.0)
            cout << stdno << endl;
    }

    return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
    float s,w,h;
    while(cin>>s>>w>>h){
        if(w/(s*s)>=25)cout<<s<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <map>
#include <numeric>
using namespace std;

#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long ll;
typedef vector<long long int> vi;
typedef vector<long long int>::iterator vit;

int main(){
	int n, c = 0;
	double l, m;
	vector<ll> vi;
	while (scanf("%d,%lf,%lf", &n, &l, &m)){
		if (l / powl(m, 2) >= 25){
			vi.push_back(n);
		}
	}
	if (c == 0){
		cout << "????????????\n";
	}
	else{
		REP(i, c){
			cout << vi[i] << "\n";
		}
	}
	return 0;
}

C++: #include <iostream>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;

int main() {
    double hei, wei;
    int num;
    char c1, c2;

    while (cin >> num) {
        cin >> c1 >> wei >> c2 >> hei;
        if (wei / hei / hei >= 25) {
            cout << num << endl;
        }
    }
}

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

struct data{
	int number;
	double weight;
	double tall;
};

int main(){
	data dt;
	while(1){
		scanf("%d,%lf,%lf",&dt.number,&dt.weight,&dt.tall);
		if(!dt.number)break;
		if(dt.weight/pow(dt.tall,2)>=25)cout<<dt.number<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;

int main() {
    int a;
    double b, c;
    while(~scanf("%d,%lf,%lf",&a,&b,&c)) {
        if(b / c / c >= 25) cout << a << endl;
    }
return 0;
}

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(){
	int num;
	double weight,height;
	char c;
	while (1){
		cin >> num >> c >> weight >> c >> height;
		if(cin.eof()) return 0;
		double bmi;
		bmi = weight/(height*height);
		if(bmi>=25) cout <<num << endl;
		else cout<<"該当なし"<<endl;
	}
}

C++: #define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>

using namespace std;

int main(){
	int a; double b,c;
	while(~scanf("%d,%lf,%lf",&a,&b,&c)) if(b >= 25 * c * c) printf("%d\n",a);

    return 0;
}

C++: #include<stdio.h>

int main(){
	int l;
	double m,n;
	while(scanf("%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;
int main(){
  int num;
  double w,h;
  
  while(scanf("%d",&num) != EOF){
    scanf(",%lf,%lf",&w,&h);
    if( w/(h*h) >= 25.0 ) cout << num << endl;
  }

  return 0;
}

C++: #include <cstdio>
#include <cmath>
#include <vector>
using namespace std;
int main() {
	vector<int> over;
	int num;
	double w, h;
	while (scanf("%d,%f,%f",&num,&w,&h)!=EOF) {
		double bmi = w/pow(h,2);
		if (bmi>=25) over.push_back(num);
	}
	if (over.empty()) {
		//printf("ツ該ツ督鳴づ按つオ\n");
	} else {
		for (int i=0; i<over.size(); i++) printf("%d\n",over[i]);
	}
}