Constraint Checker 2016微软探星夏令营在线技术笔试

题意：给你N个串，每个串有不定长表达式， 包含“<=”，"<","A~Z","integer"，A-Z的值后面会有T个样例会给你，让你判断N个串是否都是成立的

题解：链表。保存的是这个表达式的类型，是数字还是字母，还有保存判断符，最后暴力从左往右扫就好了，一旦不对就跳出。

描述

Given a set of constraints like 0 and values for all the variables, write a checker program to determine if the constraints are satisfied.

More precisely, the format of constraints is:

token op token op ... op token

where each token is either a constant integer or a variable represented by a capital letter and each op is either less-than ( < ) or less-than-or-equal-to ( <= ). 

输入

The first line contains an integer N, the number of constraints. (1 ≤ N ≤ 20)

Each of the following N lines contains a constraint in the previous mentioned format.

Then follows an integer T, the number of assignments to check. (1 ≤ T ≤ 50)

Each assignment occupies K lines where K is the number of variables in the constraints.

Each line contains a capital letter and an integer, representing a variable and its value.

It is guaranteed that:

1. Every token in the constraints is either an integer from 0 to 1000000 or an variable represented by a capital letter from 'A' to 'Z'.

2. There is no space in the constraints.

3. In each assignment every variable appears exactly once and its value is from 0 to 1000000. 

输出

For each assignment output Yes or No indicating if the constraints are satisfied.

样例输入

2
A 样例输出 
  
Yes
No 
 
  
#pragma comment(linker, "/STACK:102400000,102400000") 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include