简单模拟,模拟过程即可!
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <cstring>
#include <sstream>
#include <math.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
int main(){
int m1,m2;
int r1,r2,r3;
char s[200];
while(cin>>m1>>m2){
scanf("%s",s);
int len=strlen(s);
for(int i=0;i<len;i++){
switch (s[i]){
case 'A':r1=m1;
break;
case 'B':r2=m2;
break;
case 'C':m1=r3;
break;
case 'D':m2=r3;
break;
case 'E':r3=r1+r2;
break;
case 'F':r3=r1-r2;
break;
}
}
printf("%d,%d\n",m1,m2);
}
return 0;
}