Scribd
Upload
2 views8 pages

Java

The document contains Java code for a program that performs various operations on arrays, such as inputting, outputting, and calculating properties of the elements (like averages and counts of even/odd numbers). It includes functions for checking perfect numbers, prime numbers, and sorting arrays. The code is structured with methods for handling different tasks, but it appears to have some commented-out sections and inconsistencies.

Uploaded by

quốc anh nguyễn hoàng
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views8 pages

Java

The document contains Java code for a program that performs various operations on arrays, such as inputting, outputting, and calculating properties of the elements (like averages and counts of even/odd numbers). It includes functions for checking perfect numbers, prime numbers, and sorting arrays. The code is structured with methods for handling different tasks, but it appears to have some commented-out sections and inconsistencies.

Uploaded by

quốc anh nguyễn hoàng
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

KIỂM TRA

package nd; package nd;


import [Link]; import [Link];
public class vd { public class vd {
public static void main(String[] args) { public static void main(String[] args) {
// TODO Auto-generated method stub // TODO Auto-generated method stub
Scanner kb=new Scanner ([Link]); Scanner kb=new Scanner ([Link]);
[Link]("nhap n"); [Link]("nhap n");
int n=[Link](); int n=[Link]();

int[]a = new int[n]; int[]a = new int[n];


NhapMang(a); NhapMang(a);
[Link]("xuat mang"); [Link]("xuat mang");
XuatMang(a); XuatMang(a);

//[Link]("TBC_vitrichan\n"+TB //[Link]("TBC_vitrile"+TBC_vi
C_vitrichan(a)); trile(a));
//[Link]("liet ke so hoan thien"); //[Link]("liet ke so nguyen to");
//LK_sht(a); //LK_snt(a);
//[Link]("dem phan tu le //[Link]("dem phan tu le
"+Demsole(a)); "+Demsochan(a));
//[Link]("tong so hoan thien //[Link]("tong so nguyen to
"+tong_Sht(a)); "+tong_Snt(a));
//[Link]("sap xep "); //[Link]("sap xep ");
//SXLaSoHoanThienTangDan(a); //SXLaSo Nguyen To TangDan(a);
} }
public static void NhapMang (int []a) { public static void NhapMang (int []a) {
Scanner kb=new Scanner ([Link]); Scanner kb=new Scanner ([Link]);
for(int i=0;i<[Link];i++) { for(int i=0;i<[Link];i++) {
[Link]("a["+i+"]="); [Link]("a["+i+"]=");
a[i]=[Link](); a[i]=[Link]();
} }
} }
public static void XuatMang (int []a) { public static void XuatMang (int []a) {
for (int i= 0; i< [Link];i ++) { for (int i= 0; i< [Link];i ++) {
[Link](a[i]); [Link](a[i]);
} }
} }
public static double TBC_vitrichan(int []a)
{ public static float TBC_vitrile(int []a)
double s=0; {
int dem=0; int s = 0 , d = 0;
for (int i= 0; i< [Link]; i ++) {
if (i%2==0) { for (int i= 0; i< [Link]; i ++) {
s+=a[i]; if (i%2 !=0) {
dem++; s=s + a[i];
} dem++;
} }
if(dem==0) }
return 0; if(dem==0)
return (double)s/dem; return 0;
return (float)s/dem;
}
public static boolean KT_sht(int n) { }
if(n<=1) public static int KT_snt(int n) {
return false; int d = 0;
for (int i = 1; i <= n ; i++) {
int sum=0; if(n% i == 0)
for (int i = 1; i <=n/2; i++) { dem ++;
if(n%i==0) { }
sum+=i; if ( dem == 2 )
} }
} return 1 ;
return sum==n; return 0 ;
}
public static int LK_sht(int []a) { }
public static void LK_snt(int []a) {
for (int i = 0; i < [Link]; i++) {
if(KT_sht(a[i])==true) { for (int i = 0; i < [Link]; i++) {
[Link](a[i]); if (KT_snt (i)== 1 ) {
} [Link](a[i]) ;
} }
return 1; }

}
public static int Demsole(int []a) { public static int Demsochan(int []a) {
int dem=0 ; int dem=0 ;
for (int i = 0; i < [Link]; i++) { for (int i = 0; i < [Link]; i++) {
if(a[i]%2 !=0) { if(a[i]%2 ==0) {
dem++; dem++;
} }
} }
return dem; return dem;
} }
public static int tong_Sht(int []a) {
int sum=0; public static int tong_Snt(int []a) {
for (int i = 0; i < [Link]; i++) { int sum=0;
if(KT_sht(a[i])==true) for (int i = 0; i < [Link]; i++) {
sum+=a[i]; if(KT_sht(a[i]) == 1)
sum = sum + a[i];
}
return sum; }
} return sum;
public static int KTSHT(int n) { }
int s = 0; public static int KTSNT(int n) {
for(int i = 1; i < n; i++) int d = 0;
if(n % i == 0) for (int i = 1; i <= n ; i++) {
s = s + i; if(n% i == 0)
dem ++;
if(s == n) { }
return 1; if ( dem == 2 )
} else }
return 0; return 1 ;
} return 0 ;
public static void }
SXLaSoHoanThienTangDan(int[] a) { public static void
for (int i = 0; i < [Link] -1; i++) { SXLaSoNguyenToTangDan(int[] a) {
for (int j = i+1; j < [Link]; j++) { for (int i = 0; i < [Link] -1; i++) {
if(a[i] > a[j] && KTSHT(a[i])==1) { for (int j = i+1; j < [Link]; j++) {
int t = a[i]; if(a[i] > a[j] && KTSNT(a[i]) == 1
a[i] = a[j]; && KTSNT(a[j]) == 1)
a[j] = t; int t = a[i];
} a[i] = a[j];
} a[j] = t;
}
[Link]("Sap xep"); }
for (int i = 0; i < [Link]; i++) { }
if(KT_sht(a[i])==true) }
[Link](a[i]); [Link]("Sap xep");
} for (int i = 0; i < [Link]; i++) {
} if(KT_snt(a[i])== 1)
} [Link](a[i]);
}
}

