51nod 1182 完美字符串
2017-03-28 20:41
288 查看
//@auther zhou
//@Number 201408070203
//@start time:
//@finish time:
/*@此处注意:
*/
/* 测试数据
*/
#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
string qaq;
cin>>qaq;
int zzz[27];
memset(zzz,0,sizeof(zzz));
for(int i=0;i<qaq.length();i++){
if(qaq[i]>='a'&qaq[i]<='z'){
//cout<<"little"<<endl;
zzz[(qaq[i]-'a')+1]++;
}
if(qaq[i]>='A'&qaq[i]<='Z'){
//cout<<"big"<<endl;
zzz[qaq[i]-'A'+1]++;
}
}
vector<int> ans;
for(int i=1;i<27;i++){
ans.push_back(zzz[i]);
}
sort(ans.begin(),ans.end());
// for(int i=0;i<ans.size();i++){
// cout<<ans[i]<<endl;
// }
int times=26;
int answer=0;
for(int i=ans.size()-1;i>0;i--){
if(ans[i]){
answer+=times*ans[i];
times--;
}
}
cout<<answer;
return 0;
}
//@Number 201408070203
//@start time:
//@finish time:
/*@此处注意:
*/
/* 测试数据
*/
#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
string qaq;
cin>>qaq;
int zzz[27];
memset(zzz,0,sizeof(zzz));
for(int i=0;i<qaq.length();i++){
if(qaq[i]>='a'&qaq[i]<='z'){
//cout<<"little"<<endl;
zzz[(qaq[i]-'a')+1]++;
}
if(qaq[i]>='A'&qaq[i]<='Z'){
//cout<<"big"<<endl;
zzz[qaq[i]-'A'+1]++;
}
}
vector<int> ans;
for(int i=1;i<27;i++){
ans.push_back(zzz[i]);
}
sort(ans.begin(),ans.end());
// for(int i=0;i<ans.size();i++){
// cout<<ans[i]<<endl;
// }
int times=26;
int answer=0;
for(int i=ans.size()-1;i>0;i--){
if(ans[i]){
answer+=times*ans[i];
times--;
}
}
cout<<answer;
return 0;
}
相关文章推荐
- 51Nod - 1182 完美字符串
- 51Nod一级算法题-1182-完美字符串(贪心)
- 51nod 1182 完美字符串 (贪心,水题)
- 51Nod - 1182 完美字符串
- 51nod 1182 完美字符串(贪心)
- 51nod 1182 完美字符串
- 51nod 1182 完美字符串
- 51NOD 1182 完美字符串
- 【51Nod】1182 完美字符串
- 51nod 1182 完美字符串
- 51Nod 1182 完美字符串
- 【51Nod】1182 - 完美字符串(贪心)
- 51nod 1182 完美字符串【贪心】
- 51Nod 1182 完美字符串
- 51Nod-1182 完美字符串【排序+字符统计】
- 51Nod 1182 完美字符串
- 51nod 1182 完美字符串
- 51Nod 1182 完美字符串
- 51nod 1182完美字符串
- 51nod 1182 完美字符串