zoukankan      html  css  js  c++  java
  • Prime Distance

    题目描述

    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).

    输入

    Each line of input will contain two positive integers, L and U, with L < U. The difference between L and U will not exceed 1,000,000.

    输出

    For each L and U, the output will either be the statement that there are no adjacent primes (because there are less than two primes between the two given numbers) or a line giving the two pairs of adjacent primes.

    样例输入

    2 17
    14 17

    样例输出

    2,3 are closest, 7,11 are most distant.
    There are no adjacent primes.
    

      

    #include <bits/stdc++.h>
    
    using namespace std;
    typedef long long ll;
    const  int maxn=500010;
    int vis[1000100],prime[maxn],tot,a[maxn],num,minp,maxp;
    void get_prime() {
        for (int i = 2; i <= 50000; i++) {
            if (!vis[i]) {
                prime[tot++] = i;
            }
            for (int j = 0; j < tot && 1ll*i * prime[j] <= 50000; j++) {
                vis[i * prime[j]] = 1;
                if (i % prime[j] == 0) {
                    break;
                }
            }
        }
    }
    int main() {
        int l, r;
        get_prime();
        while (~scanf("%d%d", &l, &r)) {
            memset(vis, 0, sizeof(vis));
            for (int i = 0; i < tot; i++) {
                int p = prime[i];
                for (ll j = max(p * 2ll, (1ll*l + p - 1) / p * p); j <= r; j += p) {
                    vis[j - l] = 1;
                }
            }
            num = 0;
            for (int i = 0; i <= r - l; i++) {
                if (!vis[i]&&i+l>1) {
                    a[num++] = i+l;
                }
            }
            if (num < 2) {
                printf("There are no adjacent primes.
    ");
                continue;
            }
            minp = 0;
            maxp = 0;
            for (int i = 0; i + 1 < num; i++) {
                int d = a[i + 1] -a[i];
                if (d < a[minp + 1] - a[minp]) minp = i;
                if (d > a[maxp + 1] - a[maxp]) maxp = i;
            }
            printf("%d,%d are closest, %d,%d are most distant.
    ", a[minp], a[minp + 1], a[maxp], a[maxp + 1]);
        }
    }
    

      

  • 相关阅读:
    将某个MySQL库中的UTF8字符列都转成GBK格式
    挺苹果的声音,iPhone 5s的两处进步
    Cookie 路径在本机测试及服务器部署,在浏览器处理方式上的不同
    inner join、left join、right join中where和and的作用
    TIA Portal V12不能添加新的CPU
    Linux下可执行程序调试信息的分离及release程序的调试
    STM32.定时器
    STM32.SPI(25Q16)
    模电之运放篇
    Zigbee学习
  • 原文地址:https://www.cnblogs.com/Accpted/p/11334350.html
Copyright © 2011-2022 走看看