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<algorithm>
#include<vector>
#include<cstdio>
#include<cstring>
#include<climits>
#include<cfloat>
#include<cmath>
#include<map>
#include<complex>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define DBL(x) ((x)*(x))

typedef unsigned int uint;
typedef long long ll;

using namespace std;

int main(){
  char buff[64];
  double w,h;
  while(~scanf(" %[0-9],%lf,%lf",buff,&w,&h))
    if(w/(h*h) >= 25.0) puts(buff);
  return 0;
}

C++: #include <cstdio>
#include <cmath>
#include <vector>
using namespace std;
int main() {
	vector<int> over;
	int num;
	float 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]);
	}
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main()
{
	int s[50] = {};
	double w[50] = {};
	double h[50] = {};
	int i = 0;
	vector <int> sb(50, 0);
	while (scanf("%d,%f,%f", s[i], w[i], h[i])) {
		if ((w[i] / (h[i] * h[i])) >= 25) {
			sb.push_back(s[i]);
		}
		i++;
	}
	int j = 0;
	while (sb[j] == 0) {
		cout << sb[j] << endl;
		j++;
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <string>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <sstream>
#include <fstream>
#include <tuple>
#include <set>
#include <functional> 
#include <string.h>
//#include <assert.h>
//#include <typeinfo.h>
#include <time.h>

#define X first
#define Y second
#define MP make_pair
#define MT make_tuple
#define FOR(i, n) for(int (i) = 0; (i) < (n); ++(i))
#define REP(i, a, n) for(int (i) = (a); (i) < (n); ++(i))
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll > pll;
using namespace std;

const int INIT_SIZE_MAX = (1 << 29) + 10;
const int INIT_SIZE_MIN = -(1 << 29) - 10;
const int INIT_SIZE = 0;
const int MAX = 8;
const int DIR_SIZE = 12;
const double PI = 3.1415926535897932384;

template<class T, class U>
void convert(T &t, U &u){
	stringstream ss;
	ss << t;
	ss >> u;
}

int main(){
	int n;
	double a, b;
	char c;
	while (cin >> n >> c >> a >> c >> b){
		if (cin.eof()) break;

		if (a / (b * b) >= 25.0){
			cout << n << endl;
		}
	}
}

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
int main()
{
	int num;
	double w,h;
	bool c=true;
	while(scanf("%d,%lf,%lf",&num,&w,&h)!=EOF)
	{
		if(w/(h*h)>=25)
		{
			cout << num  << endl;
			c=false;
		}
	}
	if(c) cout << "該当なし" << endl;
	return 0;
}

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<<s<<endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    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<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 <cstdio>
#include <string>
#include <vector>
using namespace std;
int main()
{
  double w,l;
  int num;
  string str;
  vector<int> v;
  while(cin >> str){
    double bmi;
    sscanf(str.c_str(),"%d%*c%lf%*c%lf",&num,&w,&l);
    bmi=w/l/l;
    if(bmi>=25.0){
      v.push_back(num);
    }
  }
  for(int buf:v){
    cout << buf << endl;;
  }
}

C++: #include<iostream>
using namespace std;
int main(){
	int a;double b,c;
	while(scanf("%d,%lf,%lf",&a,&b,&c)!=EOF){
	if(b/(c*c)>=25)printf("%d\n",a);
	}
	
	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>

//AOJ0075
#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(int x=from;x<to;x++)

using namespace std;

int main(void){

int bg,cnt=0;
double tj, sc;
char k;

	while(!cin.eof()){
		cin >> bg >> k >> tj >> k >> sc;
		if(cin.eof()) break;
		if(tj/(sc*sc) >= 25){
			cout << bg << endl;
			cnt++;
		}
	}
	if(cnt==0) cout << "該当なし" << endl;
	return 0;
	
}

C++: #include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include <vector>
#include <map>
#include<cstdlib>


using namespace std;

void Solution()
{
    int number;
    double w, t;
    
    char comma;
    
    while (cin>>number>>comma>>w>>comma>>t)
    {
        if (w / (t * t) >= 25.0)  // don't forget the "( )"
        {
            cout<<number<<endl;
        }
    }
    
}

int main()
{
    Solution();
    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 mass/h*h;
	}
};

int main(){
	int n;
	while(cin>>n,n){
		rep(i,n){

		}
	}
	return 0;	
}

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<=w/(h*h)) cout<<n<<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> 
 
using namespace std; 
 
int main(void) 
{ 
  int a; 
  double b, c; 
  int kiken[100]; 
 
  while (scanf("%d,%lf,%lf", &a, &b, &c)){ 
    int d = 0; 
    d = c / (b * b); 
    if (d <= 25.00){ 
      cout << a << 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) {
		if (w/(h*h)>=25) over.push_back(num);
	}
	if (over.empty()) {
		printf("ツ該ツ督鳴づ按つオ\n");
	} else {
		for (int i=0; i<over.size(); i++) printf("%d\n",over[i]);
	}
}