fork download
copy 
  1. #include <bits/stdc++.h>
  2. //#include <ext/pb_ds/assoc_container.hpp>
  3. //#include <ext/pb_ds/tree_policy.hpp>
  4. #define mp				make_pair
  5. #define pb				push_back
  6. #define all(a)			(a).begin(), (a).end()
  7. #define sz(a)			a.size()
  8. #define srt(a)			sort(all(a))
  9. #define mem(a, h)		memset(a, (h), sizeof(a))
  10. #define f 				first
  11. #define s 				second
  12. #define fore(i, b, e)	for(int i = b; i < e; i++)
  13. #define forg(i, b, e, m)	for(int i = b; i < e; i+=m)
  14. //int in(){int r=0,c;for(c=getchar();c<=32;c=getchar());if(c=='-') return -in();for(;c>32;r=(r<<1)+(r<<3)+c-'0',c=getchar());return r;}
  15.  
  16. using namespace std;
  17. //using namespace __gnu_pbds;
  18.  
  19. typedef long long 		ll;
  20. typedef unsigned long long 		ull;
  21. typedef pair<int, int>  ii;
  22. typedef vector<int>     vi;
  23. typedef vector<ii>      vii;
  24. typedef vector<ll>      vll;
  25. //typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
  26. //find_by_order kth largest  order_of_key <
  27. const int tam = 100010;
  28. const int MOD = 1e9+7;
  29. const int MOD1 = 988244535;
  30. const double EPS = 1e-9;
  31. const double PI = acos(-1);
  32. int cribi[100010];
  33. int has[100010];
  34. int main()
  35. {
  36. 	ios::sync_with_stdio(0); cin.tie(0);
  37. 	//freopen("qwe.txt", "r", stdin);
  38. 	//freopen("asd.txt", "w", stdout);
  39.     int n = 1;
  40.     cin>>n;
  41.     string s = "YYYyYYYYyyYYYYYyyyYYYYY", ax;
  42.     fore(i, 0, n / 2 - !(n&1))
  43.         cout<<'Y';
  44.     cout<<'y';
  45.     fore(i, 0, n / 2)
  46.         cout<<'Y';
  47.     cout<<'\n';
  48. 	return 0;
  49. }
  50. // read the question correctly (is y a vowel? what are the exact constraints?)
  51. // look out for SPECIAL CASES (n=1?) and overflow (ll vs int?) ARRAY OUT OF BOUNDSS2
Success #stdin #stdout 0s 4584KB
comments (?)
stdin
copy 
4
stdout
copy 
YyYY
https://ideone.com/g3uyFD
language:
C++ (gcc 8.3)
created:
4 years 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!