Forum:

Programming Diversions

Puzzle for JavaProgrammers

C.R.Muthukumar

Ranch Hand

Posts: 59

posted 16 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

<html lang ="EN">
  <head>
<title>A logical Recreation under premises</title>
 <style type="text/css">
     
    </style>
    </head>
      <body>
      <body bgcolor= yellow>
     <h1>A logical puzzle</h1>
         <div id ="Container1">
         <h2>Please read</h2>
              <p>Smith,Jones and Robinson are the engineer,brakeman,fireman on a train
                but not necessarily in that order.Riding the train are three passengers with
                the same three surnames to be identified in the adjacent column of premises by 
                a" Mr" before their names
                 
                 
                <ul>Please find out who is the engineer 
 
                 <li>
                   </ul>
                   </div>
 
               <div id = "Container2">
                <h2>The premises</h2>
             <p>1)Mr Robinson lives in Losangeles
                2)The brakeman lives in Omeha
                3)Mr Jones long ago forgot all the algebra he learned in high School
                4)The passenger whose name is the same as the brakeman's lives in chicago
                5)The brakeman and one of the passengers a distinguished mathemticalPhysicist 
                attend the same Church
                6)Smith beat the fireman at biillliards 
                
 
               <ul>
                <li>Hello JavaProgrammers/friends, Can any one try to code this puzzle in Java and
                arrange to get the solution through some maths usage.
                
                  </ul>
                  </div>
 
                  </body>
                  </html>

Hello Java Programmers/Friends
Please help me to make a Java Program for the above mentioned Mathematical Puzzle The details of the same is given in an html/txt.(you may open the html file for the same)
Thanks and best wishes for the new year too.
As Always
C.R.Muthukumar

David O'Meara

Rancher

Posts: 13459

I like...

posted 16 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

Is this a homework assignment or rent-a-coder task or something?

Steve Fahlbusch

Bartender

Posts: 612

I like...

posted 16 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

We would be glad to help you.

What do you have (ie: what have you done) so far?

C.R.Muthukumar

Ranch Hand

Posts: 59

posted 16 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

Originally posted by David O'Meara:
Is this a homework assignment or rent-a-coder task or something?

This puzzle is really not getting any response though the same thing was first tried by myself ,mannualy making the answers from the clues given in the puzzle(pl ref the comments in the codes).,though the use of doublearray( matrix) as per the following java codes is rather not forth coming without an appropriate method in the place of average finding method(corretmetod) . So I once again bring this to fetch the correct codes for the puzzle.Probably the matrix elements have to be assigned as i have done mannually by way of numbering 1 for the correct logic and zero for wrong ones

import java.awt.*;
import javax.swing.*;
 
public class DoubleArray extends JApplet {
 
int grades[][]={ {0 }};
  // int GradesP[][] =    { {10, 0, 0 },
                       //  { 0,  89, 0 },
                        //{ 70, 86, 81 } };

//GradesP refer to Pesons and their Peofession viz Engineer,brakeman,fireman (matrix[][])
 
 //   int MrgradesL[][] = { { 1, 4, 73 },
                        //  { 1,  70, 71 },
                        //  { 1, 60, 81 } };
    //MrgradesL refer to the Mr so & o and their Locations viz Losangeles,Chicao and Omega(matrix[][])
 
   int students, exams;
   String output;
   JTextArea outputArea;
 
   // initialize fields
   public void init()
   {
   //Smith,Jones and Robinson are the engineer,brakeman,fireman
   //on a train but not necessarily in that order.Riding the
   //train are three passengers with the same three surnames
   //to be identified in the adjacent column of premises by a" Mr"
   //before their names
 
       //Mr Robinson lives in Losangeles
      //2)The brakeman lives in Omeha
      //3)Mr Jones long ago forgot all the algebra he learned in high School
       //4)The passenger whose name is the same as the brakeman's lives in chicago
        //5)The brakeman and one of the passengers a distinguished
     // mathemticalPhysicist attend the same Church
       //6)Smith beat the fireman at biillliards

//11Mr Robinson lives in Losangeles ;
             //2Mr Jhones forgetting Maths So Ordinary Jhones cannot be an Enginner;
              //brakeman and Mr brakeman lives inChicago;
               //either Mr or ordinary Brakeman can be an Engineer& lives in the
             //23since they happen to attend same Church but Mr Brakeman lives in Chicago
              //hence Ordinary Brakeman's place is Omega
              //Since Smith and Mr Or Ordinary fireman plyy sports both can be give 100
            //12Smith beating mr or ordinary fireman means Smith is not fireman

students = grades.length;     // number of students
      exams = grades[ 0 ].length;   // number of exams
 
      // create JTextArea and attach to applet
      outputArea = new JTextArea();
      Container container = getContentPane();
      container.add( outputArea );
 
      // build output string
      output = "The array is:\n";
      buildString();
 
      // call methods minimum and maximum
      output += "\n\nLowest grade: " + minimum() +
         "\nHighest grade: " + maximum() + "\n";
 
      // call method average to calculate each student's average
      for ( int counter = 0; counter < students; counter++ )
         output += "\nAverage for student " + counter + " is " +
            average( grades[ counter ] );  // pass one row of array grades
 
      // change outputArea's display font
      outputArea.setFont( new Font( "Monospaced", Font.PLAIN, 12 ) );
 
      // place output string in outputArea
      outputArea.setText( output );
 
   } // end method init
 
