My grand padlet 3 july by Avaneesh Srivastava

question

avaneeshsrivastava — 2021-08-09 04:05:21 UTC

Specify a class smitharr containing one-dimension integer array of N elements with following
details:
Class name: smitharr
Data members/ Instance variables:
Arr[] : Stores the array elements
N : integer to store the number of rows
Member functions/Methods:
smitharr (int nn) : parameterised constructor to initialise the data
member N=nn.
void fillarray() : to input numbers in the array.
boolean isprime(int x) : returns true if x is prime number else return false
int sumdigit(int x) : return sum of digits present in number x.
int sumprimefact(int num) : generates prime factors of num and returns their sum.
void display() : displays the smith numbers present in the array.
(Smith number is a composite number; the sum of whose digit is the sum of digits of its prime
factors obtained as a result of prime factorization [excluding 1]. Example: 666
Prime factors are 2,3,3 and 37, its sum of digits are (6+6+6)=18 and sum of digits of prime factors
are (2+3+3+(3+7))=18. )
Specify the class smitharr giving details of constructor and all the methods.
Define main() method to create and object and call the functions accordingly to enable the task.

Aditya

2021-08-09 04:24:48 UTC

import java.util.*;
class smitharr
{
int Arr[] ;
int N = 0 ;
smith ( int nn )
{
N = nn ;
Arr = new int [ N ] ;
}
void fillarray ()
{
Scanner sc = new Scanner ( System.in ) ;
System.out.println ( " Enter " + N + " numbers " ) ;
for ( int i = 0 ; i < N ; i ++ )
Arr[i] = sc.nextInt() ;
}
boolean isprime ( int x )
{
int c = 0 ;
for ( int i = 1 ; i <= x ; i++ )
{
if ( x % i == 0 )
c++ ;
}
if ( c == 2 )
return true ;
else
return false ;
}
int sumdigit ( int x )
{
int sum = 0 ;
while ( x > 0 )
{
sum = sum + ( x % 10 ) ;
x = x / 10 ;
}
return sum ;
}
int sumprimefact ( int num )
{
int sum = 0 ;
for ( int i = 1 ; i <= num ; i ++ )
{
if ( num % i == 0)
{
if ( isprime( i ) == true )
sum = sum + sumdigit ( i ) ;
}
}
return sum ;
}
void display ()
{
for ( int i = 0 ; i < N ; i ++)
{
if ( sumdigit( Arr[i]) == sumprimefact ( Arr[i] ))
System.out.print ( Arr[i] + ", " )
}
void main ( int nn1 )
{
smitharr obj = new smitharr ( nn1 ) ;
obj.fillarray() ;
obj.display() ;
}
}

Anumay Rai XI A

anumayrai2nov2004 — 2021-08-09 04:25:28 UTC

Doing in Notebook

Aryashi

2021-08-09 04:25:52 UTC

doin' in notebook

adityajaiswal2 — 2022-01-10 07:38:44 UTC