组合三位数

最新推荐文章于 2024-10-31 21:11:13 发布

ainuliba

最新推荐文章于 2024-10-31 21:11:13 发布

阅读量44

点赞数

文章标签： c语言

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/ainuliba/article/details/132782605

版权

该篇文章介绍了一个编程问题，要求将0到9的数字分为三个三位数，第一个数是第二个数的一半，第三个数是第一个数的三倍。文章提供了一个C语言程序来解决此问题，通过计算并检查数组元素找到符合条件的组合。

摘要由CSDN通过智能技术生成

题目内容：

将0到9这十个数字分成三个3位数，要求第一个3位数，正好是第二个3位数的1/2，是第三个3位数的1/3。问应当怎样分，编写程序实现。

输入格式: 无

输出格式：“%d,%d,%d\n” （注意：输出的顺序为第一个3位数，第二个3位数，第三个3位数）

#include<stdio.h>
int main(){
    for(int num=102;num<333;num++){
        int num1=num*2, num2=num*3;
        int n[10]={};
        n[num%10]++;n[num1%10]++;n[num2%10]++;
        n[num/10%10]++;n[num1/10%10]++;n[num2/10%10]++;
        n[num/100%10]++;n[num1/100%10]++;n[num2/100%10]++;
        int tmp;
        for(tmp=0;tmp<10;tmp++)
            if(n[tmp]>1)
                break;
        if(tmp==10)
            printf("%d,%d,%d\n",num,num1,num2);
    }
    return 0;
}

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫

ainuliba CSDN认证博客专家 CSDN认证企业博客

码龄5年

53: 原创

74万+: 周排名

18万+: 总排名

2万+: 访问

: 等级

696: 积分

112: 粉丝

140: 获赞

8: 评论

243: 收藏

私信

关注

热门文章

最新评论

C语言扫雷游戏
2301_80473990: #include <iostream> using namespace std; struct node { int data; struct node* link; }; int main() { struct node* p, * q; int m, n = 1; q = NULL; cout << "输入第" << n++ << "个整数："; cin >> m; while (m != 999) { p = new node; p->data = m; p->link = q; q = p; cout << "输入第" << n++ << "个整数："; cin >> m; } n -= 2; while (n > 0) { cout << "第" << n-- << "个整数：" << q->data << endl; q = q->link; } return 0; }
C语言扫雷游戏
2301_80473990: #include<iostream> #include<cstring> using namespace std; struct node { char data; node* next; }; node* create(char* str) { node* head = nullptr; node* tail = nullptr; int len = strlen(str); for (int i = 0; i < len; i++) { node* newNode = new node; newNode->data = str[i]; newNode->next = nullptr; if (head == nullptr) { head = newNode; tail = newNode; } else { tail->next = newNode; tail = newNode; } } return head; } int search(node* head, char ch, int a[]) { int count = 0; int index = 0; while (head != nullptr) { if (head->data == ch) { count++; a[index] = index + 1; index++; } head = head->next; index++; } return count; } int main() { node* head = nullptr; char str[100]; char ch; int a[100]; int n; cout << "请输入一行字符串: "; cin.getline(str, 100); head = create(str); cout << "请输入一个字符: "; cin >> ch; n = search(head, ch, a); if (n == 0) { cout << ch << "未出现在字符串" << str << "中。" << endl; } else { cout << ch << "出现在字符串" << str << "的第"; for (int i = 0; i < n; i++) { cout << a[i]; if (i != n - 1) cout << ","; } cout << "个位置处。" << endl; } return 0; }
C语言扫雷游戏
2301_80473990: #include <iostream> using namespace std; struct student { int stuID; string name; int age; double cppScore; double mathScore; double engScore; double totalScore; student* next; }; student* creat() { student* head = nullptr; student* tail = nullptr; int stuID; string name; int age; double cppScore; double mathScore; double engScore; double totalScore; cout << "输入结点数据－学号、姓名、年龄、C++、数学、英语成绩（以-1结束输入）： " << endl; while (true) { cin >> stuID; if (stuID == -1) break; cin >> name >> age >> cppScore >> mathScore >> engScore; student* newStudent = new student; newStudent->stuID = stuID; newStudent->name = name; newStudent->age = age; newStudent->cppScore = cppScore; newStudent->mathScore = mathScore; newStudent->engScore = engScore; newStudent->totalScore = cppScore + mathScore + engScore; newStudent->next = nullptr; if (head == nullptr) { head = newStudent; tail = newStudent; } else { tail->next = newStudent; tail = newStudent; } } return head; } void print(student* head) { cout << "链表上各节点值为：" << endl; while (head != nullptr) { cout << "学号：" << head->stuID << endl; cout << "姓名：" << head->name << endl; cout << "年龄：" << head->age << endl; cout << "C++成绩：" << head->cppScore << endl; cout << "数学成绩：" << head->mathScore << endl; cout << "英语成绩：" << head->engScore << endl; cout << "总分：" << head->totalScore << endl; cout << "------------------" << endl; head = head->next; } } void max1(student* head) { student* maxStudent = nullptr; double maxScore = 0.0; while (head != nullptr) { if (head->totalScore > maxScore) { maxScore = head->totalScore; maxStudent = head; } head = head->next; } cout << "总分最高的同学是：" << endl; cout << "学号：" << maxStudent->stuID << endl; cout << "姓名：" << maxStudent->name << endl; cout << "年龄：" << maxStudent->age << endl; cout << "C++成绩：" << maxStudent->cppScore << endl; cout << "数学成绩：" << maxStudent->mathScore << endl; cout << "英语成绩：" << maxStudent->engScore << endl; cout << "总分：" << maxStudent->totalScore << endl; } void free(student* head) { while (head != nullptr) { student* temp = head; head = head->next; delete temp; } } int main() { student* head; head = creat(); print(head); max1(head); free(head); return 0; }
C语言扫雷游戏
南筏458: 这个好
L1-018 大笨钟
手法king: 好耶，写的挺好的，要是代码注释多一点就更好了，支持博主

大家在看

最新文章

目录

评论

被折叠的条评论为什么被折叠?

到【灌水乐园】发言

查看更多评论

添加红包

成就一亿技术人!

hope_wisdom

发出的红包

实付元

使用余额支付

点击重新获取

扫码支付

钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。