Cod sursa(job #572571)
Utilizator | Data | 5 aprilie 2011 13:48:54 | |
---|---|---|---|
Problema | Rj | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream f("f.in");
ofstream g("f.out");
int n,i,p,k,v[100],x[100];
int succesor(int k)
{if (x[k]<=n&&k<=p)
{x[k]++;
return 1;
}
return 0;
}
int valid(int k)
{if (x[k]==x[i])
return 0;
return 1;
}
int back(k)
{int i;
k=1;
x[k]=0;
i=0;
while (k>0)
{}}