CPP-CODES/array_modification.cpp at master · SourinKar/CPP-CODES · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include<bits/stdc++.h>
using namespace std;
int main()
{
  int t;
  cin>>t;
  while(t--)
  {
    long long int n,k;
    cin>>n>>k;
    long int *a=new long int[n];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    //long int *b=new long int[k];
    int y=k%(n*3);

        if(n%2!=0)
        {
            if(k>n/2)
            {
                a[(n/2)]=0;
            for(int i=0;i<y;i++)
                {
                long int A,B;
                A=a[i%n];
                B=a[n-(i%n)-1];
        //cout<<i%n<<" ";
                a[i%n]=A^B;
        //cout<<a[i];
       // cout<<"\n";

                }
            }
            else
            {
                for(int i=0;i<y;i++)
                {
                long int A,B;
                A=a[i%n];
                B=a[n-(i%n)-1];
        //cout<<i%n<<" ";
                a[i%n]=A^B;
        //cout<<a[i];
       // cout<<"\n";

                }
        }
        }
        else{
        for(int i=0;i<y;i++)
    {
        long int A,B;
        A=a[i%n];
        B=a[n-(i%n)-1];
        //cout<<i%n<<" ";
        a[i%n]=A^B;
        //cout<<a[i];
       // cout<<"\n";
    }
    }


//    cout<<"for k="<<k<<"and i ="<<;
    for(int l=0;l<n;l++)
    {
        cout<<a[l]<<" ";
    }cout<<"\n";

  }
  return 0;
}