洛谷 P6523 「Wdoi-1」加密通信（数学简单推柿子）

本文主要是介绍洛谷 P6523 「Wdoi-1」加密通信（数学简单推柿子），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

2020.7.11
这道题就是找到一个相邻但不相等的地方求出来gcd然后再拓展，貌似不难，用双向队列很舒服

代码：

#include <bits/stdc++.h>
using namespace std;
#define limit (1000 + 5)//防止溢出
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f
#define lowbit(i) i&(-i)//一步两步
#define EPS 1e-6
#define FASTIO  ios::sync_with_stdio(false);cin.tie(0);
#define ff(a) printf("%d\n",a );
#define pi(a,b) pair<a,b>
#define rep(i, a, b) for(ll i = a; i <= b ; ++i)
#define per(i, a, b) for(ll i = b ; i >= a ; --i)
#define MOD 998244353
#define traverse(u) for(int i = head[u]; ~i ; i = edge[i].next)
#define FOPEN freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\data.txt", "rt", stdin)
#define FOUT freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\dabiao.txt", "wt", stdout)
typedef long long ll;
typedef unsigned long long ull;
ll read(){ll sign = 1, x = 0;char s = getchar();while(s > '9' || s < '0' ){if(s == '-')sign = -1;s = getchar();}while(s >= '0' && s <= '9'){x = (x << 3) + (x << 1) + s - '0';s = getchar();}return x * sign;
}//快读
void write(ll x){if(x < 0) putchar('-'),x = -x;if(x / 10) write(x / 10);putchar(x % 10 + '0');
}
ll n,m;
ll a[limit];
int main() {
#ifdef LOCALFOPEN;
#endifFASTIOint t;cin>>t;while (cin>>n>>m){rep(i ,1,n-1){cin>>*(a + i);}deque<ll>ans;ll index;rep(i,2,n-1){if(a[i] != a[i-1]){ll fact = gcd(a[i], a[i - 1]);index = i;ans.push_back(fact);break;}}per(i, 1, index - 1){ll answer = a[i] / ans.front();ans.push_front(answer);}rep(i ,index + 1,n){ll answer = a[i - 1] / ans.back();ans.push_back(answer);}int flag = 0;for(auto it : ans){if(it > m){flag = 1;break;}}if(flag){cout<<-1<<endl;continue;}for(auto it : ans){cout<<it<<' ';}cout<<endl;}return 0;
}