zoukankan      html  css  js  c++  java
  • CodeForces 157A Game Outcome

    A. Game Outcome
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Sherlock Holmes and Dr. Watson played some game on a checkered board n × n in size. During the game they put numbers on the board's squares by some tricky rules we don't know. However, the game is now over and each square of the board contains exactly one number. To understand who has won, they need to count the number of winning squares. To determine if the particular square is winning you should do the following. Calculate the sum of all numbers on the squares that share this column (including the given square) and separately calculate the sum of all numbers on the squares that share this row (including the given square). A square is consideredwinning if the sum of the column numbers is strictly greater than the sum of the row numbers.

    For instance, lets game was ended like is shown in the picture. Then the purple cell is winning, because the sum of its column numbers equals 8 + 3 + 6 + 7 = 24, sum of its row numbers equals 9 + 5 + 3 + 2 = 19, and 24 > 19.

    Input

    The first line contains an integer n (1 ≤ n ≤ 30). Each of the following n lines contain n space-separated integers. The j-th number on the i-th line represents the number on the square that belongs to the j-th column and the i-th row on the board. All number on the board are integers from 1 to 100.

    Output

    Print the single number — the number of the winning squares.

    Examples
    input
    1
    1
    
    output
    0
    
    input
    2
    1 2
    3 4
    
    output
    2
    
    input
    4
    5 7 8 4
    9 5 3 2
    1 6 6 4
    9 5 7 3
    
    output

    6

    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <math.h>
    #include <stdio.h>
    
    using namespace std;
    int r[35];
    int l[35];
    int a[35][35];
    int n;
    int main()
    {
        scanf("%d",&n);
        memset(r,0,sizeof(r));
        memset(l,0,sizeof(l));
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                scanf("%d",&a[i][j]);
    
            }
        }
         for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                r[i]+=a[i][j];
                l[i]+=a[j][i];
            }
        }
        int num=0;
        for(int i=1;i<=n;i++)
         {
            for(int j=1;j<=n;j++)
            {
                if(l[j]>r[i])
                    num++;
            }
         }
         printf("%d
    ",num);
         return 0;
    }
    


  • 相关阅读:
    Git常用命令
    更新CentOS内核
    VMware虚拟机安装Ubuntu系统步骤详解
    Ubuntu安装遇到的问题
    IOT OS and OTA
    gcc c asm,C程序内嵌汇编
    makefile and make tips
    RTEMS目录梳理Sparc
    关于FreeRTOS的信号量、队列
    FreeRTOS任务源码分析以及程序堆栈与任务堆栈的关系
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228645.html
Copyright © 2011-2022 走看看