Nanyang ACM34-Han Xin dianbing

/*
Question 34 --- Han Xin dianbing
Time Limit: 3000 MS | memory limit: 65535 KB
Difficulty: 1
Description
According to legend, Han believes that his talents never count the number of people in his army directly. As long as the soldiers change the formation in a row of three, five, and seven, each time he only takes a glance at the tail of the team, he will know the total number of people. Enter three non-negative integers a, B, and c to indicate the number of people in each formation (a <3, B <5, c <7 ), minimum value of the total output number (or no solution is reported ). The total number is not less than 10, but not more than 100.
Input
Enter three non-negative integers a, B, and c, indicating the number of people in each formation (a <3, B <5, c <7 ). For example, input: 2 4 5
Output
Minimum value of the total output number (or No solution is reported, that is, No answer is output ). Instance, output: 89
Sample Input
2 1 6 sample output
41
*/

# Include

Using namespace std;

Int main ()
{
Int a, B, c;
Int I, n = 0;

Cin> a> B> c;

For (I = 1; I <16; ++ I)
{
N = I * 7 + c;
If (n <10)
{
Continue;
}
If (n> 100)
{
Break;
}
If (n % 3 = a & n % 5 = B)
{
Cout < Return 0;
}
}
Cout <"No answer" <

Return 0;
}