Leetcode 611. Valid Triangle Number O(nlogn) NTT

vector<unsigned> rev=[]() {
   
	vector<unsigned> Rev(2048,0);
	for(int i=0; i<2048; i++) Rev[i]=(Rev[i>>1]>>1)|((i&1)<<(10));
	return Rev;
}();

class Solution {
   
public:
	typedef unsigned long long u64;
	static const u64 MOD=1004535809,MOD2=MOD*MOD;
	u64 fastpow(u64 a, u64 k) {
   
		u64 base = 1;
		while(k) {
   
			if(k & 1) base = (base * a ) % MOD;
			a = (a * a) % MOD;
			k >>= 1;
		}
		return base % MOD<