We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e6bd118 commit eb5b514Copy full SHA for eb5b514
CodeWiki/NumberTheory/sieve.cpp
@@ -2,23 +2,23 @@
2
using namespace std;
3
4
#define pb push_back
5
-#define mx 10000007
+#define MaxN 10000007
6
7
typedef long long int ll;
8
9
10
vector<ll>prime;
11
-bool vis[mx]; //mx is define in above of the code;
+bool vis[MaxN]; //MaxN is define in above of the code;
12
void sieve() {
13
- ll x=sqrt((int)mx);
+ ll x=sqrt((int)MaxN);
14
for(ll i=3; i<=x; i+=2) {
15
if(vis[i]==0) {
16
- for(ll j=i*i; j<mx; j+=2*i)
+ for(ll j=i*i; j<MaxN; j+=2*i)
17
vis[j]=1;
18
}
19
20
prime.pb(2);
21
- for(ll i=3; i<mx; i+=2)
+ for(ll i=3; i<MaxN; i+=2)
22
if(vis[i]==0)
23
prime.pb(i);
24
0 commit comments