largest subarray of 0s and 1s

Author: anishsingh20

C-practice/Complex Declarations/complex2.c

@@ -7,19 +7,23 @@ typedef int i;
 
 int main()
 {
+	
 	v fun(i,i);
 
 	fun(4,3);
 
 	return 0;
-}
-
 
-v fun(i a,i b)
-{
-	i s = 3; //here i is the type int
-	float i;//i is a variable here
-	printf("%d\n",sizeof(i)); //prints size of a float i
 
-	printf("%d",a*b*s);
 }
+
+
+//v fun(i a,i b)
+//{
+//	
+//	 i s = 3; //here i is the type int
+//	float i;//i is a variable here
+//	printf("%d\n",sizeof(i)); //prints size of a float i
+//	
+//	printf("%d",a*b*s);
+//}

Dynamic Programming/LongestPalindromicSubstring.cpp

@@ -1,6 +1,6 @@
 #include<iostream>
 #include<string.h>
-
+#include<cstdlib>
 
 using namespace std;
 
@@ -109,10 +109,12 @@ string PrintLongestPalindromicSubstring(string a)
 
 int main()
 {
-	string s = "civilwartestingwhetherthatnaptionoranynartionsoconceivedandsodedicatedcanlongendureWeareqmetonagreatbattlefiemldoftzhatwarWehavecometodedicpateaportionofthatfieldasafinalrestingplaceforthosewhoheregavetheirlivesthatthatnationmightliveItisaltogetherfangandproperthatweshoulddothisButinalargersensewecannotdedicatewecannotconsecratewecannothallowthisgroundThebravelmenlivinganddeadwhostruggledherehaveconsecrateditfaraboveourpoorponwertoaddordetractTgheworldadswfilllittlenotlenorlongrememberwhatwesayherebutitcanneverforgetwhattheydidhereItisforusthelivingrathertobededicatedheretotheulnfinishedworkwhichtheywhofoughtherehavethusfarsonoblyadvancedItisratherforustobeherededicatedtothegreattdafskremainingbeforeusthatfromthesehonoreddeadwetakeincreaseddevotiontothatcauseforwhichtheygavethelastpfullmeasureofdevotionthatweherehighlyresolvethatthesedeadshallnothavediedinvainthatthisnationunsderGodshallhaveanewbirthoffreedomandthatgovernmentofthepeoplebythepeopleforthepeopleshallnotperishfromtheearth";
-	cout<<PrintLongestPalindromicSubstring(s);
-	cout<<endl;
-	cout<<LPS_DP(s);
+//	string s = "civilwartestingwhetherthatnaptionoranynartionsoconceivedandsodedicatedcanlongendureWeareqmetonagreatbattlefiemldoftzhatwarWehavecometodedicpateaportionofthatfieldasafinalrestingplaceforthosewhoheregavetheirlivesthatthatnationmightliveItisaltogetherfangandproperthatweshoulddothisButinalargersensewecannotdedicatewecannotconsecratewecannothallowthisgroundThebravelmenlivinganddeadwhostruggledherehaveconsecrateditfaraboveourpoorponwertoaddordetractTgheworldadswfilllittlenotlenorlongrememberwhatwesayherebutitcanneverforgetwhattheydidhereItisforusthelivingrathertobededicatedheretotheulnfinishedworkwhichtheywhofoughtherehavethusfarsonoblyadvancedItisratherforustobeherededicatedtothegreattdafskremainingbeforeusthatfromthesehonoreddeadwetakeincreaseddevotiontothatcauseforwhichtheygavethelastpfullmeasureofdevotionthatweherehighlyresolvethatthesedeadshallnothavediedinvainthatthisnationunsderGodshallhaveanewbirthoffreedomandthatgovernmentofthepeoplebythepeopleforthepeopleshallnotperishfromtheearth";
+//	cout<<PrintLongestPalindromicSubstring(s);
+//	cout<<endl;
+//	cout<<LPS_DP(s);
+	
+	
 
 
 	return 0;

Dynamic Programming/PrintingTheLCS.cpp

@@ -33,7 +33,7 @@ void PrintLCS(string &a,string &b,int m,int n)
 	//getting the length of LCS
 	//making the array to store the common letters
 	string LCS(LCSlen+1,'\0');
-
+NULL
 
 	int i = m , j = n;
 

PreProcessors in CPP/ConditionCompilationMacros.cpp

@@ -4,14 +4,15 @@ using namespace std;
 //CONDITIONAL COMPILATION MACROS
 
 #define WIN 1
-#define LIN 2
+#define LIN 1
 #define MAC 3
 
 
  #define OS MAC
 int main()
 {
 
+		
 	#if OS == WIN
 		cout<<"Windows OS macro"<<endl;
 
@@ -21,8 +22,8 @@ int main()
 	#else
 		cout<<"MAC OS macro"<<endl;
 
-	
-	#endif
+	#endif	
+
 
 	return 0;
 }