TJU1081

比眉伴天荒 2021-11-01 14:58 128阅读 0赞

没错，看懂题目即可

![None.gif][] \#include < iostream >   
![None.gif][]\#include < cmath >   
![None.gif][] using   namespace  std;  
![None.gif][]  
![None.gif][] \#define  YES \{cout<<"It's a MaoLaoDa number."<<endl;continue;\}   
![None.gif][] \#define  NO \{cout<<"It's not a MaoLaoDa number."<<endl;continue;\}   
![None.gif][] int  main()  
![ExpandedBlockStart.gif][None.gif]![ContractedBlock.gif][None.gif] ![dot.gif][None.gif] \{  
![InBlock.gif][None.gif]    long n,test,m;  
![InBlock.gif][None.gif]    int flag1,flag2,temp;  
![InBlock.gif][None.gif]    while(cin>>n)  
![ExpandedSubBlockStart.gif][None.gif]![ContractedSubBlock.gif][None.gif]    ![dot.gif][None.gif]\{  
![InBlock.gif][None.gif]        flag1=1;flag2=0;m=(long)sqrt((double)n);  
![InBlock.gif][None.gif]        for(temp=2;temp<=m;temp\++)  
![InBlock.gif][None.gif]            if(n % temp == 0)  
![ExpandedSubBlockStart.gif][None.gif]![ContractedSubBlock.gif][None.gif]            ![dot.gif][None.gif]\{flag1=0;break;\}  
![InBlock.gif][None.gif]            if(flag1)  
![InBlock.gif][None.gif]                NO  
![InBlock.gif][None.gif]                test=n/temp;  
![InBlock.gif][None.gif]            m = (long)sqrt((double)test);  
![InBlock.gif][None.gif]            for(temp=2;temp<=m;temp\++)  
![InBlock.gif][None.gif]                if(test % temp == 0)  
![ExpandedSubBlockStart.gif][None.gif]![ContractedSubBlock.gif][None.gif]                ![dot.gif][None.gif]\{;flag2=1;break;\}  
![InBlock.gif][None.gif]                if(flag2)  
![InBlock.gif][None.gif]                    NO  
![InBlock.gif][None.gif]                else  
![InBlock.gif][None.gif]                YES  
![ExpandedSubBlockEnd.gif][None.gif]    \}  
![InBlock.gif][None.gif]    return 0;  
![ExpandedBlockEnd.gif][None.gif]\}

转载于:https://www.cnblogs.com/FancyMouse/articles/248822.html

[None.gif]: