关于判断两个数是否为相邻质数问题

A. Panoramix’s Prediction
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
A prime number is a number which has exactly two distinct divisors: one and itself. For example, numbers 2, 7, 3 are prime, and 1, 6, 4 are not.

The next prime number after x is the smallest prime number greater than x. For example, the next prime number after 2 is 3, and the next prime number after 3 is 5. Note that there is exactly one next prime number after each number. So 5 is not the next prime number for 2.

One cold April morning Panoramix predicted that soon Kakofonix will break free from his straitjacket, and this will be a black day for the residents of the Gallic countryside.

Panoramix’s prophecy tells that if some day Asterix and Obelix beat exactly x Roman soldiers, where x is a prime number, and next day they beat exactly y Roman soldiers, where y is the next prime number after x, then it’s time to wait for Armageddon, for nothing can shut Kakofonix up while he sings his infernal song.

Yesterday the Gauls beat n Roman soldiers and it turned out that the number n was prime! Today their victims were a troop of m Romans (m > n). Determine whether the Gauls should wait for the black day after today’s victory of Asterix and Obelix?

Input
The first and only input line contains two positive integers — n and m (2 ≤ n < m ≤ 50). It is guaranteed that n is prime.

Pretests contain all the cases with restrictions 2 ≤ n < m ≤ 4.

Output
Print YES, if m is the next prime number after n, or NO otherwise.

Examples
inputCopy
3 5
outputCopy
YES
inputCopy
7 11
outputCopy
YES
inputCopy
7 9
outputCopy
NO
这个题的意思是判断输入的两个数(n m)是否为相邻质数，开始我我是先定义变量i=n+1然后用循环依次判断，比较麻烦，后听学长讲解，得知简易方法。
思路就是直接从开始找就ok了，找到比n大的且与n相邻的质数，再与m比较就好了。

 #include<stdio.h>

int main()
{
int n,m;
while(~scanf("%d %d",&n,&m))
{
int h;
for(int i=1;i<=50;i++)
{
int s=0;
for(int j=2;j<i;j++)
{
if(i%j0)
{
s=1;
}
}
if(s0&&i>n)
{
h=i;
break;
}
}
if(h==m)
printf(“YES\n”);
else
printf(“NO\n”);
}
return 0;
}