Submission #1244847

---

Source Code Expand

/*
#pragma region GNUC
//https://yukicoder.me/wiki/auto_vectorization
#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif
#pragma endregion
*/
#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;
/////////
#pragma region Math
#pragma region
template<class T>
inline T gcd(T a, T b){return b ? gcd(b, a % b) : a;}
#pragma endregion // 最大公約数 gcd
#pragma region
template<class T>
inline T lcm(T a, T b){return a / gcd(a, b) * b;}
#pragma endregion // 最小公倍数 lcm

//thx
//http://arc023.contest.atcoder.jp/submissions/172596
void solve(){
	int N,M;
	cin >> N >> M;

	map<int,LL> MM,MM2;//gcdの値,出現数
	map<int,LL> ans;//

	for(int i=0;i<N;++i){
		int A;
		cin >> A;//[1,10^9]
		MM2.clear();//ここに今回の計算結果を入れる
		for(map<int,LL>::iterator itr = MM.begin();
			itr != MM.end(); ++itr){
			int index = gcd(itr->first, A);
			ans[index] += itr->second;
			MM2[index] += itr->second;
		}
		++MM2[A];//Aの最大公約数はA
		++ans[A];
		swap(MM,MM2);//
	}

	for(int i=0;i<M;++i){
		int X;
		cin >> X;
		cout << ans[X] << endl;
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Judge Result