Loading...
Submission
# When Author Problem Language CPU Memory
20909 2024-08-10 01:05:39 heisenberg_120 Square Reconstruction C++ 17 25 ms 7328 kb Accepted
Test Cases
# CPU Memory Points
1 25 ms 7304 kb 1 Accepted
2 25 ms 7328 kb 1 Accepted
3 25 ms 7304 kb 1 Accepted
4 25 ms 7220 kb 1 Accepted
5 25 ms 7284 kb 1 Accepted
6 25 ms 7240 kb 1 Accepted
7 25 ms 7312 kb 1 Accepted
8 25 ms 7312 kb 1 Accepted
9 25 ms 7268 kb 1 Accepted
10 25 ms 7244 kb 1 Accepted
Source Code
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define long long long int
  5.  
  6. const int N = 1e6 + 9;
  7. int spf[N];
  8.  
  9. void cal(){
  10. for(int i = 1; i < N; i++)spf[i] = i;
  11. for(int i = 2; i < N; i++){
  12. if(spf[i] == i){
  13. for(int j = i + i; j < N; j += i){
  14. spf[j] = min(spf[j], i);
  15. }
  16. }
  17. }
  18. }
  19.  
  20. signed main(){
  21. ios_base::sync_with_stdio(false);
  22. cin.tie(nullptr);
  23. cal();
  24. int t;
  25. cin >> t;
  26. while(t--){
  27. int n;
  28. cin >> n;
  29. long m = 1;
  30. while(n > 1){
  31. int p = spf[n];
  32. int c = 0;
  33. while(n % p == 0){
  34. c++;
  35. n /= p;
  36. }
  37. if(c & 1)m *= p;
  38. }
  39. cout << m << '\n';
  40. }
  41. return 0;
  42. }
  43.