Toph - Word Count

#include
using namespace std;

char buff[101];
int main()
{
    map < string , int > tree ;
    while( gets(buff) ) {
        string str = buff;
        stringstream sin(str);
        string token;
        while(sin >> token){
            tree[token]++;
        }
    }
    string ans;
    int i = 0 , k = 0;
    for(map :: iterator it = tree.begin() ; it  != tree.end()  ; it++ , i++ ){
        if((it->second) > k and i != 0){
            k = it->second;
            ans = it->first;
        }
        if (i == 0) k = it->second , ans = it->first;
    }
cout << ans << endl;
    return 0;
}

hackerrank - Equalize the Array

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

int main() {
    int a[101];
    int n , ans = 1,res = 0;
    cin >> n;
     for(int i = 0; i < n ;i++)
          cin >> a[i];
    sort( a,a+n );
    for(int i = 0; i < n-1 ;i++){
        if(a[i] == a[i+1]) ans++;
        else res = max(res,ans) , ans = 1;

    }
    res = max(res,ans);
    cout << n-res << endl;
    return 0;
}

Uri 2129 - Factorial

#include<bits/stdc++.h>

using namespace std;
//last non zero digit any factorial number function
long long fac(int a){
    int f[11] = {1,1,2,6,4,2,2,4,2,8,8};
        // mathematical equation
       // a/10 == odd  fac(a) = 4*fac(a/5)*fac(a%10)
      // a/10 == even  fac(a) = 6*fac(a/5)*fac(a%10)
    if(a < 11) return f[a];
    return ( ( a / 10 ) % 2 == 1?  4 : 6 ) * fac( a / 5 ) * fac ( a % 10 );      
}

int main()
{
    int n , i = 1;
    while(scanf("%d",&n) != EOF){
    printf("Instancia %d\n%d\n\n",i++,( fac(n) ) % 10);
    }
    return 0;
}

Uri 2312 - Medal Table

#include<bits/stdc++.h>

using namespace std;
struct match_records{
            string t_name;
            string t_name_uppercase;
            int g,s,b;

    }team_records[1001];

bool cmp(const match_records &x, const match_records &y)
{
  if(x.g != y.g)
     return x.g > y.g;
  if (x.s != y.s)
    return x.s > y.s;
  if(x.b != y.b)
    return x.b > y.b;

    return x.t_name_uppercase < y.t_name_uppercase;
}

int main()
{
    int n;
    scanf(" %d ", &n);

       for(int i = 0; i < n ;  i++) {
           char s[101];
         scanf("%s", s) ;
         scanf(" %d %d %d", &team_records[i].g,&team_records[i].s,&team_records[i].b);
         team_records[i].t_name = team_records[i].t_name_uppercase = s;
         transform(team_records[i].t_name.begin(),team_records[i].t_name.end(),
                  team_records[i].t_name_uppercase.begin(),:: toupper);
       }
      stable_sort(team_records,team_records+n,cmp);

      for(int i = 0; i < n ; i++) {
        cout << team_records[i].t_name << " " << team_records[i].g << " " << team_records[i].s << " " << team_records[i].b << endl;
      }


    return 0;
}

Uri 2336 - ABC

#include<bits/stdc++.h>

using namespace std;
#define lli long long int
#define mod 1000000007

vector < lli > v ;

lli add(){
    lli an = 1;
     int p  = 1001;
     v.push_back(1);
        while( p > 0 ) {
            an = (an * 26) %  mod ;
            v.push_back( an );
             p-- ;
        }
}
int main()
{
    add();

   string s,s1;
   lli a,b,sum = 0;
    while(cin >> s){
            sum = b = 0;
    int t  = s.size() - 1;
    for(int i = 0; i < s.size() ;i++ , t-- ){
        sum += ((s[i]-'A') * v[t]) % mod;
        sum %= mod;
    }
    cout << sum << endl;
    }
    return 0;
}

Uri 2313 - Which Triangle

#include<bits/stdc++.h>

using namespace std;
 

int main()
{
    int a,b,c;
    string ans = "" ;
    cin >> a >> b >> c ;
    if( a + c > b ){
    if((a != b and b == c) or ( a == c and a != b) or ( a == b and c != b))
        ans = "Valido-Isoceles";
    else if(a == b and a == c)
        ans = "Valido-Equilatero" ;
    else if(a != b and b != c and a != c)
        ans = "Valido-Escaleno";
    }
    else{
        ans = "Invalido";
    }

    if(ans != "Invalido"){
      if( pow(a,2) == pow(b,2) + pow(c,2)
         or pow(b,2) == pow(a,2) + pow(c,2)
         or pow(c,2) == pow(a,2) + pow(b,2) )
         cout << ans << endl << "Retangulo: S" << endl ;
       else
         cout << ans << endl << "Retangulo: N" << endl;
    }
    else
        cout << ans << endl;

    return 0;
}

 

