AcWing 4699. 如此编码
原题链接
简单
作者:
Coinisi.
,
2023-01-12 08:31:29
,
所有人可见
,
阅读 175
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
#define IOS std::ios::sync_with_stdio(false)
#define inf 0x3f3f3f3f
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define int long long
#define x first
#define y second
#define cmp [&](PII a, PII b){return a.y < b.y;}
const int N = 5e5+10, mod = 1e9+7, M = 5e7+5, K = 2e5+10, Z = 1e5+7, X = 1.5 * 1e9;
using namespace std;
typedef long long LL;
typedef priority_queue<int> PQI;
typedef priority_queue <int, vector<int>, greater<>> PQGI;
typedef pair<int, int> PII;
int a[22], modd[22];
void solve()
{
int n, m; cin >> n >> m;
int c[n + 1]; c[0] = 1;
for(int i = 1; i <= n; i ++)
{
cin >> a[i];
c[i] = c[i - 1] * a[i];
}
for(int i = 1; i <= n; i ++) modd[i] = m % c[i];
for(int i = 1; i <= n; i ++) cout << (modd[i] - modd[i - 1]) / c[i - 1] << ' ';
return;
}
signed main()
{
IOS; int T = 1;
cin.tie(nullptr);
cout.tie(nullptr);
// cin >> T;
while( T -- ) solve();
return 0;
}