Task - Interfaces - Primes in a Range

[akash-coded]

Like a class, an interface can have methods and variables, but the methods declared in the interface are by default abstract (only method signature, no method body).

Given an interface in1 which includes a method display that takes an integer as input.

interface in1
{
    void display(int p);
}

The task is to write a class TestClass which implements interface in1 and has a method display() that takes an integer as input and prints the total number of prime numbers between 2 and integer k (including it).

Input:
The first line will contain an integer T (number of test cases). Each test case consists of an integer n.

Output:
Print total number of prime numbers between 2 and the given number ( including them ).

Example:

Input:
2
13
19

Output:
6
8

[Gaurav-Joshi-31]

import java.util.Scanner;

interface in1 {
    void display(int k);
}

class TestClass implements in1 {
    private static boolean isPrime(int n) {
        if (n < 2)
            return false;

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }

        }
        return true;
    }

    @Override
    public void display(int k) {
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i))
                count++;
        }
        System.out.println(count);

    }

}

public class TotalPrime {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        TestClass test = new TestClass();
        System.out.println("Enter an integer:");
        int n = sc.nextInt();
        int arr[] = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        for (int i : arr) {
            test.display(i);
        }

    }
}

[Sarfinaa]

import java.util.*;

interface in1 {
    void display(int p);
}

class testClass implements in1 {

    public boolean isPrime(int n) {
        boolean prime = true;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0)
                prime = false;
        }
        return prime;
    }

    public int count(int p) {
        int count = 0;
        for (int i = 2; i <= p; i++) {
            if (isPrime(i))
                count++;
        }
        return count;
    }

    public void display(int p) {
        System.out.println("count for " + p + ":" + count(p));
    }
}

public class Interface {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.print("Enter value of n:");
        int n = s.nextInt();
        for (int i = 0; i < n; i++) {
            testClass test = new testClass();
            test.display(s.nextInt());
        }

    }
}

[ps030300]

Like a class, an interface can have methods and variables, but the methods declared in the interface are by default abstract (only method signature, no body).

Given an interface in1 which includes a method display that takes an integer as input.

interface in1
{
    void display(int p);
}

The task is to write a class testClass which implements interface in1 and has a method named display which takes an integer as input and the total number of prime numbers between 2 and integer k (including it).

Input: The first line will contain an integer T (number of test cases). Each test case consists of an integer n.

Output: Print total number of prime numbers between 2 and the given number ( including them ).

Example:

Input:
2
13
19

Output:
6
8

import java.util.*;

interface in1 {
    void display(int p);
}

class testClass implements in1 {

    public boolean isPrime(int n) {
        boolean prime = true;
        for (int i = 2; i <= n / 2; i++) {
            if (n % i == 0)
                prime = false;
        }
        return prime;
    }

    public int count(int p) {
        int res = 0;
        for (int i = 2; i <= p; i++) {
            if (isPrime(i))
                res++;
        }
        return res;
    }

    public void display(int p) {
        System.out.println(count(p));
    }
}

public class InterfacePrime {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.print("Enter no of test Cases:");
        int n = s.nextInt();
        for (int i = 0; i < n; i++) {
            testClass test = new testClass();
            test.display(s.nextInt());
        }

    }
}

[Khyati-tripathi]

import java.util.*;

interface in1 {
    void display(int p);
}

class testClass implements in1 {
    boolean prime(int n) {
        if (n <= 1)
            return false;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0)
                return false;
        }
        return true;
    }

    public void display(int p) {
        int count = 0;
        for (int i = 2; i <= p; i++) {
            if (prime(i))
                count++;

        }
        System.out.println(count);

    }

}

public class InterfaceDriver1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        int a[] = new int[t];
        for (int i = 0; i < t; i++) {
            a[i] = sc.nextInt();

        }
        for (int i = 0; i < t; i++) {
            testClass obj = new testClass();
            obj.display(a[i]);
        }

    }

}

[Harshita-Joshi]

`import java.util.Scanner;

interface in1{
void display(int p);
}

class testClass implements in1{

public void display(int n){
    if(n==0||n==1)
    return;
    else{
        int cnt=0;
        for(int i=2; i<=n; i++){
            if(isPrime(i)==true){
                cnt++;
            }
        }
        System.out.println(cnt);
    }
}

boolean isPrime(int n){
    if(n==2 || n==3)
    return true;
    else if(n%2==0)
    return false;
    else if(n%3==0)
    return false;
    else{
        for(int i=5; i*i<=n; i=i+6){
            if((n%i==0)||(n%(i+2)==0))
            return false;
        }
        return true;
    }
}

}

public class InterfaceOneDriver {
public static void main(String[] args) {

    Scanner scn = new Scanner(System.in);
    testClass test = new testClass();
    int T = scn.nextInt();
    int[] res = new int[T];
    for(int i=0; i<T; i++){
        res[i] = scn.nextInt();
    }

    for(int i=0; i<T; i++){
        test.display(res[i]);
    }


}

}
`