uri 2450 - Matrix Ladder

#include<bits/stdc++.h>

using namespace std;
int main()
{
    int n,i,j,c,m;

    scanf("%d %d",&n,&m);
    int ppp = 0;
    bool bo,ok = true;
    for (i = 0; i < n; i++) {
             int  pp = 0;
             bo = true;
        for (j = 0; j < m; j++) {
             scanf("%d", &c);
             // count how many zero(0) in the row
             if(c ==  0 and bo) pp++;
             else bo = false;
        }
        // check the matrix is ladder matrix or not
        if( i != 0)
            if( (pp > ppp or (pp == ppp and pp == m)) and ok) ppp = pp;
             else{
                ppp = 0;
                ok = false;
             }
        else
            ppp = pp ;
    }
    cout << ((ppp)? "S\n" : "N\n") ;

    return 0;
}

hackerrank - Cut the sticks

#include<bits/stdc++.h>

using namespace std;
int main() {

    int n,k,l,m;
    vector < int > v;
    cin >> n;

    for(int i = 0; i < n ;i++) {
            int u;
            cin >> u;
            v.push_back(u);
    }
    sort(v.begin(),v.end());
    while(true){
        cout << v.size() << endl;
          if(v.size() == 1) break;
        int t = v[0];
        for(int i = 0; i < v.size() ; i++) {
                v[i] -= t;
        }
        for(; v.front() == 0;) {
                  v.erase(v.begin()+ 0);

        }
    }

    return 0;
}

hackerrank - Repeated String

#include<bits/stdc++.h>

using namespace std;
int main()
{
    string a;
    long n,t , c = 0;
    int d ;
    cin >> a >> n;
    t = n/a.size();
    d = n%a.size();
     for(int i = 0; i < a.size()  ; i++)
         if(a[i] == 'a') c++;
      c  *=  t ;
     for(int i = 0 ; i < d ; i++) if(a[i] == 'a')  c++ ;

    cout << c << endl;

    return 0;
}

uri 2486 - C Mais ou Menos?

#include<bits/stdc++.h>
using namespace std;
int vitamin(string s){

    if( s == " suco de laranja" )
        return 120;
    else if (s == " morango fresco" )
        return 85;
    else if (s ==  " mamao")
        return 85;
    else if (s == " goiaba vermelha")
        return 70;
    else if(s == " manga")
        return 56;
    else if(s == " laranja")
        return 50;
     else
        return 34;

}

int main()
{
 int n,m;
    string a;

    while(cin >> n and n){
        int sum = 0;
            while(n--) {
        scanf("%d", &m);

        getline(cin , a);

        sum  +=  (m*(vitamin(a)));

        }

        if(sum >= 110 and sum <= 130)
            cout << sum << " mg" << endl;
        else if (sum > 130)
            cout << "Menos " << sum - 130 << " mg" << endl;
        else
            cout << "Mais " << 110 - sum << " mg" << endl;
    }
    return 0;
}

uri 2479 - Sorting Santa's List of Children

#include<bits/stdc++.h>

using namespace std;
int main()
{
    multiset < string > m_s ;
    multiset < string > :: iterator it ;
    string s;
    char ch ;
    int n,p_i = 0,n_i = 0;
    cin >> n;
    while(n--){
        cin >> ch >> s;
        (ch == '+')? p_i++ : n_i++;
        m_s.insert(s);
    }
    for(it = m_s.begin(); it != m_s.end(); it++)
         cout << *it << endl;
    printf("Se comportaram: %d | Nao se comportaram: %d\n",p_i,n_i);

    return 0;
}

uri 2484 - Abracadabra

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int n,m=0;
    string a;
    while(cin >> a){
        for(int i = 0 ; i < a.size() ; i++) {
            for(int j = 0 ; j < a.size() ; j++) {
                if(j < i)
                    cout << " ";
                else
                  if(j == a.size() - 1)
                    cout << a[j-i];
                  else
                    cout << a[j-i] << " ";
            }
            cout << endl;
        }
     cout << endl;
    }
    return 0;
}

uri 2483 - Merry Christmaaas!

	#include <cstdio>
	#include <vector>
	#include <iostream>
	#include <algorithm>

using namespace std;

