UVA 1363
2016-09-27 15:44
225 查看
【题目分析】
分组解决。
【代码】
分组解决。
【代码】
#include <cstdio> #define min(a,b) a<b?a:b #define ll long long ll ans,x,y; int n,k,p,j; int main() { while (scanf("%d%d",&n,&k)!=EOF) { ans=0; for (int i=1;i<=n;i=j+1) { p=k/i; if (p==0) j=n; else j=min(k/p,n); x=k%i; y=k%j; ans+=(x+y)*(j-i+1)/2; } printf("%lld\n",ans); } }
相关文章推荐
- UVA - 1363 Joseph's Problem(打表找规律)
- uva 1363 - Joseph's Problem(数论)
- UVA 1363 Joseph's Problem 找规律+推导 给定n,k;求k%[1,n]的和。
- UVA1363 - Joseph's Problem(数学,迷之优化)
- UVa1363 Joseph's Problem
- UVA 1363 Joseph's Problem(数论)
- UVa 1363 POJ 2800 Joseph's Problem
- POJ 1363 (简单栈)UVA 514
- UVA1363Joseph'sProblem
- uva 1363 Joseph's Problem 等差数列
- UVA 1363(p338)----Joseph's Problem
- UVa 1363 约瑟夫的数论问题
- UVa 1363 Joseph's Problem
- uva 1363 公式求和(优化)
- UVa 1363 (数论 数列求和) Joseph's Problem
- UVA 1363 - Joseph's Problem(数论)
- UVa1363 - Joseph's Problem(数论)
- UVA 1363
- uva1363 Joseph's Problem
- UVa 1363