1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 | #define YES 10 #define NO 20 #define SIZE 4 using namespace std; #include <iostream> struct Node { Node ** children; int childCount; char name[1]; int empty;//YES or NO int sequence; double value; }; using namespace std; bool isEmpty(Node ptr[SIZE][SIZE]) { for (int i = 0; i<SIZE; i++) { for (int j = 0; j < SIZE; j++) { if(ptr[i][j].empty == YES){ return true; } } } return false; } int main (int argc, const char * argv[]) { Node tree[SIZE][SIZE]; // some stuff if (isEmpty(tree)) { cout<<"this is empty\n"; return 0; } return 0; } |
I2RlZmluZSBZRVMgMTAKI2RlZmluZSBOTyAyMAojZGVmaW5lIFNJWkUgNAp1c2luZyBuYW1lc3BhY2Ugc3RkOwojaW5jbHVkZSA8aW9zdHJlYW0+CgpzdHJ1Y3QgTm9kZQp7CiAgICBOb2RlICoqIGNoaWxkcmVuOwogICAgaW50ICAgICBjaGlsZENvdW50OwogICAgY2hhciBuYW1lWzFdOwogICAgaW50IGVtcHR5Oy8vWUVTIG9yIE5PCiAgICBpbnQgc2VxdWVuY2U7CiAgICBkb3VibGUgIHZhbHVlOwp9OwoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmJvb2wgaXNFbXB0eShOb2RlIHB0cltTSVpFXVtTSVpFXSkgeyAgICAKICAgIGZvciAoaW50IGkgPSAwOyBpPFNJWkU7IGkrKykgewogICAgICAgIGZvciAoaW50IGogPSAwOyBqIDwgU0laRTsgaisrKSB7CiAgICAgICAgICAgIGlmKHB0cltpXVtqXS5lbXB0eSA9PSBZRVMpewogICAgICAgICAgICAgICAgcmV0dXJuIHRydWU7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gZmFsc2U7Cn0KCmludCBtYWluIChpbnQgYXJnYywgY29uc3QgY2hhciAqIGFyZ3ZbXSkKewogICAgTm9kZSB0cmVlW1NJWkVdW1NJWkVdOwovLyBzb21lIHN0dWZmCiAgICBpZiAoaXNFbXB0eSh0cmVlKSkgewogICAgICAgIGNvdXQ8PCJ0aGlzIGlzIGVtcHR5XG4iOwogICAgICAgIHJldHVybiAwOwogICAgfQogICAgcmV0dXJuIDA7Cn0=
-
upload with new input
-
result: Success time: 0.02s memory: 2676 kB returned value: 0


