All about programming, algorithms and data structures!

#include <iostream> #include <cmath> using namespace std ; long long fun ( long long n ) { if ( n % 2 == 0 ) return n / 2 ; else return - n + fun ( n - 1 ); } int main () { long long n , sum = 0 ; cin >> n ; cout << fun ( n ); return 0 ; }

#include <iostream> using namespace std ; int main () { int k , l , m , n ; long d , count = 0 ; cin >> k >> l >> m >> n >> d ; for ( long i = 1 ; i <= d ; i ++) { if ( i % k != 0 and i % l != 0 and i % m != 0 and i % n != 0 ) count ++; } cout << d - count ; return 0 ; }

#include <iostream> using namespace std ; int main () { long long n , k ; cin >> n >> k ; long long t =( n + 1 )/ 2 ; if ( k <= t ) cout << 2 * k - 1 ; else cout <<( k - t )* 2 ; return 0 ; }

#include < bits / stdc ++. h > using namespace std ; int main () { string str ; getline ( cin , str ); int index = str . find ( "WUB" ); int count = 0 ; while ( index !=- 1 ) { str . replace ( index , 3 , " " ); //str.erase(str.begin()+index,str.begin()+index+3); index = str . find ( "WUB" ); } cout << str ; return 0 ; }

#include < bits / stdc ++. h > using namespace std ; int main () { long n ; string str ; cin >> n ; cin >> str ; long count = 0 , index ; index = str . find ( "A" ); while ( index !=- 1 ) { count ++; str . erase ( str . begin ()+ index , str . begin ()+ index + 1 ); index = str . find ( "A" ); } if ( count > n - count ) cout << "Anton" ; else if ( count < n - count ) cout << "Danik" ; else cout << "Friendship" ; return 0 ; }

#include < bits / stdc ++. h > using namespace std ; void fun ( long long n , int count ) { if ( n == 1 ) cout << count << endl ; else if ( n % 2 != 0 and n % 3 != 0 and n % 5 != 0 ) cout << "-1" << endl ; if ( n % 5 == 0 ) { n =( 4 * n )/ 5 ; count ++; fun ( n , count ); } else if ( n % 3 == 0 ) { n =( 2 * n )/ 3 ; count ++; fun ( n , count ); } else if ( n % 2 == 0 ) { n = n / 2 ; count ++; fun ( n , count ); } } int main () { int q ; cin >> q ; for ( int i = 1 ; i <= q ; i ++) { long long x ; cin >> x ; fun ( x , 0 ); } return 0 ; }

#include < bits / stdc ++. h > using namespace std ; int main () { int t ; cin >> t ; for ( int i = 1 ; i <= t ; i ++) { int count [ 3 ]={ 0 }; int n ; cin >> n ; for ( int j = 0 ; j < n ; j ++) { long x ; cin >> x ; count [ x % 3 ]++; } int result = count [ 0 ]; int t = min ( count [ 1 ], count [ 2 ]); result += t ; count [ 1 ]-= t ; count [ 2 ]-= t ; result +=( count [ 1 ]+ count [ 2 ])/ 3 ; cout << result << endl ; } return 0 ; }