   // find minimum grade
   public int minimum()
   {
      // assume first element of grades array is smallest
      int lowGrade = grades[ 0 ][ 0 ];
 
      // loop through rows of grades array
      for ( int row = 0; row < students; row++ )
 
         // loop through columns of current row
         for ( int column = 0; column < exams; column++ )
 
            // if grade is less than lowGrade, assign it to lowGrade
            if ( grades[ row ][ column ] < lowGrade )
               lowGrade = grades[ row ][ column ];
 
      return lowGrade;  // return lowest grade
 
   } // end method minimum
 
   // find maximum grade
   public int maximum()
   {
      // assume first element of grades array is largest
      int highGrade = grades[ 0 ][ 0 ];
 
      // loop through rows of grades array
      for ( int row = 0; row < students; row++ )
 
         // loop through columns of current row
         for ( int column = 0; column < exams; column++ )
 
            // if grade is greater than highGrade, assign it to highGrade
            if ( grades[ row ][ column ] > highGrade )
               highGrade = grades[ row ][ column ];
 
      return highGrade;  // return highest grade
 
   } // end method maximum
 
   // determine average grade for particular student (or set of grades)
   public double average( int setOfGrades[] )
   {
      int total = 0;  // initialize total
 
      // sum grades for one student
      for ( int count = 0; count < setOfGrades.length; count++ )
         total += setOfGrades[ count ];
 
      // return average of grades
      return ( double ) total / setOfGrades.length;
 
   } // end method average
 
   // build output string
   public void buildString()
   {
      output += "           ";  // used to align column heads
 
      // create column heads
      for ( int counter = 0; counter < exams; counter++ )
         output += "[" + counter + "]  ";
 
      // create rows/columns of text representing array grades
      for ( int row = 0; row < students; row++ ) {
         output += "\ngrades[" + row + "]   ";
 
         for ( int column = 0; column < exams; column++ )
            output += grades[ row ][ column ] + "   ";
      }
 
   } // end method buildString
 
} // end class DoubleArray

.Can any one try now.
Thanks
AsAlways
C.R.Muthukumar

Vlado Zajac

Ranch Hand

Posts: 245

posted 16 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

Logical programming (I have used GNU Prolog and its constraint solver for very similar problem) seems to be more suitable than procedural programming (Java, C, ...) for this kind of puzzles.

C.R.Muthukumar

Ranch Hand

Posts: 59

posted 16 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

