import java.util.Scanner;
class Project10
{
public static int countDig(int n)
{
int c=0;
while(n!=0)
{
c++;
n/=10;
}
return c;
}
public static int sum(int a[])
{
int i,l=a.length,s=0;
for(i=0;i<l;i++)
s+=a[i];
return s;
}
public static void fillArr(int a[],int n)
{
int i=a.length-1;
while(n!=0)
{
a[i]=n%10;
n/=10;
i--;
}
}
public static boolean isKeith(int n)
{
int i,l=countDig(n),sum=0;
int a[]=new int[l];
fillArr(a,n);
while(a[0]<n)
{
sum=sum(a);
for(i=0;i<l-1;i++)
a[i]=a[i+1];
a[i]=sum;
}
if(a[0]==n)
return true;
else
return false;
}
public static void main(String[]args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number");
int n=sc.nextInt();
if(isKeith(n))
System.out.println("Yes Keith number");
else
System.out.println("Not Keith number");
}
}
class Project10
{
public static int countDig(int n)
{
int c=0;
while(n!=0)
{
c++;
n/=10;
}
return c;
}
public static int sum(int a[])
{
int i,l=a.length,s=0;
for(i=0;i<l;i++)
s+=a[i];
return s;
}
public static void fillArr(int a[],int n)
{
int i=a.length-1;
while(n!=0)
{
a[i]=n%10;
n/=10;
i--;
}
}
public static boolean isKeith(int n)
{
int i,l=countDig(n),sum=0;
int a[]=new int[l];
fillArr(a,n);
while(a[0]<n)
{
sum=sum(a);
for(i=0;i<l-1;i++)
a[i]=a[i+1];
a[i]=sum;
}
if(a[0]==n)
return true;
else
return false;
}
public static void main(String[]args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number");
int n=sc.nextInt();
if(isKeith(n))
System.out.println("Yes Keith number");
else
System.out.println("Not Keith number");
}
}
No comments:
Post a Comment