770A - New Password - CodeForces Solution


*special problem implementation *800

Please click on ads to support us..

Python Code:

from math import ceil
n, k = list(map(int, input().split()))
a = 'qwertyuiopasdfghjklzxcvbnm'
b = a[:k]*(ceil(n / k))
print(b[:n])

C++ Code:

#include <iostream>

using namespace std; 
int main() {
	int n, k;
	cin >> n >> k;
	char A[26] = { 'a', 'b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z' };
	string s = "";
	
	for (int i = 0; i < k; i++) {
		s = s + A[i];
	}
	int z = n - k;
	int x = k - 1;
	int a = rand()%k;
	a--;
	while (z > 0) {
		
		while (s[x] == A[a]) {
			if (a >= k-1)//
				a--;//
			else//
				a++;//
		}
		x++;
	
		s = s + A[a];
		z--;
	}

	cout << s << endl;
}
 


Comments

Submit
0 Comments
More Questions

368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor