C. Everyone is a Winner!(整除分块)
2021-01-26 21:18
标签:div std onclick typedef map article void property def 输入一个数n,求出n/i(i取任意)向下取整有几种数,并输出 整除分块裸题 cnt代表分块的块的个数,每个块里的值为a[i]=n/l,l为块的左端点,r为块的右端点r=n/(n/l) C. Everyone is a Winner!(整除分块) 标签:div std onclick typedef map article void property def 原文地址:https://www.cnblogs.com/zzl-dreamfly/p/11965723.html题意:
思路:
for(int l=1,r;l1)
{
r=n/(n/l);
a[++cnt]=n/l;
}
代码:
#include
文章标题:C. Everyone is a Winner!(整除分块)
文章链接:http://soscw.com/index.php/essay/47444.html