-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathOUTPUT_QUESTIONS.java
More file actions
85 lines (78 loc) · 1.64 KB
/
Copy pathOUTPUT_QUESTIONS.java
File metadata and controls
85 lines (78 loc) · 1.64 KB
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
class OUTPUT_QUESTIONS
{
int Mystery( int num, int x, int y)
{
if(num<10)
return num;
else
{
int z = num % 10;
if( z % 2 == 0 )
return z*x + Mystery( num/10,x,y);
else
return z*y + Mystery( num/10,x,y);
}
}
boolean PalindromeNum( int N )
{
int rev= 0;
int num=N;
while( num>0)
{
int f= num/10;
int s =10*f;
int digit =num-s;
rev= rev*10 + digit;
num /= 10;
}
if( rev==N )
return true;
else
return false;
}
int Check(int m,int n)
{
if(n==1)
return -m--;
else
return ++m+Check(m,--n);
}
void someFun(int x,int y)
{
if(x>1)
{
if(x%y==0)
{
System.out.print(y+" ");
someFun(x/y,y);
}
else
someFun(x,y+1);
}
}
int print(int m,int n)
{
if(n>m)
return n-=m;
else
return n+++--m+print(m--,++n);
}
void test (int count)
{
if (count == 0)
System.out.println(" ");
else
{
System.out.println("Bye"+count);
test(--count);
System.out.println(" "+count);
}
}
int sumofDigits(int n,int p)
{
if(n==0)
return 0;
else
return (int)Math.pow((n%10),p)+sumofDigits(n/10,p-1);
}
}