51nod 1305 Pairwise Sum and Divide
来源:互联网 发布:王奕霏编程 编辑:程序博客网 时间:2024/06/01 08:54
51nod 1305 Pairwise Sum and Divide
可以发现俩俩数的 Floor((a+b)/(a*b)) 其实就是1/a+1/b,所以发现如果a>2 && b>2 那么结果就为0,我们再思考下其他情况:a = 1 && b != 1 ; a = 1 && b = 1 ; a = b = 2 。ok
#include <stdio.h>#include <string.h>#include <math.h>#include <stack>#include <algorithm>using namespace std;#define INF 0x3f3f3f3fconst int N = 1e5+10;int a[N];int main(){ int n; scanf("%d",&n); int sum1 = 0,sum2 = 0; for(int i = 0; i < n; i++) { scanf("%d",&a[i]); if(a[i] == 1) sum1++; else if(a[i] == 2) sum2++; } int ans = 0; ans += sum1*(n-sum1); ans += sum1*(sum1-1); ans += sum2*(sum2-1)/2; printf("%d\n",ans); return 0;}
0 0
- 51nod 1305:Pairwise Sum and Divide
- 51NOD 1305 Pairwise Sum and Divide
- 51nod 1305 Pairwise Sum and Divide
- 51nod 1305 Pairwise Sum and Divide
- #51nod 1305 Pairwise Sum and Divide
- 51nod 1305 Pairwise Sum and Divide
- 51nod-【1305 Pairwise Sum and Divide】
- 51nod 1305 Pairwise Sum and Divide
- 51nod 1305 Pairwise Sum and Divide
- 51NOD 1305 Pairwise Sum and Divide
- 51nod - 1305 Pairwise Sum and Divide
- 51nod 1305 Pairwise Sum and Divide
- 【51Nod】1305 Pairwise Sum and Divide
- 51NOD 1305 Pairwise Sum and Divide
- 51nod 1305 Pairwise Sum and Divide
- 51Nod 1305Pairwise Sum and Divide
- 51Nod-1305 Pairwise Sum and Divide
- 51Nod 1305 Pairwise Sum and Divide
- Objective C类方法load和initialize的区别
- 各种日期类型之间的转换
- Java进阶之reflection(反射机制)——反射概念与基础
- 校招一些事儿
- 使用 SSHFS 挂载远程的 Linux 文件系统及目录
- 51nod 1305 Pairwise Sum and Divide
- OpenCV21(金字塔LK光流算法)
- 树状数组+离散化求逆序数poj2299Ultra-QuickSort
- 11
- Android启动模式
- DB2 mainframe support UNICODE
- 【codeforces 732D】【二分+贪心】
- 判断2..100以内的质数--sqrt
- 死锁剖析