- p是質數
- p=3(mod 4)
herrDeng網內搜尋
自訂搜尋
訂閱：
張貼留言 (Atom)
熱門文章
-
教育部為提昇全民資安素養與電腦防護能力，本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動，請在活動期間內踴躍上網檢測資訊安全素養認知程度，並有機會參與抽獎，詳情請參閱活動網站（網址： https://isafe.moe.edu.tw/event
-
先說明一下這是後知後覺的解答，所謂後知就是股票價格已知存在陣列(清單)，當然就要用迴圈練習，雙迴圈暴力解需時O(n**2)，當然不用，採python單一迴圈解答「最佳股票的買賣時機#LeetCode 121 Best Time to Buy and Sell Stock」，解...
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
你會用C的算子sizeof?
-
Python C++使用字串find迴圈速解Leetcode 2490 Circular Sentence C++ & Python都有字串的find，用法都類似 split=s.find(' ', split+1)能找到s從index=split+1開...
-
Python CPP heap priority queue速解L eetcode 2530. Maximal Score After Applying K Operations heap/priority queue是重要的資料結構，無論是C++的std::priority_q...
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); }
}
張貼留言