Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- void cambiarBit(int A[], int k)
- {
- int i = k/32;
- int pos = k%32;
- A[i] = A[i]-(pow(2, pos));
- }
- void criba(int n)
- {
- ofstream primos("primos.txt");
- char prime[n+1];
- memset(prime, '1', sizeof(prime));
- for (int p=3; p*p<=n; p=p+2)
- {
- if (prime[p] == '1')
- {
- for (int i=p*2; i<=n; i += p)
- prime[i] = '0';
- }
- }
- for (int p=2; p<=n; p++)
- if (prime[p])
- primos << p << " ";
- }
- int main()
- {
- int n;
- cin>>n;
- criba(n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement