Cod sursa(job #1379991)
Utilizator | Data | 6 martie 2015 20:54:50 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,p;
int v[20];
bool valid(int m,int k)
{
for(int i=1;i<k;i++)
if(v[i]==m)
return 0;
return 1;
}
void back(int k)
{
for(int i=v[k-1];i<=n;i++)
if(valid(i,k))
{
v[k]=i;
if(k==p)
{
for(int i=1;i<=p;i++)
g<<v[i]<<" ";
g<<"\n";
}
else
back(k+1);
}
}
int main()
{
f>>n>>p;
f.close();
v[0]=1;
back(1);
}