Cod sursa(job #2339879)

Utilizator Leonard123Mirt Leonard Leonard123 Data 9 februarie 2019 14:58:47
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include<iostream>
using namespace std;
//ifstream cin("combinari.in");
//11212ofstream cout("combinari.out");
int sir[190],frec[190],k,n;

void gen(int x)
{
     if(x-1 == k)
     {
         for(int i = 1; i <= k;i++)
            cout<<sir[i]<<' ';
         cout<<'\n';
     }
     else
     {
         for(int  i = 1; i <= n; i++)
            if(!frec[i] && sir[x-1] < i)
           {
                 sir[x] = i;
                 frec[i] = 1;
                 gen(x+1);
                 frec[i] = 0;
           }
     }
}

int main(){
    cin>>n>>k;
    gen(1);
    return 0;
}
/*
submultimi(int n){
    if(n>)
}

#include<iostream>
using namespace std;
int main(){
    cin>>n;
}*/