置换问题
2015-09-10 22:40
169 查看
Arif in Dhaka (First Love Part 2)
题目传送:UVA - 10294 - Arif in Dhaka (First Love Part 2)AC代码:
[code]#include <map> #include <set> #include <list> #include <cmath> #include <deque> #include <queue> #include <stack> #include <bitset> #include <cctype> #include <cstdio> #include <string> #include <vector> #include <complex> #include <cstdlib> #include <cstring> #include <fstream> #include <sstream> #include <utility> #include <iostream> #include <algorithm> #include <functional> #define LL long long #define INF 0x7fffffff using namespace std; const int maxn = 105; int n, t; LL jiechen[maxn] = {1}; LL gcd(LL a, LL b) { return b == 0 ? a : gcd(b, a % b); } int main() { while(scanf("%d %d", &n, &t) != EOF) { if(n == 0) break; for(int i = 1; i <= n; i ++) { jiechen[i] = jiechen[i - 1] * t; } LL a = 0; for(int i = 0; i < n; i ++) a += jiechen[gcd(i, n)]; LL b = 0; if(n & 1) b = n * jiechen[(n + 1) / 2]; else b = (n / 2) * (jiechen[n/2 + 1] + jiechen[n/2]); printf("%lld %lld\n", a / n, (a + b) / 2 / n); } return 0; }
相关文章推荐
- Instantiation of bean failed; nested exception is java.lang.NoClassDefFoundError: com/mchange/v2/ser
- Java中request请求之 - 带文件上传的form表单
- nginx中http的fastcgi模块的配置指令1
- Java利用递归的方法求整数数组中的最大值
- uva 10246 - Asterix and Obelix(最短路)
- 03_获取手机内存状态
- effective c++ 为多态基类声明virtual析构函数
- 零基础学python-15.2 分解函数
- UIScrollView&UIPageControl
- meeting之一,一些想法
- 零基础学python-15.2 分解函数
- C#版Windows服务安装卸载小工具-附源码
- [Z]CiteSeer统计的计算机领域的期刊和会议的影响因子
- Core Animation
- iOS NSAarray的initWithArray:copyItems:方法
- 2015 暑假集训总结
- C++Primer第五版 2.3.2节练习
- NetAnalyzer笔记 之 四. C#版的抓包软件
- 软件测试常用术语
- Oracle 有表连接的connect by 的优化