4 solutions

  • 5
    @ 2025-1-25 9:06:48
    #include<bits/stdc++.h> 
    using namespace std;
    const int N=100010,M=260;
    char s[N];
    int cnt[M];
    int main() 
    { 
    	cin>>s;
    	int n=strlen(s);
    	for(int i=0;i<n;i++)
    	{
    		char x=s[i];
    		cnt[x]++;
    	}
    	for(int i=0;i<n;i++)
    	{
    		char x=s[i];
    		if(cnt[x]==1)
    		{
    			cout<<x;
    			return 0;
    		}
    	}
    	cout<<"no";
    	return 0; 
    }
    
    • 0
      @ 2026-6-13 14:51:20
      #include<bits/stdc++.h>
      using namespace std;
      const int N=30;
      int a[N];
      int main()
      {
      	string s;
          cin>>s;
          int i;
          for(i=0;i<=s.size();i++){
              int a=s.find(s[i]),b=s.rfind(s[i]);
              if(a==b && a!=-1 && b!=-1) {
                  cout<<s[i];
                  break;
              }
          }
          if(i==s.size()+1) cout<<"no";
      	return 0;
      }
      
      
    • 0
      @ 2026-6-13 14:49:46
      #include<bits/stdc++.h>
      using namespace std;
      const int N=30;
      int a[N];
      int main()
      {
      	string s;
          cin>>s;
          int i;
          for(i=0;i<=s.size();i++){
              a[s[i]-'a']++;
          }
              for(i=0;i<=s.size()-1;i++){
              if(a[s[i]-'a']==1){
                  cout<<s[i];
                  return 0;
              } 
          }
          cout<<"no";
      	return 0;
      }
      
      
      • -3
        @ 2024-11-10 14:39:30
        #include<bits/stdc++.h> 
        using namespace std;
        const int N=100010,M=260;
        char s[N];
        int cnt[M];
        int main() 
        { 
        	cin>>s;
        	int n=strlen(s);
        	for(int i=0;i<n;i++)
        	{
        		char x=s[i];
        		cnt[x]++;
        	}
        	for(int i=0;i<n;i++)
        	{
        		char x=s[i];
        		if(cnt[x]==1)
        		{
        			cout<<x;
        			return 0;
        		}
        	}
        	cout<<"no";
        	return 0; 
        }
        • 1

        Information

        ID
        925
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        1
        Tags
        (None)
        # Submissions
        167
        Accepted
        54
        Uploaded By