2051673_ac_699ms_7928k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <iostream>

using namespace std;

#define MAX 1000

int main()
{
    int N, P, M, is;
    int i, j, k;
    int A[MAX][MAX], B[MAX][MAX], x = 0, y = 0;
    long C, Bp[MAX], Ap[MAX];
    __int64 temp, temp64, templ[MAX];
    scanf("%d%d%d", &N, &P, &M);
    is = 1;
    for (i = 0; i < P; i++)
    {
        Ap[i] = 0;
        templ[i] = 0;
    }
    for (i = 0; i < N; i++)
    {
        for (j = 0; j < P; j++)
        {
            scanf("%d", &A[i][j]);
            Ap[j] += A[i][j];
        }
    }
    for (i = 0; i < P; i++)
    {
        Bp[i] = 0;
        for (j = 0; j < M; j++)
        {
            scanf("%d", &B[i][j]);
            Bp[i] += B[i][j];
        }
    }
    for (i = 0; i < N; i++)
    {
        temp = 0;
        temp64 = 0;
        for (j = 0; j < P; j++)
        {
            temp += A[i][j] * Bp[j];
            if (j < M)
            {
                scanf("%ld", &C);
                temp64 += C;
                templ[j] += C;
            }
        }
        for (j = P; j < M; j++)
        {
            scanf("%ld", &C);
            temp64 += C;
            templ[j] += C;
        }
        if (temp64 != temp)
        {
            x = i;
            is = 0;
        }
    }
    for (i = 0; i < M; i++)
    {
        temp = 0;
        for (j = 0; j < P; j++)
        {
            temp += B[j][i] * Ap[j];
        }
        if (templ[i] != temp)
        {
            y = i;
            is = 0;
        }
    }
    if (is == 1)
        cout << "Yes" << endl;
    else
    {
        temp = 0;
        for (i = 0; i < P; i++)
            temp += A[x][i] * B[i][y];
        printf("No\n%d %d\n%I64d\n", x + 1, y + 1, temp);
    }
    return 0;
}