fork(1) download
copy 
  1. /*`````````````````````````````````````````````.
  2. .											   .
  3. .	My Lord, increase me in knowledge          .
  4. .                                              .
  5. ...............................................*/
  6.  
  7. #include <bits/stdc++.h>
  8. using namespace std;
  9. #pragma GCC optimize("Ofast,unroll-loops")
  10. #define int long long
  11. #define memset(a, x) memset(a, x, sizeof(a))
  12. #define PI 3.1415926535897932384626433832795l
  13. #define yes cout << "YES" << '\n'
  14. #define no cout << "NO" << '\n'
  15. const int mod = 1e9 + 7;
  16. #define vi vector<int>
  17. #define vtd vector<vector<int>>
  18. #define vp vector<pair<int, int>>
  19. #define pqu priority_queue<int>
  20. #define all(x) x.begin(), x.end()
  21. #define setbit(n) __builtin_popcount(n);
  22.  
  23. bool cmp(pair<int, int> &x, pair<int, int> &y)
  24. {
  25. 	if (x.second != y.second)
  26. 	{
  27. 		return x.second < y.second;
  28. 	}
  29.  
  30. 	return x.first < y.first;
  31. }
  32.  
  33. void input(vector<int> &v)
  34. {
  35. 	for (auto &i : v)
  36. 		cin >> i;
  37. }
  38.  
  39. void printV(vi &v) {
  40. 	for(auto it:v) {
  41. 		cerr<<it<<" ";
  42. 	}
  43. 	cerr<<'\n';
  44. }
  45. void printM(map<int, int>&mp) {
  46. 	for(auto it:mp) {
  47. 		cerr<<it.first<<" -> "<<it.second<<'\n';
  48. 	}
  49. }
  50.  
  51. void PreSum(vector<int> &prefixSum, vector<int> &v, int n)
  52. {
  53. 	prefixSum[0] = 0;
  54. 	for (int i = 1; i <= n; i++)
  55. 	{
  56. 		prefixSum[i] = prefixSum[i - 1] + v[i - 1];
  57. 	}
  58. }
  59.  
  60. void uttor()
  61. {
  62. 	int n; cin>>n;
  63. 	char x = 'a';
  64. 	for(int i = 0; i<n; i++) {
  65. 		cout<<x++;
  66. 		if(x=='z') x = 'a';
  67. 	}
  68. 	cout<<'\n';
  69. }
  70.  
  71. int32_t main()
  72. {
  73. 	ios_base::sync_with_stdio(0);
  74. 	cin.tie(0);
  75. 	cout.tie(0);
  76. 	int tc = 1;
  77. 	//cin >> tc;
  78. 	for (int t = 1; t <= tc; t++)
  79. 	{
  80. 		// cout << "Case #" << t << ": ";
  81. 		uttor();
  82. 	}
  83. 	return 0;
  84. }
  85.  
  86. /*________________________________________________________________________
  87.  
  88.  
  89.  
  90.  
  91.  _______  _______  _______           _           _
  92. (       )(  ___  )(       )|\     /|( (    /|   ( (    /||\     /|
  93. | () () || (   ) || () () || )   ( ||  \  ( |   |  \  ( |( \   / )
  94. | || || || (___) || || || || |   | ||   \ | |   |   \ | | \ (_) /
  95. | |(_)| ||  ___  || |(_)| || |   | || (\ \) |   | (\ \) |  \   /
  96. | |   | || (   ) || |   | || |   | || | \   |   | | \   |   ) (
  97. | )   ( || )   ( || )   ( || (___) || )  \  | _ | )  \  |   | |
  98. |/     \||/     \||/     \|(_______)|/    )_)(_)|/    )_)   \_/
  99.  
  100.  
  101.  
  102.  
  103. .........................................................................*/
  104.  
Success #stdin #stdout 0.01s 5304KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 

	

		
	 
	
	
			

					
			
			
			
			
			
			
			
			

			
			
			
		

	
		
		

			

			                        







			
			

				

	
					
					 https://ideone.com/8oz0E7
					
					
					
					
					

												

												
						
						

					

					
					
					

						
language:

						
C++14 (gcc 8.3)

					

					

						
created:
								
						
30 days ago

					

					

						
visibility:

						

							 public																												
							
							

								
							

						

					

										
										

					
					 Share or Embed source code
					
					
					
					

						
						
						
						
						
						
						
					

					
						
	
	
	
	
					
					
					
					
					 
					
					
					
					 
					
					
					
					
					
					

					

					

					
						
					

					


	
Discover > Sphere Engine API

	
The brand new service which powers Ideone!

	
	
Discover > IDE Widget

    
Widget for compiling and running the source code in a web browser!