Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int Sieve(int N, int K) {
- int[] L = new int[N-1];
- int m = L.length;
- for (int x=2; x<=N; x++) {
- L[x-2]=x;
- }
- for (int x=0; x<m; x++) {
- for (int y=x, T=L[x]; y<m && T!=1; y++) {
- if (L[y]%T==0) {
- K--;
- if (K==0) {
- return L[y];
- }
- L[y]=1;
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement