- p是質數
- p=3(mod 4)
herrDeng網內搜尋
自訂搜尋
訂閱：
張貼留言 (Atom)
熱門文章
-
用 while loop 算 s=3*3+4*4+....88*88
-
33, 45, 87, 99, 27 算平均
-
輸出課表代碼矩陣 Hint: 2-D array, double-for loop
-
計算你上學期加權平均
-
連續複利
-
問int怎麼存-689這個數字。 int用4個bytes。 答案請用16進位表達。
-
data structure 期中考乙
-
產生10個0~99的亂數存在a[10] 中
28 則留言:
package ex01;public class b10133007 { static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); //int m1=(int)Math.sqrt(p); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }}
public class ex_01 { static boolean isPrime(int n){ if(n<1||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0;n<=500;n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(k); }}
public class ex29 { static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; }} System.out.println(); System.out.println(k); }
}
public class ec { static boolean isPrime(int n){ if(n<1||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m;i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0;n<=500;n++){ if(isPrime(n) && n%4==3){ System.out.print(n+","); k++; } } System.out.print(k); }}
public class GG1 { static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; }return true; }
public static void main(String[] args) { int p=0; for(int n=0; n<=500; n++){ if(isPrime(n) && n%4==3){ System.out.print(n+","); p++; } } System.out.println(p); }
}
public class ex1120 { static boolean isPrime(int n){ if(n<1 || n==1) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int x=0; for(int n=0; n<=500; n++) { if(isPrime(n)&&n%4==3){ System.out.print(n+","); x++; } } System.out.println(); System.out.println(x); }}
public class ex1 { static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; }return true; }
public static void main(String[] args) { int p=0; for(int n=0; n<=500; n++){ if(isPrime(n) && n%4==3){ System.out.print(n+","); p++; } } System.out.println(p); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class ex2 {
static boolean isPrime(int n){
if(n<1 ||n==1)return false;
int m= (int)Math.sqrt(n);
for (int i=2;i<m; i++){
if(n%i==0)return false;
}
return true;
}
public static void main (String[] args){
int x=0;
for(int n=0; n<=500;n++){
if(isPrime(n)&&n%4==3){
System.out.print(n+",");
x++;
}
}
System.out.println();
System.out.println(x);
}
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello567 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello1567 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class ex2 { static boolean isPrime(int n){ if(n<1 ||n==1)return false; int m= (int)Math.sqrt(n); for (int i=2;i<=m; i++){ if(n%i==0)return false; } return true; } public static void main (String[] args){ int x=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); x++; } } System.out.println(); System.out.println(x); }}
public class ec { static boolean isPrime(int n){ if(n<1||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m;i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0;n<=500;n++){ if(isPrime(n) && n%4==3){ System.out.print(n+","); k++; } } System.out.print(k); }}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class ZZZZZ { static boolean xas(int n){ if(n<4||n==1)return false ; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; }return true ; } public static void main(String[] args) { int z=0; for (int n=0;n<=500;n++){ if(xas( n)){z++; System.out.print(n+",");} }System.out.println();System.out.println(z); }}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class dd { static boolean isPrime(int n){ if (n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0 || n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(isPrime(n)){ System.out.print(n+","); z++; } } System.out.println(); System.out.println(z); } }
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class hello123 {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
public class ex3 { static boolean abc(int n){ if(n<=3) return false; int m=(int)Math.sqrt(n); for(int i=2;i<=m;i++){ if(n%i==0) return false; if(n%4!=3) return false; } return true; } public static void main(String[] args) { int z=0; for(int n=0;n<=500;n++){ if(abc(n)){ System.out.print(n+","); z++;} } System.out.println(); System.out.println(z); }}
public class hello {
static boolean isPrime(int n){ if(n<1 ||n==1) return false; int m=(int)Math.sqrt(n); for(int i=2; i<=m; i++){ if(n%i==0) return false; } return true; } public static void main(String[] args) { int k=0; for(int n=0; n<=500; n++){ if(isPrime(n)&&n%4==3){ System.out.print(n+","); k++; } } System.out.println(); System.out.println(k); }
}
張貼留言