1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8

vrybdy cloud cmptng days.tryng smpl one,sell mchns one two btchs clld slots.cstmr buy one scnd cpu q scnds ntgr q.ipt cnssts sngl line cntnng four ntgrs q,2<=q<=1000,ndd cmplt lngr btchs,m,1<=m<=1000000,mchns owned,s,0<=s<=1000000,1-scnd slots prchsd,l,0<=l<=1000000,q -scnd slots prchsd
Original length: 1144
Compressed length: 171
Percent compression: 85.0524%
�z=�y�^�}>�y<�|>�g�v�]�k5�M�z�o7�y�w�{�^�W�u�n�v�n�[-�|�_�z�^�W�}�{�o�m6�y�o�{�w;�N�}�o�[�k�Z-�y�


Everybody could computing days. Trying sample one, sell machines one or two batches collide slots. Customer buy one second cpu q seconds integer q. Input consists single line containing four integers q, 2<=q<=100, ndd complete longer batches, m, 1<=m<=1000000, machines owned, s, 0<=s<=1000000, 1-second slots purchased, l, 0<=l<=1000000, q -second slots purchased