Fascinating Number ISC Computer Science 2021 Practical

-

A Fascinating number is one which when multiplied by 2 and 3 and then, after the results are concatenated with the original number, the new number contains all the digits from 1 to 9 exactly once.

There can be any number of zeroes and are to be ignored.

Example: 273
273 × 1 = 273
273 × 2 = 546
273 × 3 = 819

Concatenating the result we get, 273546819 which contains all digits from 1 to 9 exactly once.

Thus, 273 is a Fascinating number.

Accept two positive integers m and n, where m must be less than n and the values of both 'm' and 'n' must be greater than 99 and less than 10000 as user input.

Display all fascinating numbers that are in the range between m and n (both inclusive) and output them along with the frequency, in the format given below:

Example 1:
INPUT:
m = 100
n = 500
OUTPUT:
THE FASCINATING NUMBERS ARE:
192 219 273 327
FREQUENCY OF FASCINATING NUMBERS IS: 4

Example 2:
INPUT:
m = 900
n = 5000
OUTPUT:
THE FASCINATING NUMBERS ARE:
1902 1920 2019 2190 2703 2730 3027 3270
FREQUENCY OF FASCINATING NUMBERS IS: 8

Example 3:
INPUT:
m = 400
n = 900
OUTPUT:
THE FASCINATING NUMBERS ARE:
NIL
FREQUENCY OF FASCINATING NUMBERS IS: 0

Example 4:
INPUT:
m = 70
n = 450
OUTPUT:
INVALID INPUT

import java.util.Scanner;
class Fascinating{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        System.out.print("m = ");
        int m = Integer.parseInt(in.nextLine());
        System.out.print("n = ");
        int n = Integer.parseInt(in.nextLine());
        if(m < 100 || n < 100 || m > 9999 || n > 9990){
            System.out.println("INVALID INPUT");
            return;
        }
        int f = 0;
        System.out.println("THE FASCINATING NUMBERS ARE:");
        for(int i = m; i <= n; i++){
            if(isFascinating(i)){
                System.out.print(i + " ");
                f++;
            }
        }
        if(f == 0)
            System.out.print("NIL\n");
        else
            System.out.println();
        System.out.println("FREQUENCY OF FASCINATING NUMBERS IS: " + f);
    }
    public static boolean isFascinating(int num){
        int x = num;
        int y = num * 2;
        int z = num * 3;
        String c = x + "" + y + "" + z;
        for(char i = '1'; i <= '9'; i++){
            int count = 0;
            for(int j = 0; j < c.length(); j++){
                if(i == c.charAt(j))
                    count++;
            }
            if(count != 1)
                return false;
        }
        return true;
    }
}

Location: Asansol, West Bengal, India

Comments

Post a Comment

Popular posts from this blog

Encrypt Program ISC Specimen 2023 Theory

-
A class Encrypt has been defined to replace only the vowels in a word by the next corresponding vowel and forms a new word, i.e. A → E, E  → I, I  → O, O  → U and U  → A. Example : Input: COMPUTER Output: CUMPATIR Some of the members of the class are given below: Class name : Encrypt Data members/instance variables : wrd: to store a word len: integer to store the length of the word newWrd: to store the encrypted word Methods/Member functions : Encrypt(): default constructor to initialize data members with legal initial values void acceptWord(): to accept a word in uppercase void freqVowCon(): finds the frequency of the vowels void nextVowel(): replaces only the vowels from the word stored in 'wrd' by the next corresponding vowel and assigns it to 'newWrd', with the remaining alphabets unchanged void disp(): displays the original word along with the encrypted word Specify the class Encrypt giving details of the constructor, void acceptWord(), void freqVowCon(), void ...
Read more

No Repeat Program ISC Computer Science 2022 Semester 2 Theory

-
Design a class NoRepeat which checks whether a word has no repeated alphabets in it. Example : COMPUTER has no repeated alphabets but SCIENCE has repeated alphabets. The details of the class are given below: Class name : NoRepeat Data members/instance variables : word: to store the word len: to store the length of the word Methods/Member functions : NoRepeat(String wd): parameterized constructor to initialize word = wd boolean check(): checks whether a word has no repeated alphabets and returns true else returns false void prn(): displays the word along with an appropriate message Specify the class NoRepeat, giving details of the constructor, boolean check() and void prn(). Define the main() function to create an object and call the functions accordingly to enable the task. import java.util.Scanner; class NoRepeat{     String word;     int len;     public NoRepeat(String wd){         word = wd;         len = word.le...
Read more

Bank Inheritance Program ISC Specimen 2023 Theory

-
A super class Bank has been defined to store the details of the customer in a bank. Define a subclass Interest to calculate the compound interest. The details of the members of both the classes are given below: Class name : Bank Data members/instance variables : name: to store the name of the customer accNo: integer to store the account number principal: to store the principal amount in decimals Methods/member functions : Bank(...): parameterized constructor to assign values to the data members void display(): to display the customer details Class name : Interest Data members/instance variables : rate: to store the interest rate in decimals time: to store the time period in decimals Methods/member functions : Interest(...): parameterized constructor to assign values to the data members of both the classes double calculate(): to calculate and return the compound interest using the formula: CI = P(1 + R / 100) N - P, where P is the principal, R is the rate and N is the time void displ...
Read more