It is possible to translate this problem into a the notation of symbolic logic and solve it by appropriate method ,but this seems to be cumber some.
On the other hand ,it is difficult to grasp the problem's logical structure without some sort of notational aid. The most convenient device to use is a
matrix with vacant cells for all possible pairings of the elements in each set. In this case there are two sets. Hence two such matrices are required.
Each cell is to be marked with "1" to indicate that combination  is valid, or "0" to indicate that it is ruled out by the premises. As for example The
last premise obviously eliminates the possibilty that Smith is the fireman so, place a ''0" in the upper right corner cell of the matrix at left.
(pl note that use truthtable doesn't solve th problem either.
 
Though basically this problem may be solved under prolog, the same can be tried by using two matrices and try to do the placing task in the respective
cells in the matrix as indicated above. That is why a Java coded
Program viz doublearray. java has been given for a modification that calls
for a method replacing
the aveg find method (in the prog shown) in order to get the solution for the problem.
It is here  that gave me a scope to pose it especially those who are familiar with the creating
Matrix  methods. as also we are within our limits if we solve the same  with through java language since 
We are in Java Lobby Forem and so the uses of JavaLang .

Originally posted by Vlado Zajac:
Logical programming (I have used GNU Prolog and its constraint solver for very similar problem) seems to be more suitable than procedural programming (Java, C, ...) for this kind of puzzles.

Thanks.Can any body fetch the solution...
As Always
C.R.Muthukumar

[ March 11, 2007: Message edited by: David O'Meara ]

C.R.Muthukumar

Ranch Hand

Posts: 59

posted 16 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

Originally posted by Vlado Zajac:
Logical programming (I have used GNU Prolog and its constraint solver for very similar problem) seems to be more suitable than procedural programming (Java, C, ...) for this kind of puzzles.

It is possible to translate this problem into a the notation of symbolic logic and solve it by appropriate method ,but this seems to be cumber some. On the other hand ,it is difficult to grasp the problem's logical structure without some sort of notational aid. The most convenient device to use is a matrix with vacant cells for all possible pairings of the elements in each set. In this case there are two sets. Hence two such matrices are required. Each cell is to be marked with "1" to indicate that combination is valid, or "0" to indicate that it is ruled out by the premises. As for example The last premise obviously eliminates the possibilty that Smith is the fireman so, place a ''0" in the upper right corner cell of the matrix at left.
(pl note that use truthtable doesn't solve th problem either.

Though basically this problem may be solved under prolog, the same can be tried by using two matrices and try to do the placing task in the respective cells in the matrix as indicated above. That is why a Java coded
Program viz doublearray. java has been given for a modification that calls for a method replacing
the aveg find method (in the prog shown) in order to get the solution for the problem.
It is here that gave me a scope to pose it especially those who are familiar with the creating
Matrix methods. as also we are within our limits if we solve the same with through java language since
We are in Java Lobby Forem and so the uses of JavaLang .
Thanks.Can any body fetch the solution...
As Always
C.R.Muthukumar

C.R.Muthukumar

Ranch Hand

Posts: 59

posted 14 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

Originally posted by David O'Meara:
Is this a homework assignment or rent-a-coder task or something?

Hello Java knowledgers
It is better that the task or an assignment once appended
shall be tried for a succesfull finish as this seems to be
rather unfinshed though it is obvious that this program can be really made (treating it as Ranchers Assignment)as also mannual /proportion of the solutions are alrady narrated
Please try once again as per the below norms from c++ to Java

/*This program fills the diagonal of a matrix (square 
array) with 0, the lower left triangle with -1 and the 
upper right triangle with 1.
  */
#include <iostream>
#include <iomanip>
using namespace std;
 
int main (void)
{
 
int table [3][3];
            /**
              1)Smith,Jones and Robinson are the engineer,brakeman,fireman on a train
                but not necessarily in that order.Riding the train are three passengers with
                the same three surnames to be identified in the adjacent column of premises by 
                a" Mr" before their names

2)Mr Robinson lives in Losangeles
                3)The brakeman lives in Omeha
                4)Mr Jones long ago forgot all the algebra he learned in high School
                5)The passenger whose name is the same as the brakeman's lives in chicago
                6)The brakeman and one of the passengers a distinguished mathemticalPhysicist 
                attend the same Church
                7)Smith beat the fireman at biillliards 
                
           It is dfficult to grasp the problem's logical structur without some sort
           of notational aid.The most convenient device to se is amatrix with 
           vacant cells for all possible pairings of the elements in each set.here 
           there are two sets and therfore we need two such matrices
            Each cell is to be marked with a "1" to indicate that the combination is valid 
           or "0" to indcate it is ruledout.
 
          Step1:
 
          Premise No:7
 
          It obviously eliminates te possibilty that Smith is the fireman,
         so we place "0" in the upper ight corner cell of the matrix1.
 
          Step2: 
 
        Premise 2 tells us Mr.Robinsonlives in Losangelus.So place a "1" in thelowe left
        corner of the matrix 2 and "0"'s in  the other cells of the same row and same  column to show that
         Mr.Robinson does not live in Omaha or Chicago and that Mr.Smith and Mr Jones do not 
        live in LosAngeles.
 
       Step3: (more thinking Required)
 
          Premise 3 and 6 inform us that the Physicist lives in in Omaha,but what is his name?.
          He can not be Mr.Robinson nor can he be Mr.Jones.(who has forgotten Algebra),
          so he mustbe Mr.Smith
          We indicate this with a "1" in the middle cell of top row in the matrix2 and "0's" 
          in the remaining empty cells of the same row and column.Onl one cell in the matrix 
          is now available for the third "1" proving that Mr.Jones lives in Chicago,
 
        Step4:
 
          Premise 5. now permits us to identify the brakeman as Jones,so we place a"1"
          in the central cell  of matrix1 and "0's" in the other cells of the same row 
          and column.The remaining deductions are obvious.
          Only the bottom cell of the fireman's column is avaialble for a "1".
          This puts a "0" in the lower  left corner at matrix1,leaving the vacant only 
           the top left corner cell for th final "1"
           which prooves that Smith is the Engineer.
 
                    matrix1                                                 matrix2
                    --------                                                ---------
              Engineer | Brakeman   | Fireman                   Losangeles |  Omaha  | Chicago
 
-------------------------------------------------------------------------------------------------
    Smith              |    0         |   0         Mr.Smith         0        |    1     |  0
 
------------------------------------------------------------------------------------------------
 
    Jone           0   |     1        |     0        Mr.Jones         0       |     0    |  1
 
--------------------------------------------------------------------------------------------------
 
   Robinson             |     0         |            Mr.Robinson       1       |     0   |   0
 
 -------------------------------------------------------------------------------------------------         
 
 */

f(int row = 0; row < 3; row++)
   for (int column = 0; column < 3; column++)
      if (row == column)
         table [row][column] = 0;
      else if (row > column)
         table [row][column] = -1;
      else
         table [row][column] = 1;
 
for (int row = 0; row < 3; row++)
   {
    for (int column = 0; column < 3; column++)
         cout << setw(4) << table[row][column];
    cout << endl;
   } // for row 
return 0;
}// main 
 
    So i requst once again  to manupulate the above matrix making in Java (ie) from cplusplus.   
Thanking you.
Please correct if am wrong  .

Ben Souther

Sheriff

Posts: 13411

I like...

posted 14 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

"C.R.Muthukumar",
Please check your private messages regarding an important administrative matter.
-Ben

Java API J2EE API Servlet Spec JSP Spec How to ask a question... Simple Servlet Examples jsonf

C.R.Muthukumar

Ranch Hand

Posts: 59

posted 14 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

Originally posted by Steve Fahlbusch:
We would be glad to help you.

What do you have (ie: what have you done) so far?

This Java Program (Puzzler)making is not that easy as it looks so ,because none has come out with succesful completion.Obviously whatever has been done from my end is veryclear from the above post and lucid enough for an easy grasp.However let me give another try for coding the above puzzle which more or less more amounts for a closer approach to matrix making than earlier one. #include <iostream> #include <iomanip> using namespace std; const int NUMBER_OF_ROWS = 3; const int NUMBER_OF_COLUMNS = 3; void printMatrix(int matrix[][NUMBER_OF_COLUMNS], int NUMBER_OF_ROWS); void largestInRows(int matrix[][NUMBER_OF_COLUMNS], int NUMBER_OF_ROWS); int main() { int board[NUMBER_OF_ROWS][NUMBER_OF_COLUMNS] = {{0, 0, 0}, {0, 1, 0}, {0, 0, 0}, }; int board1[NUMBER_OF_ROWS][NUMBER_OF_COLUMNS] = {{0, 1, 0}, {0, 0, 1}, {1, 0, 0}, }; printMatrix(board, NUMBER_OF_ROWS); cout << endl; printMatrix(board1, NUMBER_OF_ROWS); cout << endl; largestInRows(board, NUMBER_OF_ROWS); largestInRows(board, NUMBER_OF_ROWS); return 0; } void printMatrix(int matrix[][NUMBER_OF_COLUMNS], int noOfRows) { int row, col; for (row = 0; row < noOfRows; row++) { for (col = 0; col < NUMBER_OF_COLUMNS; col++) cout << setw(5) << matrix[row][col] << " "; cout << endl; } } void largestInRows(int matrix[][NUMBER_OF_COLUMNS], int noOfRows) { int row, col; int largest; //Largest element in each row for (row = 0; row < noOfRows; row++) { largest = matrix[row][0]; //Assume that the first element //of the row is the largest. for (col = 1; col < NUMBER_OF_COLUMNS; col++) if (largest < matrix[row][col]) largest = matrix[row][col]; cout << "The largest element of row " << (row + 1) << " = " << largest << endl; } }

Hello JavaKnowlegers,Makers
please convince yoursef that this puzzle can be coded in java but requiers only efforts after all,
"The secret of Success is constancy of Efforts"
Bye for now.

Ps: The above codes will enable you two make two matrices as per the two sets discussed earlier,but if modified would fetch the solution iteslf please try in Java from the cpluspluss

Thanking you

Henry Wong

author

Posts: 23936

142

I like...

posted 14 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

Hello JavaKnowlegers,Makers
please convince yoursef that this puzzle can be coded in java but requiers only efforts after all,
"The secret of Success is constancy of Efforts"
Bye for now.

What is so special about this C++ code that it can't be translated to Java? Heck, it is not even using pointers. And even if it was, it is only a dozen lines long. I doubt any C++/Java programmer, worth his/her salt, would need to convince ones self that this translations requires any effort.

Henry

Books: Java Threads, 3rd Edition, Jini in a Nutshell, and Java Gems (contributor)

C.R.Muthukumar

Ranch Hand

Posts: 59

posted 14 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

Originally posted by Henry Wong:

What is so special about this C++ code that it can't be translated to Java? Heck, it is not even using pointers. And even if it was, it is only a dozen lines long. I doubt any C++/Java programmer, worth his/her salt, would need to convince ones self that this translations requires any effort.

Henry

[quote] 
 Hello JavaAuthor and Java Kowledgers
I seldom got still any response from the connected Puzzle and its solution in java,though touched here and there halfheartedly or asking something  like clarity of the same puzzle by so many till date,though current author 
emphasissed for ref to Good java books which i am sure would be like a bottle-opener for correct solution.
However please try to deploy the follwing codes that uses permutations procedure and combinations .
please try to club combinatoric java methods and clear the codes total free from errors.It contains one error;on compilation.I cannot try out all myself becase that takes time .pl get the post completed by the experts and i need only ur completion of this topic.it has taken a year almost.
Withstanding all the  non meeting of good solution till date I still
thank you for the same viz Completion 
 
/* Person.java
Manage a persons's name and more.
*/
package Combinatoric;
import java.util.Scanner;
import java.util.Arrays;
import java.util.Calendar;
import java.util.Date;
import java.util.Enumeration;
import java.util.List;
import java.util.Vector;
import java.awt.*;
import java.math.*;

interface personnel
{
    int i=3;
 void solve();
 
}
class Person extends Frame{
 
//Instance variables
   //Each student object has a name and three test scores
   private String name;
  // Person name;
//Constructor method
 
   public Person(){
   //Initialize a new student's name to the empty string and the test
   //scores to zero.
      name = "";
 
         }
 
   //Other methods
 public void setName (String nm){
   //Set a student's name
      name = nm;
   }
 
   public String getName (){
   //Get a student's name
      return name;
   }
 
 public String toString(){
   //Construct and return a string representation of the student
      String str;
      str = "Name:    " + name  + "\n";
        return str;
   }
 
}
public class PersonApp extends Person implements personnel{
 public static void main(String[] args){
 
     Perosn npa= new Person();
     npa.resize(300,300);
       npa.setVisible(true);
     System.out.println("\n v1 "+ new Vector(l1) );
         System.out.println("\n v2" + new Vector(l2) );
 
// Instantiate the persons and the keyboard object
      Person person1 = new Person();
      Person person2 = new Person();
      Person person3 = new Person();
       Scanner reader = new Scanner(System.in);
 
      String name;
     //int score;
 
      // Input the first student's data
      System.out.print("Enter the first persons's name: ");
      name = reader.nextLine();
      person1.setName(name);
   // Consume the trailing newline character
      reader.nextLine();
 
      // Input the second person's data
      System.out.print("Enter the second person's name: ");
      name = reader.nextLine();
      person2.setName(name);
      reader.nextLine();
 
      // Input the second persons's data
      System.out.print("Enter the third person's name: ");
      name = reader.nextLine();
      person3.setName(name);
     // reader.nextLine();
 
  // Output the three Persons' information
      System.out.println(person1);
      System.out.println(person2);
       System.out.println(person3);

}
}
 
 class ArrayToVector extends PersonApp implements personnel{
 
 public static void main(String[] args){
 
     Perosn npa= new Person();
     npa.resize(300,300);
       npa.setVisible(true);
     System.out.println("\n v1 "+ new Vector(l1) );
         System.out.println("\n v2" + new Vector(l2) );

Object firsts[] =(Object[])firstNamePerm.nextElement(firstNames);
  Object firsts[]   = {"Mr.Smith", "Mr.Jones","Mr.Robinson"};
 Object specs[] =(Object[])specPerm.nextElement(specs);
  Object specs[]   =  {"Enginner","Brakeman","Fireman","Losanjelus","Chicago","Omaha"};

//Arrays.asList(Object[]) --> List
    List l1 = Arrays.asList(firsts);
    List l2 = Arrays.asList(specs);
    Vector v1,v2;
      // Vector contstructor takes Collection
    // List is a subclass of Collection
 
    v1 = new Vector(l1);
      //Vector v;
    v2 = new Vector(l2);
    // Or, more simply:
    v1 = new Vector(Arrays.asList(firsts));
    v2 = new Vector(Arrays.asList(specs));
    //v3 = new Vector(Arrays.asList(xx));
 
    // Just to prove that it worked.
      Enumeration e1 = v1.elements();
 
    while (e1.hasMoreElements())
    {
      System.out.println(e1.nextElement());
         }
     Enumeration e2 = v2.elements();
 
     while (e2.hasMoreElements())
     {
      System.out.println(e2.nextElement());
    }
 
}
}

class Puzzler1 extends PersonApp implements personnel
{
 
Permutations firstNamePerm = new Permutations(firstNames);

String[] specialInfo ={"Engineer","Fireman","Brakeman","LosAngelus","Omaha"};
 
void do();
{
 while(firstNamePerm.hasMoreElement())
   {
  Object[] firsts=(Object[])firstNamePerm.nextElement();
 
 Permuations specPerm= new Permutations(specialInfo);
 
while(specPerm.hasMoreElement())
{
Object[] specs =(Object[])specPerm.nextElement();
for(int i=0; i < persons.length; i++)
{
persons[i].firstName=(String)firsts[i];
persons[i].specialnfo=(String)specs[i];
}
if( smith.firstName  != "fireman" &&
    robinson.firstName == "Lsangelus" &&
    smith.specialinfo != "Brakeman" &&
    smith.specialInfo !=" Fireman" &&
     personNamed("Robinson").specialInfo == "LosAngelus")
{
 System.out.println("Solutions");
 
for(i=0; i < firstNames.length;i++)
{
System.out.println("\t "+ persons[i] + "    ");
 
     for(int i=0;i < persons.length;i++)
{
if(persons[i].firstName.equals(firstName))
{
        return persons[i];
     }
        throw  new  internalError("Bad firstName");
}
}
 
}
}
}
}
}
 
/**
class Combinatoric extends PersonApp
{
public static BigInteger c(int n,int m)
throws Exception{
check(n,m);
int r=Math.min(m,n-m);
return p(n,r).divide(factorial(r));}
static void check(int n, int m) throws Exception
{
if(n<0){
throw new Exception (
"n,the number of items ,must be greater than 0");}
if(n<m){
throw new Exception(
"n,the number of items must be >=m,the number selected");}
if(m<0){
throw new Exception(
"m,the number of selected items ,must be>=0");}}
 
public static BigInteger factorial(int n)
throws Exception{
if(n<0){
throw new Exception("n must be >=0");
}
BigInteger factorial = new BigInteger(new byte[]{1});
for(int i=n;i>1;i--)
{
 factorial= factorial.multiply(new BigInteger(new byte[]{(byte)i}));}
return factorial;
}
public static BigInteger p(int n) throws Exception{
return factorial(n);}
public static BigInteger p(int n,int m)
throws Exception{
check(n,m);
BigInteger product = new BigInteger(new byte[]{1});
for(int i=n;i>n-m;i--){
product= product.multiply(new BigInteger(new byte[]{(byte)i}));
}
return product;
}
}*/
 
  [/quote]

Bye for now

Bear Bibeault

Sheriff

Posts: 67699

173

I like...

posted 14 years ago

Number of slices to send:

Optional 'thank-you' note:

Send

"C.R.Muthukumar", having ignored five (5!) requests for you to change your display name to adhere to JavaRanch standards your account has been closed.

[Asking smart questions] [About Bear] [Books by Bear]

HTML 5 (verified skill)
Skill verified by Jeanne Boyarsky

CSS 3 (verified skill)
Skill verified by Jeanne Boyarsky

JavaScript (verified skill)
Skill verified by Jeanne Boyarsky

Oh the stink of it! Smell my tiny ad!

The Low Tech Laboratory Movie Kickstarter is LIVE NOW!

https://www.kickstarter.com/projects/paulwheaton/low-tech