第十一届蓝桥杯大赛软件类省赛Java大学B组（第一场）

第十一届蓝桥杯大赛软件类省赛Java大学B组（第一场）

YeRikGSunlRzgDlvRwYkXkrGWWhXaA

import java.util.Date; import java.text.ParseException; import java.text.SimpleDateFormat; public class Main { public static void main(String[] args) throws ParseException { SimpleDateFormat sdf = new SimpleDateFormat("yy-MM-dd HH:mm:ss"); Date begin = (Date) sdf.parse("1921-7-23 12:00:00"); Date end = (Date) sdf.parse("2020-7-1 12:00:00"); long ans = end.getTime() - begin.getTime(); System.out.println(ans / 60000); } } 52038720

public class Main { public static void main(String[] args) { int sum = 1000; int minn = 0x3f3f3f3f; int ans = 0, res = 0; for(int i = 1; i <= 1000; i ++) { if(sum % i == 0) { ans = sum / i + 10 * i; } else { ans = sum / i + 10 * i + 1; } if(ans < minn) { minn = ans; res = i; } } System.out.println(res); } }

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); for(int i = 1; i < nums.length; i ++) sum += nums[i]; int v = sum / 2; for(int i = 1; i < nums.length; i ++) { for(int j = v; j >= nums[i]; j --) { dp[j] = Math.max(dp[j], dp[j - nums[i]] + nums[i]); } } System.out.println(dp[v]); System.out.println(sum - 2 * dp[v]); } static int sum = 0; static int[] dp = new int[98090000]; static int[] nums = {0, 9090400, 8499400, 5926800, 8547000, 4958200, 4422600, 5751200, 4175600, 6309600, 5865200, 6604400, 4635000, 10663400, 8087200, 4554000}; } public class Main { static int[] nums = {9090400, 8499400, 5926800, 8547000, 4958200, 4422600, 5751200, 4175600, 6309600, 5865200, 6604400, 4635000, 10663400, 8087200, 4554000}; static boolean[] vis = new boolean[20]; static int sum = 0; static int minn = 0x3f3f3f3f; static void dfs(int s) { if(s >= sum / 2) { int tmp = 0; for(int i = 0; i < nums.length; i ++) { if(vis[i]) tmp += nums[i]; } minn = Math.min(minn, Math.abs(sum - tmp * 2)); return; } for(int i = 0; i < nums.length; i ++) { if(!vis[i]) { vis[i] = true; dfs(s + nums[i]); vis[i] = false; } } } public static void main(String[] args) { for(int i = 0; i < nums.length; i ++) sum += nums[i]; dfs(0); System.out.println(minn); } } 2400

def fib(n): x = 1 y = 1 cnt = 2 while cnt < n: ans = x + y y = x x = ans cnt += 1 return ans import java.math.BigInteger; public class Main { public static void main(String[] args) { BigInteger a = new BigInteger("63906981155943558665134927398528713938196200043745871355763079787265151995322001898071485437809065533306267303596007174873825024273095647974649878913616096766604248066008649395662343764260286534059003290654116126957362406745866507935366369712842138930014038888572227398490742287722358671367235709189166548965693916054419169307250217586108972590100204080980670597873094617540854443783530320723473081393553497241453257464515"); BigInteger b = new BigInteger("2109055108727958115216736026700200421586510355834736601003381505407930071607408184616335724173657853423941515"); System.out.println(gcd(a, b)); } static BigInteger gcd(BigInteger a, BigInteger b) { return b.equals(BigInteger.ZERO) ? a : gcd(b, a.mod(b)); } } 6765

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); String s = in.nextLine(); char[] a = s.toCharArray(); int upper = 0, lower = 0, num = 0; for(int i = 0; i < a.length; i ++) { if(Character.isUpperCase(a[i])) upper ++; else if(Character.isLowerCase(a[i])) lower ++; else if(Character.isDigit(a[i])) num ++; } System.out.println(upper); System.out.println(lower); System.out.println(num); } }

import java.util.Scanner; public class Main { static long mod = 123456789; public static void main(String[] args) { Scanner in = new Scanner(System.in); long n = in.nextLong(); long ans = 0; for(long i = 1; i <= n; i ++) { ans = (ans + quickPow(i, 8)) % mod; } System.out.println(ans); } static long quickPow(long a, int b) { long ans = 1; while(b > 0) { if((b & 1) == 1) ans = (ans * a) % mod; a = (a * a) % mod; b >>= 1; } return ans; } }

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); String s = in.nextLine(); char[] a = s.toCharArray(); boolean[] vis = new boolean[a.length]; char[] ans = new char[a.length]; int cnt = 0, tmp; for(int i = 0; i < a.length - 1; i ++) { tmp = (a[i] - '0') * 10 + a[i + 1] - '0'; if(tmp <= 26) { ans[cnt ++] = (char)('A' + tmp - 1); vis[i] = vis[i + 1] = true; i ++; } else { ans[cnt ++] = (char)('A' + a[i] - '0' - 1); vis[i] = true; } } if(!vis[a.length - 1]) ans[cnt ++] = (char)('A' + a[a.length - 1] - '0' - 1); for(int i = 0; i < cnt; i ++) System.out.print(ans[i]); } }

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int m = in.nextInt(); for(int i = 1; i <= n; i ++) fa[i] = i; for(int i = 0; i < m; i ++) { int tmp = in.nextInt(); if(tmp == 1) { int a = in.nextInt(); int b = in.nextInt(); int tx = find(a); int ty = find(b); if(tx != ty) { fa[tx] = ty; dis[tx] = sum[tx] - sum[ty]; } } else { int a = in.nextInt(); int b = in.nextInt(); int c = find(a); sum[c] += b; } } System.out.print(sum[find(1)] + dis[1]); for(int i = 2; i <= n; i ++) { System.out.print(" " + (sum[find(i)] + dis[i])); } } static int MAXN = 10000 + 10; static int[] fa = new int[MAXN]; static int[] sum = new int[MAXN]; static int[] dis = new int[MAXN]; static int find(int x) { if(fa[x] != x) { int t = fa[x]; fa[x] = find(fa[x]); dis[x] += dis[t]; } return fa[x]; } }