Cod sursa(job #2623841)
| Utilizator | Data | 4 iunie 2020 00:27:10 | |
|---|---|---|---|
| Problema | Radix Sort | Scor | 0 |
| Compilator | py | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
def radixsort(lista):
for exp in range(0, 32, 8):
bucket = [[] for p in range(256)]
for i in lista:
bucket[(i >> exp) & 255].append(i)
index = 0
for i in range(256):
for j in range(len(bucket[i])):
lista[index] = bucket[i][j]
index += 1
return lista
with open('radixsort.in') as f:
N,A,B,C = [int(x) for x in next(f).split()]
lista=[]
lista.append(B)
for i in range(1,N+1):
lista.append((A * lista[i-1] + B) % C)
g = open("radixsort.out", "w")
g.write(radixsort(lista))
g.close()
