import Prog1Tools.IOTools;

public class Aufgabe1 {


    public static long m1(long n){
    	long spiegel=0L;
    	while (n>0) {
    		spiegel*=10;
    		spiegel+=n%10;
    		n/=10;
    	}
	return spiegel; // Dummy return
    }


    public static void m2(){
	int[] prim = {2,3,5,7,11,13,17,19,23,29};
		for (int i = 0; i<(prim.length-3);i++) {
			for (int j=i;j<(prim.length-2);j++) {
				for (int k=j; k<(prim.length-1);k++) {
					for(int l=k;l<prim.length;l++) {
						if ((prim[i]*prim[j]*prim[k]*prim[l])== 10*(prim[i]+prim[j]+prim[k]+prim[l])) {
							System.out.println("a = "+prim[i]+" b = "+ prim[j]+" c = "+prim[k]+" d = "+prim[l]);
						}
					}
				}
			}
		}
    }

    public static boolean m3(long n) {
    	if(n%10==3) {
    		return true;
    	}
    	if(n%10!=3) {
    		return (n<12) ? false:  m3(n/10);
    	}
		return true;
    }


    public static void m4(int k){
    }

    public static void main(String[] args){
	long n;
	int k;
	// positive Zahlen fuer n und k einlesen
	do {
	    n = IOTools.readLong("n = ");
	} while (n <= 0);

	do {
	    k = IOTools.readInteger("k = ");
	} while ((k <= 0) || (k > 26));


	/* *** Test m1 *** */
	System.out.println("\nTest m1:");
	long nu = m1(n);
	System.out.println("Zahl       = " + n);
	System.out.println("Umkehrzahl = " + nu);

	/* *** Test m2 *** */
	System.out.println("\nTest m2:");
	m2();

	/* *** Test m3 *** */
	System.out.println("\nTest m3:");
	for (long l : new long[] {n,12456789}){
	    if (m3(l)){
		System.out.println("Die Zahl " + l + " enthaelt mindestens eine 3.");
	    } else {
		System.out.println("Die Zahl " + l + " enthaelt keine 3.");
	    }
	}

	/* *** Test m4 *** */
	System.out.println("\nTest m4:");
	m4(k);
    }


}