2018蓝桥杯初赛

题目1-4

package zkj;
import java.math.*;



import java.io.*;
import java.math.*;
import java.util.Scanner;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Collection;
import java.util.TreeSet;
import java.util.ArrayList;

import java.util. Iterator;

public class Zz {  

	static void fracReduction(int numerator, int denominator) {
		//找到最大公约数，然后分别处以最大公约数
		int m = numerator;
		int n = denominator;
		int r;
		while (numerator > 0){
			r = denominator % numerator;
			denominator = numerator;
			numerator = r;
		}
		
		System.out.println(m/denominator + "/" + n/denominator);
	}


	public static void main(String[] args) throws FileNotFoundException 
	{  
		int i=1;
		for(int j=2;j<=20;j++) {
			i=i*2;
		}
		System.out.println(i);
		int k=i,l=1;
		for(int j=2;j<=20;j++)
		{
			l=l*2;
			k+=(i/l);
		}
		fracReduction(k,i);
		
		System.out.println(k);
}
	
}

package zkj;
import java.math.*;



import java.io.*;
import java.math.*;
import java.util.Scanner;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Collection;
import java.util.TreeSet;
import java.util.ArrayList;
import java.util.Calendar;
import java.util. Iterator;

public class Zz {  

	


	public static void main(String[] args) throws FileNotFoundException 
	{  
		Calendar a=Calendar.getInstance();
		a.set(Calendar.YEAR, 2000);
		a.set(Calendar.MONTH, 12);
		a.set(Calendar.DAY_OF_MONTH, 31);
		Calendar b=Calendar.getInstance();
		b.set(Calendar.YEAR, 1901);
		b.set(Calendar.MONTH, 1);
		b.set(Calendar.DAY_OF_MONTH, 1);
		System.out.println(a.get(Calendar.MONDAY));
		System.out.println(b.get(Calendar.MONDAY));
		long aa=(a.getTimeInMillis()-b.getTimeInMillis())/(1000*60*60*24);
		System.out.println(aa/7);
}
	
}

package 大数运算;

import java.math.BigInteger;

public class Main {

    public static void main(String[] args) {
        int nums[]={
                5650,4542,3554,473,946,4114,3871,9073,90,4329,
                2758,7949,6113,5659,5245,7432,3051,4434,6704,3594,
                9937,1173,6866,3397,4759,7557,3070,2287,1453,9899,
                1486,5722,3135,1170,4014,5510,5120,729,2880,9019,
                2049,698,4582,4346,4427,646,9742,7340,1230,7683,
                5693,7015,6887,7381,4172,4341,2909,2027,7355,5649,
                6701,6645,1671,5978,2704,9926,295,3125,3878,6785,
                2066,4247,4800,1578,6652,4616,1113,6205,3264,2915,
                3966,5291,2904,1285,2193,1428,2265,8730,9436,7074,
                689,5510,8243,6114,337,4096,8199,7313,3685,211
        };
        int i;
        BigInteger ans = new BigInteger("1");
        for(i=0;i<nums.length;i++){
            BigInteger tmp=new BigInteger("1");
            tmp=BigInteger.valueOf(nums[i]);
            ans=ans.multiply(tmp);
        }
        int zeros=0;
        String str=ans.toString();
        for(i=str.length()-1;i>=0;i--){
            if(str.charAt(i)=='0'){
                zeros++;
            }else{
                break;
            }
        }
        System.out.println(ans);
        System.out.println(zeros);
    }

}

package zkj;
import java.math.*;



import java.io.*;
import java.math.*;
import java.util.Scanner;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Collection;
import java.util.TreeSet;
import java.util.ArrayList;
import java.util.Calendar;
import java.util. Iterator;

public class Zz {  

	


	public static void main(String[] args) throws FileNotFoundException 
	{  
		long x = 59084709587505L;
		int num=0;
		for(int i=0;Math.pow(3, i)<=x;i++)
		{
			for(int j=0;Math.pow(5, j)<=x;j++)
			{
				for(int k=0;Math.pow(7, k)<=x;k++)
				{
					if(Math.pow(3, i)*Math.pow(5, j)*Math.pow(7, k)<=x)
						{num++;}
					else {break;}
				}
			}
		}
		System.out.println(num-1);//1905
}
	
}