UVa--10791 Minimum Sum LCM(math)
来源:互联网 发布:供应商管理数据流程图 编辑:程序博客网 时间:2024/05/16 15:17
UVa 10791
题解
算术基本定理的应用。
将n分解,
注意当 n = 1和 n 为素数的时候,最小和为
#include <bits/stdc++.h>using namespace std;int main(){ #ifdef LOCAL freopen("data.in", "r", stdin); #endif // LOCAL int kcase = 1; long long n; while(cin >> n && n) { long long ans = 0; vector<int> fac; long long nn = n, m = (int)sqrt(n + 0.5); for(int i = 2; i <= m; ++i) { long long e = 1; while(n % i == 0 && n > 1) { e *= i; n /= i; } if(e != 1) fac.push_back(e); } if(n > 1) fac.push_back(n); if(fac.size() == 1 || nn == 1) ans = nn + 1; else{ for(size_t i = 0; i < fac.size(); ++i) ans += fac[i]; } printf("Case %d: %lld\n", kcase++, ans); } return 0;}
0 0
- UVa--10791 Minimum Sum LCM(math)
- uva 10791 - Minimum Sum LCM
- uva 10791 - Minimum Sum LCM
- UVa 10791 - Minimum Sum LCM
- UVA 10791 - Minimum Sum LCM
- UVA 10791 Minimum Sum LCM
- UVa:10791 Minimum Sum LCM
- uva 10791 - Minimum Sum LCM
- UVA - 10791 Minimum Sum LCM
- UVA 10791 - Minimum Sum LCM
- UVA 10791 - Minimum Sum LCM
- UVA 10791 Minimum Sum LCM
- UVa 10791 - Minimum Sum LCM
- Minimum Sum LCM - UVa 10791
- UVa 10791 - Minimum Sum LCM
- UVA - 10791 Minimum Sum LCM
- UVA 10791 - Minimum Sum LCM
- UVa 10791 Minimum Sum LCM
- Android基础(四)——Activity的两种启动方式、Intent初探
- C/C++的字符串流
- Swift语法
- boost::asio::io_service的stop()和reset()和stopped()函数
- [数学专题大汇总][SDOI2013]项链
- UVa--10791 Minimum Sum LCM(math)
- android搭建环境错误 daemon not running. starting it now on port 5037 ADB server didn't ACK
- 算法竞赛入门经典 开灯问题
- 数据库基础知识
- 万恶的KPI、新兴的OKR及让人纠结的程序员考核
- Unicode
- android LurCache类分析
- 开源ZQLoopScrollView轮播组件
- POJ 2549 Sumsets(折半枚举)