Sort4

#include <algorithm>
using namespace std;
struct S
{
    int x,d,s,p;
    bool operator < (const S& e) const
    {
        if(d!=e.d)
            return d>e.d;
        if(s!= e.s)
            return s<e.s;
        if(p!=e.p)
            return p<e.p;
        return x<e.x;
    }
};

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;
	}
};
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 << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

void nr_cif_sum_prod(int n,int &ncd,int &s,int &p)
{
    int c,cif[10]={0};
    ncd=0,s=0,p=1;
    while(n)
        c=n%10,cif[c]=1,s+=c,p*=c,n/=10;
    for(int i=0;i<10;++i)
        if(cif[i])
            ++ncd;
}

int main()
{
    int n;
    InParser f("sort4.in");
    f>>n;
    S a[n];
    for(int i=0;i<n;++i)
        f>>a[i].x,nr_cif_sum_prod(a[i].x,a[i].d,a[i].s,a[i].p);
    sort(a,a+n);
    OutParser g("sort4.out");
    for(int i=0;i<n;++i)
        g<<a[i].x<<' ';
    return 0;
}