#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
class Solution{
public :
int countNegatives( vector< vector< int >> & A) {
int i;
int res = 0 ;
for ( i= ( 0 ) ; i< ( A.size ( ) ) ; i++ ) {
int j;
for ( j= ( 0 ) ; j< ( A[ 0 ] .size ( ) ) ; j++ ) {
if ( A[ i] [ j] < 0 ) {
res++ ;
}
}
}
return res;
}
}
;
// cLay varsion 20200214-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// class Solution {
// public:
// int countNegatives(vector<vector<int>>& A) {
// int res = 0;
// rep(i,A.size()) rep(j,A[0].size()) if(A[i][j] < 0) res++;
// return res;
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KY2xhc3MgU29sdXRpb257CiAgcHVibGljOgogIGludCBjb3VudE5lZ2F0aXZlcyh2ZWN0b3I8dmVjdG9yPGludD4+JiBBKXsKICAgIGludCBpOwogICAgaW50IHJlcyA9IDA7CiAgICBmb3IoaT0oMCk7aTwoQS5zaXplKCkpO2krKyl7CiAgICAgIGludCBqOwogICAgICBmb3Ioaj0oMCk7ajwoQVswXS5zaXplKCkpO2orKyl7CiAgICAgICAgaWYoQVtpXVtqXSA8IDApewogICAgICAgICAgcmVzKys7CiAgICAgICAgfQogICAgICB9CiAgICB9CiAgICByZXR1cm4gcmVzOwogIH0KfQo7Ci8vIGNMYXkgdmFyc2lvbiAyMDIwMDIxNC0xCgovLyAtLS0gb3JpZ2luYWwgY29kZSAtLS0KLy8gI2RlZmluZSBtYWluIGR1bW15X21haW4KLy8ge30KLy8gI3VuZGVmIG1haW4KLy8gCi8vIGNsYXNzIFNvbHV0aW9uIHsKLy8gcHVibGljOgovLyAgIGludCBjb3VudE5lZ2F0aXZlcyh2ZWN0b3I8dmVjdG9yPGludD4+JiBBKSB7Ci8vICAgICBpbnQgcmVzID0gMDsKLy8gICAgIHJlcChpLEEuc2l6ZSgpKSByZXAoaixBWzBdLnNpemUoKSkgaWYoQVtpXVtqXSA8IDApIHJlcysrOwovLyAgICAgcmV0dXJuIHJlczsKLy8gICB9Ci8vIH07Cg==