#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
int ok( int n) {
while ( n) {
if ( n% 10 == 0 ) {
return 0 ;
}
n / = 10 ;
}
return 1 ;
}
class Solution{
public :
vector< int > getNoZeroIntegers( int n) {
int i;
for ( i= ( 1 ) ; i< ( n) ; i++ ) {
if ( ok( i) && ok( n- i) ) {
break ;
}
}
return vector< int > { i, n- i} ;
}
}
;
// cLay varsion 20200119-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// int ok(int n){
// while(n){
// if(n%10==0) return 0;
// n /= 10;
// }
// return 1;
// }
//
// class Solution {
// public:
// vector<int> getNoZeroIntegers(int n) {
// rep(i,1,n) if(ok(i) && ok(n-i)) break;
// return vector<int>{i, n-i};
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbWFpbiBkdW1teV9tYWluCmludCBtYWluKCl7CiAgcmV0dXJuIDA7Cn0KI3VuZGVmIG1haW4KaW50IG9rKGludCBuKXsKICB3aGlsZShuKXsKICAgIGlmKG4lMTA9PTApewogICAgICByZXR1cm4gMDsKICAgIH0KICAgIG4gLz0gMTA7CiAgfQogIHJldHVybiAxOwp9CmNsYXNzIFNvbHV0aW9uewogIHB1YmxpYzoKICB2ZWN0b3I8aW50PiBnZXROb1plcm9JbnRlZ2VycyhpbnQgbil7CiAgICBpbnQgaTsKICAgIGZvcihpPSgxKTtpPChuKTtpKyspewogICAgICBpZihvayhpKSAmJiBvayhuLWkpKXsKICAgICAgICBicmVhazsKICAgICAgfQogICAgfQogICAgcmV0dXJuIHZlY3RvcjxpbnQ+e2ksIG4taX07CiAgfQp9CjsKLy8gY0xheSB2YXJzaW9uIDIwMjAwMTE5LTEKCi8vIC0tLSBvcmlnaW5hbCBjb2RlIC0tLQovLyAjZGVmaW5lIG1haW4gZHVtbXlfbWFpbgovLyB7fQovLyAjdW5kZWYgbWFpbgovLyAKLy8gaW50IG9rKGludCBuKXsKLy8gICB3aGlsZShuKXsKLy8gICAgIGlmKG4lMTA9PTApIHJldHVybiAwOwovLyAgICAgbiAvPSAxMDsKLy8gICB9Ci8vICAgcmV0dXJuIDE7Ci8vIH0KLy8gCi8vIGNsYXNzIFNvbHV0aW9uIHsKLy8gcHVibGljOgovLyAgIHZlY3RvcjxpbnQ+IGdldE5vWmVyb0ludGVnZXJzKGludCBuKSB7Ci8vICAgICByZXAoaSwxLG4pIGlmKG9rKGkpICYmIG9rKG4taSkpIGJyZWFrOwovLyAgICAgcmV0dXJuIHZlY3RvcjxpbnQ+e2ksIG4taX07Ci8vICAgfQovLyB9Owo=