UVa 1363
2017-06-06 18:13
211 查看
注意: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; }
相关文章推荐
- 找规律(约瑟夫的数论问题,uva 1363)
- UVA 514 - Rails && POJ 1363 (堆栈模拟)
- UVA - 1363 Joseph's Problem(打表找规律)
- UVA1363 - Joseph's Problem(数学,迷之优化)
- UVA 1363 Joseph's Problem 找规律+推导 给定n,k;求k%[1,n]的和。
- uva 1363 - Joseph's Problem(数论)
- UVa1363 Joseph's Problem
- POJ 1363 (简单栈)UVA 514
- UVA 1363 Joseph's Problem(数论)
- UVa 1363 POJ 2800 Joseph's Problem
- UVA1363Joseph'sProblem
- uva 1363 Joseph's Problem 等差数列
- UVA 1363
- UVA 1363(p338)----Joseph's Problem
- UVa 1363 约瑟夫的数论问题
- UVa 1363 Joseph's Problem
- uva 1363 公式求和(优化)
- uva1363 Joseph's Problem
- UVa 1363 (数论 数列求和) Joseph's Problem
- UVA 1363 Joseph's Problem