牛客网 bitset用法

链接： https://www.nowcoder.com/acm/contest/132/C

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<bitset> 
#define mem(a,x) memset(a,x,sizeof(a));
#define s1(x) scanf("%d",&x);
#define s2(x,y) scanf("%d%d",&x,&y);
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z);
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k);
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const ll inf = 0x3f3f3f3f;
/*void dis(int a[], int n){
	printf("总数为%d个\n",n); 
	for(int i = 0; i < n; i++) 	cout<<a[i]<<", ";
	cout<<endl<<"------------------"<<endl;		
}*/

const int mx = 1e6+10;
bitset<mx>te,ans;
int n,l,r;

int main(){
	//int T=10;
	//scanf("%d",&T);
	s1(n);
	ans.reset();
	ans[0] = 1;
	for(int i = 0; i < n; i++){
		s2(l,r);
		te.reset();
		for(int i = l; i <= r; i++){
			te |= ans<<(i*i); 
		} 
		ans = te;
	}
	cout<<ans.count()<<endl;
	return 0;
}