# Geeksforgeeks Solution For " 1's Complement "

GeeksforGeeks Solution For School Domain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard .You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers

Problem :- Given an N bit binary number, find the 1's complement of the number. The ones' complement of a binary number is defined as the value obtained by inverting all the bits in the binary representation of the number (swapping 0s for 1s and vice versa).

Input:

The first line of input takes the number of test cases, T. Then T test cases follow. The first line of each test case takes the number of bits, N. The second line of each test case takes N space separated integers denoting the N bits of the binary number.

Output:

Print the 1's complement for each test case in a new line.

Solution :-

#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,i,j,sum,res=0;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
for(i=0;i<n;i++)
{
if(arr[i]==1)
cout<<"0 ";
else
cout<<"1 ";
}
cout<<endl;
}
return 0;

}

Output:-