0分全PLE求调

#include <iostream>
#include <cmath>
using namespace std;
int main(){
	int all;
	int tianshu,shifou,uncishu;
	int num=0;
	cin>>all;
	for (int i=0;i<=all;i++){
		cin>>shifou;
		if (shifou==1){
			tianshu+1;
			if (tianshu>=1,tianshu<3){
				num+1;
			}
			if (tianshu>=3,tianshu<7){
				num+2;
			}
			if (tianshu>=7,tianshu<30){
				num+3;
			}
			if (tianshu>=30,tianshu<120){
				num+4;
			}
			if (tianshu>=120,tianshu<365){
				num+5;
			}
			if (tianshu>=365){
				num+6;
			}
		}
		if (shifou==0){
			uncishu++;
			tianshu-pow(2,uncishu-1);
		}
	} 
	cout<<num;
	return 0;
}