NEUQ OJ 2022: icebound的账单

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y); memset(x,y,sizeof(x))
#define mv 2147483648+30
using namespace std;
ll gar(ll a,ll b){//最大公约数 
return b==0?a:gar(b,a%b);
} 
int main(){
	int n;
	while(cin>>n){
		int sum1=0,sum2=0,x;
		for(int i=0;i<n;i++){cin>>x;
			if(x>0){
				sum1+=x;
			}
			else{
				sum2+=x;
			}
		}
		if(sum1+sum2>0)cout<<"icebound is happy."<<endl;
		if(sum1+sum2==0)cout<<"icebound is ok."<<endl;
		if(sum1+sum2<0)cout<<"icebound is sad."<<endl;
	}
}