1120. Friend Numbers (20)解题报告
2017-01-01 09:04
330 查看
利用哈希表记录朋友号。
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
int friendid(int num);
int main(void)
{
int tmp, i, cnt, n, first;
bool arr[100] = { false };
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &tmp);
arr[friendid(tmp)] = true;
}
cnt = 0;
for (i = 0; i < 100; i++) {
if (arr[i]) {
first = (cnt ? first : i);
cnt++;
}
}
printf("%d\n", cnt);
printf("%d", first);
for (i = first + 1; i < 100; i++) {
if (arr[i]) {
printf(" %d", i);
}
}
putchar('\n');
return 0;
}
int friendid(int num){
int id = 0;
while (num) {
id += num % 10;
num /= 10;
}
return id;
}
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
int friendid(int num);
int main(void)
{
int tmp, i, cnt, n, first;
bool arr[100] = { false };
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &tmp);
arr[friendid(tmp)] = true;
}
cnt = 0;
for (i = 0; i < 100; i++) {
if (arr[i]) {
first = (cnt ? first : i);
cnt++;
}
}
printf("%d\n", cnt);
printf("%d", first);
for (i = first + 1; i < 100; i++) {
if (arr[i]) {
printf(" %d", i);
}
}
putchar('\n');
return 0;
}
int friendid(int num){
int id = 0;
while (num) {
id += num % 10;
num /= 10;
}
return id;
}
相关文章推荐
- PAT甲级 1120. Friend Numbers (20)
- PAT (Basic Level) Practise (中文)1067. 试密码(20) 解题报告
- PAT (Advanced Level)1120. Friend Numbers (20)
- 1084. Broken Keyboard (20)解题报告
- PAT - 甲级 - 1120. Friend Numbers (20)
- 1116. Come on! Let's C (20)解题报告
- [leetcode] 20. Valid Parentheses 解题报告
- 1073. Scientific Notation (20)解题报告
- PAT (Advanced Level) 1001. A+B Format (20) 解题报告
- PAT (Advanced Level) 1035. Password (20) 解题报告
- 【PAT】【Advanced Level】1120. Friend Numbers (20)
- 1054. The Dominant Color (20)解题报告
- 1081. Rational Sum (20)解题报告
- 1092. To Buy or Not to Buy (20)解题报告
- 1100. Mars Numbers (20)解题报告
- leetcode解题报告(20):Rotate Array
- 【解题报告】Educational Codeforces Round 20
- 1120. Friend Numbers (20)
- PAT (Advanced Level) Practise 1120 Friend Numbers (20)
- BestCoder20 1002.lines (hdu 5124) 解题报告