Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Origin of Lorem Ipsum pt5

    Uploaded by

    oiuoiuoiu
    The init() function initializes an array p to store prime numbers below N. It marks all numbers as prime, except 0 and 1. It then uses the Sieve of Eratosthenes algorithm to iteratively mark composite numbers as non-prime by multiplying primes and adding them. Finally, it stores actual prime numbers in a vector primes for numbers between 1000 and N. The solve() function calls init(), then iterates through primes to find Pythagorean triplets where the numbers are also a palindrome in base 10. It prints any triplets found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Origin of Lorem Ipsum pt5

    Uploaded by

    oiuoiuoiu
    5 views1 page
    The init() function initializes an array p to store prime numbers below N. It marks all numbers as prime, except 0 and 1. It then uses the Sieve of Eratosthenes algorithm to iteratively mark composite numbers as non-prime by multiplying primes and adding them. Finally, it stores actual prime numbers in a vector primes for numbers between 1000 and N. The solve() function calls init(), then iterates through primes to find Pythagorean triplets where the numbers are also a palindrome in base 10. It prints any triplets found.

    Original Description:

    Original Title

    Origin of lorem ipsum pt5

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The init() function initializes an array p to store prime numbers below N. It marks all numbers as prime, except 0 and 1. It then uses the Sieve of Eratosthenes algorithm to iteratively mark composite numbers as non-prime by multiplying primes and adding them. Finally, it stores actual prime numbers in a vector primes for numbers between 1000 and N. The solve() function calls init(), then iterates through primes to find Pythagorean triplets where the numbers are also a palindrome in base 10. It prints any triplets found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    5 views1 page

    Origin of Lorem Ipsum pt5

    Uploaded by

    oiuoiuoiu
    The init() function initializes an array p to store prime numbers below N. It marks all numbers as prime, except 0 and 1. It then uses the Sieve of Eratosthenes algorithm to iteratively mark composite numbers as non-prime by multiplying primes and adding them. Finally, it stores actual prime numbers in a vector primes for numbers between 1000 and N. The solve() function calls init(), then iterates through primes to find Pythagorean triplets where the numbers are also a palindrome in base 10. It prints any triplets found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    void init() {

    memset(p,true,sizeof(p));
    p[0] = p[1] = false;
    for(int i = 2; i*i < N; i++) {
    if(p[i]) {
    for(int j = i*i; j < N; j += i) {
    p[j] = false;
    }
    }
    }
    for(int i = 1000; i < N; i++) {
    if(p[i]) {
    primes.pb(i);
    }
    }
    }

    void solve() {
    init();

    int n = (int)primes.size();
    for(int i = 0; i < n; i++) {
    for(int j = i+1; j < n; j++) {
    int a = primes[i];
    int b = primes[j];
    int c = 2*b-a;
    int inst = c;
    if(c < N && p[c]) {
    vector<ll> v(3,0);
    for(int k = 0; k < 4; k++) {
    v[0] += pow(10,(a%10));
    v[1] += pow(10,(b%10));
    v[2] += pow(10,(c%10));
    a /= 10; b /= 10; c /= 10;
    }
    if(v[0] == v[1] && v[1] == v[2] && primes[j] - primes[i] == 3330) {
    cout << primes[i] << " " << primes[j] << " " << inst << "\n";
    }

    }
    }
    }

    You might also like