[Ashwesh09]

import java.util.Scanner;

interface int1 {
    int display(int p);
}

class testCase implements int1 {
    boolean isPrime(int n)
    {
        if (n <= 1)
            return false;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }
        }
  
        return true;
    }
    public int display(int k) {
        int count = 0 ;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i)) {
                count++;
            }
        }
        return count;
    }
}

public class InterfaceExample {
    public static void main(String[] args) {
        int1 testPrime = new testCase();
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();
        int[] arr = new int[num];
        for (int i = 0; i < num; i++)
            arr[i] = testPrime.display(sc.nextInt());
        for (int i = 0; i < num; i++)
            System.out.println(arr[i]);
        sc.close();
    }
}
    

[sruthi-15-sketch]

import java.util.*;
interface in1{
void display(int p);
}
class TestClass implements in1{
int flag=0;
int c=0;
public void display(int p){
c=0;
for(int j=2;j<=p;j++){
flag=0;
int h=j/2;
for(int i=2;i<=h;i++){
if (j%i==0){
flag=1;
break;
}
if (flag==1) break;
}
if (flag==0){
c++;
}
}
System.out.println(c);
}
}
public class Main {
public static void main(String[] args) {
TestClass t=new TestClass();
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
for(int i=0;i<n;i++){
t.display(sc.nextInt());
}
}
}

[Shubhi27]

package session9;

import java.util.Scanner;

interface in1 {
    void display(int p);
}

class TestClass implements in1 {
    boolean checkPrime(int n) {
        if (n < 2)
            return false;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0)
                return false;
        }
        return true;
    }

    int count = 0;

    public void display(int p) {
        for (int i = 2; i <= p; i++) {
            if (checkPrime(i)) {
                count++;
            }
        }
        System.out.println(count);
    }
}

public class Interface1 {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int arr[] = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = s.nextInt();
        }
        for (int i = 0; i < n; i++) {
            TestClass test = new TestClass();
            test.display(arr[i]);
        }

    }

}

[ratnadeepikavuddagiri]

`import java.util.Scanner;
interface in1
{
void display(int n);
}
class TestClass implements in1{

@Override
public void display(int n) {
    // TODO Auto-generated method stub
    int c=0;
    for(int j=2;j<=n;j++){
        if(isPrime(j))
            c++;
    }
    System.out.println(c);
}
static boolean isPrime(int n){
    for(int i=2;i<=n/i;i++){
        if(n%i==0)
            return false;
    }
    return true;
}                     

}
public class PrimeNumbers {

public static void main(String[] args) {
    Scanner S = new Scanner(System.in);
    int t;
    TestClass testClass = new TestClass();
    System.out.println("Enter no .of test cases :");
    t =S.nextInt();
    while(t>0){
        int n;
        n= S.nextInt();
        testClass.display(n);
        t--;
    }    
}

}
`

[RohitNaikade1]

import java.util.*;

interface in1{
    void display(int p);
}

class testClass implements in1 {

    boolean isPrime(int num){
        for(int i=2;i<num;i++){
            if(num%i==0){
                return false;
            }
        }

        return true;
    }
    public void display(int n){
        for(int i=2;i<=n;i++){
            if(isPrime(i)){
                System.out.print(i+" ");
            }
        }
    }
}

public class PrimeInterface {
    public static void main(String[] args) {
        Scanner s1 = new Scanner(System.in);
        int tests=s1.nextInt();
        testClass t1=new testClass();
        for(int i=0;i<tests;i++){
            int n=s1.nextInt();
            t1.display(n);
        }
    }
}

[KaminiJha]

import java.util.Scanner;
interface in1
{
    void display(int p);
}
class TestClass implements in1{
    @Override
    public void display(int num)
    {
        int count=count(num);
        System.out.println(count);
    }
    public int count(int num)
    {
        int count=0;
        for(int i=2;i<=num;i++)
        {
            if(isPrime(i)==true)
            {
                count++;
            }
        }
        return count;
    }
    public boolean isPrime(int num)
    {
        for(int i=2;i*i<num;i++)
        {
            if(num%i==0)
            {
                return false;
            }
        }
        return true;
    }
}
public class InterfaceTask1{
    public static void main(String[] args)
    {
        TestClass tc=new TestClass();
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        while(t!=0)
        {
            int num=sc.nextInt();
            tc.display(num);
            t--;
        }
    }
}

