POJ 3458-Colour Sequence 水題-類brute force算法
今天晚上都是水題,直接上代碼吧;
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
char up[2000];
char down[2000];
char origin[2000];

int main ()

{
int n;
int i;
int pos1;
int pos2;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s%s",origin,up,down);
pos1=0;
pos2=0;
int len=strlen(up);
while(1)

{
if(up[pos2]=='*'||down[pos2]=='*')
{
pos2++;
pos1++;
}
else if(origin[pos1]==up[pos2]||origin[pos1]==down[pos2])
{
pos2++;
pos1++;
}
else
pos2++;
if(pos1==strlen(origin))
{
printf("win\n");
break;
}
if(pos2>len)
{
printf("lose\n");
break;
}
}
}
system("pause");
return 0;
}posted on 2009-03-06 23:06 abilitytao 閱讀(952) 評論(0) 編輯 收藏 引用

