這是Herr Deng桑的教學blog，主要處理作業與班導事務，另外還有數位小品。
public class ZX3 { public static boolean isPrime(int n) { if(n==1) return false; boolean result=true; int nn=(int)(Math.sqrt(n)); for(int d=2; d<=nn; d++){ if( n%d == 0){ result=false; break; } } return result; } public static void main(String[] args){ int counter=1; for(int i=3; i<=200; i+=2) if(isPrime(i)) counter++; System.out.println(counter); } }
public class kk {public static boolean isPrime(int n) { if(n==1) return false; boolean result=true; int nn=(int)(Math.sqrt(n)); for(int d=2; d<=nn; d++){ if( n%d == 0){ result=false; break; } } return result;}public static void main(String[] args){ int counter=1; for(int i=3; i<=200; i+=2) if(isPrime(i)) counter++; System.out.println(counter); }}
public class ex1 { private static boolean isPrime(int n){ if(n==1) return false; boolean result=true; int nn=(int)(Math.sqrt(n)); for(int d=2; d<=nn; d++){ if( n%d == 0){ result=false; break; } } return result; } public static void main(String[] args) { int counter=1; for(int i=1;i<=200;i+=2) if(isPrime(i)) counter++; System.out.println(counter); } }
public static boolean isPrime(int n) { if(n==1) return false; boolean result=true; int nn=(int)(Math.sqrt(n)); for(int d=2; d<=nn; d++){ if( n%d == 0){ result=false; break; } } return result; } public static void main(String[] args){ int counter=1; for(int i=3; i<=200; i+=2) if(isPrime(i))counter++; System.out.println(counter); }}
package aaa;public class bbbb { public static boolean isPrime(int n) { if(n==1) return false; boolean result=true; int nn=(int)(Math.sqrt(n)); for(int d=2; d<=nn; d++){ if( n%d == 0){ result=false; break; } } return result; } public static void main(String[] args){ int counter=1; for(int i=3; i<=200; i+=2) if(isPrime(i)) counter++; System.out.println(counter); } }
public class xcsdvsdvdsv { public static boolean isPrime(int n){ if (n==1) return false; boolean result=true; int nn=(int)(Math.sqrt(n)); for(int d=2;d<=nn ;d++){ if(n%d == 0){ result=false; break; } } return result; } public static void main(String[] args) { int counter =1; for(int i=3;i<=200 ;i+=2) if(isPrime(i))counter++; System.out.println(counter); } }
public class Z2 { static boolean judyfirst(int judy){ if(judy==1) return false;//1永遠都不是植樹 boolean result=true;//建立變數蕊壽等於處 for(int a=2;a<judy;a++){//從二跑到茱蒂 if(judy%a==0) {//茱蒂取餘數等於零 result=false;//代表他不是植樹 break;//結束 } } return result;//兩個算完回傳 } public static void main(String[] args) { int counter=0; for(int s=1;s<=200;s++) if(judyfirst(s)) counter++; System.out.println(counter); }}
public class ex1 { public static boolean isPrime(int n){ if(n==1) return false; boolean r=true; for(int i=2;i<n;i++){ if(n%i==0){ r=false; break; } } return r; } public static void main(String[] args) { int count=0; for(int i=1;i<=200;i++){ if(isPrime(i)) count++; } System.out.println(count); }}
public class ex11 { public static boolean isPrime(int n){ if(n==1) return false; boolean re=true; for(int i=2;i<n;i++){ if(n%i==0) re=false; } return re; } public static void main(String[] args) { int c=0; for(int j=1;j<=200;j++){ if(isPrime(j)) c++; } System.out.println(c); }}
public class S123 { public static boolean isPrime(int n){ if(n==1) return false; boolean re=true; for(int d=2; d<n; d++){ if(n%d==0){ re=false; } } return re; } public static void main(String[] args) { int c=0; for(int i=1;i<=200;i++){ if(isPrime(i)) c++; }System.out.println(c); }}
public class EX2 { public static boolean isPrime(int n){ if(n==1) return false; boolean result=true; for(int d=2; d<n; d++){ if( n%d == 0){ result=false; break; } } return result; } public static void main(String[] args ) { int c=0; for(int i=1;i<=200;i++){ if(isPrime(i)) c++; } System.out.println(c); }}
public class ex11 { public static boolean isPrime(int n){ if(n==1) return false; boolean re=true; for(int d=2; d<n; d++){ if(n%d==0){ re=false; } } return re; } public static void main(String[] args) { int c=0; for(int i=1;i<=200;i++){ if(isPrime(i)) c++; }System.out.println(c); }}
public class ex11 {public static boolean isPrime(int n){if(n==1) return false;boolean re=true;for(int d=2; d<n; d++){if(n%d==0){re=false;}}return re;}public static void main(String[] args) {int c=0;for(int i=1;i<=200;i++){if(isPrime(i)) c++;}System.out.println(c);}
張貼留言
17 則留言:
public class ZX3 {
public static boolean isPrime(int n) {
if(n==1) return false;
boolean result=true;
int nn=(int)(Math.sqrt(n));
for(int d=2; d<=nn; d++){
if( n%d == 0){
result=false;
break;
}
}
return result;
}
public static void main(String[] args){
int counter=1;
for(int i=3; i<=200; i+=2)
if(isPrime(i)) counter++;
System.out.println(counter);
}
}
public class kk {
public static boolean isPrime(int n) {
if(n==1) return false;
boolean result=true;
int nn=(int)(Math.sqrt(n));
for(int d=2; d<=nn; d++){
if( n%d == 0){
result=false;
break;
}
}
return result;
}
public static void main(String[] args){
int counter=1;
for(int i=3; i<=200; i+=2)
if(isPrime(i)) counter++;
System.out.println(counter);
}}
public class ex1 {
private static boolean isPrime(int n){
if(n==1) return false;
boolean result=true;
int nn=(int)(Math.sqrt(n));
for(int d=2; d<=nn; d++){
if( n%d == 0){
result=false;
break;
}
}
return result;
}
public static void main(String[] args) {
int counter=1;
for(int i=1;i<=200;i+=2)
if(isPrime(i)) counter++;
System.out.println(counter);
}
}
public static boolean isPrime(int n) {
if(n==1) return false;
boolean result=true;
int nn=(int)(Math.sqrt(n));
for(int d=2; d<=nn; d++){
if( n%d == 0){
result=false;
break;
}
}
return result;
}
public static void main(String[] args){
int counter=1;
for(int i=3; i<=200; i+=2)
if(isPrime(i))counter++;
System.out.println(counter);
}
}
package aaa;
public class bbbb {
public static boolean isPrime(int n) {
if(n==1) return false;
boolean result=true;
int nn=(int)(Math.sqrt(n));
for(int d=2; d<=nn; d++){
if( n%d == 0){
result=false;
break;
}
}
return result;
}
public static void main(String[] args){
int counter=1;
for(int i=3; i<=200; i+=2)
if(isPrime(i)) counter++;
System.out.println(counter);
}
}
public class xcsdvsdvdsv {
public static boolean isPrime(int n){
if (n==1) return false;
boolean result=true;
int nn=(int)(Math.sqrt(n));
for(int d=2;d<=nn ;d++){
if(n%d == 0){
result=false;
break;
}
}
return result;
}
public static void main(String[] args) {
int counter =1;
for(int i=3;i<=200 ;i+=2)
if(isPrime(i))counter++;
System.out.println(counter);
}
}
public class Z2 {
static boolean judyfirst(int judy){
if(judy==1) return false;//1永遠都不是植樹
boolean result=true;//建立變數蕊壽等於處
for(int a=2;a<judy;a++){//從二跑到茱蒂
if(judy%a==0) {//茱蒂取餘數等於零
result=false;//代表他不是植樹
break;//結束
}
}
return result;//兩個算完回傳
}
public static void main(String[] args) {
int counter=0;
for(int s=1;s<=200;s++)
if(judyfirst(s)) counter++;
System.out.println(counter);
}
}
public class ex1 {
public static boolean isPrime(int n){
if(n==1)
return false;
boolean r=true;
for(int i=2;i<n;i++){
if(n%i==0){
r=false;
break;
}
}
return r;
}
public static void main(String[] args) {
int count=0;
for(int i=1;i<=200;i++){
if(isPrime(i))
count++;
}
System.out.println(count);
}
}
public class ex11 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean re=true;
for(int i=2;i<n;i++){
if(n%i==0)
re=false;
}
return re;
}
public static void main(String[] args) {
int c=0;
for(int j=1;j<=200;j++){
if(isPrime(j))
c++;
}
System.out.println(c);
}
}
public class S123 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean re=true;
for(int d=2; d<n; d++){
if(n%d==0){
re=false;
}
}
return re;
}
public static void main(String[] args) {
int c=0;
for(int i=1;i<=200;i++){
if(isPrime(i)) c++;
}System.out.println(c);
}
}
public class EX2 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean result=true;
for(int d=2; d<n; d++){
if( n%d == 0){
result=false;
break;
}
}
return result;
}
public static void main(String[] args ) {
int c=0;
for(int i=1;i<=200;i++){
if(isPrime(i)) c++;
}
System.out.println(c);
}
}
public class ex11 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean re=true;
for(int d=2; d<n; d++){
if(n%d==0){
re=false;
}
}
return re;
}
public static void main(String[] args) {
int c=0;
for(int i=1;i<=200;i++){
if(isPrime(i)) c++;
}System.out.println(c);
}
}
public class ex11 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean re=true;
for(int d=2; d<n; d++){
if(n%d==0){
re=false;
}
}
return re;
}
public static void main(String[] args) {
int c=0;
for(int i=1;i<=200;i++){
if(isPrime(i)) c++;
}System.out.println(c);
}
}
public class ex11 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean re=true;
for(int d=2; d<n; d++){
if(n%d==0){
re=false;
}
}
return re;
}
public static void main(String[] args) {
int c=0;
for(int i=1;i<=200;i++){
if(isPrime(i)) c++;
}System.out.println(c);
}
}
public class ex11 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean re=true;
for(int d=2; d<n; d++){
if(n%d==0){
re=false;
}
}
return re;
}
public static void main(String[] args) {
int c=0;
for(int i=1;i<=200;i++){
if(isPrime(i)) c++;
}System.out.println(c);
}
}
public class ex11 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean re=true;
for(int d=2; d<n; d++){
if(n%d==0){
re=false;
}
}
return re;
}
public static void main(String[] args) {
int c=0;
for(int i=1;i<=200;i++){
if(isPrime(i)) c++;
}System.out.println(c);
}
}
public class ex11 {
public static boolean isPrime(int n){
if(n==1) return false;
boolean re=true;
for(int d=2; d<n; d++){
if(n%d==0){
re=false;
}
}
return re;
}
public static void main(String[] args) {
int c=0;
for(int i=1;i<=200;i++){
if(isPrime(i)) c++;
}System.out.println(c);
}
張貼留言