DAY-4

//IsEven?
#include<stdio.h>
#include<string.h>
int isEven(int input1)
{
if(input1%2==0)
{
return 2;
}
else
{
return 1;
}
}
//IsOdd?
import java.io.*;
import java.util.*;
class UserMainCode
{
public int isOdd(int input1)
{
if(input1%2!=0)
{
return 2;
}
else
{
return 1;
}

}
}

//Return last digit of the given number

import java.io.*;
import java.util.*;
import java.math.*;
class UserMainCode
{
public int lastDigitOf(int input1)
{
return Math.abs(input1%10);
}
}
//Return second last digit of the given number
import java.io.*;
import java.util.*;
class UserMainCode
{
public int secondLastDigitOf(int input1)
{
if(input1<10 && input1>=0 || input1<0 && input1>=-9)
{
return -1;
}
else
{
int x=2;
 int r=0;
while(x>=1)
{
r=input1%10;
input1=input1/10;
x=x-1;
}
return Math.abs(r);
}

}
}

//Sum of last digits of two given numbers

import java.io.*;
import java.util.*;
import java.math.*;
class UserMainCode
{
public int addLastDigits(int input1,int input2)
{
int x=Math.abs(input1%10);
int y=Math.abs(input2%10);
return x+y;
}
}

DAY-5
//Is N an exact multiple of M
import java.io.*;
import java.util.*;
class UserMainCode
{
public intisMultiple(int input1,int input2)
{
if(input1==0||input2==0)
{
return 3;
}
else
{
if(input1%input2==0)
{
return 2;
}
else
{
return 1;
}
}
}
}

Of given 5 numbers, how many are even?

import java.io.*;
import java.util.*;
class UserMainCode
{
public int countEvens(int input1,int input2,int input3,int input4,int input5)
 {
int c=0;
if(input1%2==0)
{
c=c+1;
}
if(input2%2==0)
{
c=c+1;
}
if(input3%2==0)
{
c=c+1;
}
if(input4%2==0)
{
c=c+1;
}
if(input5%2==0)
{
c=c+1;
}
return c;
}
}

Of given 5 numbers, how many are odd?

import java.io.*;
import java.util.*;
class UserMainCode
{
public int countEvens(int input1,int input2,int input3,int input4,int input5)
{
int c=0;
if(input1%2!=0)
{
c=c+1;
}
if(input2%2!=0)
{
c=c+1;
}
if(input3%2!=0)
{
c=c+1;
}
if(input4%2!=0)
{
c=c+1;
}
if(input5%2!=0)
{
c=c+1;
}
return c;
}
}

Of 5 numbers, how many are even or odd?

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int countEvenOdds(int input1,int input2,int input3,int input4,int input5,char*
input6)
{
int oc=0,ec=0;
if(input1%2!=0)
{
oc=oc+1;
}
else{ec=ec+1;}
if(input2%2!=0)
{
oc=oc+1;
}
else{ec=ec+1;}
if(input3%2!=0)
{
oc=oc+1;
}
else{ec=ec+1;}
if(input4%2!=0)
{
oc=oc+1;
}
else{ec=ec+1;}
if(input5%2!=0)
{
oc=oc+1;
}
else{ec=ec+1;}
if(strcmp(input6,"odd")==0)
return oc;
else
return ec;
}

DAY-6
//Is Prime?
import java.io.*;
import java.util.*;
class UserMainCode
{
public int isPrime(int input1)
{
int i,flag=0;
if(input1==2)
return 2;
else
{
for(i=2;i<=input1/2;i++)
{
if(input1%i==0)
{
flag=1;
break;
}
}
 if(flag==1)
return 1;
else
return 2;
}
}
}

Factorial of a number
import java.io.*;
import java.util.*;
class UserMainCode
{
public int nFactorial(int input1)
{
int f=1;
while(input1>=1)
{
f=f*input1;
input1--;
}

return f;

}
}