{filelink=23}

/**
 * @(#)LeplusGrandDiviseurCommun.java
 *
 *
 * @author 
 * @version 1.00 2013/9/26
 */

import javax.script.ScriptEngine;
import javax.script.ScriptEngineManager;
public class LeplusGrandDiviseurCommun 
{

      public static void main(String[] argv) throws Exception
  {
    ScriptEngineManager manager = new ScriptEngineManager();
 
    ScriptEngine engine = manager.getEngineByName("js");
    String myJSCode = "function gcd(a,b) {\n" +
		"    //Write Code Here\n" +
		"    if(a==b)\n" +
		"        return a;\n" +
		"    else if(a>b)\n" +
		"        return gcd(a-b, b);\n" +
		"    else if(a

A Voir sur le même Sujet:

diviseur en java
js algorithme d'euclide