codeforces-expression

#include<bits/stdc++.h>
using namespace std;
void check(int a,int b,int c)
{
 int p,q,r,s,t,u;
 p=a*b+c;
 q=a+b*c;
 r=(a+b)*c;
 s=a*b*c;
 t=a*(b+c);
 u=a+b+c;
 cout<<max(p,max(q,max(r,max(s,max(t,u)))));
}
int main()
{
 int a,b,c;
 cin>>a>>b>>c;
 check(a,b,c);
 return 0;
}

Comments

codeforces-Anton and Danik

#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 ; }

Gcd using recursion

#include<iostream> #include<algorithm> using namespace std; int gcd(int m,int n) { if(max(m,n)%min(m,n)==0) { return min(m,n); } else { gcd(max(m,n)%min(m,n),min(m,n)); } } int main() { int m,n; cin>>m>>n; cout<<gcd(m,n); return 0; }

codeforces-divide it solution

#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 ; }

All about programming, algorithms and data structures!

Search This Blog