UVa 1363

xiaoxiao2021-02-28  151

注意:long long

#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #include<cstdlib> #include<vector> #define fo(i,a,b) for(int i=a;i<=b;i++) #define fod(i,a,b) for(int i=a;i>=b;i--) using namespace std; typedef long long ll; ll n,k, ans; ll sum(ll a,ll d,ll n) { return ll(2*a-n*d)*(n+1)/2; } int main() { while(cin>>n>>k) { ans=0; ll i=1; while(i<=n) { ll q=k%i,p=k/i,cnt=n-i; if(p>0) cnt=min(cnt,q/p); ans+=sum(q,p,cnt); i=i+cnt+1; } printf("%lld\n",ans); } return 0; }
转载请注明原文地址: https://www.6miu.com/read-19195.html

最新回复(0)