讀入scanf，%d和%lld問題

最新推荐文章于 2021-09-24 18:49:02 发布

xyinktw

最新推荐文章于 2021-09-24 18:49:02 发布

阅读量1.8k

点赞数

分类专栏：疑難雜症

本文链接：https://blog.csdn.net/xyinktw/article/details/46663959

版权

博客讨论了在不同在线编程平台上使用scanf读取整数时，使用%d和%lld格式化字符串可能导致不同结果的问题。文章以poj_2689和uva_10140的Prime Distance题目为例，介绍了寻找相邻质数的算法，并给出了输入输出示例。

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

在做一道題目時，用不同的格式化字符讀入在不同的OJ上會有不同的結果。
poj_2689/ uva_10140 Prime Distance
poj題目鏈接：http://poj.org/problem?id=2689
題目：
Description

The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of primality. A prime number is a number that is has no proper factors (it is only evenly divisible by 1 and itself). The first prime numbers are 2,3,5,7 but they quickly become less frequent. One of the interesting questions is how dense they are in various ranges. Adjacent primes are two numbers that are both primes, but there are no other prime numbers between the adjacent primes. For example, 2,3 are the only adjacent primes that are also adjacent numbers.
Your program is given 2 numbers: L and U (1<=L< U<=2,147,483,647), and you are to find the two adjacent primes C1 and C2 (L<=C1< C2<=U) that are closest (i.e. C2-C1 is the minimum). If there are other pairs that are the same distance apart, use the first pair. You are also to find the two adjacent primes D1 and D2 (L<=D1< D2<=U) where D1 and D2 are as distant from each other as possible (again choosing the first pair if there is a tie).
Input

Each line of input will contain two positive integers, L and U, with L < U. T