Cod sursa(job #961769)
| Utilizator | Data | 12 iunie 2013 20:31:05 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int v[20];
int n,k,x;
int main ()
{ f>>k;
for(int i=1;i<=k;i++) g<<v[i]<<' ';
if(x>k) g<<x;
else for(v[x]=v[x-1]+1;v[x]<=n;v[x]++) g<<x+1;
g.close (); return 0;
}
