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 <cmath>
#include <iostream>

using namespace std;

double BMI(double height, double weight)
{
	return weight / pow(height / 100.0, 2);
}

int main()
{
	const int DATASETS = 1000;

	int Number[DATASETS], C = 0; double H[DATASETS], W[DATASETS]; char ch;

	while (cin >> Number[C] >> ch >> W[C] >> ch >> H[C])
	{
		C++;
	}

	for (int i = 0; i < C; i++)
	{
		if (BMI(H[i] * 100.0, W[i]) >= 25.0)
		{
			cout << Number[i] << endl;
		}
	}

	return 0;
}

C++: #include <cstdio>

using namespace std;

int f[10000];

int main()
{
	int num;
	float weight,height;
	int i = 0;
	
	while(scanf("%d,%f,%f", &num, &weight, &height) != EOF){
		float bmi = weight / (height * height);
		
		if(bmi >= 25.0){
			f[i] = num;
			i++;
		}
	}
	
	for(int i = 0; f[i] != 0; i++){
		printf("%d\n", f[i]);
	}
	
	return(0);
}

C++: main(n){double w,t;for(;~scanf("%d,%lf,%lf",&n,&w,&t);w/t/t>25.0?printf("%d\n", n ):0);}

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

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

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#define fi first
#define se second
#define fcout(n) cout<<fixed<<setprecision((n))
using namespace std;
bool value(int y,int x,int R,int C){return 0<=y&&y<R&&0<=x&&x<C;}
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
double pie=acos(-1);
int INF=10000009;
int dx[4] = { 0,-1,0,1 };
int dy[4] = { -1,0,1,0 };
int main() {
	int n,count=0;
	double BMI,w,h;
	char x,y;
	while(true){
		cin>>n>>x>>w>>y>>h;
		if (cin.eof())break;
		BMI=w/(h*h);
		if(BMI>=25){
			cout<<n<<endl;
			count++;
		}
	}
}

C++: #include <stdio.h>

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

}

C++: #include<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define pf push_front
#define pb push_back
#define int long long
using namespace std;
const int INF=1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

signed main(){
  int s;
  double w,h;
  char t;
  vector<int> v;
  while(cin>>s>>t>>w>>t>>h){
    double BMI=w/(h*h);
    if(BMI>25){
      v.pb(s);
    }
  }
  rep(i,v.size()){
    cout<<v[i]<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <sstream>
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<vector>
using namespace std;
int main()
{
	int s[50] = {};
	double w[50] = {};
	double h[50] = {};
	int i = 0;
	vector <int> sb = {};
	while (scanf_s("%d,%f,%f", s[i], w[i], h[i])) {
		if ((w[i] / (h[i] ^ 2)) >= 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<iomanip>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
    int s,w,h;
    while(cin>>s>>w>>h){
        if(w/(s*s)>25)cout<<s<<endl;
    }
    return 0;
}

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

int main()
{
	int id;
	double w, h;
	while (scanf_s("%d,%lf,%lf",&id,&w,&h)) {
		double bmi = w / (h*h);
		if (bmi >= 25.0) {
			cout << id << endl;
		}
	}
    return 0;
}

C++: #include<cstdio>

using namespace std;

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

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

/** Problem0075 : BMI **/
int main()
{
	int stnum, output=0;
	double weight, height;
	char comma;
	
	while (1) {
		cin >> stnum >> comma >> weight >> comma >> height;
		if (cin.eof()) break;
		if (weight / (height*height) >= 25) {
			cout << stnum << endl;
			output=1;
		}
	}
	if (output==0)
		cout << "該当なし" << endl;
	
	return 0;
}

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

using namespace std;

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

C++: #include <iostream>

using namespace std;

int main() {
  int s;
  double w, h;
  while (scanf("%d,%lf,%lf", &s, &w, &h) != EOF)
    if (25 <= w / h / h)
      cout << s << endl;
}

C++: #include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
using namespace std;

int n;
double w,h;

int main(){
	int flag=0;
	while(scanf("%d,%lf,%lf",&n,&w,&h)!=EOF){
		if(w/h/h>=25){cout<<n<<endl;flag=1;}
	}
	if(flag==0)cout<<"ツ該ツ督鳴づ按つオ"<<endl;
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int main() {
	int n;
	double w,h;
	for(;~scanf("%d,%lf,%lf",&n,&w,&h);){
		if(w/h/h>=25)cout<<n<<endl;
	}
	return 0;
}

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

int main(){
	int n;
	double w, h, bmi;
	while (~scanf("%d,%lf,%lf", &n, &w, &h)) {
		bmi = w / (h*h);
		if (bmi >= 25) {
			cout << n << endl;
		}
	}
	return 0;
}