Added submission link

Author: hardik-rana02

Problems/Mathematics/Day-01/sol/Hardik Singh Rana/Solution2.cpp

@@ -16,7 +16,14 @@ using namespace std;
 
 const ll MOD = 1e9+7;
 const ll INF = 1e18;
+/*
+We need to count the no of pairs such that their product makes some number's k-th power-this means the product of the two numbers should have
+factors frequency that is divisible by k. For every number first factorize it using spf(also store its factors mod k) and also store how much
+factor more it needs to make the k-th power add this for all numbers.
 
+*/
+
+/* Submission Link: https://codeforces.com/contest/1225/submission/355183203 */
 void solve() {
     int n,k;
     cin>>n>>k;
@@ -68,4 +75,4 @@ int main() {
     //cin >> t;
     while(t--) solve();
     return 0;
-}
+}