4 solutions

  • 1
    @ 2025-1-21 9:50:05
    #include<bits/stdc++.h>
    using namespace std;
    const int N=25;
    int a[N];
    int main()
    {
    		string a;
    		char n;
    		cin>>a>>n;
    	
    			while(a.find(n)!=-1) 
    			{
    				a.erase(a.find(n),1);
    			}
    			cout<<a;
    	return 0;
    }
    
    • 1
      @ 2024-9-11 20:09:47
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
      	string n;
      	char e;
      	cin>>n;
      	cin>>e;
      	for(int i=0;i<n.size();i++)
      	{
      		if(n[i]==e)
      		{
      			n.erase(i,1);
      			i--;
      		}
      	}
      	cout<<n;
      	return 0;
      }
      
      
      
      • 0
        @ 2024-8-17 15:48:17
        
        #include<bits/stdc++.h>
        using namespace std;
        const int N=25;
        int a[N];
        int main()
        {
        		string a;
        		char n;
        		cin>>a>>n;
        	
        			while(a.find(n)!=-1) 
        			{
        				a.erase(a.find(n),1);
        			}
        			cout<<a;
        	return 0;
        }
        
        
        • -1
          @ 2024-12-15 15:56:08
          #include<bits/stdc++.h>
          using namespace std;
          int main()
          {
          	string n;
          	char e;
          	cin>>n;
          	cin>>e;
          	for(int i=0;i<n.size();i++)
          	{
          		if(n[i]==e)
          		{
          			n.erase(i,1);
          			i--;
          		}
          	}
          	cout<<n;
              return 0;
          }
          • 1

          Information

          ID
          104
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          1
          Tags
          (None)
          # Submissions
          33
          Accepted
          16
          Uploaded By