Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- ////1
- #include <fstream>
- using namespace std;
- ifstream f("date.in");
- ofstream g("date.out");
- int s[100],i,n,m;
- void tipar(int k)
- {
- int i;
- for(i=1; i<=k; i++)
- g<<s[i]<<" ";
- g<<endl;
- }
- int valid(int k)
- {
- int i;
- if(k>1 && s[k]<=s[k-1])
- return 0;
- return 1;
- }
- void back(int k)
- {
- int i;
- for(i=1; i<=9; i++)
- {
- s[k]=i;
- if(valid(k))
- if(k==n)
- tipar(k);
- else back(k+1);
- }
- }
- int main()
- {
- f>>n;
- back(1);
- }
- ////2
- #include <fstream>
- #include<cmath>
- using namespace std;
- ifstream f("date.in");
- ofstream g("date.out");
- int s[100],i,n,m;
- void tipar(int k)
- {
- int i;
- for(i=1; i<=k; i++)
- g<<s[i]<<" ";
- g<<endl;
- }
- int valid(int k)
- {
- int i;
- for(i=1; i<k; i++)
- if(s[i]==s[k])
- return 0;
- if(k>1 && abs(s[k]-s[k-1])<2)
- return 0;
- if(k==1 && s[k]==0) return 0;
- return 1;
- }
- void back(int k)
- {
- int i;
- for(i=0; i<=9; i++)
- {
- s[k]=i;
- if(valid(k))
- if(k==n)
- tipar(k);
- else back(k+1);
- }
- }
- int main()
- {
- f>>n;
- back(1);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement