XOR RoundsProblem code: RESN02 |
All submissions for this problem are available.
You are given a cyclic array A having N numbers. In an XOR round, each element of the array A is replaced by the bitwise XOR (Exclusive OR) of itself, the previous element, and the next element in the array. All operations take place simultaneously. Can you calculate A after K such XOR rounds ?
Input
The first line contains the number of test cases T (T <= 50). There follow 2T lines, 2 per test case. The first line contains two space seperated integers N (3 <= N <= 500) and K (1 <= K <= 1000000000). The next line contains N space seperated integers Ai (0 <= Ai <= 1000000000), which are the initial values of the elements in array A.
Output
Output T lines, one per test case. For each test case, output a space seperated list of N integers, specifying the contents of array A after K XOR rounds.
Example
Input: 2 3 1 1 2 3 5 100 1 11 111 1111 11111 Output: 0 0 0 11117 101 1075 12127 12081
| Date: | 2009-12-16 |
| Time limit: | 15s |
| Source limit: | 50000 |
| Languages: | C C99 strict C++ 4.0.0-8 C++ 4.3.2 PAS gpc PAS fpc JAVA NICE JAR C# C#2 NEM ST ASM D FORT ADA BASH PERL PYTH RUBY LUA ICON PIKE PHP SCM guile SCM qobi LISP sbcl LISP clisp SCALA HASK ERL CAML CLPS PRLG WSPC BF ICK JS |
Comments
SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:
HELP
Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:
- Accepted
Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark. - Time Limit Exceeded
Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach. - Wrong Answer
Your program compiled and ran succesfully but the output did not match the expected output. - Runtime Error
Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section. - Compilation Error
Your code was unable to compile. When you see this icon, click on it for more information.
If you are still having problems, see a sample solution here.

Fetching successful submissions

This was a nice one :D
This was a nice one :D
am getting time limit
am getting time limit exceeded for my python soln (the sample inputs are running successfully locally)
could anybody give suggestions for improving the time
here is my soln
import copy
def solve():
b1=raw_input().split()
b=int(b1[0])
c=int(b1[1])
d=[]
d=raw_input().split()
for i in range(b):
d[i]=int(d[i])
q2=c
while q2>0:
templist=copy.deepcopy(d)
for s in range(b):
if s==b-1:
d[s]=templist[s]^templist[s-1]^templist[0]
else:
d[s]=templist[s]^templist[s-1]^templist[s+1]
q2=q2-1
for t1, t2 in enumerate(d):
print t2,
print
a=int(raw_input())
for i in range(a):
solve()
my email address is
my email address is anandghegde@gmail.com
jacksparrow007, Results in
can someone tell me how can i