简单计算题一.ppt
《简单计算题一.ppt》由会员分享,可在线阅读,更多相关《简单计算题一.ppt(42页珍藏版)》请在三一文库上搜索。
1、第二讲,简单计算题(一),ACM算法与程序设计,简单计算题,主要目的:通过编写一些简单计算题的程序焘悉CC+语言的基本语法 基本思想:解决简单的计算问题的基本过程包括将一个用自然语言描述的实际问题抽象成一个计算问题给出计算过程继而编程实现计算过程,并将计算结果还原成对原来问题的解答。这里首要的是读懂问题接清输入和输出数据的含义及给出的格式并且通过输入输出样例验证自己的理解是否正确。,最小公倍数,http:/ http:/ Description 求两个正整数的最小公倍数。 Input 输入数据含有不多于50对的数据,每对数据由两个正整数(0n1,n2100000)组成。 Output 对于每组
2、数据n1和n1,计算最小公倍数,每个计算结果应占单独一行。,Sample input: 6 5 18 12 Sample output: 30 36,题目分析,最小公倍数等于两数之积除以最大公约数 利用辗转相除法求最大公约数。,欧几里德算法,只要两数不相等,就反复用 大数减小数,直到相等为止, 此相等的数就是两数的最大公 约数。,int gcd(int x,int y) while (x!=y) if (xy) x=x-y; else y=y-x; return x; ,#include int gcd(int int) ; Int main() int x,y; while(cinxy) c
3、outx/gcd(x,y)*yend1; return 0; ,int gcd(int a,int b)return !b?a:gcd(b,a%b);,POJ 2750 鸡兔同笼,http:/ Description 一个笼子里面关了鸡和兔子(鸡有2只脚,兔子有4只脚,没有例外)。已经知道了笼子里面脚的总数a,问笼子里面至少有多少只动物,至多有多少只动物。 Input 第1行是测试数据的组数n,后面跟着n行输入。每组测试数据占1行,每行一个正整数a (a 32768)。 Output 输出包含n行,每行对应一个输入,包含两个正整数,第一个是最少的动物数,第二个是最多的动物数,两个正整数用一个空
4、格分开 如果没有满足要求的答案,则输出两个0。,Sample input: 2 3 20 Sample output: 0 0 5 10,#include void main() int nCases,I,nFeet; /InCases表示输入测试数据的组 数,nFeet表示输入的脚数 scanf(“%d”, ,The Story of ZCS,1、Link http:/222.197.181.37/ShowProblem.aspx?ProblemID=1088 2、Description Love and Eternal lay hid in night; God said “Let CS
5、be“ and all was light. Walking alone in darkness, lonely and never knew what I would go through. How many times I walked lonely in the campus, how many times I woke up with a start at midnight, and how many times I sang a sorrow song but no one cared about? The terrible feeling is just like a albatr
6、oss around my neck until I met CS. My door is opened and the sky is lightened.It is a moment for my renaissance, which makes me understand the meaning of sunshine and rainbow once again. When I catch sight of you, you are the only one in my view. When you are out of sight, you are the only one in my
7、 heart. When I am awake, you are the only one in my mind. When I am asleep, you are the only one in my dream. You are my only one.I want to catch sight of you every minute and every second. - Letter from Kamel (ZS) to CS,The Story of ZCS,Kamel has lots of photos of CS. He wants to fill his desktop w
8、ith her photos. The desktop is made up of m rows and n columns. One photo occupies b consecutive squares in a row or b consecutive squares in a column. He want to know want to know whether it is possible to cover his desktop with CSs photos while no two photos overlap with each other and the whole d
9、esktop is full? You may assume that Kamel has tens of thousands of photos of CS. If it is possible then print “YES“ else print “NO“.,The Story of ZCS,3、Input The first line of the inputs is T(no more than 120), which stands for the number of test cases you need to solve. Each line has three numbers
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 简单 算题
链接地址:https://www.31doc.com/p-3176982.html