From f96297aa6e4993079eaaf3d0f9448635acfbbda5 Mon Sep 17 00:00:00 2001 From: ProgramLight Date: Sun, 23 Apr 2023 12:34:32 +0000 Subject: [PATCH] =?UTF-8?q?=E4=B8=8A=E4=BC=A0=E6=96=87=E4=BB=B6=E8=87=B3?= =?UTF-8?q?=20''?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- LQ_008.java | 22 ++++++++++++++++++ _2的幂的判断.java | 15 +++++++++++++ n的约数的个数.java | 23 +++++++++++++++++++ sky数判断.java | 36 +++++++++++++++++++++++++++++ 三个数求最大值.java | 50 +++++++++++++++++++++++++++++++++++++++++ 两数交换.java | 21 +++++++++++++++++ 埃氏筛法.java | 31 +++++++++++++++++++++++++ 大数.java | 39 ++++++++++++++++++++++++++++++++ 子集输出.java | 27 ++++++++++++++++++++++ 快读演示.java | 28 +++++++++++++++++++++++ 数位拆分.java | 18 +++++++++++++++ 整数翻转.java | 24 ++++++++++++++++++++ 既约分数.java | 25 +++++++++++++++++++++ 求100阶乘0的个数.java | 41 +++++++++++++++++++++++++++++++++ 求二进制中含1个数.java | 21 +++++++++++++++++ 求最大公约数.java | 29 ++++++++++++++++++++++++ 穷举.java | 34 ++++++++++++++++++++++++++++ 素数的判断.java | 25 +++++++++++++++++++++ 计算PI小数点后n位.java | 31 +++++++++++++++++++++++++ 身份证号合理性验证.java | 34 ++++++++++++++++++++++++++++ 进位模拟.java | 21 +++++++++++++++++ 21 files changed, 595 insertions(+) create mode 100644 LQ_008.java create mode 100644 _2的幂的判断.java create mode 100644 n的约数的个数.java create mode 100644 sky数判断.java create mode 100644 三个数求最大值.java create mode 100644 两数交换.java create mode 100644 埃氏筛法.java create mode 100644 大数.java create mode 100644 子集输出.java create mode 100644 快读演示.java create mode 100644 数位拆分.java create mode 100644 整数翻转.java create mode 100644 既约分数.java create mode 100644 求100阶乘0的个数.java create mode 100644 求二进制中含1个数.java create mode 100644 求最大公约数.java create mode 100644 穷举.java create mode 100644 素数的判断.java create mode 100644 计算PI小数点后n位.java create mode 100644 身份证号合理性验证.java create mode 100644 进位模拟.java diff --git a/LQ_008.java b/LQ_008.java new file mode 100644 index 0000000..daf7971 --- /dev/null +++ b/LQ_008.java @@ -0,0 +1,22 @@ +package Course_Codes; + +import java.util.Scanner; + +//nn-1ֻ1εĸ +public class LQ_008 { + + public static void main(String[] args) { + Scanner sc=new Scanner(System.in); + int n,ans=0;//뼸 + + while(sc.hasNext()) { + n=sc.nextInt(); + ans=0; + for(int i=0;i0) { + sum+=n%r; + n/=r; + } + return sum; + } +} diff --git a/三个数求最大值.java b/三个数求最大值.java new file mode 100644 index 0000000..d42d38f --- /dev/null +++ b/三个数求最大值.java @@ -0,0 +1,50 @@ +package Course_Codes; + +import java.util.Scanner; +//3ֵ +public class ֵ { + + public static void main(String[] args) { + Scanner sc=new Scanner(System.in); + while(sc.hasNext()) { + int a=sc.nextInt(); + int b=sc.nextInt(); + int c=sc.nextInt(); + System.out.println("1:"+Get_Max1(a,b,c)); + System.out.println("2:"+Get_Max2(a,b,c)); + System.out.println("3:"+Get_Max3(a,b,c)); + } + + + } + //ϵͳ + static int Get_Max3(int a, int b, int c) { + return Math.max(Math.max(a, b), c); + } + + static int Get_Max2(int a, int b, int c) { + int max=a; + if(b>max) + max=b; + if(c>max) + max=c; + return max; + } + + static int Get_Max1(int a,int b,int c) { + if(a>b) { + if(a>c) + return a; + else + return c; + } + else { + if(b>c) + return b; + else + return c; + } + } + + +} diff --git a/两数交换.java b/两数交换.java new file mode 100644 index 0000000..6eb8218 --- /dev/null +++ b/两数交换.java @@ -0,0 +1,21 @@ +package Course_Codes; + +import java.util.Scanner; + +// +public class { + + public static void main(String[] args) { + Scanner sc=new Scanner(System.in); + while(sc.hasNext()) { + int a=sc.nextInt(); + int b=sc.nextInt(); + //˼ + a=a^b; + b=a^b; + a=a^b; + System.out.print("a="+a+" b="+b); + } + } + +} diff --git a/埃氏筛法.java b/埃氏筛法.java new file mode 100644 index 0000000..b195cd7 --- /dev/null +++ b/埃氏筛法.java @@ -0,0 +1,31 @@ +package Course_Codes; + +import java.util.Arrays; + +//ҪõȻnڵȫѲڸnı޳ʣµľ +public class ɸ { + + public static void main(String[] args) { + int n=10000; + boolean isprime[]=new boolean[n+1]; + Arrays.fill(isprime, true);//ٶȫ + //ж0 1 + isprime[0]=false; + isprime[1]=false; + + for(int i=2;i*i<=n;i++) { + if(isprime[i]==true) + for(int j=2;i*j<=n;j++) //2i,3i,4i.... + isprime[i*j]=false; + } + int count=0; + for(int i=2;i<=n;i++) { + if(isprime[i]==true) { + count++; + System.out.println(i); + } + } + System.out.printf("1%d%d", n,count); + } + +} diff --git a/大数.java b/大数.java new file mode 100644 index 0000000..d784e8e --- /dev/null +++ b/大数.java @@ -0,0 +1,39 @@ +package Course_Codes; + +import java.math.BigInteger; + +public class { + + public static void main(String[] args) { + String num="FF";//num16ƣôӦľ10Ƶ255 + System.out.println(BigInteger.ONE); + BigInteger a=new BigInteger("9527"); + System.out.println("a:"+a); + //numתΪ + BigInteger b=new BigInteger(num,16); + System.out.println("bʮΪ"+b); + //bתΪ˽ + System.out.println("bİ˽Ϊ"+b.toString(8)); + //bתΪ + System.out.println("bĶΪ"+b.toString(2)); + //a+b a.add(b)=9527+255 + System.out.println("a+b="+a.add(b)); + //a-b a.subtract(b)=9527-255 aֵûб + System.out.println("a-b="+a.subtract(b)); + //a*b + System.out.println("a*b="+a.multiply(b)); + //a/b + System.out.println("a/b="+a.divide(b)); + //a%b + System.out.println("a%b="+a.mod(b)); + //a bԼ + System.out.println("a bԼ"+a.gcd(b)); + //жaǷΪ + System.out.println("aǷΪ"+a.isProbablePrime(10)); + //a^b%p + BigInteger two=new BigInteger("2"); + //10^2%13=9 + System.out.println("10^2%13="+BigInteger.TEN.modPow(two, new BigInteger("13"))); + } + +} diff --git a/子集输出.java b/子集输出.java new file mode 100644 index 0000000..fe377cb --- /dev/null +++ b/子集输出.java @@ -0,0 +1,27 @@ +package Course_Codes; +//{1234}Ӽ +public class Ӽ { + + public static void main(String[] args) { + int [] a= {1,2,3,4}; + for(int i=0;i<15;i++) { + System.out.print("{"); + int n=i;//洢ǰҪתɶƵi + int index=0;//ǰǵڼγ2 + while(n>0) { + if(n%2==1) { + if(n>2) + System.out.print(a[index]+","); + else + System.out.print(a[index]); + } + index++; + n/=2; + } + System.out.println("}"); + } + + } + +} +/*úΪֵֻûв*/ \ No newline at end of file diff --git a/快读演示.java b/快读演示.java new file mode 100644 index 0000000..939396d --- /dev/null +++ b/快读演示.java @@ -0,0 +1,28 @@ +package Course_Codes; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +// BufferedReader Javaʾ +public class ʾ { + public static void main(String[] args) { + //System.in:ȡֽ InputStreamReaderֽ->ַתһ + //BufferedReaderַࣺд湦ܵĶȡַreadline()жȡַ + //eg: + //37 65 + //74 415 + BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); + String line="";//ÿδinȡһַ + try { + while((line=in.readLine())!=null){//ֻҪоͼȡÿζȡһзŵlineַ + String[] s=line.split(" +");//+ʾὫո񿴳һո + int a=Integer.parseInt(s[0]); + int b=Integer.parseInt(s[1]); + System.out.println(a+b); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} diff --git a/数位拆分.java b/数位拆分.java new file mode 100644 index 0000000..d83670e --- /dev/null +++ b/数位拆分.java @@ -0,0 +1,18 @@ +package Course_Codes; + +import java.util.Scanner; + +//Сֻʶ100ڵǴ100ֻĺλ㡣 +public class λ { + + public static void main(String[] args) { + Scanner sc=new Scanner(System.in); + int a=sc.nextInt(); + int b=sc.nextInt(); + int sum=0; + sum=(a%100+b%100)%100; + System.out.print(sum); + + } + +} diff --git a/整数翻转.java b/整数翻转.java new file mode 100644 index 0000000..e2353b3 --- /dev/null +++ b/整数翻转.java @@ -0,0 +1,24 @@ +package Course_Codes; + +import java.util.Scanner; +//ת +public class ת { + + public static void main(String[] args) { + // TODO Auto-generated method stub + Scanner sc=new Scanner(System.in); + while(sc.hasNext()) { + int n=sc.nextInt();//ת + /* int sum=0; + while(n>0) { + //(1)System.out.print(n%10); + sum=sum*10+n%10;//sum10+β + n=n/10; + } + System.out.print(sum);//(2) */ + //ϵͳ + System.out.println(new StringBuffer(String.valueOf(n)).reverse().toString()); + } + } + +} diff --git a/既约分数.java b/既约分数.java new file mode 100644 index 0000000..bcc1e3b --- /dev/null +++ b/既约分数.java @@ -0,0 +1,25 @@ +package Course_Codes; +/* + * Ϊ⣬ֻҪڴʹ佫ɡ +һķӺͷĸԼ1ΪԼ +ʣжٸԼӺͷĸ12020֮12020*/ +public class Լ { + + public static void main(String[] args) { + int count=0; + int n=2020; + for(int i=1;i<=n;i++) { + for(int j=1;j<=n;j++) { + if(Gcd(i,j)==1) { + count++; + } + } + } + System.out.print(count); + } +//շת㹫ʽgcd(a,b) = gcd(b,a mod b) + public static int Gcd(int a,int b) { + //bΪ0ʱaǼԼ + return b==0?a:Gcd(b,a%b); + } +} diff --git a/求100阶乘0的个数.java b/求100阶乘0的个数.java new file mode 100644 index 0000000..308b1d9 --- /dev/null +++ b/求100阶乘0的个数.java @@ -0,0 +1,41 @@ +package Course_Codes; + +import java.math.BigInteger; + +public class 100׳0ĸ { + + public static void main(String[] args) { + int n=10; + Fun(n); + Fun2(n); + } + + public static void Fun(int n) { + BigInteger a=new BigInteger("1"); + for(int i=1;i<=n;i++) { + //aΪBigInteger ͣ˲a*=i; + a=a.multiply(BigInteger.valueOf(i)); + + } + String s=a.toString();//s=100ֵ + System.out.println(s); + int count=0; + for(int i=s.length()-1;i>=0;i--) { + if(s.charAt(i)!='0')//ҵһ0 + break; + count++;//¼0ĸ + } + System.out.println(count); + } + //ѧ + public static void Fun2(int n) { + int ans=0; + while(n>0) { + //15105ĸ + ans=ans+n/5; + n=n/5; + } + System.out.println(ans); + } + +} diff --git a/求二进制中含1个数.java b/求二进制中含1个数.java new file mode 100644 index 0000000..c4caab1 --- /dev/null +++ b/求二进制中含1个数.java @@ -0,0 +1,21 @@ +package Course_Codes; + +import java.util.Scanner; + +//һʮƵĶк1ĸ +public class к1 { + + public static void main(String[] args) { + Scanner sc=new Scanner(System.in); + int count=0;//nĶ1ĸ + while(sc.hasNext()) { + int n=sc.nextInt(); + while(n>0) { + n=n&(n-1); + count++; + } + System.out.println(count); + } + + } +} diff --git a/求最大公约数.java b/求最大公约数.java new file mode 100644 index 0000000..f194635 --- /dev/null +++ b/求最大公约数.java @@ -0,0 +1,29 @@ +package Course_Codes; + +import java.util.Scanner; + +//Լ +public class Լ { + + public static void main(String[] args) { + Scanner sc=new Scanner(System.in); + int a=sc.nextInt(); + int b=sc.nextInt(); + System.out.println("ŷã"+Gcd1(a,b)); + System.out.println("ݹ飺"+Gcd(a,b)); + + } + //Gcd=Լ + public static int Gcd(int a,int b) { + return b==0?a:Gcd(b,a%b); + } + + public static int Gcd1(int a,int b) { + while(b>0) { + int temp=a%b; + a=b; + b=temp;//Gcd(a,b)=>Gcd(b,a%b) + } + return a; + } +} diff --git a/穷举.java b/穷举.java new file mode 100644 index 0000000..b1d6e33 --- /dev/null +++ b/穷举.java @@ -0,0 +1,34 @@ +package Course_Codes; +//ӡһʵԲһԲ +public class { + + public static void main(String[] args) { + int r=16; + sxy(r); + kxy(r); + } + static void sxy(int r) { + for(int y=-r;y<=r;y+=2) { + for(int x=-r;x<=r;x++) { + if(x*x+y*y<=r*r) + System.out.print("*"); + else + System.out.print(" "); + } + System.out.println(); + } + System.out.println(); + } + + static void kxy(int r) { + for(int y=r;y>=-r;y=y-2) { + int x=(int)Math.round(Math.sqrt(r*r-y*y)); + for(int i=1;i<=r-x;i++) + System.out.print(" "); + System.out.print("*"); + for(int i=1;i<=2*x;i++) + System.out.print(" "); + System.out.println("*"); + } + } +} diff --git a/素数的判断.java b/素数的判断.java new file mode 100644 index 0000000..0400b6e --- /dev/null +++ b/素数的判断.java @@ -0,0 +1,25 @@ +package Course_Codes; + +import java.util.Scanner; + +public class ж { + + public static void main(String[] args) { + Scanner sc=new Scanner(System.in); + while(sc.hasNext()) { + int n=sc.nextInt(); + System.out.println(isprime(n)?"Yes":"No"); + } + } + public static Boolean isprime(int n) { + //ų0 1 + if(n<1) + return false; + //i*i=10?1:0; + count+=temp; + a/=10; + b/=10; + } + System.out.print(count); + } + +}