CODECHEF::DECINC

-

 

#include <bits/stdc++.h>
using namespace std ;

int main (){
    int n ;
    cin >> n ;
    if (n%4 == 0){
        n++;
    }
    else{
        n--;
    }
    cout << n << '\n';


    return 0 ;
}

Comments

  1. AnonymousApril 11, 2022 at 4:36 PM

    Mysuru Casino - The HERZAMMAN
    Mysuru https://febcasino.com/review/merit-casino/ Casino - The Home of the Best of the Slots! Visit 메이피로출장마사지 us to Play the best slots and 출장마사지 enjoy the best table games in our sol.edu.kg casino. Visit us herzamanindir

    ReplyDelete

Post a Comment

Popular posts from this blog

CodeChef::CSUB

-
  #include   <bits/stdc++.h> using  namespace   std  ; #define   boost   ios :: sync_with_stdio ( 0 ); cin . tie ( 0 ) #define   ll  long long  int   main  (){      boost  ;      ll   t  ;      cin   >>   t  ;      while  ( t --)     {        ll   n  ;        cin   >>   n  ;        string   seq  ;        cin   >>   seq  ;        ll   count { 0 };        for  ( int   i  =  0 ;  i  <  seq . size ();  i ++){            if  ( seq [ i ]  ==...
Read more

Atcoder Educational Dp contest :: C vacation

-
  #include <bits/stdc++.h> using namespace std ; #define ll long long int const inf = 1e9 + 5 ; int const mod = 1e9 + 7 ; int main (){ ll n ; cin >> n ; ll a[n] , b[n] , c[n] ; for ( ll i= 0 ; i<n ; i++)cin >> a[i] >> b[i] >> c[i] ; ll dp[n][ 3 ] ; //base case dp[ 0 ][ 0 ] = a[ 0 ] ; dp[ 0 ][ 1 ] = b[ 0 ] ; dp[ 0 ][ 2 ] = c[ 0 ] ; //recursive case for ( ll i= 1 ; i<n ; i++){ dp[i][ 0 ] = a[i] + max(dp[i- 1 ][ 1 ] , dp[i- 1 ][ 2 ]) ; dp[i][ 1 ] = b[i] + max(dp[i- 1 ][ 0 ] , dp[i- 1 ][ 2 ]) ; dp[i][ 2 ] = c[i] + max(dp[i- 1 ][ 0 ] , dp[i- 1 ][ 1 ]) ; } cout << max({dp[n- 1 ][ 0 ] , dp[n- 1 ][ 1 ] , dp[n- 1 ][ 2 ]}) ; return 0 ; }
Read more

How Recursion Works?

-
  #include <bits/stdc++.h> using namespace std ; int fact ( int n){ //1st step Base Case if (n== 0 ){ return 1 ; } int smallans = fact(n- 1 ) ; // 2nd step Assumption Recursive Case int ans = n*smallans ; //3rd step Calculation return ans ; } int main (){ int n ; cin >> n ; cout << fact(n) << ' \n ' ; return 0 ; }
Read more