1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
int a[1010],ty[1010];
int main(){
    int n,k,ans=0,c,i,x;
    double y;
    char tmp[10],QQ[4];
    scanf("%d",&n);
    for(k=1;k<=n;k++){
        scanf("%s%s%d",tmp,QQ,&a[k]);
        int s=strlen(QQ);
        if(s==1){
            if(QQ[0]=='=') ty[k]=1;
            if(QQ[0]=='>') ty[k]=2;
            if(QQ[0]=='<') ty[k]=3;
        }
        if(s==2){
            if(QQ[0]=='>') ty[k]=4;
            if(QQ[0]=='<') ty[k]=5;
        }
    }
    for(k=-2;k<=2002;k++){
        c=0;
        for(i=1;i<=n;i++){
            x=a[i];
            if(ty[i]==1){
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX