Ich wollte für mc einen tree erstellen, sodass die benötigten commands trotz des hardcodens nicht so viele sind.
Doch das hier erschafft nicht alle Ordner:
Doch das hier erschafft nicht alle Ordner:
Java:
import java.io.*;
import java.nio.file.*;
public class Effect {
public static void main(String[] args) {
int[] primes = primes();
String path = "haste/";
String[] currentPrimes = new String[primes.length];
for(int i = 0; i < primes.length-1; i++) {
currentPrimes[i] = Integer.toString(1) + "/";
path+=currentPrimes[i];
}
String file = "1";
Path p;
File f;
for(int i = 0; i < primes.length; i++) {
System.out.println("hoi");
for(int j = 0; j < primes.length; j++) {
currentPrimes[j] = Integer.toString(1) + "/";
}
for(int j = 1; j <= primes[i]; j++) {
currentPrimes[i] = Integer.toString(j) + "/";
path = "haste/";
for(int k = 0; k < primes.length-1; k++) {
path+=currentPrimes[k];
}
System.out.println(path);
file = "" + j;
p = Paths.get(path, file);
f = new File(path + file+".mcfunction");
try {
Files.createDirectories(p.getParent());
f.createNewFile();
} catch (IOException e) {
e.printStackTrace();
}
}
}
/**for(int x = 1; x<=320; x++) {
System.out.println("execute if score @s haste matches " + x + " run effect give @p haste 1 " + (x-1));
if((x%5)==0) {
System.out.println("");
}
}**/
}
static int[] primes() {
int[] primes = new int[320];
int x = 0;
int number = 320;
for(int i = 2; i < number; i++) {
while(number%i==0) {
primes[x] = i;
number /= i;
System.out.println(i);
x++;
}
}
if(number >= 2) {
primes[x] = number;
x++;
}
int[] ints = new int[x];
for(int i = 0; i < x; i++) {
ints[i] = primes[i];
}
return ints;
}
}
