zoukankan      html  css  js  c++  java
  • acm寒假特辑 1月17日 CodeForces

    B - 2 CodeForces - 69A

    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
    NO
    Input
    3
    3 -1 7
    -5 2 -4
    2 -1 -3
    Output
    YES

    题目大意:受力平衡(向量相加为0)
    思路:x,y,z轴各自相加总和为0;

    //miku saiko
    #include<iostream>
    using namespace std;
    int main()
    {
    	int n, a[105][3], sumx = 0,sumy = 0, sumz = 0;
    	cin >> n;
    	for (int i=0;i<n;i++)
    	{
    		for (int j=0;j<3;j++)
    		{
    			cin >> a[i][j];
    		}
    	}
    	for (int i=0;i<n;i++)
    	{
    		sumx += a[i][0]; sumy += a[i][1]; sumz += a[i][2];
    	}
    	if (sumx == 0 && sumy == 0 && sumz == 0)
    	{
    		cout << "YES" << endl;
    	}
    	else
    		cout << "NO" << endl;
        return 0;
    }
    
  • 相关阅读:
    浅谈P2P
    一串字符的解密
    下载地址解密
    初探DirectX
    本文介绍在VC 6.0中编译和使用OpenSSL的过程
    鱼钩绑线视频
    PKCS cer 证书
    02、创建顶点缓冲
    [原]SSL 开发简述(Delphi)
    [转]Delphi和C++数据类型对照表
  • 原文地址:https://www.cnblogs.com/gidear/p/10433285.html
Copyright © 2011-2022 走看看