Cod sursa(job #657590)
| Utilizator | Data | 6 ianuarie 2012 20:00:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
int st[100],n, k;
double cost[100];
ifstream cin("combinari.in");
ofstream cout("combinari.out");
void back(int p)
{ int pval; //valorile pentru nivelul p;
for(pval=1;pval<=n;pval++)
{st[p]=pval;
if(p==n)
inmultire(p);
else
back(p+1);}}
int main()
{ int i;
float contor2;
cin>>n;
cin>>k;
for(i=1;i<=n;i++)
cin>>cost[i];
back(1);
cout<<contor2;
cin.close();
cout.close();
return 0;}
