为什么这个可以全过啊？

解题思路:

注意事项:

参考代码:

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

import java.util.HashSet;

import java.util.Set;

import java.util.StringTokenizer;

public class D_5 {

static int a[] ;

static int b[];

static int n,m;

static Set<Integer> set = new HashSet<>();

public static void main(String[] args) throws IOException {

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

StringTokenizer stringTokenizer = new StringTokenizer(br.readLine());

while(stringTokenizer.hasMoreTokens()) {

n=Integer.valueOf(stringTokenizer.nextToken());

m=Integer.valueOf(stringTokenizer.nextToken());

}

int count = 0;

a=new int[n+2];

b=new int[m+2];

stringTokenizer=new StringTokenizer(br.readLine());

for (int i = 1; i <=n; i++) {

a[i]=Integer.valueOf(stringTokenizer.nextToken());

}

stringTokenizer=new StringTokenizer(br.readLine());

for (int i = 1; i <= m; i++) {

b[i]=Integer.valueOf(stringTokenizer.nextToken());

}

for (int i = 1; i <= n; i++) {

for (int j = 1; j <= m; j++) {

int S = a[i]+b[j];

if(S<=n+m&&isprim(S)) {

// System.out.println(i+" "+j);

// System.out.println(a[i]);

// System.out.println(b[j]);

// System.out.print(S+" ");

set.add(S);

}

}

}

System.out.println(set.size());

}

private static boolean isprim(int s) {

// TODO Auto-generated method stub

for (int i = 2; i*i<=s; i++) {

if(s%i==0) return false;

}

return true;

}

}