We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
i actually tried running the code in eclipse, and it is matching the expected output, expect in the last case where it doesnot return the result before enter is pressed, as when the return key is pressed the output becomes fully correct.
here is my code----------------------
import java.io.;
import java.util.;
public class Solution {
public static void main(String[] args) {
Scanner s1=new Scanner(System.in);
int n=s1.nextInt();
int k=s1.nextInt();
int q=s1.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++)
{
a[i]=s1.nextInt();
}
for(int i=0;i<q;i++)
{
int m=s1.nextInt();
System.out.println(a[(n-k+m)%n]);
}
}
I am not concernerd with the working of the solution, the issue is why is it not working in that particular case, what is the issue? because i am facing the same issue in another problem which is Bigger is Greater in the implementation section.
I can't see any problem in your code. And your code is working fine, though i haven't run it on eclipse but i have tried it on an online compiler and it gave me the correct output.
that's because in test case 4 the number of rotations is much bigger than the number of elements of the array.
If you were really executing the rotations, it wouldn't cause any error, but would be very slow, causing errors in other cases (time out). If you use any algorythm that just subtacts the number of rotations from the size of the array, in fact you may try to access elements outside of the array. In case 4 we have an array with 515 elements which is rotated 100000 times. When I try to retrieve the 1st element, the algorythm will try to retriev the element with the index -9485(negative), giving an error of segmentation.
Circular Array Rotation
You are viewing a single comment's thread. Return to all comments →
it is failing for one case when modulo is used, any help?
I don't know why you guys are having problem. I have submitted my solution without any problem.
Anyway if you are having issues than you should upload you code than only i will know what the problem is.
i actually tried running the code in eclipse, and it is matching the expected output, expect in the last case where it doesnot return the result before enter is pressed, as when the return key is pressed the output becomes fully correct.
here is my code----------------------
import java.io.; import java.util.;
public class Solution {
}
Same problem in another solution.
Try this solution it will work
I am not concernerd with the working of the solution, the issue is why is it not working in that particular case, what is the issue? because i am facing the same issue in another problem which is Bigger is Greater in the implementation section.
I can't see any problem in your code. And your code is working fine, though i haven't run it on eclipse but i have tried it on an online compiler and it gave me the correct output.
yes, thats what the problem is , i m not understanding why is it not accepting the solution.
Anyways, Thanks for the help
Do this. Had same issue and it fixed it.
k=k%n; Looking at the test case found that k is pretty large.
thank you
This one is very good but, for the case when k is much more bigger than n it is not working, because an arrayoutofboundException will occure.
maybe this will help
Add one line k=k%n; before second loop start then you'll pass all the test.
Thank you
i got runtime error by using this
same problem
that's because in test case 4 the number of rotations is much bigger than the number of elements of the array. If you were really executing the rotations, it wouldn't cause any error, but would be very slow, causing errors in other cases (time out). If you use any algorythm that just subtacts the number of rotations from the size of the array, in fact you may try to access elements outside of the array. In case 4 we have an array with 515 elements which is rotated 100000 times. When I try to retrieve the 1st element, the algorythm will try to retriev the element with the index -9485(negative), giving an error of segmentation.
What will happen if the rotations(k) arer greater than n. For example
There are 3 number of elements i.e n=3 it performs 96 rotations i.e k=96 and m=0 ?
I posted my code, if u could look at it in the comment section above that would be great!
include
using namespace std; int main() { int n,k,q,temp,i,p; cin>>n>>k>>q; int a[n]; for(i=0;i>a[i]; } while(k>0) { temp=a[n-1]; for(i=n-1;i>=0;i--) { a[i]=a[i-1]; } a[0]=temp; k--; for(i=0;i>p; cout<
}
problem : Terminated due to time out??