A8956 | Dima and Sequence
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Dima got into number sequences. Now he's got sequence $a_{1},a_{2},...,a_{n}$ , consisting of $n$ positive integers. Also, Dima has got a function $f(x)$ , which can be defined with the following recurrence:
- $f(0)=0$ ;
- $f(2·x)=f(x)$ ;
- $f(2·x+1)=f(x)+1$ .
Dima wonders, how many pairs of indexes $(i,j)$ $(1<=i<j<=n)$ are there, such that $f(a_{i})=f(a_{j})$ . Help him, count the number of such pairs.
- $f(0)=0$ ;
- $f(2·x)=f(x)$ ;
- $f(2·x+1)=f(x)+1$ .
Dima wonders, how many pairs of indexes $(i,j)$ $(1<=i<j<=n)$ are there, such that $f(a_{i})=f(a_{j})$ . Help him, count the number of such pairs.
输入格式
The first line contains integer $n$ $(1<=n<=10^{5})$ . The second line contains $n$ positive integers $a_{1},a_{2},...,a_{n}$ $(1<=a_{i}<=10^{9})$ .
The numbers in the lines are separated by single spaces.
The numbers in the lines are separated by single spaces.
输出格式
In a single line print the answer to the problem.
Please, don't use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.
Please, don't use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.
输入输出样例
输入 #1
3 1 2 4
输出 #1
3
输入 #2
3 5 3 1
输出 #2
1
In the first sample any pair $(i,j)$ will do, so the answer is $3$ .
In the second sample only pair $(1,2)$ will do.
In the second sample only pair $(1,2)$ will do.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted