Cod sursa(job #3175708)
Utilizator | Data | 26 noiembrie 2023 12:49:47 | |
---|---|---|---|
Problema | Radix Sort | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#pragma GCC optimize("Ofast")
#define int long long
using namespace std;
void radixSort(int v[], int n)
{
int i;
}
int v[10000001];
signed main()
{
ifstream cin("radixsort.in");
ofstream cout("radixsort.out");
int n, a, b, c, i;
cin >> n >> a >> b >> c;
v[1] = b;
for(i = 2; i <= n; i++)
{
v[i] = (a * v[i - 1] + b) % c;
}
for(i = 1; i <= n; i += 10)
{
cout << v[i] << " ";
}
return 0;
}