PAT A1120 friend numbers (20)
来源:互联网 发布:淘宝双十二承接页装修 编辑:程序博客网 时间:2024/06/08 00:23
#include<cstdio>
#include<vector>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
struct node{
string number;
int friendId;
};
vector<node> num;
int getfriend(string number){
int len=number.size();
int i,sum=0;
for(i=0;i<len;i++){
sum+=(number[i]-'0');
}
return sum;
}
int cmp(node a,node b){
return a.friendId<b.friendId ;
}
int main(){
int n,i;
scanf("%d",&n);
char temp[6];
for(i=0;i<n;i++){
node Node;
scanf("%s",temp);
Node.number=temp;
Node.friendId=getfriend(temp);
num.push_back(Node);
}
sort(num.begin(),num.end(),cmp);
int k=1;
for(i=1;i<n;i++){
if(num[i].friendId!=num[i-1].friendId) k++;
}
printf("%d\n",k);
printf("%d",num[0].friendId);
for(i=1;i<n;i++){
if(num[i].friendId!=num[i-1].friendId){
printf(" %d",num[i].friendId);
}
}
system("pause");
return 0;
}
#include<vector>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
struct node{
string number;
int friendId;
};
vector<node> num;
int getfriend(string number){
int len=number.size();
int i,sum=0;
for(i=0;i<len;i++){
sum+=(number[i]-'0');
}
return sum;
}
int cmp(node a,node b){
return a.friendId<b.friendId ;
}
int main(){
int n,i;
scanf("%d",&n);
char temp[6];
for(i=0;i<n;i++){
node Node;
scanf("%s",temp);
Node.number=temp;
Node.friendId=getfriend(temp);
num.push_back(Node);
}
sort(num.begin(),num.end(),cmp);
int k=1;
for(i=1;i<n;i++){
if(num[i].friendId!=num[i-1].friendId) k++;
}
printf("%d\n",k);
printf("%d",num[0].friendId);
for(i=1;i<n;i++){
if(num[i].friendId!=num[i-1].friendId){
printf(" %d",num[i].friendId);
}
}
system("pause");
return 0;
}
0 0
- PAT A1120 friend numbers (20)
- PAT A1120. Friend Numbers (20)
- PAT A1120. Friend Numbers
- A1120. Friend Numbers (20)
- A1120. Friend Numbers (20)
- PAT--1120. Friend Numbers (20)
- PAT - 甲级 - 1120. Friend Numbers (20)
- PAT(A)- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20) PAT 甲级
- PAT甲级 1120. Friend Numbers (20)
- 【PAT】【Advanced Level】1120. Friend Numbers (20)
- PAT 甲级 1120. Friend Numbers (20)
- 【PAT】1120. Friend Numbers
- pat 1120. Friend Numbers
- PAT-A1120
- 1120. Friend Numbers (20)-PAT甲级真题
- PAT (Advanced Level) Practise 1120Friend Numbers (20)
- 1120. Friend Numbers (20)-PAT甲级真题
- 不错的sql
- Retrofit2.0的使用详解
- opstack-neutron 安全组 博主其他文章也不错
- QinScan
- CI(1)Windows下CI的配置部署
- PAT A1120 friend numbers (20)
- 支持向量机通俗导论(理解SVM的三层境界)(3)以及参考文献
- Ubuntu12.04如何修改窗口背景色为眼睛保护色来保护眼睛,强力推荐!!
- 05.计算属性
- 实战项目商城(第一天)
- mysql的1093错误You can't specify target table 't' for update in FROM clause 简单解决
- TabLayout使用setupWithViewPager()方法绑定Viewpager后不显示文字
- Mysql开发—— 事务
- 如何在centOS等一些linux系统下安装oracle sqldeveloper图形化数据库操作界面