fork download
copy 
  1. #include <bits/stdc++.h>
  2. #define int long long
  3. #define SORT(c) sort(begin(c), end(c))
  4. #define rSORT(c) sort(rbegin(c), rend(c))
  5. #define rsort(c,n) sort(a,a+n,greater<int>())
  6. #define f first
  7. #define s second
  8. #define pb push_back
  9. //#define endl "\n"
  10. #define yes cout << "YES\n"
  11. #define no cout << "NO\n"
  12. #define oo LLONG_MAX
  13. #define vec vector <int>
  14.  
  15. using namespace std;
  16. void solve();
  17.  
  18. vector <int> prime;
  19. void sieve(int n) {
  20.     vector<bool> isPrime(n + 1, true);
  21.     isPrime[0] = isPrime[1] = false;
  22.     for (int p = 2; p * p <= n; p++)
  23.         if (isPrime[p])
  24.             for (int i = p * p; i <= n; i += p)
  25.                 isPrime[i] = false;
  26.  
  27.     for (int i = 2; i <= n; i++) {
  28.         if (isPrime[i]) {
  29.             prime.pb(i);
  30.             //cout<<i<<endl;
  31.         }
  32.     }
  33. }
  34.  
  35. set<int> divisors;
  36. void Divisors(int n) {
  37.     for (int i = 1; i * i <= n; ++i)
  38.         if (n % i == 0) {
  39.             divisors.insert(i);
  40.             if (i != n / i)
  41.                 divisors.insert(n / i);
  42.         }
  43. }
  44.  
  45. vector <int> factors;
  46. int numberOfPrimeFactors(int n) {
  47.     set <int> s;
  48.     for (int i = 2; i * i <= n; i++) {
  49.         if (n % i == 0)
  50.             s.insert(i);
  51.         while (n % i == 0) {
  52.             factors.pb(i);
  53.             n /= i;
  54.         }
  55.     }
  56.     if (n > 1) {
  57.         s.insert(n);
  58.         factors.pb(n);
  59.     }
  60.     return factors.size();
  61. }
  62.  
  63.  
  64. void rec(int n){
  65.     if(n==0)
  66.         return;
  67.     cout<<"I love Recursion\n";
  68.     rec(n-1);
  69. }
  70.  
  71.  
  72.  
  73. int32_t main() {
  74. #ifndef ONLINE_JUDGE
  75.     freopen("input1.txt", "r", stdin);
  76.     freopen("output1.txt", "w", stdout);
  77. #endif
  78.     ios::sync_with_stdio(false); cin.tie(0); int t = 1; int i = 1;
  79.  
  80.     //cin >> t;
  81.     int n = 1;
  82.     while (t--) {
  83.         // cout<<"Case #"<<n<<": ";
  84.         solve();
  85.         n++;
  86.     }
  87.  
  88.     return 0;
  89. }
  90.  
  91.  
  92. void solve() {
  93.     int n;
  94.     cin>>n;
  95.     rec(n);
  96. }
Success #stdin #stdout 0s 5280KB
comments (?)
stdin
copy 
3
stdout
copy 
I love Recursion
I love Recursion
I love Recursion
https://ideone.com/98ZayF
language:
C++14 (gcc 8.3)
created:
8 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!