-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA.cpp
52 lines (39 loc) · 894 Bytes
/
A.cpp
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/*****
* __Bismillahir Rahmanir Rahim__
* American International University Bangladesh (AIUB)
* Hadiur Rahman Nabil
*****/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
ll n,a,b,c,k=0,s1=0,s2=0,s3=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a>>b>>c;
s1+=a;
s2+=b;
s3+=c;
}
if(s1==0 && s2==0 && s3==0)
{
cout<<"YES\n";
}
else
{
cout<<"NO\n";
}
}
int main()
{
int t=1;
//cin>>t
while(t--)
{
solve();
}
//cout<<
return 0;
}