Pagini recente » Cod sursa (job #1142498) | Cod sursa (job #1167212) | Cod sursa (job #780181) | Cod sursa (job #2156419) | Cod sursa (job #2305823)
#include <fstream>
using namespace std;
ifstream f("pavare2.in");
ofstream g("pavare2.out");
int n,A,B,a[101][101],b[101][101],i,j,l,x,k,st;
int main()
{ f>>n>>A>>B;
a[0][0]=1;
b[0][0]=1;
for(i=1;i<=n;i++){
for(j=1;j<=A&&j<=i;j++){
a[i][j]=b[i-j][0];
a[i][0]+=a[i][j];
}
for(j=1;j<=B&&j<=i;j++){
b[i][j]=a[i-j][0];
b[i][0]+=b[i][j];
}
}
g<<a[n][0]+b[n][0]<<'\n';;
f>>k;
if(k>a[n][0]){
k=k-a[n][0];
g<<1;
st=0;
}
else{
j=A;
while(a[n][j]<k&&j>=0)
j--;
for(l=1;l<=j;l++)
g<<0;
st=1;
}
x=n-1;
while(x!=1){
if(st==0){
j=A;
while(a[x][j]<=k&&j>=0){
k=k-a[x][j];
j--;
}
for(l=1;l<=j;l++)
g<<0;
st=1;
}
else{
j=1;
while(b[x][j]<k&&j<=B)
j++;
for(l=1;l<=j;l++)
g<<1;
st=0;
}
x--;
}
return 0;
}