fork(7) download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int path[100],idx=0;
  5.  
  6. void findsteps(int n, int k, int sum, int idx)
  7. {
  8. 	if(sum==n)
  9. 	{
  10. 		for(int i=0;i<idx;i++)
  11. 		 cout<<path[i];
  12.  
  13. 		 cout<<endl;
  14. 		 return;
  15. 	}
  16. 	if(sum>n)
  17. 	return;
  18.     if(sum<n)
  19.     {
  20. 		for(int i=1;i<=k;i++)
  21. 		 {
  22. 		 	path[idx]=i;
  23. 		 	findsteps(n,k,sum+i,idx+1);
  24. 		 }
  25.     }
  26. }
  27.  
  28. int main() {
  29. 	// your code goes here
  30. 	int n,k;
  31. 	cin>>n>>k;
  32. 	findsteps(n,k,0,0);
  33. 	return 0;
  34. }
Success #stdin #stdout 0s 3300KB
comments (?)
stdin
copy 
4 2
stdout
copy 
1111
112
121
211
22
https://ideone.com/3NvPLq
language:
C++ (gcc 8.3)
created:
10 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!