Uri 1004 - Simple Product

#include

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

    printf("PROD = %d\n",A*B);

    return 0;

}

Uri 1003 - Simple Sum

#include

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

    printf("SOMA = %d\n",A+B);

    return 0;

}

Uri 1001 - Extremely Basic

#include

int main() {

    int A,B,X;
    scanf("%d %d",&A,&B);
    X=A+B;

    printf("X = %d\n",X);

    return 0;
}

Uri 2310 - Volleyball

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

int main(){
    int n;
        double s,b,a,s1,b1,a1,t_s=0,t_b=0,t_s1=0,k=0,t_b1=0,k1=0;
        float s_ans,b_ans,a_ans;
        string name;
         cin>>n;
         while(n--){
            cin>>name>>s>>b>>a;
            cin>>s1>>b1>>a1;
                t_s  += s;
                t_s1 += s1;
                    t_b += b;
                    t_b1 += b1;
                    k += a;
                    k1 += a1;

         }
         s_ans = (t_s1*100)/t_s;
         b_ans = (t_b1*100)/t_b;
         a_ans = (k1*100)/k;
         cout<<fixed<<setprecision(2)<<"Pontos de Saque: "<<s_ans<<" %."<<endl;
         cout<<fixed<<setprecision(2)<<"Pontos de Bloqueio: "<<b_ans<<" %."<<endl;
         cout<<fixed<<setprecision(2)<<"Pontos de Ataque: "<<a_ans<<" %."<<endl;

    return 0;
}

Uri 2235 - Walking in Time

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

int main(){
        int f,v,p;
          cin>>f>>v>>p;
        if(f == p  ||  v == p  ||  f == v  ||  f+v == p  ||  v+p == f  ||  f+p == v)
            cout<<"S"<<endl;
        else
            cout<<"N"<<endl;

    return 0;
}

Uri 2242 - Huaauhahhuahau

/*                                                    CODEMAN
                                                ARIF KHAN NIHAR
                                           Uri 2242 - Huaauhahhuahau
                                                    date -> 1/11/2016

                                            */
#include<bits/stdc++.h>
using namespace std;
bool check_vowel(char ch){
    switch(ch){
        case 'a': return true;
        break;
        case 'e': return true;
        break;
        case 'i': return true;
        break;
        case 'o': return true;
        break;
        case 'u': return true;
        break;
        default : return false;
    }
}
int main(){
      string s,s1,s2;
      cin>>s;
      for(int i = 0;i<s.size();i++){
        if(check_vowel(s[i]))
            s1 += s[i];
      }
      s2 = s1;
      reverse(s2.begin(),s2.end());
      if(s1 == s2)
      cout<<"S"<<endl;
      else
         cout<<"N"<<endl;
    return 0;
}

Uri 2232 - Pascal's Triangle

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

int main(){
    int  i,j,ca,p=0;
     int sum[32][32];
     sum[1][0] = 1,sum[2][0] = 1, sum[2][1] = 1;

    cin>>ca;
    while(ca--){
          int ans = 3,val;  p = 0;
          cin>>val;
          if(val == 1)ans = 1;
          else if(val == 2) ans = 3;
          else{
     for(i = 3; i<=val ; i++){
        sum [i][0] = 1;
        ans += sum[i][0];
    for(j=1 ; j< i-1 ; j++){
        sum[i][j]  = sum[i-1][j-1] + sum[i-1][j];

        ans += sum[i][j];
    }
   sum[i][j] = 1;
   ans += 1;
}
          }
  cout<<ans<<endl;
}
    return 0;
}

UVA 11462-AGE SORT

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

int main()
{
    int n,a,i,j,t=0;
    int *ar = new int[2000001];
    int *br = new int[2000001];
    while(cin>>n && n)
    {
        t = 0;
        for (i = 1;i<=n;i++){
            cin >> a;
            ar[a]=ar[a]+1;
        }
    for(i=1;i<=n;i++)
        if(ar[i]>0)
                for(j=1;j<=ar[i];j++,t++)
                    br[t]=i;

         for(i=1;i<=n;i++)
            if(ar[i]>0)
                for(j=1;j<=ar[i];j++) ar[i]=0;

        for(i = 0;i<t;i++){
            if(i>0)cout<<" ";
                cout<<br[i];
        }
        cout<<endl;
    }
     delete []ar;
    return 0 ;
}

