Go: package main

import (
    "fmt"
    "math"
)

func main() {
    var e int
    for {
        fmt.Scan(&e)
        if e == 0 { break }

        var ans float64 = float64(e)
        for z := 0; z <= 101; z++ {
            for y := 0; y <= 1001; y++ {
                x := e - y*y - z*z*z
                if (0 <= x && x <= 100000) {
                  ans = math.Min(ans, float64(x+y+z));
                }
            }
        }
        fmt.Println(ans)
    }
}

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

using namespace std;

int main()
{
    unsigned long long e;
    while( cin >> e ) {
        if ( e == 0 )
            break;

        cout << [&]() mutable -> unsigned long long
        {
            const unsigned short y_max = sqrt( e );
            const unsigned short z_max = cbrt( e );
            for( unsigned int x=0; x<=e; ++x ) {
                for( unsigned short y=0; y<=y_max; ++y ) {
                    for( unsigned short z=0; z<=z_max; ++z ) {
                        unsigned long long const v = x + y*y + z*z*z;
                        if ( v > e )
                            break;
                        if ( v == e ) {
                            return x + y + z;
                        }
                    }
                }
            }
            return 0;
        }() << endl;
    }
}

C++: // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2012

#include <stdio.h>

int main(void) {
	while(1) {
		
		int e;
		int mmin = 10000000;
		
		scanf("%d", &e);
		if ( e == 0 ) { break; }
		
		for(int z=0; z<=100; z++) {
			int r = e - z*z*z;
			for(int y=0; y<=1000; y++) {
				int x = r - y*y;
				if ( x<0 ) { break; }
				
				int sum = x+y+z;
				if ( mmin > sum ) { mmin = sum; }
			}
		}
		
		printf("%d\n", mmin);
	}
}

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

int main(void){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int e;
  while(cin >> e, e){
    int x, y, z;
    int ans = INT_MAX;
    for(z = 0; z <= pow(e, 1.0/3.0); z++){
      for(y = 0; y <= sqrt(e); y++){
        if(pow(z, 3) + pow(y, 2) > e) break;
        ans = min(ans, (int)(z + y + (e - pow(y, 2) - pow(z, 3))));
      }
    }
    cout << ans << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
//ranker
using namespace std;

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;

void merge (int *first1, int *last1, int *first2, int *last2){
    int size1 = last1 - first1;
    int size2 = last2 - first2;
    int *result = new int[size1+size2];
    int i = 0;
    int j = 0;
    int index = 0;
    while (true){
        if (i < size1 && (first1[i] <= first2[j] || j >= size2)){
            result[index] = first1[i];
            ++i; ++index;
        }
        if (j < size2 && (first1[i] > first2[j] || i >= size1)){
            result[index] = first2[j];
            ++j; ++index;
        }
        if (i==size1 && j==size2){
            for (i=0; i<size1; ++i) first1[i] = result[i];
            for (j=0; j<size2; ++j) first2[j] = result[j+size1];
            delete[] result;
            return;
        }
    }
}
void MergeSort (int *first, int *last){
    int size = last - first;
    if(size <= 1) return;
    MergeSort(first, first+size/2);
    MergeSort(first+size/2, last);
    merge(first, first+size/2, first+size/2, last);
}


int gcd(int a, int b)
{
    int c;

    if (a < b) {
        a+=b; b=a-b; a-=b;
    }

    while (b != 0) {
        c = a % b;
        a = b;
        b = c;
    }

    return a;
}

int isPrime(int x){
  int i;
  if(x < 2) return 0;
  else if(x == 2) return 1;
  if( x%2 == 0) return 0;
  for(i = 3; i*i <= 2; i += 2){
    if(x%i == 0) return 0;
  }
  return 1;
}


const int pmax = 10000000;
bool isPrime_table[pmax];
//const???????????¨????????£?¨???§?????????

void eratos(void){
  int i, j;
  double sqrtmax=sqrt(pmax);

  REP(k, pmax) isPrime_table[k] = true; /* Initialization */

  /* Sieve process  */
  isPrime_table[0] = false;
  isPrime_table[1] = false;
          /* 0 and 1 are not prime. */
  for (i=2; i <= sqrtmax; i++){
    if (isPrime_table[i]==true){   /* i is prime. */
      for (j=i; i*j<pmax; j++){
        isPrime_table[i*j] = false; /* multiples of i are not prime. */
      }
    }
  }
}

//????????????????¨???°?????????
//abs(dx[i]+dy[j])==1??§??????
int dx[3]={-1, 0, 1};
int dy[3]={-1, 0, 1};
int W0, H0;
int  masu0[100][100]={0};
int cnt0;

int dfs(int a, int b){
  masu0[a][b] = 2;
  REP(i, 3)REP(j, 3){
    a = a+dx[i];
    b = b+dy[j];
    if(masu0[a][b]== 1 && a >= 0 && a < W0 && b >= 0 && b < H0){
    dfs(a, b);
  }
  }
  return 1;
}

//????????????????????????str.substr(i, 5)
//????????°????????? stoi, stod ??¨to_string

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  eratos();

  int e;
  while(1){
    cin >> e;
    if(e == 0) break;
    int min = 1000000;
    REP(z, 100) REP(y, 1000) if(e-y*y-z*z*z+z+y >= 0 && e-y*y-z*z*z >= 0){
      if(min > e-y*y-z*z*z+z+y){
        min = e-y*y-z*z*z+z+y;
      }
    }
    cout << min << endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int e;
  while(cin>>e&&e){
    int i,j,a,y,m=1000000000;
    for(i=1;i*i*i<=e;++i);
    a=i-1;
    for(i=0;i<=a;++i){
      int b=e;
      b=b-i*i*i;
      for(j=1;j*j<=b;++j);
      y=(j-1);
      b=b-y*y;
      m=min(m,b+y+i);
    }
    cout<<m<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int calcOver(int, int, int);

int main() {
  while(true) {
    int e;
    cin >> e;
    if(e == 0) break;
    int y = 0;
    int z = 0;
    int maxy = 0;
    int maxz = 0;
    int maxover = 0;
    int limity = pow(e, 1.0 / 2.0);
    int limitz = pow(e, 1.0 / 3.0);
    //cout << limity << ":" << limitz << endl;
    for(; y <= limity; ++y) {
      for(int z = 0; z <= limitz; ++z) {
        int over = calcOver(e, y, z);
        //cout << y << ":" << z << ":" << over << endl;
        if(e >= over) {
         /// cout << "ok" <<endl;
          if(maxover < over) {
            maxy = y;
            maxz = z;
            maxover = over;
          }
        } else {
          break;
        }
      }
    }
    //cout << maxy << ":" << maxz << endl;
    cout << (e - pow(maxy, 2) - pow(maxz, 3) + maxy + maxz) << endl;
  }
  return 0;
}

int calcOver(int e, int y, int z) {
  return (pow(y, 2) + pow(z, 3));
}

C++: #include<iostream>
using namespace std;
int main() {
    while (1) {
        int min = 1000000;
        int e; cin >> e;
        if (e == 0) break;
        for (int z = 0; z * z * z <= e; ++z) {
            for (int y = 0; y * y <= e; ++y) {
                int x = e - y * y - z * z * z;
                if (0 <= x && x <= e) {
                    if (min > x + y + z) {
                        //cout << x << " " << y << " " << z << endl;
                        min = x + y + z;
                    }
                }
            }
        }
        cout << min << endl;
    }
    return 0;
}