return (key);7
return (key);6
return (key);5
return (key);4
return (key);3
return (key);2
return (key);1
return (key);0
}9
}8
}7
}6
}5
}4
}3
}2
}1
}0
public static void inArray(int[] a, int begin , int end){
System.out.println();9
public static void inArray(int[] a, int begin , int end){
System.out.println();8
public static void inArray(int[] a, int begin , int end){
System.out.println();7
public static void inArray(int[] a, int begin , int end){
System.out.println();6
public static void inArray(int[] a, int begin , int end){
System.out.println();5
public static void inArray(int[] a, int begin , int end){
System.out.println();4
Lesson 2:
public static void inArray(int[] a, int begin , int end){
System.out.println();3
public static void inArray(int[] a, int begin , int end){
System.out.println();2
public static void inArray(int[] a, int begin , int end){
System.out.println();1
public static void inArray(int[] a, int begin , int end){
System.out.println();0
int i;9
int i;8
int i;7
int i;6
int i;5
int i;4
int i;3
int i;2
int i;1
int i;0
for(i=begin ; i System.out.print(" "+a[i]);9
for(i=begin ; i System.out.print(" "+a[i]);8
for(i=begin ; i System.out.print(" "+a[i]);7
for(i=begin ; i System.out.print(" "+a[i]);6
for(i=begin ; i System.out.print(" "+a[i]);5
for(i=begin ; i System.out.print(" "+a[i]);4
for(i=begin ; i System.out.print(" "+a[i]);3
for(i=begin ; i System.out.print(" "+a[i]);2
for(i=begin ; i System.out.print(" "+a[i]);1
Lesson 03:
for(i=begin ; i System.out.print(" "+a[i]);0
}9
}8
}7
}6
}5
}4
}3
}2
}1
}0
System.out.println9
System.out.println8
System.out.println7
System.out.println6
System.out.println5
System.out.println4
System.out.println3
System.out.println2
System.out.println1
System.out.println0
System.out.println1
System.out.println0
}4
}3
Lesson 04:
}2
}1
}0
2
1
0
9
8
7
6
5
4
3
2
1
0
9
8
7
6
5
4
3
2
1
0
9
8
Lesson 05:
7
6
5
4
3
2
1
0
9
8
7
6
5
4
3
2
1
0
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 9
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 8
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 7
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 6
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 5
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 5
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 4
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 4
Lesson 06:
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 3
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 2
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 1
@media (min-width:1024px) { #adsposttop { margin: 0 20px 10px 0; width: 336px; min-height: 360px; float: left } #adsposttop2 { height: 90px; } } @media (max-width:480px) { #adsposttop { float: none; min-height: 360px; } } 0
QTM Responsive Post 9
QTM Responsive Post 8
QTM Responsive Post 7
QTM Responsive Post 6
QTM Responsive Post 5
QTM Responsive Post 4
QTM Responsive Post 3
QTM Responsive Post 2
QTM Responsive Post 1
QTM Responsive Post 0
Quantrimang Links - Dapung1 9
Quantrimang Links - Dapung1 8
Quantrimang Links - Dapung1 7
Quantrimang Links - Dapung1 6
Quantrimang Links - Dapung1 5
Quantrimang Links - Dapung1 4
Quantrimang Links - Dapung1 3
Quantrimang Links - Dapung1 2
Quantrimang Links - Dapung1 1
Quantrimang Links - Dapung1 0
Lesson 07:
package bai07;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static void main(String[] args) {
System.out.print("Nhap n");
int n= nhap();
int[] f= new int[n+1];
f[0]= 1; f[1]= 1;
for(int i=2;i<=n;i++){
f[i]= f[i-1]+f[i-2];
}
System.out.println("So Fibonanci thu "+n+" la: f["+n+"]= "+f[n]);
}
}
Lesson 08:
package bai08;
public class Main {
public static boolean testSoThuanNghich(int n){
StringBuilder xau= new StringBuilder();
String str= ""+n;
xau.append(str);
String check= ""+xau.reverse();
if(str.equals(check)) return true;
else return false;
}
public static void main(String[] args) {
int n,count=0;
for(n=100000 ; n<= 999999 ; n++){
if(testSoThuanNghich(n)){
System.out.println(n);count++;
}
}
System.out.println("Co "+count+" so thuan nghich co 6 chu so");
}
}
Lesson 09:
package bai09;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static void main(String[] args) {
System.out.println("Nhap n");
int n= nhap();
int[] array= new int[n];
int tich;
do{
tich= 1;
//In ra mang va tinh tich cac phan tu trong mang
System.out.println("");
for(int j=0 ; j
System.out.print(" " +array[j]);
tich*= array[j];
}
int i=n-1;
do{
if(array[i]==0){
array[i]=1;
for(int j=n-1 ; j>i ;j--){
array[j]= 0;
}
break;
}
else i--;
}while(i>=0);
}while(tich!=1);
}
}
Lesson 10:
package bai10;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static void result(int a[],int k){
int i;
System.out.println();
for(i=1 ; i<=k ; i++){
System.out.print(" "+a[i]);
}
}
public static void try_backTrack(int a[], int n, int k, int i){
int j;
for(j=a[i-1]+1 ; j<=(n-k+i) ; j++){
a[i]= j;
if(i== k) result(a,k);
else try_backTrack(a, n, k, i+1);
}
}
public static void main(String[] args) {
System.out.println("Nhap n");
int n= nhap();
int[] array= new int[n+1];
int k;
System.out.println("Liet ke tat ca cac tap con k phan tu cua 1,2,.,"+n+" : ");
for(k=1 ; k<=n ; k++){
System.out.println("n Tap con "+k+" phan tu: ");
try_backTrack(array,n,k,1);
}
}
}
Lesson 11:
package bai11;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static void main(String[] args) {
System.out.print("Nhap n");
int n= nhap();
int[] array= new int[n+2];
int i,j,k=n-1,temp,check=1;
for(i=0 ; i
array[i]= i+1;
}
System.out.println("Cac hoan vi ke la: ");
try{
i= n-2;
while(check>0){
//In ra hoan vi System.out.println(" ");
for(j=0 ; j
System.out.print(" "+array[j]);
}
for(i= n-2 ; i>=0 ; i--){
check= 1;
if(array[i] < array[i+1]){
if(i==n-2){
temp= array[i];
array[i]= array[n-1];
array[n-1]= temp;
break;
}
else{
//Tim so a[k] nho nhat ma >a[i] trong cac so ben phai a[i]
k= i+1;
for(j=i+1 ; j
if(array[i+1]>array[j] && array[j]>array[i]) k=j;
}
//Doi cho a[k] va a[i]
temp= array[i];
array[i]= array[k];
array[k]= temp;
//Sap xep lai tu a[i+1] toi a[n]
for(j=i+1 ; j
for(int m= i+1 ; m if(array[j]
temp= array[j];
array[j]= array[m];
array[m]= temp;
}
}
}
break;
}
}
else {
check=0;
// break;
}
}
//if(i==0)check=0;
}
}catch(Exception e){}
}
}
int[] array= new int[n+2];
int i,j,k=n-1,temp,check=1;
for(i=0 ; i
array[i]= i+1;
}
System.out.println("Cac hoan vi ke la: ");
try{
i= n-2;
while(check>0){
//In ra hoan vi System.out.println(" ");
for(j=0 ; j
System.out.print(" "+array[j]);
}
for(i= n-2 ; i>=0 ; i--){
check= 1;
if(array[i] < array[i+1]){
if(i==n-2){
temp= array[i];
array[i]= array[n-1];
array[n-1]= temp;
break;
}
else{
//Tim so a[k] nho nhat ma >a[i] trong cac so ben phai a[i]
k= i+1;
for(j=i+1 ; j
if(array[i+1]>array[j] && array[j]>array[i]) k=j;
}
//Doi cho a[k] va a[i]
temp= array[i];
array[i]= array[k];
array[k]= temp;
//Sap xep lai tu a[i+1] toi a[n]
for(j=i+1 ; j
for(int m= i+1 ; m if(array[j]
temp= array[j];
array[j]= array[m];
array[m]= temp;
}
}
}
break;
}
}
else {
check=0;
// break;
}
}
//if(i==0)check=0;
}
}catch(Exception e){}
}
}
Lesson 12:
package bai12;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static void horner(int a[], int n){
int T=0,i,x;
System.out.println("n Nhap x= ");
x= nhap();
T= a[n];
for(i=n ; i>0 ; i--){
T= T*x + a[i-1];
}
System.out.println("Gia tri cua da thuc tinh theo cong thuc Horner la: "+T);
}
public static void main(String[] args) {
int i;
System.out.println("Nhap bac cua da thuc n= ");
int n= nhap();
int[] array= new int[n+1];
for(i=n ; i>=0 ; i--){
System.out.print("Nhap he so cua x^"+i+" = ");
array[i]= nhap();
}
horner(array,n);
}
}
Lesson 13:
package bai13;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static void inArray(int[] a, int begin , int end){
System.out.println();
int i;
for(i=begin ; i System.out.print(" "+a[i]);
}
System.out.println();
}
public static void themPhanTu(int[] a,int n,int pt){
a[0]= pt;
Arrays.sort(a);
}
public static void main(String[] args) {
System.out.println("Nhap n");
int n= nhap();
System.out.println("Nhap m");
int m= nhap();
int i;
int[] a= new int[n+m];
int[] b= new int[m];
//Nhap vao mang A va sap xep theo thu tu tang dan
System.out.println("nhap mang A: ");
for(i=0 ; i
System.out.print("n Nhap phan tu thu "+i+" = ");
a[i]= nhap();
}
Arrays.sort(a);
//Nhap vao mang B va sap xep theo thu tu tang dan
System.out.println("nhap mang B: ");
for(i=0 ; i
System.out.print("n Nhap phan tu thu "+i+" = ");
b[i]= nhap();
}
Arrays.sort(b);
//Gop mang b vao mang a
for(i=0 ; i
themPhanTu(a, n+m+1, b[i]);
}
inArray(a, 0, n+m);
}}
Lesson 14:
package bai14;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static int countElement(int a[], int n, int i){
int count= 0;
for(int j=0 ; j
if(a[j]== i)
count ++;
}
return (count);
}
public static void main(String[] args) {
int n,i;
System.out.println("Nhap n= ");
n= nhap();
int[] array= new int[n];
for(i=0 ; i
System.out.println("Nhap phan tu thu " +(i+1)+" ");
array[i]= nhap();
}
System.out.print("Cac phan tu trong day xuat hien 1 lan: ");
for(i=0 ; i
if(countElement(array, n, array[i])==1)
System.out.print(" "+array[i]);
}
}
}
Lesson 15:
package bai15;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static int countElement(int a[], int n, int i){
int count= 0;
for(int j=0 ; j
if(a[j]== i)
count ++;
}
return (count);
}
public static void main(String[] args) {
int n,i;
System.out.println("Nhap n= ");
n= nhap();
int[] array= new int[n];
for(i=0 ; i
System.out.println("Nhap phan tu thu " +(i+1)+" ");
array[i]= nhap();
}
System.out.print("Cac phan tu trong day xuat hien 2 lan: ");
for(i=0 ; i
if(countElement(array, n, array[i])==2 && countElement(array, i, array[i])==0){
System.out.print(" "+array[i]);
}
}
}
}
Lesson 16:
package bai16;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static int countElement(int a[], int n, int i){
int count= 0;
for(int j=0 ; j
if(a[j]== i)
count ++;
}
return (count);
}
public static void main(String[] args) {
int n,i;
System.out.println("Nhap n= ");
n= nhap();
int[] array= new int[n];
for(i=0 ; i
System.out.println("Nhap phan tu thu " +(i+1)+" ");
array[i]= nhap();
}
for(i=0 ; i
if(countElement(array, i, array[i])==0){
System.out.println("Phan tu "+array[i]+ " xuat hien "+countElement(array, n,
array[i])+" lan");
}
}
}
}
Lesson 17:
package bai17;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static float nhapFloat(){
Scanner input= new Scanner(System.in);
boolean check= false;
float n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static int viTriMinFloat(float a[], int n){
float min= a[0];
int key= 0;
for(int j=0 ; j
array[i]= nhapFloat();
if(min>a[j]){
min= a[j];
key= j;
}
}
return (key);
}
public static float maxFloat(float a[], int n){
float max= a[0];
for(int j=0 ; j
if(max
}
return (max);
}
public static void main(String[] args) {
int n,i;
System.out.println("Nhap n= ");
n= nhap();
float[] array= new float[n];
for(i=0 ; i
System.out.println("Nhap phan tu thu " +(i+1)+" ");
array[i]= nhapFloat();
}
i =0;
System.out.println("Sap xep theo thu tu tang dan");
while(i
System.out.println(" "+array[viTriMinFloat(array, n)]);
array[viTriMinFloat(array, n)]= maxFloat(array, n);
i++;
}
}
}
}
i =0;
System.out.println("Sap xep theo thu tu tang dan");
while(i
System.out.println(" "+array[viTriMinFloat(array, n)]);
array[viTriMinFloat(array, n)]= maxFloat(array, n);
i++;
}
}
}
for(int j=0 ; j
if(min>a[j]){
min= a[j];
key= j;
}
}
return (key);
}
public static float maxFloat(float a[], int n){
float max= a[0];
for(int j=0 ; j
if(max
}
return (max);
}
public static void main(String[] args) {
int n,i;
System.out.println("Nhap n= ");
n= nhap();
float[] array= new float[n];
for(i=0 ; i
System.out.println("Nhap phan tu thu " +(i+1)+" ");
array[i]= nhapFloat();
}
i =0;
System.out.println("Sap xep theo thu tu tang dan");
while(i
System.out.println(" "+array[viTriMinFloat(array, n)]);
array[viTriMinFloat(array, n)]= maxFloat(array, n);
i++;
}
}
}
Lesson 18:
package bai18;
import java.util.*;
public class Main {
public static void main(String[] args)
{ Scanner input= new
Scanner(System.in);
System.out.println("Nhap vao 1 xau: ");
String str= input.nextLine();
StringTokenizer strToken= new
StringTokenizer(str, " "); System.out.println("So cac tu trong xau la: "+strToken.countTokens());
}
}
Lesson 19:
package bai19;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static boolean checkSNT(int n){
if(n>1){
for(int i=2;i<=Math.sqrt(n);i++){
if(n%i==0) return false;
}
return true;
}
else return false;
}
public static int tongChuSo(int n){
int T=0;
while(n>0){
T+= n%10;
n/= 10;
}
return (T);
}
public static void main(String[] args) {
System.out.print("Nhap S= ");
int s= nhap(); int i,count=0;
System.out.println("Cac so nguyen to co tong cac chu so co tong bang "+s+" la: ");
for(i=10000 ; i<=99999 ; i++){
if(checkSNT(i)){
if(tongChuSo(i)== s) {
System.out.println(" "+i);
count++;
}
else continue;
}
}
System.out.println("Co "+count+" so thoa man");
}
}
Lesson 20:
package bai20;
import java.util.Scanner;
public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
//Ham kiem tra so nguyen to
public static boolean checkSNT(int n){
if(n>1){
for(int i=2;i<=Math.sqrt(n);i++){
if(n%i==0) return false;
}
return true;
}
else return false;
}
public static void main(String[] args) {
System.out.print("Nhap n= ");
int n= nhap();
int[] f= new int[n];
f[0]= 1; f[1]= 1;
int i=1,count=1;
System.out.print("Cac so Fibonanci nho hon "+n+" la so nguyen to: n 1");
while(f[i]
if(checkSNT(f[i])){
System.out.print(" "+f[i]);
count++;
} i++;
f[i]= f[i-1] + f[i-2];
}
System.out.println("n Co "+count+" so thoa man");
}
}
System.out.print("Cac so Fibonanci nho hon "+n+" la so nguyen to: n 1");
while(f[i]
if(checkSNT(f[i])){
System.out.print(" "+f[i]);
count++;
} i++;
f[i]= f[i-1] + f[i-2];
}
System.out.println("n Co "+count+" so thoa man");
}
}
Lesson 21:
package bai21;
import java.util.Scanner; public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in); boolean check= false;
int n=0; while(!check){
System.out.print(" "); try{
n= input.nextInt(); check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai."); input.nextLine();
}
}
return (n);
}
public static int tongChuSo(int n){ int T=0;
while(n>0){
T+= n%10;
n/= 10;
}
return (T);
}
//Ham kiem tra so nguyen to
public static boolean checkSNT(int n){ if(n>1){for(int i=2;i<=Math.sqrt(n);i++){ if(n%i==0) return false;
}
return true;
}
else return false;
}
public static void phanTich(int n){
int i=2; while(n>1){
if(checkSNT(i)){
if(n%i==0){
System.out.print(i+"."); n/=i;
}
else i++;
}
else i++;
}
}
public static void main(String[] args) {
System.out.print("Nhap n");
int n= nhap(); System.out.print("n= 1" ); phanTich(n);
System.out.println("Tong cac chu so cua "+n+" la: "+tongChuSo(n));
}
}
Lesson 22:
package bai22;
import java.util.Scanner; public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in); boolean check= false;
int n=0; while(!check){
System.out.print(" "); try{
n= input.nextInt(); check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai."); input.nextLine();
}
}
return (n);
}
public static boolean checkSNT(int n){
if(n>1){
for(int i=2;i<=Math.sqrt(n);i++){ if(n%i==0) return false;}
return true;
}
else return false;
}
public static void lietKeUoc(int n){
int count=0;
System.out.print("nCac uoc cua "+n+" la:"); for(int i=1 ; i<=n ; i++){
if(n%i==0) {
System.out.print(" "+i); count++;
}
}
System.out.println("nCo "+count+" uoc");
}
public static void lietKeUocSNT(int n){
int count=0;
System.out.print("nCac uoc cua "+n+" la:"); for(int i=1 ; i<=n ; i++){
if(n%i==0 && (checkSNT(i))) { System.out.print(" "+i); count++;
}
}
System.out.println("nCo "+count+" uoc la so nguyen to");
}
public static void main(String[] args) {
System.out.print("Nhap n");
int n= nhap(); lietKeUoc(n); lietKeUocSNT(n);
}
}
Lesson 23:
package bai23;
import java.util.Scanner; public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in); boolean check= false;
int n=0; while(!check){
System.out.print(" "); try{
n= input.nextInt(); check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai."); input.nextLine();
}
}
return (n);
}
public static boolean checkSNT(int n){
if(n>1){
for(int i=2;i<=Math.sqrt(n);i++){ if(n%i==0) return false;
}
return true;
}
else return false;
}
public static void lietKeSNT(int n){
int i=1,count=0;
System.out.println("Cac so nguyen to nho hon "+n+" la: "); while(i
if(checkSNT(i)){
System.out.print(" "+i); count++;
} i++;
}
System.out.println("n Co "+count+" so thoa man");
}
public static void main(String[] args) {
System.out.print("Nhap n");
int n= nhap(); lietKeSNT(n); int[] f= new int[n]; f[0]= 1; f[1]= 1;
int i=1;
System.out.print("Cac so Fibonanci nho hon "+n+" la : n 1"); while(f[i]
System.out.print(" "+f[i]);
i++;
f[i]= f[i-1] + f[i-2];
}
System.out.println("n Co "+i+" so thoa man");
}
}
System.out.println("Cac so nguyen to nho hon "+n+" la: "); while(i
if(checkSNT(i)){
System.out.print(" "+i); count++;
} i++;
}
System.out.println("n Co "+count+" so thoa man");
}
public static void main(String[] args) {
System.out.print("Nhap n");
int n= nhap(); lietKeSNT(n); int[] f= new int[n]; f[0]= 1; f[1]= 1;
int i=1;
System.out.print("Cac so Fibonanci nho hon "+n+" la : n 1"); while(f[i]
System.out.print(" "+f[i]);
i++;
f[i]= f[i-1] + f[i-2];
}
System.out.println("n Co "+i+" so thoa man");
}
}
System.out.println("Cac so nguyen to nho hon "+n+" la: "); while(i
if(checkSNT(i)){
System.out.print(" "+i); count++;
} i++;
}
System.out.println("n Co "+count+" so thoa man");
}
public static void main(String[] args) {
System.out.print("Nhap n");
int n= nhap(); lietKeSNT(n); int[] f= new int[n]; f[0]= 1; f[1]= 1;
int i=1;
System.out.print("Cac so Fibonanci nho hon "+n+" la : n 1"); while(f[i]
System.out.print(" "+f[i]);
i++;
f[i]= f[i-1] + f[i-2];
}
System.out.println("n Co "+i+" so thoa man");
}
}
Lesson 24:
package bai24;
import java.util.Scanner; public class Main {
public static int nhap(){
Scanner input= new Scanner(System.in);
boolean check= false;
int n=0;
while(!check){
System.out.print(" ");
try{
n= input.nextInt();
check= true;
}catch(Exception e){
System.out.println("Ban phai nhap so! hay nhap lai.");
input.nextLine();
}
}
return (n);
}
public static boolean checkSNT(int n){
if(n>1){
for(int i=2;i<=Math.sqrt(n);i++){
if(n%i==0) return false;
}
return true;
}
else return false;
}
public static void inMT(int[][] A, int n, int m){
int i,j;
for(i=0 ; i
System.out.print(
4 ★ | 1 VoteYou should read it
- What is Java? Why choose Java?
- Basic Java syntax
- Write and run Java code on the computer for the first time
- Download and install Java on the computer
- How to Compile a Java Program
- 4 ways to write multi-threaded code in Java
- Which career Java programming options are waiting for you?
- eQuiz - Multiple choice quiz about JAVA
- What is JAVA file? How to open, edit and convert JAVA files
- 9 things Java programmers should know in 2018 if they want a successful career
- How to install Java on a Raspberry Pi
- How to fix the error does not install Java
Maybe you are interested
How to Integrate ChatGPT for Siri on iPhone
How to get data from web into Excel
Top best apps to turn men into women, boys into girls
How to blur background images in PowerPoint - Adjust background image display mode
Instructions for creating PowerPoint background color effects - Create a new background for slides
7 Best Pinterest Alternatives