done

Author: Hard-Coder05

CF1.cpp

@@ -16,31 +16,6 @@ using namespace std;
 using i64 = long long;
 using u64 = unsigned long long;
 using u32 = unsigned;
-string updateString(string S,  
-                    string A, string B) 
-{   int l = A.length(); 
-    for (int i = 0; i + l <= S.length(); i++) 
-    { 
-        string curr = S.substr(i, i + l); 
-        if (curr == A)  
-        { 
-            string new_string = ""; 
-            new_string += S.substr(0, i) + B +  
-                          S.substr(i + l, S.length()); 
-            S = new_string; 
-            i += l - 1; 
-        } 
-        else
-        { 
-            string new_string = ""; 
-            new_string += S.substr(0, i) + A +  
-                          S.substr(i + l, S.length()); 
-            S = new_string; 
-            i += l - 1; 
-        } 
-    } 
-    return S; 
-}
 int main() {
 	FIO;
 #ifndef ONLINE_JUDGE
@@ -49,44 +24,24 @@ int main() {
 #endif
 	int tc;
 	cin >> tc;
+	map<string,int> mp;
 	while (tc--) {
-		int n;
-		cin >> n;
-		string s;
-		cin>>s;
-		char c;
-		cout<<"1";
-		if(s[0]=='0')
-		c='1';
-		else
-		c='2';
-		for(int i=1;i<n;i++){
-			if(s[i]=='1'){
-				if(c=='2'){
-					cout<<'0';
-					c='1';
-				}
-				else{
-					cout<<'1';
-					c='2';
-				}
-			}
-			else{
-				if(c=='2'){
-					cout<<'1';
-					c='1';
-				}
-				else if(c=='1'){
-					cout<<'0';
-					c='0';
-				}
-				else{
-					cout<<'1';
-					c='1';
-				}
-			}
+		int n,l; 
+		cin>>n>>l;
+		set<int> s;
+		for(int i=0;i<n;i++){
+			int x;
+			cin>>x;
+			s.insert(x);
+		}
+		double maxm=0;
+		int curr=0;
+		for(auto i:s){
+			maxm=max((double)(i-curr)/2,maxm);
+			curr=i;
 		}
-		cout<<endl;
-		
+		maxm=max(maxm,l-curr);
+		maxm=max(maxm,*s.begin());
+		cout<<fixed<<setprecision(10)<<maxm<<endl;
 	}
 }

CF1.exe

@@ -16,32 +16,6 @@ using namespace std;
 using i64 = long long;
 using u64 = unsigned long long;
 using u32 = unsigned;
-bool isPrime(int n)  
-{  
-    if (n <= 1)  return false;  
-    if (n <= 3)  return true;  
-    if (n%2 == 0 || n%3 == 0) return false;  
-    
-    for (int i=5; i*i<=n; i=i+6)  
-        if (n%i == 0 || n%(i+2) == 0)  
-           return false;  
-    
-    return true;  
-}  
-int nextPrime(int N) 
-{ 
-    if (N <= 1) 
-        return 2; 
-    int prime = N; 
-    bool found = false; 
-    while (!found) { 
-        prime++; 
-  
-        if (isPrime(prime)) 
-            found = true; 
-    } 
-    return prime; 
-}
 int main() {
 	FIO;
 #ifndef ONLINE_JUDGE
@@ -53,8 +27,5 @@ int main() {
 	while (tc--) {
 		int n;
 		cin >> n;
-		int a=nextPrime(1+n);
-		int b=nextPrime(a+n);
-		cout<<a*b<<endl;
 	}
 }

CF2.cpp

@@ -1,11 +1,2 @@
-5
-1
-0
-3
-011
-3
-110
-6
-111000
-6
-001011
+1 7 15
+15 5 3 7 9 14 0

input.txt

@@ -1,5 +1 @@
-1
-110
-100
-101101
-101110
+2.5000000000