Here’s the (incomplete) code to find some prime numbers.

```
#include<iostream>
#include<bitset>
#include<cmath>
#define SQRT_10_POW_12 1000000llu
#define _10_POW_12_BY_2 1000000000000llu/2llu
using namespace std;
int main()
{
unsigned int T;
unsigned long long n;
register unsigned int it1,it2;
bitset<SQRT_10_POW_12+1llu> isprime;
bitset<_10_POW_12_BY_2+1llu> nums;
return 0;
}
…
```

35 more words