CodeForces 567C Geometric Progression
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Description
Polycarp loves geometric progressions very much. Since he was only three years old, he loves only the progressions of length three. He also has a favorite integer k and a sequence a, consisting of n integers.
He wants to know how many subsequences of length three can be selected from a, so that they form a geometric progression with common ratio k.
A subsequence of length three is a combination of three such indexes i1, i2, i3, that 1 ≤ i1 < i2 < i3 ≤ n. That is, a subsequence of length three are such groups of three elements that are not necessarily consecutive in the sequence, but their indexes are strictly increasing.
A geometric progression with common ratio k is a sequence of numbers of the form b·k0, b·k1, ..., b·kr - 1.
Polycarp is only three years old, so he can not calculate this number himself. Help him to do it.
Input
The first line of the input contains two integers, n and k (1 ≤ n, k ≤ 2·105), showing how many numbers Polycarp's sequence has and his favorite number.
The second line contains n integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — elements of the sequence.
Output
Output a single number — the number of ways to choose a subsequence of length three, such that it forms a geometric progression with a common ratio k.
Sample Input
5 2
1 1 2 2 4
4
3 1
1 1 1
1
10 3
1 2 6 2 3 6 9 18 3 9
6
Hint
In the first sample test the answer is four, as any of the two 1s can be chosen as the first element, the second element can be any of the 2s, and the third element of the subsequence must be equal to 4.
#include <stdio.h>
#include <string.h>
#include <map>
#include <algorithm>
using namespace std; map <long long,long long> a;
map <long long,long long> b;
long long y[];
int main()
{
long long n,k,o;
long long i,j,x,m;
long long s;
while(scanf("%I64d %I64d",&n,&k)!=EOF)
{
s=,o=,m=;
a.clear();
b.clear();
if(k==)
{
for(i=;i<=n;i++)
{
scanf("%I64d",&x);
a[x]++;
if(a[x]==)
{
m++;
y[m]=x;
}
}
//prlong longf("*%d %d\n",a[y[1]],m);
for(i=;i<=m;i++)
{
s=s+(a[y[i]]*(a[y[i]]-)/)*(a[y[i]]-)/;
}
}
else
{
for(i=;i<=n;i++)
{
scanf("%I64d",&x);
if(x==)
o++;
a[x]++;
if(x%k== && x/k!=)
{
s=s+b[x/k];
b[x]=a[x/k]+b[x];
}
}
s=s+o*(o-)/*(o-)/;
}
printf("%I64d\n",s);
}
return ;
}
最新文章
- 构建高可用集群Keepalived+Haproxy负载均衡
- Mobile data
- 两分钟了解REACTIVEX
- [py] 导入模块 reload(sys)
- 如何搭建maya plugin develop environment on MAC OS X
- ImageMagick的使用
- SQL2008-删除时间字段重复的方法
- 08重编终极版《东邪西毒:终极版》DVD粤语中字
- 【Java基础01】Java InputStream的read方法
- bzoj 4034 [HAOI2015] T2(树链剖分,线段树)
- CodeIgniter框架介绍
- Linux 配置多IP
- Arcgis api For silverlight 加载高德地图
- js 短信倒计时60s
- 基于Office 365的随需应变业务应用平台
- [51nod1532]带可选字符的多字符串匹配
- Linux多线程实践(6) --Posix读写锁解决读者写者问题
- docker(4)docker的网络,自定义网桥
- kafka笔记9(监控)
- pycrypto安装各种方法试了,最后这种最快速最方便