Initial commit

Author: rogerioo

.gitignore

@@ -0,0 +1,2 @@
+*.o
+a.out

airport.c

@@ -0,0 +1,53 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main(){
+	int passengers, planes, * seats, max = 0, min = 0;
+	int i, j, aux;
+
+	scanf("%d %d", &passengers, &planes);
+
+	seats = (int *) malloc(sizeof(int) * planes);
+
+	for(i = 0; i < planes; i++){
+		scanf("%d", &seats[i]);
+	}
+
+	for(i = 0; i < planes; i++){
+		for(j = i + 1; j < planes; j++){
+			if(seats[j] > seats[i]){
+				aux = seats[i];
+				seats[i] = seats[j];
+				seats[j] = aux;
+			}
+		}
+	}
+
+	int k = 0, tmp = seats[k];
+
+	for(i = 0; i < passengers; i++){
+		min += (tmp --);
+
+		if(tmp == 0)
+			tmp = seats[++ k];	
+	}
+
+	for(i = 0; i < passengers; i++){
+		max += seats[0];
+
+		seats[0] -= 1;
+
+		for (k = 1; k < planes; k++){
+			if (seats[k - 1] >= seats[k])
+				break;
+
+			tmp = seats[k];
+			seats[k] = seats[k - 1];
+			seats[k-1] = tmp;
+		}
+	}
+
+	printf("%d %d\n", max, min);
+	free(seats);
+	return 0;
+}

amusing_joke.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(int argc, char const *argv[]) {
+  string guest, host, pile;
+  bool theres_host, theres_guest;
+  int i, j, aux=0;
+
+  cin >> guest >> host >> pile;
+
+
+  for(i=0;i<guest.size();i++)
+    for(j=0;j<pile.size();j++)
+      if(guest[i] == pile[j]){
+        pile[j] = '#';
+        aux++;
+        break;
+      }
+  theres_guest = (aux == guest.size()) ? true : false;
+
+  aux=0;
+  for(i=0;i<host.size();i++)
+    for(j=0;j<pile.size();j++)
+      if(host[i] == pile[j]){
+        pile[j] = '#';
+        aux++;
+        break;
+      }
+  theres_host = (aux == host.size()) ? true : false;
+
+
+  cout << ((pile.find_first_not_of('#') == -1 && theres_host && theres_guest) ? "YES" : "NO"  ) << endl;
+
+  return 0;
+}

arrival_of_the_general.c

@@ -0,0 +1,30 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main(int argc, char const *argv[]) {
+  int line, bigger=-32768, biggerID, smaller=32767, smallerID, i, n, seconds;
+
+  scanf("%d", &n);
+
+  for(i=0; i < n;i++){
+    scanf("%d", &line);
+
+    if(bigger < line){
+      bigger = line;
+      biggerID = i+1;
+    }
+    if(smaller >= line){
+      smaller = line;
+      smallerID = i+1;
+    }
+  }
+
+  seconds = (biggerID-1) + (n - smallerID);
+
+  if (biggerID > smallerID) //When this happens the swap between them are double counted
+    seconds--;
+
+  printf("%d\n", seconds);
+
+  return 0;
+}

beatiful_matrix.c

@@ -0,0 +1,23 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main (){
+  int mtx, i, j, total = 0;
+  int row, column;
+
+  for (i = 0; i < 5; i++){
+    for (j = 0; j < 5; j++){
+      scanf("%d", &mtx);
+      if (mtx == 1){
+          row = i;
+          column = j;
+      }
+    }
+  }
+
+  total = abs(2 - row) + abs(2 - column);
+
+  printf("%d\n", total);
+
+  return 0;
+}

beatiful_year.c

@@ -0,0 +1,20 @@
+#include <stdio.h>
+
+int main(int argc, char const *argv[]) {
+  int num;
+  int i;
+
+  scanf("%d", &num);
+
+  for(i= ++num; i <= 10000; i++){
+    if ( (i%10 != i/10%10) && (i % 10 != i/100%10) && (i%10 != i/1000)
+        && (i/10%10 != i/100%10) && (i/10%10 != i/1000) && (i/100%10 != i/1000)){
+
+      printf("%d\n", i);
+      break;
+    }
+
+  }
+
+  return 0;
+}

bit++.c

@@ -0,0 +1,21 @@
+#include <stdio.h>
+
+int main(int argc, char const *argv[]) {
+  char operation[4];
+  int statements, X=0, i;
+
+  scanf("%d", &statements);
+
+  for(i=0;i<statements;i++){
+    scanf("%s", operation);
+
+    if(operation[0] == '+' || operation[1] == '+' || operation[2] == '+')
+      X++;
+    else if(operation[0] == '-' || operation[1] == '-' || operation[2] == '-')
+      X--;
+  }
+
+  printf("%d\n", X);
+
+  return 0;
+}