ÔN TẬP

package nd; public static int DemSoAm(int []a) {


import [Link]; int dem = 0;
public class vd { for(int i = 0; i < [Link]; i++) {
public static void main(String[] args) { if(a[i] < 0) {
int n;
Scanner kb = new Scanner([Link]);
[Link]("Nhap n = "); dem++;
n= [Link](); }
} return dem;
int x; }
[Link]("Nhap x= ");
x=[Link](); public static int DemBoi3Va5(int []a) {
int dem = 0;
int[]a = new int[n]; for(int i = 0; i < [Link]; i++) {
NhapMang(a); if(a[i] % 3 == 0 && a[i] % 5 == 0) {
[Link]("Mang sau khi nhap");
XuatMang(a); dem++;
// [Link]("Cac phan }
tu lon hon x"); } return dem;
// LietKeLonHon(a, x); }
// [Link]("Cac phan
tu nho hon x"); public static int
// LietKeNhoHon(a, x); DemSoLanXuatHienCuaXTrongMang(int
// int kq = DemChan(a); []a, int x) {
// [Link]("Co " + int dem = 0;
kq + " so chan"); for(int i = 0; i < [Link]; i++) {
// int kp = DemLe(a); if(a[i] == x) {
// [Link]("Co " +
kp + " so le"); dem++;
// KTSNT(n); }
// int kg = DemSNT(a); } return dem;
// [Link]("Co " + }
kg + " so nguyen to");
// int ky = DemSHT(a); public static int
// [Link]("Co " + TongCacPhanTuNhoHonX(int []a, int x) {
ky + " so hoan thien"); int s = 0;
// int ko =DemSCP(a); for(int i = 0; i < [Link]; i++) {
// [Link]("Co " + if(a[i] < x) {
ko+ " so chinh phuong");
// [Link]("Co" + s += a[i];
DemSoDuong(a) + " so duong"); }
// [Link]("Co" + } return s;
DemSoAm(a) + " so am"); }
// [Link]("Co " +
DemBoi3Va5(a) + " boi cua 3 va 5"); public static int
// [Link]("Co " + TongCacPhanTuOViTriChanTrongMang(in
DemSoLanXuatHienCuaXTrongMang(a, x) t []a, int x) {
+ " lan x xuat hien"); int s = 0;
// [Link]("Tong cac for(int i = 0; i < [Link]; i++) {
phan tu nho hon x = " + if( i % 2 ==0) {
TongCacPhanTuNhoHonX(a, x) );
// [Link]("Tong cac s += a[i];
phan tu o vi tri chan trong mang = " + }
TongCacPhanTuOViTriChanTrongMang(a, } return s;
x) ); }
// [Link]("Trung
binh cong cac so am = " + public static double
TrungBinhCongCacSoAm(a) ); TrungBinhCongCacSoAm(int[]a) {
// [Link]("Trung
binh cong cac so duong = " + double s = 0;
TrungBinhCongCacSoDuong(a)); int dem = 0;
// [Link]("Trung for(int i = 0; i < [Link]; i++) {
binh cong cac so chan = " + if(a[i] < 0) {
TrungBinhCongCacSoChan(a));
// [Link]("Trung s += a[i];
binh cong cac so le = " + dem++;
TrungBinhCongCacSoLe(a)); }
// [Link]("Trung } if(dem==0)
binh cong cac so nguyen to = " + return 0;
TrungBinhCongCacSoNguyenTo(a)); return (double)s /dem;
// [Link]("Trung
binh cong cac so hoan thien = " + }
TrungBinhCongCacSoHoanThien(a));
// [Link]("Trung public static double
binh cong cac so chinh phuong = " + TrungBinhCongCacSoDuong(int[]a) {
TrungBinhCongCacSoChinhPhuong(a));
// XuatMang(a); double s = 0;
int dem = 0;
// int vtchen, x; for(int i = 0; i < [Link]; i++) {
// [Link]("\nNhap if(a[i] > 0) {
vi tri chen");
// vtchen = [Link](); s += a[i];
// [Link]("\nNhap x dem++;
= "); }
// x = [Link](); } if(dem==0)
// a = Chen(a, 0, x); return 0;
// XuatMang(a); return (double)s /dem;

