codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

588B.md (1325B)


      1 Source: https://codeforces.com/problemset/problem/588/B
      2 
      3 B. Duff in Love
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Duff is in love with lovely numbers! A positive integer *x* is called lovely if and only if there is no such positive integer *a* > 1 such that *a*2 is a divisor of *x*.
     22 
     23  ![](https://espresso.codeforces.com/6062108835fa75c4a9dcd23f62abdbfe92f937fa.png) 
     24 
     25 Malek has a number store! In his store, he has only divisors of positive integer *n* (and he has all of them). As a birthday present, Malek wants to give her a lovely number from his store. He wants this number to be as big as possible.
     26 
     27 Malek always had issues in math, so he asked for your help. Please tell him what is the biggest lovely number in his store.
     28 
     29 Input
     30 
     31 The first and only line of input contains one integer, *n* (1 ≤ *n* ≤ 1012).
     32 
     33 Output
     34 
     35 Print the answer in one line.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 10
     43 ```
     44 
     45 Output
     46 
     47 ```
     48 10
     49 ```
     50 
     51 Input
     52 
     53 ```
     54 12
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 6
     61 ```
     62 
     63 Note
     64 
     65 In first sample case, there are numbers 1, 2, 5 and 10 in the shop. 10 isn't divisible by any perfect square, so 10 is lovely.
     66 
     67 In second sample case, there are numbers 1, 2, 3, 4, 6 and 12 in the shop. 12 is divisible by 4 = 22, so 12 is not lovely, while 6 is indeed lovely.