Timus Problem 1086 Solution

Timus Problem Solution

Timus Problem 1086 Solution

#include <iostream>

#include <stdio.h>

using namespace std;

bool flag[20000005];

int primes[20000005];

int cnt;



void sieve(int n)

{

cnt=0;

primes[cnt++] = 2;

for(int i=3; i<=n; i+=2)

{

if(flag[i] == 0)

{

primes[cnt++] = i;

if(i <= n/i)

{

for(int j=i*i; j<=n; j+=i*2)

flag[j] = 1;

}

}

}



return ;

}

int main()

{

    sieve(17000);

    int num,tc;

    scanf("%d",&tc);

    while(tc--)

    {

        scanf("%d",&num);

        printf("%d\n",primes[num-1]);

    }

    return 0;

}

 

0 Comments

You may find interest following article

Complete Guide: Create Laravel Project in Docker Without Local Dependencies

, , , | 0 Comments

Create Laravel Project Through Docker — No Need to Install PHP, MySQL, or Apache on Your Local Machine In this tutorial, I’ll show you how to create and run a full Laravel project using Docker containers. That means you won’t have to install PHP, MySQL, or Apache locally on your computer. By the end of this guide, you’ll have a fully functional Laravel development...