codeforces 567c
2015-08-06 21:58
267 查看
C. Geometric Progression
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
output
input
output
input
output
Note
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.
map就好了
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<cstdio>
#define maxn 1100000
using namespace std;
map<int,int>Q1,Q2;
int n,k,a[maxn],sum1[maxn],sum2[maxn];
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d",a+i);
if(a[i]%k==0)sum1[i]=Q1[a[i]/k];
Q1[a[i]]++;
}
for(int i=n;i>=1;i--){
if(abs(1LL*a[i]*k)<=1000000000)sum2[i]=Q2[a[i]*k];
Q2[a[i]]++;
}
long long ans=0;
for(int i=1;i<=n;i++){
ans+=1LL*sum1[i]*sum2[i];
// printf("%d %d\n",sum1[i],sum2[i]);
}
cout<<ans<<endl;
return 0;
}
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
5 2 1 1 2 2 4
output
4
input
3 1 1 1 1
output
1
input
10 3 1 2 6 2 3 6 9 18 3 9
output
6
Note
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.
map就好了
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<cstdio>
#define maxn 1100000
using namespace std;
map<int,int>Q1,Q2;
int n,k,a[maxn],sum1[maxn],sum2[maxn];
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d",a+i);
if(a[i]%k==0)sum1[i]=Q1[a[i]/k];
Q1[a[i]]++;
}
for(int i=n;i>=1;i--){
if(abs(1LL*a[i]*k)<=1000000000)sum2[i]=Q2[a[i]*k];
Q2[a[i]]++;
}
long long ans=0;
for(int i=1;i<=n;i++){
ans+=1LL*sum1[i]*sum2[i];
// printf("%d %d\n",sum1[i],sum2[i]);
}
cout<<ans<<endl;
return 0;
}
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B
- Codeforces Gym100571A Cursed Query
- Codeforces Div2 244AB
- Coder-Strike 2014 - Finals (online edition, Div. 2)AB
- Codeforces Div2 243AB
- Codeforces Div2 242AB