沙漠寻宝题解

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#define MAXN 1001
using namespace std;

void run(char x[]);
double run_fu(char x[],int in);

char str[MAXN][MAXN],s[MAXN];
int tot=0,h=1,f[MAXN];
const int sta=1,en=2,loo=3,con=4,wri=5,bre=6,fu=7;
double sh[30];

void read(){
    while((scanf("%s",s))!=EOF){
        if(s[0]!=' '){
            strcpy(str[++tot],s);
        }
    }
}

int check(char x[]){
    if(x[1]=='='){
        return fu;
    }else if(x[0]=='s'){
        return sta;
    }else if(x[0]=='e'&&x[1]=='n'){
        return en;
    }else if(x[0]=='l'&&x[1]=='o'){
        return loo;
    }else if(x[0]=='c'&&x[1]=='o'