蓝桥杯 练习系统 算法提高答案Java

}

}

int n = (int) st.nval; st.nextToken(); int m = (int) st.nval;

System.out.println(\System.out.println(\

System.out.println(\System.out.println(\if (m == 1) { m = 13; n -= 1; }

if (m == 2) { m = 14; n -= 1; }

int w = (1 + 2 * m + 3 * (m + 1) / 5 + n + n / 4 - n / 100 + n / 400 + 1) % 7; int c = 1;

for (int i = w; i < 7; i++) System.out.print(c++ + \System.out.println();

int month[] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }; if (n % 400 == 0 || (n % 4 == 0 && n % 100 != 0)) month[2] = 29;

int days = month[m == 13 ? 1 : (m == 14 ? 2 : m)] - c + 1; while (days >= 7) { for (int i = 0; i < 7; i++) System.out.print(c++ + \ System.out.println(); days -= 7; }

if (days > 0) for (int i = 0; i < days; i++) { if (i == days - 1) System.out.println(c); else System.out.print(c++ + \ }

System.out.println(\

ADV-92 求最大公约数

import java.util.Scanner;

public class Main{ public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int m = input.nextInt(); System.out.println(gcd(n,m)); } public static int gcd(int n,int m){ int num = n>m ? m:n; while(true){ if (n % num == 0 && m % num ==0){ break; } num--; } return num; } }

ADV-91

素数判断

import java.util.Scanner;

public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a =sc.nextInt(); if(IsPrime(a)) System.out.println(\ else System.out.println(\ } static boolean IsPrime(int num) { boolean Prime=true; if(num<2) Prime=false; else

}

}

{ for (int i = 2; i <= Math.sqrt(num); i++) { if(num%i==0) Prime=false; } }

return Prime;

ADV-90 输出日历

public class Main { public static void main(String[] args) { System.out.println(\ System.out.println(\ System.out.println(\ Mo Tu We Th Fr Sa\ System.out.println(\

System.out.println(\ 1 2\ int n=31,sum=0; for(int i=3;i<=n;i++){ sum++; if(sum==1&&i<=9) System.out.print(\ if(sum==1&&i>9) System.out.print(i); if(sum!=1&&i<=9) System.out.print(\ \ if(sum!=1&&i>9) System.out.print(\ \ if(sum==7){ sum=0; System.out.println(); } } if(sum!=0) System.out.println(); System.out.println(\ } }

ADV-89

输出九九乘法表

import java.util.Scanner;

public class Main {

}

public static void main(String[] args) { System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\ System.out.println(\}

ADV-88 输出正反三角形

import java.util.*; public class Main{ public static void main(String[] args) { Scanner aa=new Scanner(System.in); int a=aa.nextInt(); int b=aa.nextInt(); int num=a-1; for(int i=0;i0;j--){ System.out.print(\ } num-=1; System.out.println(); } }