1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

#include<iostream>

#include<string>

#include<cstring>

#include<algorithm>

#include<cmath>

using namespace std;

int main()

{

int n,a[4001],cut,sum,t[4001],rp,oo;

string c,q,b;

while(cin>>n)

{

string c,q,b;

for(int i=0;i<n/8;i++)

{

cin>>a[i];

string q;

do

{

q+=a[i]%2+'0';

a[i]=a[i]/2;

}while(a[i]>0);

reverse(q.begin(),q.end());

for(int j=8;j>q.length();j--)

{

c+='0';

}

c+=q;

}

//cout<<c<<endl;

//string b;

for(int i=0;i<c.length();i++)

{

string q;

cut=1;

b+=c[i];

//cout<<b<<endl;

while(c[i]==c[i+1])

{

cut++;

i++;

}

//cout<<cut<<endl;

do

{

q+=cut%2+'0';

cut=cut/2;

}while(cut>0);

reverse(q.begin(),q.end());

//cout<<q.length()<<endl;

for(int j=7;j>q.length();j--)

{

b+='0';

}

b+=q;

}

//cout<<b<<endl;

for(int i=0,j=0;i<b.length();i+=8,j++)

{

rp=0;

for(int m=i;m<i+8;m++)

{

rp+=pow(2,7-m%8)*(b[m]-'0');

}

t[j]=rp;

oo=j;

}

//cout<<oo<<endl;

for(int i=0;i<=oo;i++)

{

printf("%d%c",t[i],i<oo?' ':'\n');

}

}

return 0;

}

/**************************************************************

Problem: 1598

User: 201644901023

Language: C++

Result: 正確

Time:0 ms

Memory:2208 kb

****************************************************************/