Adolfo Fragoso Magallanes MagallanesFito

Software Developer at Oracle

MagallanesFito / potencias_de_dos.cpp

Last active April 15, 2020 05:30

solucion potencias de dos omega up

	#include <iostream>
	using namespace std;

	#define MAX_ARRAY 750
	#define op_io ios_base::sync_with_stdio(0);cin.tie(0);

	int res[MAX_ARRAY];
	int res_size = 1;

	void multiplica(){

MagallanesFito / Agente A, El Héroe Nacional.cpp

Last active January 5, 2016 09:51

solucion Agente A, Heroe Nacional. Problema preselectivo

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

	typedef unsigned long long ULL;
	ULL n,t,a,b,d,suma;
	int main(){
	cin>>n;
	cin>>t;
	suma = 0;
	while(n--){

MagallanesFito / Canguros.cpp

Last active January 5, 2016 09:56

Canguros Problema Preselectivo

	#include <iostream>
	#include <queue>
	#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
	using namespace std;

	int main(){
	op_io
	int n,c;
	cin>>c>>n;
	char comando;

MagallanesFito / Nieves y el merge-sort.cpp

Last active October 16, 2022 04:28

Solucion a Nieves y el merge-sort. Problema preselectivo IOI

	/*
	Problema recopilado de:
	https://omegaup.com/arena/problem/Nieves-y-el-merge-sort#problems
	*/
	#include <iostream>
	using namespace std;
	#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
	void mezclar(long long int A[],int l,int m,int r){
	int n1 = m - l + 1;
	int n2 = r-m;

MagallanesFito / Xbox Live Points.cpp

Created January 6, 2016 09:43

Solucion Xbox Live Points

	/*
	Kadane's Algorithm
	*/
	#include <iostream>
	using namespace std;
	#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
	int maximaSuma(int A[],int n){
	int curr=0;
	int maxSum = 0;
	for(int i=0;i<n;i++){

MagallanesFito / K-Ceros.cpp

Last active January 8, 2016 00:31

Solucion K-Ceros. Busqueda binaria

	#include<iostream>
	using namespace std;
	#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
	typedef unsigned long long int ULL;

	ULL ceros(ULL n){
	if(n<=1){
	return 0;
	}
	return n/5 + ceros(n/5);

MagallanesFito / Proyectiles.cpp

Last active January 7, 2016 07:56

Solución Proyectiles. Búsqueda binaria

	#include <iostream>
	#include <algorithm>
	using namespace std;
	#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
	#define MAX_NAVES 100002
	#define MAX_K 1002
	typedef unsigned long int UL;

	struct punto{
	UL x;

MagallanesFito / Gasto Mensual.cpp

Created January 8, 2016 01:12

Solucion gasto mensual. Búsqueda Binaria

	#include <iostream>
	#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
	using namespace std;

	bool posible(int A[],int hi,int dias,int n){
	int suma = 0;
	int curr_dias = 1;
	for(int i=0;i<n;i++){
	if(A[i] > hi) return false;
	if(suma + A[i] <= hi){

MagallanesFito / Destruyendo edificios.cpp

Last active January 18, 2016 02:21

Problema Preselectivo IOI

	#include <iostream>
	#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
	using namespace std;
	typedef long long int LLI;

	struct Pila{
	LLI altura;
	LLI posicion;
	};
	Pila _Pila[1000002];

MagallanesFito / Calculadora Científica.cpp

Created February 4, 2016 04:50

Solucion a Calculadora Científica