compression-project

Finding creative ways to compress USACO problem statements

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
ipt cntns two ntgrs n,1<=n<=200000,d,1<=d<=10^9,dvsr.ipt cntns n ntgrs _1,...,_n,0<=_<=10^9,a_i i th lmnt.opf dsply ntgr ndctng dstnct pairs ndcs (i,j) 1<=<j<=n _/d=_j/d ntgr dvsn c++.e._=_j ndcs i!=j
Original length: 887
Compressed length: 133
Percent compression: 85.0056%
j5y^}>y^Wzww]k5M&|{^z=yo[-y^k5FQunv~_u:p\k5