/*
Description: Using Brute-force Strategy to Search a Solution
 
	今有物不知其数,三三数之剩二,五五数之剩 三,七七数之剩二,问物几何?
	x = 2 (mod 3)
	x = 3 (mod 5)
	x = 2 (mod 7)
 
Author:  Liutong Xu
Date: 2016/10/25
*/
 
#include <stdio.h>
#define LIMIT 100
int main()
{
	int x;
 
	x = 1;
	while (!(x % 3 == 2 && x % 5 == 3 && x % 7 == 2))	//while not a solution
		x++;
	printf("x = %d\n",x);
 
	//if you wang to find all solutions 
	//for (x = 1;x < LIMIT;x++)			
	//	if (x % 3 == 2 && x % 5 == 3 && x % 7 == 2)
	//		printf("x = %d\n",x);
 
	return 0;
} 

LyoKRGVzY3JpcHRpb246IFVzaW5nIEJydXRlLWZvcmNlIFN0cmF0ZWd5IHRvIFNlYXJjaCBhIFNvbHV0aW9uCgkKCeS7iuacieeJqeS4jeefpeWFtuaVsCzkuInkuInmlbDkuYvliankuows5LqU5LqU5pWw5LmL5YmpIOS4iSzkuIPkuIPmlbDkuYvliankuows6Zeu54mp5Yeg5L2VPwoJeCA9IDIgKG1vZCAzKQoJeCA9IDMgKG1vZCA1KQoJeCA9IDIgKG1vZCA3KQoJCQpBdXRob3I6ICBMaXV0b25nIFh1CkRhdGU6IDIwMTYvMTAvMjUKKi8KCiNpbmNsdWRlIDxzdGRpby5oPgojZGVmaW5lIExJTUlUIDEwMAppbnQgbWFpbigpCnsKCWludCB4OwoJCgl4ID0gMTsKCXdoaWxlICghKHggJSAzID09IDIgJiYgeCAlIDUgPT0gMyAmJiB4ICUgNyA9PSAyKSkJLy93aGlsZSBub3QgYSBzb2x1dGlvbgoJCXgrKzsKCXByaW50ZigieCA9ICVkXG4iLHgpOwoJCgkvL2lmIHlvdSB3YW5nIHRvIGZpbmQgYWxsIHNvbHV0aW9ucyAKCS8vZm9yICh4ID0gMTt4IDwgTElNSVQ7eCsrKQkJCQoJLy8JaWYgKHggJSAzID09IDIgJiYgeCAlIDUgPT0gMyAmJiB4ICUgNyA9PSAyKQoJLy8JCXByaW50ZigieCA9ICVkXG4iLHgpOwoKCXJldHVybiAwOwp9IA==