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

}

}

}

int result=list.get(j-1); list.set(j, result); System.out.print(\ Move back:\ for(int s:list){ System.out.print(s+\ } System.out.println(); }else{ list.set(j, value); break; } }else if(list.get(0)>value){ list.set(j, value); } }

/*System.out.print(\for(int s:list){ System.out.print(s+\}

System.out.println();*/ }

System.out.print(\ Final:\for(int s:list){ System.out.print(s+\}

System.out.println();

ADV-128 找素数

import java.util.Scanner;

public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); boolean arr[] = new boolean[50001]; boolean arr2[] = new boolean[1000002]; arr[0] = true; arr[1] = true; int ans = 0; int left = sc.nextInt();

int right = sc.nextInt();

for (int i = 2; i < arr.length; i++) if (!arr[i]) for (int j = i + i; j < arr.length; j += i) arr[j] = true; if (right < arr.length) { for (int i = left; i <= right; i++) if (!arr[i]) ans++; System.out.println(ans); return; }

if (left < arr.length) { for (int i = left; i < arr.length; i++) if (!arr[i]) ans++; left = arr.length; }

for (int i = 2; i < arr.length; i++) { if (!arr[i]) for (int j = left / i; j <= right / i; j++) { int temp = j * i - left + 1; if (temp >= 0) arr2[temp] = true; } }

for (int i = 0; i <= right - left + 1; i++) if (!arr2[i]) ans++;

System.out.println(ans);

}

}

ADV-126 import java.util.ArrayList; import java.util.List; import java.util.Scanner;

public class Main { /**

扫雷

* @param args */

public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc=new Scanner(System.in); List sb=new ArrayList(); int count=1; while(true){ int a=sc.nextInt(); int b=sc.nextInt(); if(a==b&&a==0) break; int[][] arr=new int[a][b]; sc.nextLine(); for(int i=0;i=0&&j-1>=0&&arr[i-1][j-1]!=9) arr[i-1][j-1]++; if(i-1>=0&&arr[i-1][j]!=9) arr[i-1][j]++; if(i-1>=0&&j+1=0&&arr[i][j-1]!=9) arr[i][j-1]++; if(j+1=0&&arr[i+1][j-1]!=9) arr[i+1][j-1]++; if(i+1

}

}

} String s=\ sb.add(new StringBuffer(s)); for(int i=0;i

for(int i=0;i

ADV-125 促销购物

import java.util.Hashtable;

import java.util.Scanner; public class Main { private plan plan[]; private Hashtable ha=new Hashtable(); private static int pl[][],n,m; private Node t[][][][][][]; private static boolean b[]; public void setT(int a,int b,int c,int d,int e,int f) { t=new Node[a][b][c][d][e][f]; } public void setPlan(int n) { plan=new plan[n]; } public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc=new Scanner(System.in); Main ps=new Main();