Cod sursa(job #2168810)
Utilizator | Data | 14 martie 2018 12:24:08 | |
---|---|---|---|
Problema | Radix Sort | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
#include<fstream>
#define MAXN 1000001
using namespace std;
ifstream f("bitsort.in");
int n;
char s[MAXN/8+1];
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
{
int a; f>>a;
s[a>>3] |= (1<<(a&7));
}
}
void afis()
{
for(int i=0;i<MAXN;i++)
if(s[i>>3] & (1<<(i&7)))
cout<<i<<" ";
}
int main()
{
citire();
afis();
return 0;
}