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 67 68 69 70 | //This is an example for problem id FCTRL2 in SPOJ.. import java.math.BigInteger; import java.io.*; import java.util.Arrays; class FCTRL2 { public static int multiplicity(int n, int p) { int q = n, m = 0; if (p > n) return 0; if (p > n/2) return 1; while (q >= p) { q /= p; m += q; } return m; } public static void main(String s[]) throws Exception { int total_no_cases,num_data,prime_list[]; boolean prime_num[]=new boolean[101]; prime_list=new int[30]; Arrays.fill(prime_num, Boolean.FALSE); BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); total_no_cases=Integer.parseInt(br.readLine()); //Find all the prime number's b/w 1-100.. int count=0; prime_num[0]=prime_num[1]=true; for(int i=2;i<=100;i++) { if(!prime_num[i]) { for(int j=i;j<=100;j=j+i) { if(!prime_num[j]) { prime_num[j]=true; } } prime_list[count]=i; ++count; } } prime_list[count]=-1; for (int i=0;i<total_no_cases;i++) { BigInteger res_print=BigInteger.ONE; num_data=Integer.parseInt(br.readLine()); int incr=0; while(prime_list[incr]<=num_data||prime_list[incr]==-1) { //FInd the exponent of the prime number.. int exp=multiplicity(num_data,prime_list[incr]); double p1=Double.parseDouble(String.valueOf(prime_list[incr])); double p2=Double.parseDouble(String.valueOf(exp)); long temp=(long)Math.pow(p1,p2); res_print=res_print.multiply(BigInteger.valueOf(temp)); incr++; } System.out.println(res_print); } } } |
Ly9UaGlzIGlzIGFuIGV4YW1wbGUgZm9yIHByb2JsZW0gaWQgRkNUUkwyIGluIFNQT0ouLgppbXBvcnQgamF2YS5tYXRoLkJpZ0ludGVnZXI7CmltcG9ydCBqYXZhLmlvLio7CmltcG9ydCBqYXZhLnV0aWwuQXJyYXlzOwpjbGFzcyBGQ1RSTDIKewoKcHVibGljIHN0YXRpYyBpbnQgbXVsdGlwbGljaXR5KGludCBuLCBpbnQgcCkgewogICAgaW50IHEgPSBuLCBtID0gMDsKICAgIGlmIChwID4gbikgcmV0dXJuIDA7CiAgICBpZiAocCA+IG4vMikgcmV0dXJuIDE7CiAgICB3aGlsZSAocSA+PSBwKSB7CiAgICAgICAgcSAvPSBwOwogICAgICAgIG0gKz0gcTsKICAgIH0KICAgIHJldHVybiBtOwp9CnB1YmxpYyBzdGF0aWMgdm9pZCBtYWluKFN0cmluZyBzW10pIHRocm93cyBFeGNlcHRpb24KewoJaW50IHRvdGFsX25vX2Nhc2VzLG51bV9kYXRhLHByaW1lX2xpc3RbXTsKCWJvb2xlYW4gcHJpbWVfbnVtW109bmV3IGJvb2xlYW5bMTAxXTsKCXByaW1lX2xpc3Q9bmV3IGludFszMF07CglBcnJheXMuZmlsbChwcmltZV9udW0sIEJvb2xlYW4uRkFMU0UpOwoJQnVmZmVyZWRSZWFkZXIgYnIgPSBuZXcgQnVmZmVyZWRSZWFkZXIobmV3IElucHV0U3RyZWFtUmVhZGVyKFN5c3RlbS5pbikpOwoJdG90YWxfbm9fY2FzZXM9SW50ZWdlci5wYXJzZUludChici5yZWFkTGluZSgpKTsKCQoJLy9GaW5kIGFsbCB0aGUgcHJpbWUgbnVtYmVyJ3MgYi93IDEtMTAwLi4KCWludCBjb3VudD0wOwoJcHJpbWVfbnVtWzBdPXByaW1lX251bVsxXT10cnVlOwoJZm9yKGludCBpPTI7aTw9MTAwO2krKykKCXsKCQlpZighcHJpbWVfbnVtW2ldKQoJCXsKCQkJZm9yKGludCBqPWk7ajw9MTAwO2o9aitpKQoJCQl7CgkJCWlmKCFwcmltZV9udW1bal0pCgkJCXsKCQkJCXByaW1lX251bVtqXT10cnVlOwoJCQl9CgkJCX0KCQkJCgkJCXByaW1lX2xpc3RbY291bnRdPWk7CgkJCSsrY291bnQ7CgkJfQoJCQoJfQoJcHJpbWVfbGlzdFtjb3VudF09LTE7Cglmb3IgKGludCBpPTA7aTx0b3RhbF9ub19jYXNlcztpKyspCgl7CgkJQmlnSW50ZWdlciByZXNfcHJpbnQ9QmlnSW50ZWdlci5PTkU7CgkJbnVtX2RhdGE9SW50ZWdlci5wYXJzZUludChici5yZWFkTGluZSgpKTsKCQlpbnQgaW5jcj0wOwoJCXdoaWxlKHByaW1lX2xpc3RbaW5jcl08PW51bV9kYXRhfHxwcmltZV9saXN0W2luY3JdPT0tMSkKCQl7CgkJCS8vRkluZCB0aGUgZXhwb25lbnQgb2YgdGhlIHByaW1lIG51bWJlci4uCgkJCQoJCQlpbnQgZXhwPW11bHRpcGxpY2l0eShudW1fZGF0YSxwcmltZV9saXN0W2luY3JdKTsKCQkJZG91YmxlIHAxPURvdWJsZS5wYXJzZURvdWJsZShTdHJpbmcudmFsdWVPZihwcmltZV9saXN0W2luY3JdKSk7CgkJCWRvdWJsZSBwMj1Eb3VibGUucGFyc2VEb3VibGUoU3RyaW5nLnZhbHVlT2YoZXhwKSk7CgkJCQoJCQlsb25nIHRlbXA9KGxvbmcpTWF0aC5wb3cocDEscDIpOwoJCQlyZXNfcHJpbnQ9cmVzX3ByaW50Lm11bHRpcGx5KEJpZ0ludGVnZXIudmFsdWVPZih0ZW1wKSk7CgkJCQoJCQlpbmNyKys7CgkJfQoJCQoJCVN5c3RlbS5vdXQucHJpbnRsbihyZXNfcHJpbnQpOwoJfQp9Cn0=
-
upload with new input
-
result: Success time: 0.08s memory: 212416 kB returned value: 0
4 1 2 5 3
1 2 120 6



