Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n,m,s[100];
- int valid(int k);
- int sol (int k);
- void afisare (int k);
- void backt (int k)
- {
- for (int val=0;val<=9; val++)
- {
- s[k]=val;
- if (valid(k))
- if (sol(k))
- afisare (k);
- else
- backt (k+1);
- }
- }
- int sol (int k)
- {
- return k==n;
- }
- int valid (int k)
- {
- if (k==1 && s[k]==0)
- return 0;
- if (k==n && s[k]!=s[1])
- return 0;
- if (s[k]>=m)
- return 0;
- return 1;
- }
- void afisare (int k)
- {
- for (int i=1; i<=n; i++)
- cout << s[i];
- cout << endl;
- }
- int main ()
- {
- cin >> n >> m;
- backt(1);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement