Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
41 lines (40 loc) · 930 Bytes

File metadata and controls

41 lines (40 loc) · 930 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
class NcrAndNpr
{
double fact(double n)
{
int i=1;
double fact=1;
while(i<=n)
{
fact=fact*i;
i++;
}
return fact;
}
double permutation(int n,int r )
{
double per=fact(n)/fact(n-r);
return per;
}
double combination(int n,int r)
{
double com=fact(n)/(fact(n-r)*fact(r));
return com;
}
public static void main(String arg[])
{
NcrAndNpr p=new NcrAndNpr( );
Scanner sc=new Scanner(System.in);
System.out.println("enter value of n");
int n=sc.nextInt();
System.out.println("enter value of r");
int r=sc.nextInt();
if(n>=r)
{
System.out.println("The value of "+n+"p"+r+" is : "+p.permutation(n,r));
System.out.println("The value of "+n+"c"+r+" is : "+p.combination(n,r));
}
else
System.out.println("n value should be greater than or equals to r value");
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.