Codeforces-A. Chat Server's Outgoing Traffic

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

int main(){
    int n,m=0,k=0,l;
    size_t p;
    string a,b;
    while(getline(cin,a)){
        if(a[0] == '+') m++;
        else if(a[0] == '-') m--;
        else {
            k+=m*(a.size()-a.find(':')-1);
        }
    }
    cout << k <<endl;
    return 0 ;
}

Codeforces[div.2-659]-A. Round House

#include <stdio.h>
#include <math.h>
int main()
{
    int n, a, b, r, d;
    while(scanf("%d%d%d", &n, &a, &b)==3)
    {
 d  = (a+b)%n;
 if(d<0)d+=n;
 if(d==0)d=n;
  printf("%d\n",d);
    }
    return 0;
}

Codeforces[div.2-706]-A. Beru-taxi

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

int main() {
 int n,p,i,j,lo=0,q,a[100001],t=0,a1,b,x,z,y;
 double k ,l = 1e99;
     cin >> a1>>b>>n;
     for(i=1;i<=n;i++){
      cin >>x>>y>>z;
      k =  hypot(x - a1 + 0., y - b + 0.) / z;
      l = min(l,k);
     }
     printf("%.10f\n",l);
 return 0;
}

Codeforces[div.2-706B]-B. Interesting drink

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

int main() {
 int n,p,i,j,k,lo=0,q,t=0;
 long int q1;
 cin >> n;
 vector<int>a(n);
 for(i=0;i<n;i++)cin >>a[i];
 sort(a.begin(),a.end());
 cin >> q;
 for(i=0;i<q;i++){
  cin >>q1;
     k = upper_bound(a.begin(),a.end(),q1)-a.begin();
    cout<<k<<endl;
 }
 return 0;
}

Codeforces-(dev 709A)-A. Juicer

#include<stdio.h>
#include<math.h>
int main()
{
    int i,n,b,c = 0,d,sum = 0,a[100001];
    scanf("%d %d %d",&n,&b,&d);
 
    for(i = 0 ; i < n ; i++)
    {
        scanf("%d",&a[i]);
        if(a[i] <= b){
        sum += a[i];}
        if(sum>d){c++;sum = 0;}
    }
    printf("%d\n",c);
 
    return 0;
}

