1 solutions
-
0
C++ :
#include<stdio.h> #include<iostream> using namespace std; int a[111111]; int main() { long long n, i; int T, cnt; scanf("%d", &T); while (T--) { scanf("%lld", &n); cnt = 0; for (i = 2; i*i <= n; ++i) if (n % i == 0) while (n % i == 0) { a[++cnt] = i; //printf("%d\n", i); n /= i; }//puts(""); if (n != 1) a[++cnt] = n; if (cnt < 2) printf("M\n0\n"); else if (cnt == 2) printf("H\n"); else printf("M\n%d\n", a[2] * a[1]); } return 0; }
- 1
Information
- ID
- 18095
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By