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 <iostream>
#include<math.h>
using namespace std;

int main(void){
    int s;
    double w,h;
    char a;
    while(cin>>s>>a>>w>>a>>h){
        if(w/pow(h,2)>=25.0){
            cout<<s<<endl;
        }
    }
}

C++: #include <iostream>

using namespace std;

int main(void) {
	
	while(1) {
		int num;
		cin >> num;
		if(cin.eof())	{ break; }
		
		double w, h;
		cin >> w >> h;
		
		if(w / (h * h) >= 25.0) {
			cout << num;
		}
		cout << endl;
	}
	return 0;
}

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

using namespace std;

int main(){

	int num;
	double weight,length;
	char ch;

	vector<int> v;
	while(cin>>num>>ch>>weight>>ch>>length){
		if((weight/(length*length))>=25.0){
			v.push_back(num);
		}
	}
	for(int i= 0; i < v.size(); i++)
		cout<<v[i]<<endl;

	return 0;
}

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", i );
	}
}

C++: #include <iostream>
#include <stdio.h>
#include <math.h>
#include <iomanip>

using namespace std;


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

C++: #include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000007
#define EPS 1E-12

int id;
double weight, height;
double bmi;
bool flag;

template<class T> T add(T x, T y){ if(abs(x+y) < EPS*(abs(x)+abs(y))) return 0; return x + y; }
template<class T> inline bool semieq(T x, T y){ return abs(x - y) < EPS; }
template<class T> inline bool semige(T x, T y){ return x - y > -EPS; }
template<class T> inline bool semile(T x, T y){ return y - x > -EPS; }

int main()
{
  while(scanf("%d,%lf,%lf", &id, &weight, &height) != EOF){
    if(semige(weight / (height * height), 25.0)){
      flag = true;
      cout << id << endl;
    }
  }

  if(!flag) cout << endl;

  return 0;
}

C++: #include<iostream>

using namespace std;

struct student {
	int id;
	double weight;
	double height;
	char ch;
};

int main() {
	
	student a;
	while(cin >> a.id >> a.ch >> a.weight >> a.ch >> a.height) {
	
	if( a.weight / a.height / a.height >= 25.0)
		cout << a.id << "\n";
}
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define int long long
#define all(v) (v).begin(), (v).end()
#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)

template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}
template<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}

typedef pair<int, int> Pi;
typedef tuple<int, int, int> Ti;
typedef vector<int> vint;

const int inf = 1LL << 55;
const int mod = 1e9 + 7;

signed main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  int s;
  double w, h;
  while(scanf("%lld,%lf,%lf", &s, &w, &h) != EOF) {
    double bmi = w/h/h;
    if(bmi >= 25 + 1e-9) printf("%lld\n", s);
  }

  return 0;
}

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

int main()
{
	int num;
	double w,l;
	char dot;
	while(cin >> num >> dot >> w >> dot >> l){
		if(25.0 <= w/(l*l))
			cout << num <<endl;
	}
	return 0;
}

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

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

double calcBMI(double weight, double height) {
    return(weight / (height*height));
}

int main(void) {
    int no;
    double weight, height;
    vector<int> selection;
    while(scanf("%d,%lf,%lf", &no, &weight, &height) != EOF) {
        if(calcBMI(weight, height) > 25) {
            selection.push_back(no);
        }
    }
    if(selection.size() == 0) {
        cout << "該当なし" << endl;
        return(0);
    }
    vector<int>::iterator ite;
    for(ite = selection.begin(); ite != selection.end(); ite++) {
        cout << *ite << endl;
    }
    return(0);
}

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

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

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

int main(){
	int s;
	double w,h;
	while( scanf("%d,%lf,%lf", &s, &w, &h) != EOF ){
		if(w/h/h>25) printf("%d\n", s);
	}
	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/(h*h);
		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 <cstdio>

using namespace std;

int main(void) {
	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;
}

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

#define rep(i, n) for(int i = 0; i < n; i ++)
#define ALL(T) T.begin(), T.end()
#define mp make_pair
#define pb push_back

using namespace std;

typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<string> vs;

int main(void){
    double w, l, bmi;
    for(int n; ~scanf("%d,%lf,%lf", &n, &w, &l); ) if((bmi = w / pow(l, 2.)) >= 25) cout << n << endl;

    return 0;
}