Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream f("partitiinumar.in");
- ofstream g("partitiinumar.out");
- int x[101],n,nr,b,p;
- int cont(int k){
- int i,s=0;
- if(x[k-1]>x[k]&&k>1)return 0;
- for(i=1;i<=k;i++)s=s+x[i];
- if(s>n)return 0;
- return 1;
- }
- void afis(int k){
- for(int i=1;i<=k;i++)g<<x[i]<<" ";
- g<<endl;
- nr++;
- }
- int sol(int k){
- int i,s=0;
- for(i=1;i<=k;i++)s=s+x[i];
- if(s==n)return 1;
- else return 0;
- }
- void back(int k){
- for(int v=1;v<=n;v++){
- x[k]=v;
- if(cont(k))if(sol(k))afis(k);
- else back(k+1);
- }}
- int main(){
- f>>n;
- back(1);
- //cout<<nr<<" "<<b;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement