# www.vustudents.ning.com

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

Views: 1794

### Replies to This Discussion

Complete Idea Soluton

Share the Assignment Questions & Discuss Here....

Stay touched with this discussion, Solution idea will be uploaded as soon as possible in replies here before the due date.

Share the Assignment Questions & Discuss Here....

Stay touched with this discussion, Solution idea will be uploaded as soon as possible in replies here before the due date.

cs508 assignment no 03 solution fall 2020

import java.io.*;
import java.math.*;
import java.util.scanner;

static int reverse(int num){
int rev = 0, remainder;
while(num > 0) {
remainder = num %10;
rev = rev * 10 +remainder;
num = num/10;
}
return rev;
}
static boolean isPrime(intnum) {
int flage = 0;
for (int i = num; i >= 1; i--){
if(num % i == 0){
flage += 1;
}
}
if(flage == 2) {
return true;
}
else{
return false;
}
}
static boolean isTwistedPrime (int num){
if(isPrime (num) == false){
return false;
}
else {
return isPrime(reverse (num));
}
}

public static void main(String args[]) {
scanner scan = new scanner (system.in);
String uid;
uid = scan.nextLine();
String id = uid.substrings(7,11);
stringBuilder rid = new stringBuilder(id);
rid.reverse() ;
int count = Integer.parseInt(rid.tostring());

for(int i = 2; i <= count; i++){
if(isTwistedPrime(i)) {
system.out.print(i + " ");

}
}

}
}

Twisted Prime Number Between (1 to id k last 4 digits reverse)
line is missing