Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <algorithm>
- #include <iostream>
- using namespace std;
- int nw;
- long long w[4];
- void gen(int i, long long num)
- {
- w[nw++] = num;
- if (i == 1) return;
- gen(i+1, num*10+4);
- gen(i+1, num*10+7);
- }
- int main()
- {
- nw = 2;
- w[0] = 4;
- w[1] = 7;
- gen(1, 4);
- gen(1, 7);
- sort(w, w+nw);
- for (int i = 0; i < nw; ++i) {
- cout << w[i] << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment