~~一眼就看出是个数论分块优化暴力~~
by LuckyCloud @ 2018-11-07 20:49:29
真是纯暴力,个人试了下:
#include<cstdio>
using namespace std;
int main()
{
int i;
long long k,m,n;
scanf("%lld%lld",&m,&n);
if(m>n){k=n*(m-n);
for(i=2;i<n;i++)k+=n%i;}
else {k=0;for(i=2;i<=m;i++)k+=n%i;}
printf("%lld",k);
return 0;
}
by Anoshag_Ruwan @ 2018-12-15 14:21:00
@[tony12345](/space/show?uid=111172)
希望更丰富的展现?[使用markdown](https://www.luogu.org/wiki/show?name=%E5%B8%AE%E5%8A%A9%EF%BC%9Amarkdown)
by coldskin233 @ 2018-12-16 08:43:00
挖坟,这个题纯暴力,就是O(n)的可以卡常卡到80分qwq
O(n)跑五亿级别复杂度了解一下
by 小知青 @ 2019-02-12 08:10:00
~~也不看看这是哪一年的题~~
by Frozencode @ 2019-08-04 20:18:39