1081
#include <algorithm> #include <iostream> #include <vector> #include <map> #include <set> #include <string> using namespace std; int main () { int N; int K; int a[100]; int i = 0; cin >> N >> K; a[0] = 2; a[1] = 3; for(i = 2; i < 100; i++) a[i] = a[i-1]+a[i-2]; if( a[N-1] < K ) { cout << -1; return 0; } i = N-1; while(1) { if( i == 0) { cout << K-1; break; } if(a[i-1] >= K) { cout << 0; } else { cout << 10; K -= a[i-1]; i--; } i--; if( i < 0 ) break; } return 0; }
page revision: 0, last edited: 22 Nov 2006 16:21