PM3

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=32394#problem/A

// File Name: a.cpp// Author: bo_jwolf// Created Time: 2013年09月28日 星期六 21:08:28#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>using namespace std;const int maxn = 1005 ;int a[ maxn ][ maxn ] , b[ maxn ][ maxn ]  , c[ maxn ][ maxn ] , B[ maxn ] , C[ maxn ] ;int main(){int n , p , m , sum ; while( scanf( "%d%d%d" ,  &n , &p , &m ) != EOF ){for( int i = 1 ; i <= n ; ++i ){for( int j  =1 ; j <= p ; ++j ){scanf( "%d" , &a[ i ][ j ] );}}for( int i = 1 ; i <= p ; ++i ){for( int j = 1 ; j <= m ; ++j ){scanf( "%d" , &b[ i ][ j ] ) ;}}for( int i = 1 ; i <= n ; ++i ){for( int j = 1 ; j <= m ; ++j ){scanf( "%d" , &c[ i ][ j ] ) ;}}bool flag = true ;for( int i = 1 ; i <= n && flag ; ++i ){//sum = 0 ;for( int j = 1 ; j <= m && flag ; ++j ){sum = 0 ;for( int k = 1 ; k <= p && flag; ++k ){sum += a[ i ][ k ] * b[ k ][ j ]  ;}//cout << endl << endl ;//cout << sum << endl ;if( sum != c[ i ][ j ] ){flag = false ;cout << "No" << endl ;cout << i << " " << j << endl ;cout << sum << endl ;break ;}}}if( flag ){printf( "Yes\n" ) ;}}return 0;}