若x mod 2 =1, x mod 3 = 2, x mod 5 = 4, x mod 6 = 5, x mod 7 =0;求最小解
源码如下：
#include <string.h>
#include <stdio.h>
3:
int main()
5: {
int x = 7, i, res, flag = 0;
7:
for (i=1; i<=100; i++)
9: {
if ((x%2 == 1) && (x % 3 == 2) && (x % 5 == 4) && (x % 6 ==5))
11: {
12: res = x;
13: flag = 1;
break;
15: }
16: x = 7 * (i + 1);
17: }
18:
if (flag == 1)
, res);
else
);
23:
return 0;
25: }