-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDecoder.java
More file actions
66 lines (66 loc) · 2.01 KB
/
Decoder.java
File metadata and controls
66 lines (66 loc) · 2.01 KB
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
import java.util.*;
public class LoopoverUpper {
private static int[] perm(long num, int n, int ra, int ca, int k) {
int max=locid(n*n-1,n,ra,ca)+1;
int[] out=new int[k];
for (int i=k-1; i>-1; i--) {
out[i]=(int)(num%(max-i));
num/=max-i;
}
for (int i=k-1; i>-1; i--)
for (int j=i+1; j<k; j++)
if (out[j]>=out[i])
out[j]++;
for (int i=0; i<out.length; i++)
out[i]=idloc(out[i],n,ra,ca);
return out;
}
private static int locid(int loc, int n, int ra, int ca) {
int r=loc/n, c=loc%n;
assert(r>=ra || c>=ca);
int smallr=n-ca;
if (r<ra)
return r*smallr+(c-ca);
else
return (r-ra)*n+c+ra*smallr;
}
private static int idloc(int id, int n, int ra, int ca) {
int smallr=n-ca;
if (id<ra*smallr)
return (id/smallr)*n+(id%smallr+ca);
else {
id-=ra*smallr;
return (id/n+ra)*n+(id%n);
}
}
private static long num(String b95) {
long out=0;
for (int i=0; i<b95.length(); i++) {
out*=95;
out+=b95.charAt(i)-32;
}
return out;
}
public static void main(String[] args) {
String code="&@q8`";
int N=5;
int ra=3, ca=4, rb=5, cb=5;
int[] locs=perm(num(code),N,ra,ca,rb*cb-ra*ca);
int[] tiles=new int[rb*cb-ra*ca];
for (int i=0; i<tiles.length; i++)
tiles[i]=idloc(i,N,ra,ca);
System.out.println(Arrays.toString(locs)+"\n"+Arrays.toString(tiles));
int[][] board=new int[N][N];
for (int i=0; i<tiles.length; i++) {
int loc=locs[i];
int tile=tiles[i];
board[loc/N][loc%N]=tile;
}
for (int r=0; r<N; r++) {
for (int c=0; c<N; c++) {
System.out.print((r<ra&&c<ca)?"*":(char)(65+board[r][c]));
}
System.out.println();
}
}
}