Cod sursa(job #636997)
| Utilizator | Data | 20 noiembrie 2011 09:18:14 | |
|---|---|---|---|
| Problema | Dirichlet | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | .com 2011 | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
int n,i,v[100],a[100];
void scrie() {
for (int j=1;j<=n;j++) g << a[j] << ' ';
g << '\n';
return;
}
void comb(int k,int s) {
int j;
if (k>n && s==n) {
scrie();
return;
}
if (k>n) return;
for (j=0;j<=n;j++)
if (s+j<=k) {
a[k]=j;
comb(k+1,s+j);
}
}
int main() {
f >> n;
for (i=0;i<=n;i++) v[i]=i;
comb(1,0);
}
