# 标签存档: Fortran

## 1112. Number Steps

Time Limit: 2s Source limit: 50000B

### Description

Starting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,… as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1), (2,0), and (3, 1) respectively and this pattern has continued.

You are to write a program that reads the coordinates of a point (x, y), and writes the number (if any) that has been written at that point. (x, y) coordinates in the input are in the range 0…10000.

### Input

The first line of the input is N, the number of test cases for this problem. In each of the N following lines, there is x, and y representing the coordinates (x, y) of a point.

### Output

For each point in the input, write the number written at that point or write No Number if there is none.

### Sample Input

3
4 2
6 6
3 4

### Sample Output

6
12
No Number

Continue

## 42. Adding Reversed Numbers

Time Limit: 5s Source limit: 50000B

### Description

The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfigure some tragedies into comedies. Obviously, this work is very hard because the basic sense of the play must be kept intact, although all the things change to their opposites. For example the numbers: if any number appears in the tragedy, it must be converted to its reversed form before being accepted into the comedy play.
Reversed number is a number written in arabic numerals but the order of digits is reversed. The first digit becomes last and vice versa. For example, if the main hero had 1245 strawberries in the tragedy, he has 5421 of them now. Note that all the leading zeros are omitted. That means if the number ends with a zero, the zero is lost by reversing (e.g. 1200 gives 21). Also note that the reversed number never has any trailing zeros.
ACM needs to calculate with reversed numbers. Your task is to add two reversed numbers and output their reversed sum. Of course, the result is not unique because any particular number is a reversed form of several numbers (e.g. 21 could be 12, 120 or 1200 before reversing). Thus we must assume that no zeros were lost by reversing (e.g. assume that the original number was 12).

### Input

The input consists of N cases (equal to about 10000). The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly one line with two positive integers separated by space. These are the reversed numbers you are to add.

### Output

For each case, print exactly one line containing only one integer – the reversed sum of two reversed numbers. Omit any leading zeros in the output.

### Sample Input

5 5
3
24 1
4358 754
305 794

### Sample Output

34
1998
1

Continue

## 2. Prime Generator

Time Limit: 6s Source limit: 50000B

### Description

Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate all prime numbers between two given numbers!

### Input

The input begins with the number t of test cases in a single line (t<=10). In each of the next t lines there are two numbers m and n (1 <= m <= n <= 1000000000, n-m<=100000) separated by a space.

### Output

For every test case print all prime numbers p such that m <= p <= n, one number per line, test cases separated by an empty line.

### Sample Input

5 5
2
1 10
3 5

### Sample Output

2
3
5
7
3
5

Continue

## 福州大学至诚学院2008级《Fortran 90 程序设计教程》部分习题参考答案

### 2010年11月25日修订

!第29页第7题
program main
real c,f
f=9*c/5+32
write(*,100) f
100 format(1x,f7.3)
end

!第29页第8题第1小题
program main
integer a,b,c
real average
average=(a+b+c)*1.0/3
write(*,100) average
100 format(1x,f7.3)
end

!第29页第8题第2小题
program main
real x,y,ans