hackerrank- Minimum Distances locked(https://www.hackerrank.com/contests/june-world-codesprint/challenges/minimum-distances)

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

int main() {
    int i,j,n,k=0,l,b1,d1=0;
    cin >> n ;
    int a[n],b[n];
    for(i=0;i<n;i++) cin >> a[i];
    k =  0;
    l = a[0] ;
    for(i=0;i<n;i++){
        for(j=i+1;j<n;j++){
            if(a[i] == a[j]){
                b1 = j-i;
                d1 = 1;
            }
        }
        if(l>b1) l = b1 ;
    }
         if(d1!=0)
         cout << l <<endl;
         else
         cout << "-1" <<endl;
  
    return 0;
}

uri- 2144 - Bodybuilder

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

int main(){
 double W1, W2, R, acumulacao=0.0;
int qtd=0;


while(cin >> W1 >> W2 >>R ){
     double esq, dir;
     double media;
     if(qtd !=0)
     cout<<endl;
     if(W1+W2+R == 0)
     break;
    esq = W1*(1+ R/30);
    dir = W2*(1+ R/30);

    media = (esq+dir)/2;
    acumulacao+=media;

        qtd++;
        if(media>=1 && media < 13){
            cout << "Nao vai da nao";
        }
        if(media>=13 && media <14){
            cout << "E 13";
        }
        if(media>=14 && media <40){
            cout << "Bora, hora do show! BIIR!" ;
         }
        if(media>=40 && media <=60){
            cout << "Ta saindo da jaula o monstro!" ;
        }
        if(media>60){
            cout << "AQUI E BODYBUILDER!!" ;
        }
}
        if((acumulacao/qtd)>40){
            cout<<"\n";
           printf("Aqui nois constroi fibra rapaz! Nao e agua com musculo!\n");
        }
  return 0;
}

uri- 1940 - Strategy Game

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

int main()
{
int n,i,n1,c=0,c1,c2,max,pos,bar[501],arr[250001],j;
cin >> n >> n1 ;
    max = pos = 0;
       for(i=1;i<=n*n1;i++){
           cin >> arr[i];
       }
        for(i=1;i<=n;i++){
            c=0;
            for(j=i;j<=n1*n;j+=(n)){
                    c += arr[j];
            }

            if(max<=c){
                max = c;
                pos = i;
            }
    }
    cout << pos <<endl;

    return 0;
    }

uri- 1893 - Moon Phases

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

int main() {
    int a,b1,b2;
      cin >> b1 >>b2 ;

    if(b1>b2){
        if(b2>=0 && b2<3)
            cout <<"nova"<<endl;
                else if(b2>=3 && b2<97)
                  cout <<"minguante"<<endl;
                      else if(b2>=97 && b2<101)
                        cout <<"cheia"<<endl;
    }else{
        if(b2>=0 && b2<3)
            cout <<"nova"<<endl;
                else if(b2>=3 && b2<97)
                   cout <<"crescente"<<endl;
                      else if(b2>=97 && b2<101)
                        cout <<"cheia"<<endl;
    }
    return 0;
}

uri- 1595 - Humm.. Run or Walk.. That's the Question

#include <bits/stdc++.h>
using namespace std;
int cmp(const void * a,const void * b){ return (*(int*)a - *(int*)b);}
int main() {
int ar[100001];
int t,n,s,c,r;
double res;
cin >> n ;
while(n--){
    res = 0.0 ;
    cin >>s>>c>>r;
    for(int i = 0; i<s  ; i++) cin >>ar[i];
    qsort(ar,s,sizeof(int),cmp);
   if(c!=0)
    for(int i = 0; i<c;i++) res += 1.0/((double)ar[i]*1.0 + (double)r*1.0);
  
    for(int i = c; i<s;i++) res += 1.0/((double)ar[i]*1.0);
  
    printf("%.2lf\n",res);
}
    return 0;
}

uri- 1451 - Broken Keyboard

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

int main() {
string a;
list<char>s1;
list<char>::iterator it;
while(cin >> a){
    s1.clear();
    it = s1.begin();
  
    for(int i = 0; i<a.size();i++){
          if(a[i] == ']') {
        it = s1.end();
      } else if(a[i] == '[') {
        it = s1.begin();
      }else {
        s1.insert(it, a[i]);
      }
  
}
    for(it = s1.begin(); it != s1.end(); it++)
      cout << *it;
    cout << '\n';
}
    return 0;
}

uri- 1383 - Sudoku

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


int main(int argc, char const *argv[]) {
  int n, i, j, k, sum = 285, cnt = 0;
  int a[9][9];
  string s = "";

  cin >> n;
  while(n--) {
    for(i = 0; i < 9; i++)
      for(j = 0; j < 9; j++)
        cin >> a[i][j];

        int sl[9], sc[9], sm[3][3];

        for (i = 0; i < 9; i++)
          sl[i] = sc[i] = sm[i/3][i%3] = 0;

        for (i = 0; i < 9; i++) {
          for (j = 0; j < 9; j++) {
            k = a[i][j];
            k *= k;
            sl[i] += k;
            sc[j] += k;
            sm[i/3][j/3] += k;

            if (i == 8 && sc[j] != 285)
              break;
          }

          if (sl[i] != 285)
            break;
        }

       // if(s == "")
          for (i = 0; i < 3; i++)
            for (j = 0; j < 3; j++)
              if (sm[i][j] != 285)
               s = "NAO";

       if(s == "")
         s  = "SIM";

        cnt++;
        cout << "Instancia " << cnt << endl << s << endl << endl;
        s = "";
    }

    return 0;
}