fork download
  1. #include<bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4.  
  5. using namespace __gnu_pbds;
  6. using namespace std;
  7. typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
  8. #define ll long long
  9. #define pb push_back
  10. #define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  11. #define yes cout<<"YES"<<endl
  12. #define no cout<<"NO"<<endl
  13. #define vi vector<int>
  14. #define vll vector<long long>
  15. #define mp make_pair
  16. #define SP cout<<fixed<<setprecision(10);
  17. #define rep(i,inval,n) for(int i = inval; i < n; i++)
  18. #define all(x) x.begin(),x.end()
  19. #define N 100005
  20. #define valid(nx,ny) nx>=1 && nx<=row && ny>=1 && ny<=col
  21. const int inf = 1e9 + 10;
  22. const ll INF = 1e18 + 10;
  23. int fx[] = { +1, -1, +0, +0};
  24. int fy[] = { +0, +0, +1, -1};
  25. int mx = 0;
  26. void upore_dekho()
  27. {
  28.  
  29. string ch = "CSTECLUB";
  30. ll n;
  31. cin >> n;
  32. cout << ch[(n-1)%8] << endl;
  33.  
  34.  
  35.  
  36. }
  37.  
  38. int main()
  39. {
  40. IOS;
  41. //freopen("input.txt", "r", stdin);
  42. //freopen("output.txt", "w", stdout);
  43. //freopen("input.txt", "w", stdout);
  44.  
  45. ll t = 1;
  46. //cout << t << "\n";
  47. cin >> t;
  48.  
  49. while (t--)
  50. {
  51. upore_dekho();
  52. }
  53.  
  54. return 0;
  55. }
  56.  
Success #stdin #stdout 0.01s 5532KB
stdin
4
1
10
19
100
stdout
C
S
T
E