資源簡介
AFO后發福利,noip提高組模擬題(有代碼,有解題報告),可對拍

代碼片段和文件信息
#include
#include
const?int?N=205;
int?nmia[N]cntb[1000000]f[N];
void?add(int?n){for(int?i=1;i<=n/i;i++)if(n%i==0)b[++cnt]=ib[++cnt]=n/i;}
int?cal(int?d){
??int?t=0;
??for(int?i=1;i<=m;i++)if(a[i]%d==0)t++;
??return?t;
}
int?main(){
??freopen(“div.in““r“stdin);freopen(“div.out““w“stdout);
??scanf(“%d%d“&n&m);
??for(i=1;i<=m;i++)scanf(“%d“&a[i])add(a[i]);
??std::sort(b+1b+cnt+1);
??for(i=1;i<=cnt;i++)if(b[i]<=n&&b[i]!=b[i-1])f[cal(b[i])]++;
??f[0]=n;
??for(i=1;i<=m;i++)f[0]-=f[i];
??for(i=0;i<=m;i++)printf(“%d\n“f[i]);
??fclose(stdin);fclose(stdout);
??return?0;
}
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2017-10-10?22:46??BZOJ?NoipRound?2\
?????目錄???????????0??2017-10-10?22:46??BZOJ?NoipRound?2\std\
?????目錄???????????0??2018-07-21?09:22??BZOJ?NoipRound?2\std\div\
?????文件?????????626??2016-09-02?14:28??BZOJ?NoipRound?2\std\div.cpp
?????目錄???????????0??2018-07-21?09:22??BZOJ?NoipRound?2\std\market\
?????文件????????1054??2016-09-02?15:54??BZOJ?NoipRound?2\std\market.cpp
?????目錄???????????0??2018-07-21?09:22??BZOJ?NoipRound?2\std\speed\
?????文件????????2715??2016-09-04?16:11??BZOJ?NoipRound?2\std\speed.cpp
?????文件????????2860??2016-10-07?23:02??BZOJ?NoipRound?2\std.zip
?????文件??????612307??2016-10-07?23:02??BZOJ?NoipRound?2\test2-solutions.pdf
?????文件???????98601??2016-10-07?23:02??BZOJ?NoipRound?2\test2-statements.pdf
?????文件??????642382??2016-10-07?23:02??BZOJ?NoipRound?2\test2_result.html
- 上一篇:計步器的算法
- 下一篇:star ccm場函數的命令規則
評論
共有 條評論