borze.c

@@ -0,0 +1,30 @@
+#include <stdio.h>
+#include <string.h>
+
+#define MAX 200
+
+int main(int argc, char const *argv[]) {
+  char code[MAX];
+  int size, i;
+
+  scanf("%s", code);
+
+  size = strlen(code);
+
+  for(i = 0; i < size; i++){
+    if (code[i] == '.')
+      printf("0");
+    else if (code[i+1] == '.'){
+      printf("1");
+      i++;
+    }
+    else{
+      printf("2");
+      i++;
+    }
+  }
+
+  printf("\n");
+
+  return 0;
+}

boy_or_girl.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(int argc, char const *argv[]) {
+  string user_name;
+  int i, j, distinct_characters;
+
+  cin >> user_name;
+  distinct_characters = user_name.size();
+
+  for(i=0;i<user_name.size();i++)
+    for(j=i+1;j<user_name.size();j++)
+      if(user_name[i]==user_name[j]){
+        distinct_characters--;
+        user_name[j] = -j;
+      }
+
+  cout << (((distinct_characters%2) == 0) ? "CHAT WITH HER!" : "IGNORE HIM!") << endl;
+
+  return 0;
+}

cupboards.c

@@ -0,0 +1,21 @@
+#include <stdio.h>
+
+#define MIN(x,y) ((x < y) ? x : y)
+
+int main(int argc, char const *argv[]) {
+  int cupboards, left, right, i;
+  int lf_closed=0, lf_opened=0, rt_closed=0, rt_opened=0, seconds=0;
+
+  scanf("%d", &cupboards);
+  for (i = 0; i < cupboards; i++) {
+    scanf("%d %d", &left, &right);
+
+    left ? lf_closed++ : lf_opened++;
+    right ? rt_closed++ : rt_opened++;
+  }
+  seconds = MIN(lf_closed, lf_opened) + MIN(rt_closed, rt_opened);
+
+  printf("%d\n", seconds);
+
+  return 0;
+}

dima_and_friends.c

@@ -0,0 +1,22 @@
+#include <stdio.h>
+
+int main(int argc, char const *argv[]) {
+  int friends, fingers=0, dima=0, aux, i;
+
+  scanf("%d", &friends);
+
+  for(i=0;i<friends;i++){
+    scanf("%d", &aux);
+    fingers += aux;
+  }
+
+  for(i=1;i<=5;i++){
+    aux = fingers + i;
+    if (aux%(friends+1) != 1) //Including Dima
+      dima++;
+  }
+
+  printf("%d\n", dima);
+
+  return 0;
+}

drinks.c

@@ -0,0 +1,19 @@
+#include <stdio.h>
+
+int main(int argc, char const *argv[]) {
+  int drinks, franctions, i;
+  double total, volume = 0;
+
+  scanf("%d", &drinks);
+
+  for (i = 0; i < drinks; i++) {
+    scanf("%d", &franctions);
+    volume += franctions;
+  }
+
+  total = volume / drinks;
+
+  printf("%.12lf\n", total);
+
+  return 0;
+}

effective_aproach.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(int argc, char const *argv[]) {
+  long long n, m, Vasya=0, Petya=0, aux, i, j;
+  long long a[100000], b[100000], c[100000];
+
+  cin >> n;
+
+  for(i=0;i<n;i++){
+    cin >> a[i];
+    c[a[i]] = i; //Keeping the position of the element on array c
+  }
+
+  cin >> m;
+
+  for(i=0;i<m;i++){
+    cin >> b[i];
+  }
+
+  for(i=0;i<m;i++)
+    Vasya += c[b[i]] + 1; //Accessing the position of element b
+
+  for(i=0;i<m;i++)
+    Petya += n - c[b[i]]; //Accessing the position of element b
+
+  cout << Vasya << ' ' << Petya << endl;
+
+  return 0;
+}

helpful_maths.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(int argc, char const *argv[]) {
+  string calculation;
+  int i, j, base;
+
+  cin >> calculation;
+
+  for(i=2; i < calculation.size(); i+=2){
+    base=calculation[i];
+
+    for(j=i; j && calculation[j-2] > base; j-=2)
+      calculation[j] = calculation[j-2];
+
+    calculation[j]=base;
+  }
+
+  cout << calculation << endl;
+
+  return 0;
+}

hq9+.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(int argc, char const *argv[]) {
+  string program;
+
+  cin >> program;
+
+  if (program.find('H') != -1 || program.find('Q') != -1 || program.find('9') != -1)
+    printf("YES\n");
+  else
+    printf("NO\n");
+
+  return 0;
+}