九度OJ 1006 ZOJ问题 (二)

2014-11-24 02:21:13 · 作者: · 浏览: 4
if (a * b == c)
{
cout<<"Accepted"< }
else
{
cout<<"Wrong Answer"< }
}
}
}
}
}
}
}
}
return 0;
}

#include
#include
using namespace std;

int main()
{
string s;
while (cin>>s)
{
int x = 0;
int a = 0, b = 0, c = 0;
int temp = -1;

if (s[0] == 'z')
{
int d = 1;
//判断z后边为o
if (s[d] != 'o')
{
cout<<"Wrong Answer"< }
else
{
while (s[d] == 'o')
{
d++;
}
//判断o后边为j
if (s[d] != 'j')
{
cout<<"Wrong Answer"< }
else
{
d ++;
//判断j后边是否还有字符
if (d != s.length())
{
cout<<"Wrong Answer"< }
else
{
cout<<"Accepted"< }
}
}

}
else
{//首字母不为z,则必为o,计算o的个数
if (s[0] != 'o')
{
cout<<"Wrong Answer"< }
else
{
int i = 0;
while (s[i] == 'o')
{
i++;
}
x = i;
a = i;

//o判断结束,o之后必须是z
if(s[i] != 'z')
{
cout<<"Wrong Answer"< }
else
{//o后边是z
i++;
//判断z后边是否为o
if (s[i] != 'o')
{
cout<<"Wrong Answer"< }
else
{//z后边为o,计算o的个数
int j = 0;
while (s[i] == 'o')
{
i++;
j++; //o的个数
}

b = j;

if (s[i] != 'j')
{
cout<<"Wrong Answer"< }
else
{//判断j后边o的个数
int k = 0;
i++;
if (s[i] != 'o')
{
cout<<"Wrong Answer"< }
else
{
while (s[i] == 'o')
{
i++;
k++;
}

//判断字符串是否结束
if (i != s.length())
{
cout<<"Wrong Answer"< }
else
{
c = k;
//比较a与c
if (a * b == c)
{
cout<<"Accepted"< }
else
{
cout<<"Wrong Answer"< }
}
}
}
}
}
}
}
}
return 0;
}