PAT A1120 friend numbers (20)
2017-03-03 10:36
274 查看
#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; }
相关文章推荐
- PAT--1120. Friend Numbers (20)
- 1120. Friend Numbers (20) 统计友元
- 1120. Friend Numbers (20)-PAT甲级真题
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- PAT_A 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)-PAT甲级真题
- 1120. Friend Numbers (20)解题报告
- PAT - 甲级 - 1120. Friend Numbers (20)
- PAT甲级 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- PAT (Advanced Level)1120. Friend Numbers (20)
- PAT(A)- 1120. Friend Numbers (20)
- 【PAT】【Advanced Level】1120. Friend Numbers (20)
- PAT甲题题解-1120. Friend Numbers (20)-水题
- 1120. Friend Numbers (20)
- PAT 甲级 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)