Pagini recente » Atasamentele paginii vs_12_lmk | Cod sursa (job #3181229) | Cod sursa (job #413464) | Monitorul de evaluare | Cod sursa (job #2949879)
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
typedef long long llong;
const int nmax = 1e7 + 7;
int n, a, b, c;
static int v[nmax];
ios_base::sync_with_stdio(false), cin.tie(NULL);
cin >> n >> a >> b >> c;
v[0] = b;
for (int i = 1; i < n; i++) v[i] = (llong(a) * v[i - 1] + b) % c;
sort(v, v + n);
for (int i = 0; i < n; i += 10) cout << v[i];
}