Skip to content

Commit 989c3ee

Browse files
Vishal023Vishal023
committed
Searching Contest
1 parent fcc02fd commit 989c3ee

File tree

5 files changed

+268
-2
lines changed

5 files changed

+268
-2
lines changed

‎BitManipulation/ToggleBits.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,8 +4,8 @@
44

55
public class ToggleBits {
66
public static void main(String[] args) {
7-
int num= 8;
8-
int toggle1st = 1;
7+
int num= 5;
8+
int toggle1st = 2;
99
int r = 1 << (toggle1st-1);
1010
System.out.println(num^r);
1111
}

‎Contest/BooleanMatrixProblem.java

Lines changed: 114 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,114 @@
1+
package SummerTrainingGFG.Contest;
2+
3+
import java.io.BufferedReader;
4+
import java.io.IOException;
5+
import java.io.InputStreamReader;
6+
import java.util.ArrayList;
7+
import java.util.StringTokenizer;
8+
9+
/**
10+
* @author Vishal Singh
11+
*/
12+
public class BooleanMatrixProblem {
13+
static class FastReader{
14+
BufferedReader br;
15+
StringTokenizer st;
16+
public FastReader(){
17+
br = new BufferedReader(new InputStreamReader(System.in));
18+
}
19+
String next(){
20+
while (st == null || !st.hasMoreElements()){
21+
try {
22+
st = new StringTokenizer(br.readLine());
23+
} catch (IOException e) {
24+
e.printStackTrace();
25+
}
26+
}
27+
return st.nextToken();
28+
}
29+
String nextLine(){
30+
String str = "";
31+
try {
32+
str = br.readLine();
33+
}catch (IOException e){
34+
e.printStackTrace();
35+
}
36+
return str;
37+
}
38+
int nextInt(){
39+
return Integer.parseInt(next());
40+
}
41+
}
42+
public static void main(String[] args) {
43+
FastReader fr = new FastReader();
44+
int t = fr.nextInt();
45+
while (t-->0){
46+
int m = fr.nextInt();
47+
int n = fr.nextInt();
48+
49+
String string1 = "";
50+
for(int i=0;i<n;i++)
51+
string1 = string1 + "1 ";
52+
53+
String string2 = "";
54+
for(int i=0;i<n;i++)
55+
string2 = string2 + "0 ";
56+
57+
int[][] matrixx = new int[m][n];
58+
59+
int count = 0;
60+
61+
ArrayList<Integer> list = new ArrayList<Integer>();
62+
63+
for(int i=0;i<m;i++)
64+
{
65+
count = 0;
66+
67+
for(int j=0;j<n;j++)
68+
{
69+
matrixx[i][j] = fr.nextInt();
70+
71+
if(matrixx[i][j]==1 && count==0)
72+
{
73+
list.add(j);
74+
count++;
75+
}
76+
}
77+
78+
if(count!=0)
79+
System.out.println(string1);
80+
else
81+
System.out.println(string2);
82+
}
83+
84+
/*int m = fr.nextInt();
85+
int n = fr.nextInt();
86+
int[][] arr = new int[m][n];
87+
for (int i = 0; i < m; i++) {
88+
for (int j = 0; j < n; j++) {
89+
arr[i][j] = fr.nextInt();
90+
}
91+
}
92+
for (int i = 0; i < m; i++) {
93+
boolean flag = false;
94+
for (int j = 0; j < n; j++) {
95+
if (arr[i][j] == 1){
96+
flag = true;
97+
break;
98+
}
99+
}
100+
if (flag) {
101+
for (int j = 0; j < n; j++) {
102+
System.out.print("1 ");
103+
}
104+
}
105+
else {
106+
for (int j = 0; j < n; j++) {
107+
System.out.print("0 ");
108+
}
109+
}
110+
System.out.println(" ");
111+
}*/
112+
}
113+
}
114+
}

‎Contest/ToggleTheMiddle.java

Lines changed: 71 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,71 @@
1+
package SummerTrainingGFG.Contest;
2+
3+
4+
import java.io.BufferedReader;
5+
import java.io.IOException;
6+
import java.io.InputStreamReader;
7+
import java.util.StringTokenizer;
8+
9+
/**
10+
* @author Vishal Singh
11+
*/
12+
public class ToggleTheMiddle {
13+
static class FastReader{
14+
BufferedReader br;
15+
StringTokenizer st;
16+
public FastReader(){
17+
br = new BufferedReader(new InputStreamReader(System.in));
18+
}
19+
String next(){
20+
while (st == null || !st.hasMoreElements()){
21+
try {
22+
st = new StringTokenizer(br.readLine());
23+
} catch (IOException e) {
24+
e.printStackTrace();
25+
}
26+
}
27+
return st.nextToken();
28+
}
29+
String nextLine(){
30+
String str = "";
31+
try {
32+
str = br.readLine();
33+
}catch (IOException e){
34+
e.printStackTrace();
35+
}
36+
return str;
37+
}
38+
int nextInt(){
39+
return Integer.parseInt(next());
40+
}
41+
}
42+
43+
public static void main(String[] args) {
44+
FastReader fr = new FastReader();
45+
int t = fr.nextInt();
46+
while (t-->0){
47+
int n = fr.nextInt();
48+
int temp = n;
49+
n = (int)(Math.log(n)/Math.log(2) + 1);
50+
//System.out.println("N: "+n);
51+
if (n%2 == 0){
52+
int bit1 = (int)(n/2);
53+
int r = 1 << (bit1-1);
54+
temp = temp^r;
55+
n = (int)(Math.log(temp)/Math.log(2) + 1);
56+
int b = bit1+1;
57+
if (n%2 == 0){
58+
r = 1 << (b-1);
59+
}
60+
else {
61+
r = 1 << (b-2);
62+
}
63+
System.out.println(temp^r);
64+
}else {
65+
int bit1 = (int)(n/2)+1;
66+
int r = 1 << (bit1-1);
67+
System.out.println(temp^r);
68+
}
69+
}
70+
}
71+
}

‎Contest/WithoutAdjacent.java

Lines changed: 80 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,80 @@
1+
package SummerTrainingGFG.Contest;
2+
3+
import java.io.BufferedReader;
4+
import java.io.IOException;
5+
import java.io.InputStreamReader;
6+
import java.util.Collection;
7+
import java.util.Collections;
8+
import java.util.StringTokenizer;
9+
10+
/**
11+
* @author Vishal Singh
12+
*/
13+
public class WithoutAdjacent {
14+
static class FastReader{
15+
BufferedReader br;
16+
StringTokenizer st;
17+
public FastReader(){
18+
br = new BufferedReader(new InputStreamReader(System.in));
19+
}
20+
String next(){
21+
while (st == null || !st.hasMoreElements()){
22+
try {
23+
st = new StringTokenizer(br.readLine());
24+
} catch (IOException e) {
25+
e.printStackTrace();
26+
}
27+
}
28+
return st.nextToken();
29+
}
30+
String nextLine(){
31+
String str = "";
32+
try {
33+
str = br.readLine();
34+
}catch (IOException e){
35+
e.printStackTrace();
36+
}
37+
return str;
38+
}
39+
int nextInt(){
40+
return Integer.parseInt(next());
41+
}
42+
}
43+
static int findSubArrayWithMinSum(int[] arr, int i , int j){
44+
int min = Integer.MIN_VALUE;
45+
int maxElement = arr[0];
46+
for (int k = 0; k < j; k++) {
47+
int currSum = arr[k];
48+
maxElement = Math.max(maxElement,arr[k]);
49+
for (int l = k+2; l < j; l+=2) {
50+
currSum+=arr[l];
51+
}
52+
min = Math.max(currSum,min);
53+
}
54+
return Math.max(min,maxElement);
55+
}
56+
public static void main(String[] args) {
57+
FastReader fr = new FastReader();
58+
int t = fr.nextInt();
59+
while (t-->0){
60+
int n = fr.nextInt();
61+
int[] arr = new int[n];
62+
for (int i = 0; i < n; i++) {
63+
arr[i] = fr.nextInt();
64+
}
65+
/* int min = findSubArrayWithMinSum(arr,0,n);
66+
*/
67+
long x = arr[0];
68+
long y = 0;
69+
long res;
70+
71+
for(int i=1;i<n;i++)
72+
{
73+
res = Math.max(x, y);
74+
x = y + arr[i];
75+
y = res;
76+
}
77+
System.out.println((long)Math.max(x,y));
78+
}
79+
}
80+
}

‎Stack/ArrayImplementation.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -11,6 +11,7 @@ static class Stack{
1111
Stack(int size){
1212
this.size = size;
1313
arr = new int[size];
14+
top = -1;
1415
}
1516
void push(int data){
1617
if(top == size){

0 commit comments

Comments
 (0)