由于比赛我也不知道题目，我就直接贴代码了
题目一
package demo;
public class Demo1 {
public static void main(String[] args) {
System.out.println("Problem? The Solution: Programming.");
}
}
题目二
package demo2;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
int b = scanner.nextInt();
System.out.println(b-a);
}
}
题目三
package demo3;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
int b = scanner.nextInt();
if(a==2||b==1){
System.out.println("-");
}else{
if(a==0){
System.out.println("biii");
}else{
System.out.println("dudu");
}
}
if(a==1){
System.out.println("move");
}else
System.out.println("stop");
}
}
题目四
package demo4;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int m = scanner.nextInt();
long sum=0;
for(int i =0;i<m;i++){
int k = scanner.nextInt();
sum+=k;
}
int k =m-1;
int z = n*k;
if(sum>z){
System.out.println(sum-z);
}else{
System.out.println(0);
}
}
}
题目五
#include <bits/stdc++.h>
#define OST std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
float arr[110];
int sall[110];
string YES="YES",NO="NO",Yes="Yes",No="No",yes="yes",no="no";
int main(){
int n;
cin>>n;
for(int i =0;i<n;i++){
cin>>arr[i];
}
double sum=0;
while(true){
int a;
cin>>a;
int b;
cin>>b;
if(a==0)break;
sall[a]+=b;
sum +=arr[a-1]*b;
}
for(int i =1;i<=n;i++){
cout<<sall[i]<<endl;
}
printf("%.2f\n",sum);
}题目六
package demo7;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.ArrayList;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int a,b;
a= scanner.nextInt();
b = scanner.nextInt();
Map<Integer, List<Integer>> map = new HashMap<Integer, List<Integer>>();
int max = 0;
while (a<=b){
int k = fun(a);
max=Math.max(max,k);
if(k>=max){
map.putIfAbsent(max,new ArrayList<Integer>());
map.get(max).add(Integer.valueOf(a));
}
a++;
}
List<Integer>ans = map.get(max);
System.out.println(max);
for(int i=0;i<ans.size();i++){
if(i==ans.size()-1) System.out.println(ans.get(i));
else
System.out.print(ans.get(i)+" ");
}
}
private static int fun(int a) {
int step =0;
while(a>=10){
int sum=1;
while (a>0){
sum = sum*(a%10);
a/=10;
}
a = sum;
step++;
}
return step;
}
}
题目七
package demo8;
//
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
while (n>0){
n--;
int[][]arr= new int[10][10];
for(int i =0;i<9;i++){
for(int j = 0;j<9;j++){
arr[i][j]=scanner.nextInt();
}
}
if(!fun1(arr)){
System.out.println(0);
continue;
}
if(!fun2(arr)){
System.out.println(0);
continue;
}
if(!fun3(arr)){
System.out.println(0);
continue;
}
System.out.println(1);
}
}
private static boolean fun3(int[][] arr) {
for(int i=0;i<9;i+=3){
for(int j =0;j<9;j+=3){
boolean one[]= new boolean[10];
for(int a=i;a<i+3;a++){
for(int b =j;b<j+3;b++){
if(one[arr[a][b]]){
return false;
}
one[arr[a][b]]=true;
}
}
}
}
return true;
}
private static boolean fun2(int[][] arr) {
for(int i =0;i<9;i++){
boolean one[]= new boolean[10];
for(int j = 0;j<9;j++){
if(arr[i][j]<=0||arr[i][j]>9){
return false;
}
if(one[arr[j][i]]){
return false;
}
one[arr[j][i]]=true;
}
}
return true;
}
public static boolean fun1(int[][] arr){
for(int i =0;i<9;i++){
boolean one[]= new boolean[10];
for(int j = 0;j<9;j++){
if(arr[i][j]<=0||arr[i][j]>9){
return false;
}
if(one[arr[i][j]]){
return false;
}
one[arr[i][j]]=true;
}
}
return true;
}
}
题目七
package newDemo;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n,m;
n = scanner.nextInt();
m = scanner.nextInt();
int[][]arr=new int[n][1010];
for(int i =0;i<n;i++){
int k = scanner.nextInt();
for(int j =0;j<k;j++){
int v = scanner.nextInt();
arr[i][0]=k;
arr[i][j+1]=v;
}
}
int q=scanner.nextInt();
while (q>0){
q--;
int a =scanner.nextInt();
int b = scanner.nextInt();
int sum =0;
for(int i=0;i<n;i++){
boolean flag =false;
for(int j=1;j<=arr[i][0];j++){
if(arr[i][j]==a){
flag = true;
break;
}
}
if(!flag)continue;
flag=false;
for(int j=1;j<=arr[i][0];j++){
if(arr[i][j]==b){
flag = true;
break;
}
}
if(flag)sum++;
}
System.out.println(sum);
}
}
}
还有的不是全对，我就不贴了，怕误导人家
