Pagini recente » Cod sursa (job #2823758) | Cod sursa (job #1866058) | Cod sursa (job #1446713) | Cod sursa (job #3005068) | Cod sursa (job #991842)
Cod sursa(job #991842)
#include <fstream>
using namespace std;
ifstream fin("f.in"); ofstream fout("f.out");
int n, A, N, k, x[100];
void Read()
{
fin >> n >> A >> N >> k;
}
int Bun(int pas, int i)
{
int cont = 1, p = pas - 1;
while(p && x[p] == i)
{
cont++;
p--;
}
if(i == 1)
{
if(cont <= A)
return 1;
return 0;
}
if(i == 2)
{
if(cont <= N)
return 1;
return 0;
}
}
void Afis()
{
for(int i = 1; i <= n; i++)
fout << x[i];
fout << "\n";
}
void Back(int pas)
{
for(int i = 1; i <= 2; i++)
{
if(Bun(pas, i))
x[pas] = i;
/* else
{
if(i == 1)
x[pas] = 2;
else
x[pas] = 1;
}
*/
if(pas == n)
Afis();
else
Back(pas + 1);
}
}
int main()
{
Read();
Back(1);
fin.close(); fout.close();
return 0;
}