Codeforces 705A - Hulk Solution

 Solution in C++: 

///**********ALLAH IS ALMIGHTY************///

///AH Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh 

  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int main()
  4. {
  5. long long n,i;
  6. cin>>n;
  7. for ( i=1; i<=n; i++)
  8. {
  9. if(i%2==1)
  10. cout<<"I hate ";
  11. else
  12. {
  13. cout<<"I love ";
  14. }
  15. if(i!=n)
  16. {
  17. cout<<"that ";
  18. }
  19.  
  20. }
  21. cout<<"it";
  22. return 0;
  23. }

2 comments:

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.