-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathproblem39.java
69 lines (60 loc) · 1.32 KB
/
problem39.java
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/**
Solved by
K.S.VIDHYA
111712205105 IT-B
*/
public class xxxx
{
/**
* @param args
*/
public static void main(String[] args)
{
int i;
for( i=510;;i++)
if(isprime(i))
if(i>0 &&!((i&(i-1))==1))
{
System.out.println(i);
break;
}
for( i=0;;i=i=i+2)
if(i%2==0)
if(i>0 &&!((i&(i-1))==1))
{
System.out.println(i);
break;
}
for( i=1;;i=i=i+2)
if(i%2!=0)
if(i>0 &&!((i&(i-1))==1))
{
System.out.println(i);
break;
}
for( i=2;;i=i=i*2)
if(i>0 &&!((i&(i-1))==1))
{
System.out.println(i);
break;
}
}
public static boolean isprime(int j)
{
int x=0;
if(j<2)
return false;
if(j%2==0 && j!=2)
return false;
for(int i=3;i<=Math.sqrt(j);i=i+2)
if(j%i==0)
{
x++;
break;
}
if(x==0)
return true;
else
return false;
}
}