// int vtxoa; }
// [Link]("\nNhap
vi tri xoa"); public static double
// vtxoa = [Link](); TrungBinhCongCacSoChan(int[]a) {
// a = Xoa(a, vtxoa);
// [Link]("\nMang double s = 0;
sau khi xoa"); int dem = 0;
// XuatMang(a); for(int i = 0; i < [Link]; i++) {
if(a[i] % 2 == 0) {
// a = XoaVTLe(a);
// [Link]("\nMang s += a[i];
sau khi xoa cac pt vitri le"); dem++;
// XuatMang(a); }
[Link]("Trung binh cong cac } if(dem==0)
phan tu co gia tri la uoc so cua x trong mang return 0;
="+ return s /dem;
TrungBinhCongCacPhanTuCoGiaTriLaUoc
SoCuaXTrongMang(a, x)); }

} public static double


TrungBinhCongCacSoLe(int[]a) {
public static void NhapMang(int []a ) {
Scanner kb = new Scanner ([Link]); double s = 0;
for(int i = 0; i < [Link]; i++) { int dem = 0;
[Link]("a[" + i +"] ="); for(int i = 0; i < [Link]; i++) {
a[i] = [Link](); if(a[i] % 2 != 0) {
}
} s += a[i];
public static void XuatMang(int []a) { dem++;
for(int i = 0; i < [Link]; i++) }
[Link](a[i] + "\t"); } if(dem==0)
return 0;
} return (double)s /dem;

public static void LietKeLonHon(int []a, int }


x){ public static double
for(int i = 0; i< [Link]; i++) { TrungBinhCongCacSoNguyenTo(int[]a) {
if(a[i]>x) {
[Link](a[i] + "\t"); double s = 0;
} int dem = 0;
} for(int i = 0; i < [Link]; i++) {
} if(KTSNT(a[i])==1) {
public static void LietKeNhoHon(int []a, int
x){ s += a[i];
for(int i = 0; i< [Link]; i++) { dem++;
if(a[i]<x) { }
[Link](a[i] + "\t"); } if(dem==0)
} return 0;
} return (double)s /dem;
} }

