map Codeforces Round #Pi (Div. 2) C. Geometric Progression

题目传送门

 1 /*
 2     题意：问选出3个数成等比数列有多少种选法
 3     map：c1记录是第二个数或第三个数的选法，c2表示所有数字出现的次数。别人的代码很短，思维巧妙
 4 */
 5 /************************************************
 6  * Author        :Running_Time
 7  * Created Time  :2015-8-6 1:07:18
 8  * File Name     :C.cpp
 9  ************************************************/
10
11 #include <cstdio>
12 #include <algorithm>
13 #include <iostream>
14 #include <sstream>
15 #include <cstring>
16 #include <cmath>
17 #include <string>
18 #include <vector>
19 #include <queue>
20 #include <deque>
21 #include <stack>
22 #include <list>
23 #include <map>
24 #include <set>
25 #include <bitset>
26 #include <cstdlib>
27 #include <ctime>
28 using namespace std;
29
30 #define lson l, mid, rt << 1
31 #define rson mid + 1, r, rt << 1 | 1
32 typedef long long ll;
33 const int MAXN = 2e5 + 10;
34 const int INF = 0x3f3f3f3f;
35 const int MOD = 1e9 + 7;
36 map<ll, ll> c1, c2;
37
38 int main(void)    {     //Codeforces Round #Pi (Div. 2) C. Geometric Progression
39     ll ans = 0, x;  ll n, k;
40     scanf ("%I64d%I64d", &n, &k);
41     for (int i=1; i<=n; ++i)    {
42         scanf ("%I64d", &x);
43         if (x % (k * k) == 0)   ans += c1[x/k];     //x可选作第三个数
44         if (x % k == 0) c1[x] += c2[x/k];           //x第三个数或第二个数
45         c2[x]++;
46     }
47
48     printf ("%I64d\n", ans);
49
50     return 0;
51 }

转载于:https://www.cnblogs.com/Running-Time/p/4709186.html

map Codeforces Round #Pi (Div. 2) C. Geometric Progression相关推荐

Codeforces Round #Pi (Div. 2)(A,B,C,D)
A题: 题目地址: Lineland Mail #include <stdio.h> #include <math.h> #include <string.h> # ...
Codeforces Round #Pi (Div. 2) D. One-Dimensional Battle Ships set区间分解
D. One-Dimensional Battle Ships Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/c ...
Codeforces Round #Pi (Div. 2) B. Berland National Library 模拟
B. Berland National Library Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/conte ...
Codeforces Round #224 (Div. 2): C. Arithmetic Progression（模拟）
题意: 给你n个数字,你需要再添加一个数字,使得最后所有数字排序之后任意相邻两个数之差全部相等,问可以添加多少种不同的数字思路: 一看就是水题但是情况不少,没了例如所有数字全部相等,只有两个数字, ...
Codeforces Round #315 (Div. 2)
题目传送:Codeforces Round #315 (Div. 2) A. Music 题意较难懂.只是仅仅要推公式就好了注意到S+(q - 1) * t = q * t; 仅仅须要t等于S就可以 ...
[CF]Codeforces Round #529 (Div. 3)
[CF]Codeforces Round #529 (Div. 3) C. Powers Of Two Description A positive integer xx is called a po ...
CodeCraft-21 and Codeforces Round #711 (Div. 2) 题解
先上链接CodeCraft-21 and Codeforces Round #711 (Div. 2) A: 从n开始往后找,不出几十个一定能找到的,所以暴力就好了 void sovle(){cin ...
Codeforces Round #510 (Div. 2)
Codeforces Round #510 (Div. 2) https://codeforces.com/contest/1042 A 二分 1 #include<iostream> 2 ...
Codeforces Round #706 (Div. 2)B. Max and Mex
Codeforces Round #706 (Div. 2)B. Max and Mex 题目题目大意刚开始给你n个不同的数,k次询问每次求在该序列中已存在的最大的数和不存在的最小的数(大于等于零 ...

map Codeforces Round #Pi (Div. 2) C. Geometric Progression

map Codeforces Round #Pi (Div. 2) C. Geometric Progression相关推荐

最新文章

热门文章