Cod sursa(job #1797587)

Utilizator StarGold2Emanuel Nrx StarGold2 Data 4 noiembrie 2016 16:55:31
Problema Sum Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.09 kb
#include <fstream>
#include <numeric>
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;
    }
} in( "sum.in" );

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 << (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;
    }
} out( "sum.out" );

const int DIM = 1e5 + 5;

int phi[DIM];

int main( int argc, const char *argv[] ) {
    ios::sync_with_stdio( false );

    iota( phi + 1, phi + DIM, 1 );
    for( int i = 2; i < DIM; i ++ ) {
        if( phi[i] != i ) {
            continue; }
        for( int j = i; j < DIM; j += i ) {
            phi[j] = ( phi[j] / i ) * (i - 1); } }

    int n; in >> n;
    for( int i = 1; i <= n; i ++ ) {
        int x; in >> x;
        out << 2LL * x * phi[x] << '\n'; }

    return 0; }