public static int DemChan(int []a) { public static double


int dem = 0; TrungBinhCongCacSoHoanThien(int[]a) {
for(int i = 0; i < [Link]; i++) {
if(a[i]% 2 ==0) { double s = 0;
int dem = 0;
for(int i = 0; i < [Link]; i++) {
dem++; if(KTSHT(a[i])==1) {
}
} return dem; s += a[i];
} dem++;
}
public static int DemLe(int []a) { } if(dem==0)
int dem = 0; return 0;
for(int i = 0; i < [Link]; i++) { return (double)s /dem;
if(a[i]% 2 !=0) {/-strong/-heart:>:o:-((:-h
dem++; }
} public static double
} return dem; TrungBinhCongCacSoChinhPhuong(int[]a)
} {

public static int KTSNT(int n) { double s = 0;


int d = 0; int dem = 0;
for(int i = 1; i <= n; i++) for(int i = 0; i < [Link]; i++) {
if(n % i == 0) if(KTSCP(a[i])==1) {
d++;
if(d == 2) s += a[i];
return 1; dem++;
else }
return 0; } if(dem==0)
} return 0;
return (double)s /dem;
public static int DemSNT(int []a) {
int d = 0; }
for(int i = 0; i < [Link]; i++) { public static int[] Chen(int []a, int vtchen,
if(KTSNT(a[i])==1) { int x) {
d++; int[]b = new int[[Link] + 1];
} for(int i = 0 ; i < vtchen ; i++)
} return d; b[i] = a[i];
} b[vtchen] = x;
for(int i = vtchen ; i < [Link] ; i++)
public static int KTSHT(int n) { b[i+1] = a[i];
int s = 0; return b;
for(int i = 1; i < n; i++) }
if(n % i == 0) public static int[] Xoa(int []a, int vtxoa)
s = s + i;
if(s == n) {
return 1; int []b = new int[[Link] - 1];
else for(int i = vtxoa ; i < [Link] - 1 ; i++)
return 0;
} b[i] = a[i+1];
public static int DemSHT(int []a) { for(int i = 0 ; i < vtxoa ; i++)
int dem = 0; b[i] = a[i];
for(int i = 0; i < [Link]; i++) { return b;
if(KTSHT(a[i])==1) { }
dem++; public static int[] XoaVTLe(int []a) {
} int i = 1;
} return dem; while(i < [Link])
} {
a = Xoa(a, i++);
public static int KTSCP(int n) { }
if (n < 0) { return a;
return 0; }
} //Xoa phan tu lon nhat
/*B1. Tìm vitri lon nhat
int sqrt = (int) [Link](n); * B2. Xoa
if (sqrt * sqrt == n) { * */
return 1; public static int TimVTMax(int[]a)
} else { {
return 0; int vtmax = 0;
} for (int i = 1; i < [Link]; i++)
} {
if (a[i] > a[vtmax])
public static int DemSCP(int[]a) { {
int dem = 0; vtmax = i;
for(int i = 0; i < [Link]; i++) { }
if(KTSHT(a[i])==1) { }
dem++; return vtmax;
} }
} return dem; public static int[] Xoa_VTMax(int []a) {
} int i = TimVTMax(a);
a = Xoa(a, i);
public static int DemSoDuong(int []a) { return a;
int dem = 0; }
for(int i = 0; i < [Link]; i++) { }
if(a[i] > 0) { public static double
TrungBinhCongCacPhanTuCoGiaTriLaUoc
SoCuaXTrongMang(int[] a, int x) {
dem++; double s = 0;
} int dem = 0;
} return dem; for (int i = 0; i < [Link]; i++) {
} if (x % a[i] == 0) {
s += a[i];
dem++;
}
}
if (dem == 0) {
return 0;
}
return (double)s/ dem;
}

You might also like