Merge pull request #61 from DvnOshin/master

Added Modified Kaprekar Number and Circular Array Rotation

Author: larissalages

Hackerrank/Problem Solving/Circular_Array_Rotation.cpp

@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n,k,q,j,w;
+    cin>>n>>k>>q;
+    int a[n],i,b[n];
+    for(i=0;i<n;i++)
+    {
+        cin>>a[i];
+    }
+    for(i=0;i<n;i++)
+    {
+        b[(i+k)%n]=a[i];
+    }
+    for(i=0;i<q;i++)
+    {
+        int m;
+        cin>>m;
+        cout<<b[m]<<endl;
+    }
+    return 0;
+}

Hackerrank/Problem Solving/Modified_Kaprekar_Number.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() 
+{ 
+long long int p,q,i,j,k,m,s,flag=0; 
+cin>>p>>q;
+for( i=p;i<=q;i++)
+{ 
+int l=0; 
+j=i;
+while(j>0)
+{ 
+  l++;
+  j=j/10;
+}
+k=i*i;
+m = pow(10,l);
+s = k/m + k%m;
+if(s == i)
+{
+    cout<<i<<" ";
+    flag ++;
+}
+}
+if (flag == 0)
+{
+    cout<<"INVALID RANGE";
+}
+return 0;
+}