Uva-1339 Ancient Cipher
2017-04-16 18:35
344 查看
虽说课本上讲的是将函数当作参数一样使用,但是这题可以不用那么做。
代码:#include <bits/stdc++.h>
using namespace std;
#define maxn 100 + 5
string a, b;
int cnt[maxn], cnt2[maxn];
void ssor(int *s)
{
int t, i, j;
int len = 26;
for(int i = 0; i < len; i++)
{
for(int j = i + 1; j < len; j++)
if(s[i] > s[j])
{
t = s[i];
s[i] = s[j];
s[j] = t;
}
}
}
int main()
{
while(cin>>a>>b)
{
int len1 = a.length(), len2 = b.length();
memset(cnt,0,sizeof(cnt));
memset(cnt2,0,sizeof(cnt2));
if(len1 != len2)
cout<<"NO"<<endl;
else
{
for(int i = 0; i < len1; i++)
{
cnt[a[i] - 'A']++;
cnt2[b[i] - 'A']++;
}
ssor(cnt);
ssor(cnt2);
int flag = 1;
for(int i = 0; i < 26; i++)
if(cnt[i] != cnt2[i])
flag = 0;
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
}
return 0;
}
相关文章推荐
- 例题4-1 UVa1339 Ancient Cipher
- UVA 1339 Ancient Cipher——快速排序
- Ancient Cipher,NEETC 2004,UVa1339
- UVa_1339 - Ancient Cipher
- UVa 1339 - Ancient Cipher
- UVA 1339 Ancient Cipher(水题)
- UVa 1339 Ancient Cipher(古老的密码)
- Ancient Cipher UVA-1339
- UVA 1339 Ancient Cipher
- UVa1339 Ancient Cipher
- uva 1339 Ancient Cipher(字符串处理)
- UVa 1339 - Ancient Cipher
- UVA 1339 - Ancient Cipher
- UVA 1339 - Ancient Cipher
- UVa 1339 - Ancient Cipher
- K - Ancient Cipher UVA - 1339
- uva_1339_Ancient Cipher
- UVA - 1339 - Ancient Cipher
- UVA1339-Ancient Cipher
- UVA 1339 Ancient Cipher(映射 | 想法)