easy log n solution
\nbool isValid(int n){\n        if(n==0)\n            return false;\n        while(n>0){\n            int r = n%10;\n            if(r==0)\n                retur
```\nbool isValid(int n){\n        if(n==0)\n            return false;\n        while(n>0){\n            int r = n%10;\n            if(r==0)\n                return false;\n            n = n/10;\n        }\n        return true;\n    }\n    vector<int> getNoZeroIntegers(int n) {\n       int low = 1;\n        int high = n;\n        int low2 = 1;\n        int high2 = n;\n        while(low <high){\n            int m =low + (high-low)/2;\n            if(isValid(low) && isValid(n-low))\n                return {low,n-low};\n            if(isValid(m) && isValid(n-m))\n                return {m,n-m};\n            low = m+1;            \n        }\n        while(low2 <high2){\n            int m =low2 + (high2-low2)/2;\n            if(isValid(high2)&&isValid(n-high2))\n                return {high2,n-high2};\n            if(isValid(m) && isValid(n-m))\n                return {m,n-m};\n            high2 = m-1;            \n        }\n        \n       return{};\n    }\n\t```
['C']