Pagini recente » Cod sursa (job #2044436) | Cod sursa (job #1021079) | Cod sursa (job #1544162) | Cod sursa (job #2196544) | Cod sursa (job #3144077)
#include <iostream>
#include <fstream>
using namespace std;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
InParser fin("ghiozdan.in");
OutParser fout("ghiozdan.out");
int dp[75001], u[75001], nr[75001], f[201];
void F(int s)
{if(u[s]!=0)
{fout<<u[s]<<"\n";
F(s-u[s]);
}
}
int main()
{ int n, s, a;
fin>>n>>s;
for(int i=1;i<=n;i++)
{fin>>a;
f[a]++;
}
for(int i=200;i>0;i--)
if(f[i]!=0)
{for(int j=i;j<=s;j++)
if((j==i || dp[j-i]!=0) && (dp[j]==0 || dp[j]>dp[j-i]+1))
{if(u[j-i]!=i)dp[j]=dp[j-i]+1, nr[j]=1, u[j]=i;
else if(nr[j-i]<f[i])dp[j]=dp[j-i]+1, nr[j]=1+nr[j-i], u[j]=i;
}
}
while(dp[s]==0)
s--;
fout<<s<<" "<<dp[s]<<"\n";
F(s);
return 0;
}