Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <cstring>
- #include <cmath>
- #define N 10000001
- using namespace std;
- int F[N],nr;
- 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;
- }
- };
- void FactorprimMax(int n)
- {
- int d=2;
- bool ok=true;
- while(n>1)
- {
- if(n%d==0)
- while(n%d==0)
- n/=d;
- ++d;
- if(n>1&&d*d>n)
- {
- if(F[n]==0)
- ++nr;
- ++F[n],n=1,ok=false;
- }
- }
- if(ok)
- {
- if(F[d-1]==0)
- ++nr;
- ++F[d-1];
- }
- }
- int main()
- {
- int n;
- InParser f("jocprim.in");
- f>>n;
- int x;
- while(n--)
- {
- f>>x;
- if(x>1)
- FactorprimMax(x);
- }
- OutParser g("jocprim.out");
- g<<nr<<'\n';
- for(int i=1;i<=10000000;++i)
- if(F[i])
- g<<i<<' '<<F[i]<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement