Beer Refrigerator

http://202.117.21.117/xjoj/problem_html/102.html

c++:

#include <stdio.h>
#include <math.h>
#include <limits.h>

int main()
{
   int n;
   int i,j,k;
   int ans[3];
   int min;
   while(scanf("%d",&n)!=EOF)
   {
       min=INT_MAX;
       for(i=1;i<=sqrt((double)n)+1;i++)
       {
           if(n%i==0)
           {
               for(j=1;j<=n/i;j++)
               {
                   if(n%(i*j)==0)
                   {
                       k=n/(i*j);
                       if(i*j+i*k+j*k<min)
                       {
                            min=i*j+i*k+j*k;
                            ans[0]=i;
                            ans[1]=j;
                            ans[2]=k;
                       }
                   }
               }
           }
       }
       printf("%d %d %d\n",ans[0],ans[1],ans[2]);
   }
   return 0;
}

 java：

//author:pz

import java.awt.*;
import java.io.*;
import java.util.*;
import java.lang.*;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(new BufferedInputStream(System.in));       
        while(in.hasNextInt()){
            int i,j,k;
        int []ans = new int[3];
        int min;
            int n = in.nextInt();
            min=Integer.MAX_VALUE;
            for(i=1; i<=Math.sqrt((double)n)+1; i++)
            {
                if(n%i==0)
                {
                    for(j=1; j<=n/i; j++)
                    {
                        if(n%(i*j)==0)
                        {
                            k=n/(i*j);
                            if(i*j+i*k+j*k<min)
                            {
                                min=i*j+i*k+j*k;
                                ans[0]=i;
                                ans[1]=j;
                                ans[2]=k;
                            }
                        }
                    }
                }
            }
            System.out.println(ans[0]+" "+ans[1]+" "+ans[2]);
        }
    }
}