-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbeecrowd1074.cpp
More file actions
33 lines (33 loc) · 893 Bytes
/
beecrowd1074.cpp
File metadata and controls
33 lines (33 loc) · 893 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/**
* @file beecrowd1074.cpp
* see the problem - https://prnt.sc/hOMrJe_fm2yT
* @author Md. Alamin (alamin5g@yahoo.com)
* I would love be a software engineer at Google. That is why anybody can uses this code without any condition, if you face any difficulty, then try to email me.
* @version 0.1
* @date 2022-06-30
*
* @copyright Copyright (c) 2022
*
*/
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
int n;
cin >> n;
if(n%2==0 && n<0){
cout << "EVEN NEGATIVE" << endl;
}else if(n%2==0 && n>0){
cout << "EVEN POSITIVE" << endl;
}else if(n%2!=0 && n<0){
cout << "ODD NEGATIVE" << endl;
}else if(n%2!=0 && n>0){
cout << "ODD POSITIVE" << endl;
}else if(n==0){
cout << "NULL" << endl;
}
}
return 0;
}