[Ashritha-sd]

`import java.util.Scanner;
interface in1
{
void display(int p);
}
class TestClass implements in1
{
public int count=0;
boolean isPrime(int n)
{
if (n <= 1)
return false;
for (int i = 2; i <= n/2; i++) {
if (n % i == 0)
return false;
}
return true;
}
@OverRide
public void display(int p)
{
for(int k=2;k<=p;k++)
{
if(isPrime(k))
{
count++;
}
}
System.out.println(count);
}

}
public class Interface1
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
for(int i=0;i<n;i++)
{
TestClass tc=new TestClass();
tc.display(arr[i]);
}

}

}`

[SabaMhabar]

interface in1 {
void display(int p);
}

class TestClass implements in1 {

@Override
public void display(int p) {
    int c = 0;
    for (int i = 2; i <= p; i++) {
        if (isPrime(i))
            c++;
    }
    System.out.println("Number of prime numbers from 2 to " + p + " : " + c);
}

private boolean isPrime(int n) {
    if (n == 2)
        return true;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0)
            return false;
    }
    return true;
}

}

public class Interface1 {
public static void main(String[] args) {
TestClass t = new TestClass();
t.display(13);
t.display(19);
}
}

[lalit-ky]

import java.util.Scanner;

interface In1 {
    void display(int k);
}

class TestClass implements In1 {
    private static boolean isPrime(int n) {
        if (n < 2)
            return false;

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }

        }
        return true;
    }

    public void display(int k) {
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i))
                count++;
        }
        System.out.println(count);

    }

}

public class PrimeRange {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        TestClass testclass = new TestClass();
        System.out.print("Enter Number of Test Cases : ");
        int n = sc.nextInt();
        int[] arr = new int[n];
        System.out.println("Enter " + n + " Integers : ");
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        System.out.println();
        for (int i : arr) {
            testclass.display(i);
        }
        sc.close();
    }
}

[SrideviYamala]

import java.util.Scanner;

interface in1 {
    void display(int p);
}

class TestClass implements in1 {
    boolean isPrime(int n) {
        for (int i = 2; i < n; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

    public void display(int p) {
        int count = 0;
        for (int i = 2; i <= p; i++) {
            if (isPrime(i)) {
                count++;
            }
        }
        System.out.println(count);
    }
}

public class InterfaceTask {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();
        int a[] = new int[T];
        for (int i = 0; i < T; i++) {
            a[i] = scanner.nextInt();
        }
        for (int i = 0; i < T; i++) {
            in1 obj = new TestClass();
            obj.display(a[i]);
        }
    }
}

[preeti-max]

`import java.util.Scanner;
interface in1
{
void display(int p);
}
class testClass implements in1{

public boolean isPrime(int n) {
    boolean prime = true;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0)
            prime = false;
    }
    return prime;
}
public void display(int k) {
    int count = 0;
    for (int i = 2; i <= k; i++) {
        if (isPrime(i))
            count++;
    }
    System.out.println(count);

}

}

public class Inteface {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);

    int n= sc.nextInt();
    int arr[]=new int[n];
    for (int i = 0; i < n; i++) {
        arr[i] = sc.nextInt();
    }
    for (int i = 0; i < n; i++) {
        testClass test = new testClass();
        test.display(arr[i]);
    }
    
    

    
}

}
`

[VigneshVishwa]

import java.util.Scanner;

interface in1 {
    void display(int p);
}

class Test implements in1 {
    private static boolean isPrime(int n) {
        if (n < 2)
            return false;

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }

        }
        return true;
    }

    @Override
    public void display(int k) {
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i))
                count++;
        }
        System.out.println(count);

    }

}

public class Interface {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Test t = new Test();
        int n = sc.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        for (int i : arr)
            t.display(i);

    }
}

[ujjwal18bit1167]

import java.util.Scanner;

interface in1 {
    void display(int k);
}

class TestClass implements in1 {
    private static boolean isPrime(int n) {
        if (n < 2)
            return false;

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }

        }
        return true;
    }

    @Override
    public void display(int k) {
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i))
                count++;
        }
        System.out.println(count);

    }

}

public class TotalPrime {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        TestClass test = new TestClass();
        System.out.println("Enter an integer:");
        int n = sc.nextInt();
        int arr[] = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        for (int i : arr) {
            test.display(i);
        }

    }
}