int main() {
    int n;
    string s = "Feliz nata";
    cin >> n;
    for(int i = 1;i < n; i++)
         s += 'a';
    cout  << s <<  "l!" << endl;

    return 0;
}

Uva 10903 - Rock-Paper-Scissors Tournament

/*                                                CODEMAN
                                              Arif Khan Nihar
                                Uva 10903 - Rock-Paper-Scissors Tournament
                                             date -> 16/12/2016

                                             */

#include<bits/stdc++.h>

using namespace std;
int main()
{
    //freopen("in.txt","r",stdin);
    int p,m=0,p1,p2,k=0;
    string s1,s2;
    while(cin >> p){
            if(p == 0) break ;
            if(k != 0 ) cout << endl;
        cin >> m;
        m = m*p*(p-1)/2;
        int p_ar[p+2] , p_l[p+2] ;
        float ans ;
        memset(p_ar,0,sizeof p_ar);
        memset(p_l,0,sizeof p_l);
        while(m--){
            cin >> p1 >> s1 >> p2 >> s2;
            if(s1 == "paper" and s2 == "rock") p_ar[p1]+=1,p_l[p2] += 1;
            if(s2 == "paper" and s1 == "rock") p_ar[p2]+=1,p_l[p1] += 1;
            if(s1 == "scissors" and s2 == "paper") p_ar[p1]+=1,p_l[p2] += 1;
            if(s2 == "scissors" and s1 == "paper") p_ar[p2]+=1,p_l[p1] += 1;
            if(s2 == "scissors" and s1 == "rock") p_ar[p1]+=1,p_l[p2] += 1;
            if(s1 == "scissors" and s2 == "rock") p_ar[p2]+=1,p_l[p1] += 1;

        }
        char res;
        for(int i = 1; i<= p ;i++){
            ans = ((float)p_ar[i]/(p_ar[i]+p_l[i]));
            if(p_ar[i] == 0 and p_l[i] == 0)
                cout << '-' << endl;
            else
                cout << fixed << setprecision(3) << ans << endl ;
        }
        k = 1;
    }

    return 0;
}

Uva 1225 - Digit Counting.cpp

#include <bits/stdc++.h>

using namespace std;

int main() {
     int n,m,y = 0, t = 1;
    char s1[10001];
    int ve[10] = {0},x = 1;
    cin >> n;
    while(n--){
        t = 1;
          cin >> m;
        while(t <= m){
            y = t ;
           sprintf(s1 , "%d" ,y);
           int jh = strlen(s1);
           for( int b = 0; b < jh ; b++) ve[s1[b]-48]++;
            t++;
        }
        for(int i = 0; i < 10 ; i++){
            if(i < 9)
            cout << ve[i] << " ";
            else
            cout << ve[i];

            ve[i] = 0;
        }
        cout << endl;
    }
    return 0;
}

Uva - 12289 - One-Two-Three

#include < iostream >
#include < string.h >
using namespace std;

int main() {
  int n,i,j;
  char s1[6];
  cin >> n;
  while(n--){
      cin >> s1;
      if(strlen(s1) == 5){
          cout << "3" << endl;
      } else if((s1[0] == 'o' && s1[1] == 'n') || (s1[0] == 'o' && s1[2] == 'e') || (s1[1] == 'n' && s1[2] == 'e') ){
              cout << "1" << endl;
      } else{
              cout << "2" << endl;
      }
  }
    return 0;
}

Codeforce - 13A. Numbers

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

int main() {
         int n;
          cin >> n;
          int sum = 0,d =0;
           for(int i =2 ;i< n ;i++){
            int t,p;
            t = i;
            p = n;
             
            while(p!=0){
             sum += p%i;
             p/=i;
            }
            d++;
           }
           int g = __gcd(sum,d);

           cout<<sum/g<<'/'<<d/g<<endl;
         
 return 0;
}

Codeforce - B. Anton and Digits

/*                          CODEMAN
                        Arif Khan Nihar
                    Problem -B. Anton and Digits
*/
#include<bits/stdc++.h>
#define long long ll
//#define long int li
using namespace std;

int main()
{
    string s;
    int d2,d3,d5,d6,mi = 5000001,mi2=5000001,sum=0;
    cin>>d2>>d3>>d5>>d6;
     mi = min(d2,min(d5,d6));
     sum += 256*mi;
     d2 -= mi , d5 -= mi, d6 -= mi;
     if(d2 != 0 and d3 != 0){
        mi2 = min(d2,d3);
        sum += 32*mi2;
     }
        cout<<sum<<endl;

    return 0;
}