CodeForces - 69A

最新推荐文章于 2021-09-13 18:18:22 发布

weixin_44003830

最新推荐文章于 2021-09-13 18:18:22 发布

阅读量295

点赞数

本文链接：https://blog.csdn.net/weixin_44003830/article/details/86585738

版权

A guy named Vasya attends the final grade of a high school. One day Vasya decided to watch a match of his favorite hockey team. And, as the boy loves hockey very much, even more than physics, he forgot to do the homework. Specifically, he forgot to complete his physics tasks. Next day the teacher got very angry at Vasya and decided to teach him a lesson. He gave the lazy student a seemingly easy task: You are given an idle body in space and the forces that affect it. The body can be considered as a material point with coordinates (0; 0; 0). Vasya had only to answer whether it is in equilibrium. “Piece of cake” — thought Vasya, we need only to check if the sum of all vectors is equal to 0. So, Vasya began to solve the problem. But later it turned out that there can be lots and lots of these forces, and Vasya can not cope without your help. Help him. Write a program that determines whether a body is idle or is moving by the given vectors of forces.

    Input
    The first line contains a positive integer n (1 ≤ n ≤ 100), then follow n lines containing three integers each: the xi coordinate, the yi coordinate and the zi coordinate of the force vector, applied to the body ( - 100 ≤ xi, yi, zi ≤ 100).

    Output
    Print the word "YES" if the body is in equilibrium, or the word "NO" if it is not.

    Examples

Input

3
4 1 7
-2 4 -1
1 -5 -3

Output

Input

3
3 -1 7
-5 2 -4
2 -1 -3

Output

YES

问题简述：输入n，每次输入x,y,z三个数（代表三个方向的力），一共输入n次。
将每次的x,y,z对应相加。通过最终结果判断物体的状态。
问题思路: 用一次循环将每次输入的X,Y,Z分别加起来得到x1,y1,z1。判断x1,y1,z1是否全为零
AC代码如下：

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
 int n;
 scanf_s("%d", &n);
 int x1 = 0, y1 = 0, z1 = 0;
 while (n--)
 {
  int x, y, z;
  scanf_s("%d %d %d", &x, &y, &z);
  x1 += x;
  y1 += y;
  z1 += z;
 }
 if (x1 == 0 && y1 == 0 && z1 == 0)
  printf("YES");
 else
  printf("NO");
 return 0;
}