| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
大家公认的水题2159,WA的受不了了!求教,谢谢。帮忙看下这个到底有啥问题啊?谢谢#include<iostream>
#include<cstdlib>
#include<string>
using namespace std;
int Compare(const void *ele1, const void *ele2) //由小到大
{
return *(int *)ele1 - *(int *)ele2;
}
int main()
{
string original,secret; //定义两个字符串,用来做输入
getline(cin,original);
getline(cin,secret);
char *pto = &original[0]; //指针指向string对象original字符串的首地
char *pts = &secret[0]; //同上
qsort(pto, original.size(), sizeof(char), Compare);
qsort(pts, secret.size(), sizeof(char), Compare);
int count1=0,count2=0,num1[26]={0},num2[26]={0};
if(!cin.fail()) //统计字符的频率
{
for(int i=0;i<original.size()-1;i++)
{
if(original[i] == original[i+1])
{
num1[count1]++;
}
else count1++;
if(secret[i] == secret[i+1])
{
num2[count2]++;
}
else count2++; };
for(int cont =0; cont<=count1;cont++) //检查密码是否正确
{
if(num1[cont]!=num2[cont]){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
}
return 0;
}
谢谢!!!
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator