Zoj 3175 Number of Containers block acceleration

Test instructions: Calculates the number of multiples of I within N, not including I itself, sum

Solution: Direct violence for once must be no, but with a block acceleration can be

#include <stdio.h> #include <string.h>int main () {    int t;    Long long N;    while (scanf ("%d", &t)!=-1)    {while        (t--)        {            scanf ("%lld", &n);                  To use LLD wrong n fat lesson            long long sum=0;            for (int i=1,last;i<=n;i=last+1)            {                last=n/(n/i);                 Block acceleration, all n/i results identical to the computed                sum+= ((n/i-1) * (last-i+1));            }            printf ("%lld\n", sum);        }    }    return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Zoj 3175 Number of Containers block acceleration