MINDTREE Company Numerical Ability Permutation and Combination

The number of sequence in which 7 players can throw a ball so that the youngest player may not be the last one.

Read Solution (Total 2)

import java.util.*;
public class dice {

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int k,i,j,x,res,count=0;
int a[]={1,2,3,4,5,6};
int b[]={1,2,3,4,5,6};
int c[]={1,2,3,4,5,6};
System.out.println("Enter the non");
x=sc.nextInt();
System.out.println("Outputs are");
for(i=0;i
5 years agoHelpfull: Yes(3) No(2)

6(6!)=4320
7 years agoHelpfull: Yes(1) No(1)

MINDTREE Other Question

you have three dice each side is numbered as 1,2,3,4,5,6 .you have to take a number from user check that number as sum of any side number of these three dice.like we take number as 5 then the possibility are (1,1,3) (1,2,2) (1,3,1) (2,1,2) (2,2,1) (3,1,1) and is 6 possibility. So write to a program for that. You can write program in c.