1025A - Doggo Recoloring - CodeForces Solution


implementation sortings *900

Please click on ads to support us..

Python Code:

ALP = 26
freq = ALP * [0]

size = int(input())
string = str(input())
two = False

for iteration in range(size):
    index = ord(string[iteration]) - ord('a')
    freq[index] += 1
    if freq[index] == 2:
        two = True
        break

output = "No"
if two or size < 2:
    output = "Yes"
print(output)

C++ Code:

#include<bits/stdc++.h>
bool salom(long long x)
{
    for (int i = 2; i <= sqrt(x); i++)
    {
        if (x % i == 0)
        {
            return false;
        }
    }
        return true;
}
using namespace std;
void wrongontest2()
{int a,cnt=0;
	cin>>a;
	string x;
	cin>>x;
	if (a == 1)
	{
		cout << "YES \n";
		return;
	}
	sort(x.begin(),x.end());
	for (int i = 0; i < x.size(); i++)
	{
		if (x[i] == x[i+1])
		{
			cnt ++ ;
		}
	}
	if (cnt == 0)
	{
		cout << "NO \n";
	}
	else
	{
		cout << "YES \n";
	}
}
int main ()
{
    int t=1;
    //cin>>t;
    while(t--)
    {
      wrongontest2();
    }
}


Comments

Submit
0 Comments
More Questions

1006A - Adjacent Replacements
1195C - Basketball Exercise
1206A - Choose Two Numbers
1438B - Valerii Against Everyone
822A - I'm bored with life
9A - Die Roll
1430B - Barrels
279B - Books
1374B - Multiply by 2 divide by 6
1093B - Letters Rearranging
1213C - Book Reading
1468C - Berpizza
1546B - AquaMoon and Stolen String
1353C - Board Moves
902A - Visiting a Friend
299B - Ksusha the Squirrel
1647D - Madoka and the Best School in Russia
1208A - XORinacci
1539B - Love Song
22B - Bargaining Table
1490B - Balanced Remainders
264A - Escape from Stones
1506A - Strange Table
456A - Laptops
855B - Marvolo Gaunt's Ring
1454A - Special Permutation
1359A - Berland Poker
459A - Pashmak and Garden
1327B - Princesses and Princes
1450F - The Struggling Contestant