Zzuli:1056 lucky numbers

Title Description

Xiao Ming has a preference for some numbers , for example , He likes it 7 Multiple , And don't like 4 Multiple , If an integer is 7 Multiple , instead of 4 Multiple , Xiao Ming will think this number is his lucky number . Now give two integers m and n, Please help Xiao Ming find it m To n The largest lucky number in the range . If m To n There are no lucky numbers in the range , The output “no”

Input

Two positive integers m and n（m < =n, And all of them are less than 10 Of 9 Power ）

Output

An integer , namely m To n The largest lucky number in the range .

The sample input  Copy

90 100

Sample output  Copy

98

#include <stdio.h>
int main()
{
	int i,m,n,c=0;
	scanf("%d%d",&m,&n);
	for(i=n;i>=m;i--)
	{
		if(i%7==0&&i%4!=0)
		{
			printf("%d",i);
			c++;
			break;
		}
	}
	if(c==0)
	{
	printf("no");
    }
	return 0;
}