[ghost]

import java.util.Scanner;

interface in1 {
    void display(int p);
}

class TestClass implements in1 {
    boolean checkPrime(int n) {
        if (n < 2)
            return false;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0)
                return false;
        }
        return true;
    }

    int count = 0;

    public void display(int p) {
        for (int i = 2; i <= p; i++) {
            if (checkPrime(i)) {
                count++;
            }
        }
        System.out.println(count);
    }
}

public class d17 {
    public static void main(String[] args) {
        Scanner obj = new Scanner(System.in);
        int n = obj.nextInt();
        int a[] = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = obj.nextInt();
        }
        for (int i = 0; i < n; i++) {
            TestClass test = new TestClass();
            test.display(a[i]);
        }
    }
}

[uzma23]

import java.util.Scanner;

interface in1 {
    void display(int p);
}

class TestClass implements in1 {
    public boolean isPrime(int n) {
        boolean prime = true;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0)
                prime = false;
        }
        return prime;
    }

    public int count(int p) {
        int count = 0;
        for (int i = 2; i <= p; i++) {
            if (isPrime(i))
                count++;
        }
        return count;
    }

    public void display(int p) {
        System.out.println(count(p));

    }
}

public class discussion17 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        TestClass t1 = new TestClass();
        System.out.println("How many numbers?");
        int n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            System.out.println("Enter numbers");
            int p = sc.nextInt();
            t1.display(p);
        }

    }

}

[gayatribabar]

import java.util.Scanner;

interface in1 {
    int display(int p);
}

class Test implements in1 {
    public static boolean isPrime(int n) {
        if (n <= 1) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(n); i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

    public int display(int p) {
        int count = 0;
        for (int i = 2; i <= p; i++) {
            if (isPrime(i)) {
                count++;
            }
        }
        return count;

    }
}

public class TestInterface {
    public static void main(String[] args) {
        System.out.println("Enter n: ");
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Test T = new Test();

        for (int i = 0; i < n; i++) {
            System.out.println("Enter a number");
            System.out.println(T.display(sc.nextInt()));
        }
    }

}

[Coder-093]

import java.util.*;

public class task17 {
  public static void main(String[] args) {
    Scanner scn = new Scanner(System.in);
    System.out.print("Enter the no. of test Cases:");
    int n = scn.nextInt();
    for (int i = 0; i < n; i++) {
      TestClass test = new TestClass();
      System.out.println("Enter a number");
      test.display(scn.nextInt());
    }
  }
}

interface in1 {
  void display(int p);
}

class TestClass implements in1 {
  public void display(int k) {
    System.out.println("Prime numbers within this number are " + count(k));
  }

  public boolean isPrime(int n) {
    boolean prime = true;
    for (int i = 2; i <= n / 2; i++) {
      if (n % i == 0)
        prime = false;
    }
    return prime;
  }

  public int count(int k) {
    int cnt = 0;
    for (int i = 2; i <= k; i++) {
      if (isPrime(i))
        cnt++;
    }
    return cnt;
  }
}

[Kuntapaliwal]

package java_programs;

interface myInteface {
    void display(int p);

}

class TestClass implements myInteface {

    private static boolean isPrime(int n) {
        if (n < 2)
            return false;

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }

        }
        return true;
    }

    @Override
    public void display(int k) {
        // TODO Auto-generated method stub
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i))
                count++;
        }
        System.out.println(count);
    }

}

public class Interfaces {
    public static void main(String[] args) {
        TestClass test = new TestClass();
        test.display(13);
        test.display(19);
    }

}

[ghost]

import java.util.*;
import java.math.*;

interface in1 {
    void display(int p);
}

class Test implements in1 {
    private static boolean isPrime(int n) {
        if (n < 2)
            return false;

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }

        }
        return true;
    }

    @Override
    public void display(int k) {
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i))
                count++;
        }
        System.out.println(count);

    }

}

public class assigment5 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Test test = new Test();
        System.out.println("Enter an integer");
        int n = sc.nextInt();
        int arr[] = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        for (int i : arr) {
            test.display(i);
        }

    }

}

[meghvi-raj]

import java.util.*;

public class D17 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter no of test Cases:");
        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            testClass test = new testClass();
            test.display(sc.nextInt());
        }
    }

}

interface in1 {
    void display(int p);
}

class testClass implements in1 {
    public boolean isPrime(int n) {
        boolean prime = true;
        for (int i = 2; i <= n / 2; i++) {
            if (n % i == 0)
                prime = false;
        }
        return prime;
    }

