Pagini recente » Cod sursa (job #102575) | Cod sursa (job #1389721) | Cod sursa (job #3032849) | Cod sursa (job #855558) | Cod sursa (job #1275820)
#include <stdio.h>
#include <stdlib.h>
#define m 6
int A[100][100]={0},B[100][100]={0};
FILE *f,*g;
/*void T(int i,int j)
{
if(i>0)
{
fprintf(g,"%d ",A[i][j]);
T(i-A[i][j],j-1);
}
}*/
int main()
{
f=fopen("loto.in","r");
g=fopen("loto.out","w");
int i,k,A[100][100]={0},j,s,n,v[100];
fscanf(f,"%d %d",&n,&s);
for(i=1; i<=n; i++)
{
fscanf(f,"%d",&v[i]);
A[v[i]][1]=B[v[i]][1]=v[i];
}
for(i=1; i<=s; i++)
for(j=2; j<=m; j++)
for(k=1; k<=n; k++)
{
if(v[k]<i && A[i-v[k]][j-1]!=0)
{
A[i][j]=v[k];
B[i][j]=A[i-v[k]][j-1];
k=n+1;
}
}
for(i=1; i<=s; i++)
{
for(j=1; j<=m; j++)
fprintf(g,"%d ",B[i][j]);
fprintf(g,"\n");
}
fprintf(g,"\n");
i=s;
j=m;
while(j>0)
{
fprintf(g,"%d ",A[i][j]);
i=i-A[i][j];
j--;
}
//T(s,m);
return 0xB;
}