第二个星期的简单问题（一）.pptVIP

第二讲;简单计算题;题目内容 已知正方形的边长，试编程求出其面积。 输入描述 输入不超过50个正整数的数据n (1=n=10000)，每个正整数间以空格隔开。 输出描述 每次读入一个正整数，便输出其正方形的面积数，输出每个面积后再回车。 ;;初学者很常见的一种写法：;有什么问题呢？;第一部分;输入_第一类：;;说明：;例如：;参考源代码;本类输入解决方案：;读入两个参数;;参考源代码;输入_第二类：;Problem Description Your task is to Calculate a + b. Input Input contains an integer N in the first line, and then N lines follow. Each line consists of a pair of integers a and b, separated by a space, one pair of integers per line. Output For each pair of input integers a and b you should output the sum of a and b in one line, and with one line of output for each line in input.  Sample input: 2 1 5 10 20 Sample output: 6 30;Hdoj_1090源代码：;本类输入解决方案：;输入_第三类：;Problem Description Your task is to Calculate a + b. Input Input contains multiple test cases. Each test case contains a pair of integers a and b, one pair of integers per line. A test case containing 0 0 terminates the input and this test case is not to be processed. Output For each pair of input integers a and b you should output the sum of a and b in one line, and with one line of output for each line in input.  Sample input: 1 5 10 20 0 0 Sample output: 6 30;Hdoj_1091源代码：;本类输入解决方案：;输入_第四类：;本类输入解决方案：;说明：;输出_第一类：;解决方案：;输出_第二类：;1095源代码;解决办法：;第二部分; 最小公倍数 ;Problem Description 求两个正整数的最小公倍数。 Input 输入数据含有不多于50对的数据，每对数据由两个正整数(0n1,n2100000)组成。  Output 对于每组数据n1和n1，计算最小公倍数，每个计算结果应占单独一行。 ;;题目分析;#includeiostream.h int gcd(int int) ； Int main() { int x,y; while(cinxy) { coutx/gcd(x,y)*yend1; } return 0; } ;欧几里德算法;1021 Fibonacci Again ;Problem Description There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n=2). Input Input consists of a sequence of lines, each containing an integer n. (n 1,000,000). Output Print the word yes if 3 divide evenly into F(n). Print the word no if not.;;题目分析：;Hdoj_1021程序清单：;POJ