    public int count(int p) {
        int res = 0;
        for (int i = 2; i <= p; i++) {
            if (isPrime(i))
                res++;
        }
        return res;
    }

    public void display(int p) {
        System.out.println(count(p));
    }

}

[vshvandana]

import java.util.*;

interface in1 {
    void display(int p);
}

class testclass implements in1 {
    private boolean prime(int n) {

        for (int i = 2; i < n ; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

    public void display(int p) {
        int count = 0;
        for (int i = 2; i <= p - 1; i++) {
            if (prime(i)) {
                count++;
            }
        }
        System.out.println(count);
    }
}

public class interfaces {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            testclass test = new testclass();
            test.display(sc.nextInt());
        }

    }
}

[Gauravkumar930]

import java.util.Scanner;

interface In1 {
    void display(int k);
}

class TestClass implements In1 {
    private static boolean isPrime(int n) {
        if (n < 2)
            return false;

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }

        }
        return true;
    }

    public void display(int k) {
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i))
                count++;
        }
        System.out.println(count);

    }

}

public class Interface {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        TestClass testclass = new TestClass();
        System.out.print("Enter Number of Test Cases : ");
        int n = sc.nextInt();
        int[] arr = new int[n];
        System.out.println("Enter " + n + " Integers : ");
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        System.out.println();
        for (int i : arr) {
            testclass.display(i);
        }
        sc.close();
    }
}

[Shivani2145]

import java.util.Scanner;

interface In1 {
    void display(int k);
}

class TestClass implements In1 {
    private static boolean isPrime(int n) {
        if (n < 2)
            return false;

        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }

        }
        return true;
    }

    public void display(int k) {
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i))
                count++;
        }
        System.out.println(count);

    }

}

public class Interface {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        TestClass testclass = new TestClass();
        System.out.print("Enter Number of Test Cases : ");
        int n = sc.nextInt();
        int[] arr = new int[n];
        System.out.println("Enter " + n + " Integers : ");
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        System.out.println();
        for (int i : arr) {
            testclass.display(i);
        }
        sc.close();
    }
}

[Lohithr1975]

lohith R

import java.util.Scanner;
class Main {
public static void main(String[] args) {
TestClass t=new TestClass();
System.out.println("enter a number");
Scanner sc = new Scanner (System.in);
int number = sc.nextInt();
int arr[]=new int[number];
for(int i=0;i<number;i++){
arr[i]=sc.nextInt();
}
for(int i=0;i<number;i++){

t.display(arr[i]);

}

}

}

interface in1{
void display(int p);
}

class TestClass implements in1{
@OverRide
public void display(int p){
System.out.println(countPrime(p));
}

   public int countPrime(int p){
       int count=1;
       for(int i=2;i<p;i++){
           if(isPrime(i)){
               count++;
           }
       }
       return count;
   }
   
   boolean isPrime(int a){
       for(int i=2;i<a;i++){
           if(a%i==0)return false;
       }
       return true;
   }

}

[nandhusekar]

Naga Nandhini

import java.util.Scanner;

interface in1 {
    void display(int p);
}

public class TestClass implements in1 {

    private boolean isPrime(int num) {
        if (num < 2) return false;
        for (int i = 2; i * i <= num; i++) {
            if (num % i == 0) return false;
        }
        return true;
    }

    public void display(int k) {
        int count = 0;
        for (int i = 2; i <= k; i++) {
            if (isPrime(i)) {
                count++;
            }
        }
        System.out.println(count);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        TestClass obj = new TestClass();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            obj.display(n);
        }
        sc.close();
    }
}

[Sdey0907]

Task 1 - Sayan Dey Completed

import java.util.Scanner;

// Interface declaration
interface in1 {
void display(int p);
}

// Class implementing the interface
class TestClass implements in1 {

// Overriding the display method
public void display(int k) {
    int count = 0;
    for (int i = 2; i <= k; i++) {
        if (isPrime(i)) {
            count++;
        }
    }
    System.out.println(count);
}

// Helper method to check if a number is prime
private boolean isPrime(int num) {
    if (num < 2)
        return false;
    for (int i = 2; i <= Math.sqrt(num); i++) {
        if (num % i == 0)
            return false;
    }
    return true;
}

}

public class Main{
    public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int T = sc.nextInt();  // Number of test cases
    TestClass obj = new TestClass();

    for (int i = 0; i < T; i++) {
        int n = sc.nextInt();
        obj.display(n);
    }

    sc.close();
}

}