This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const echoPostRequest = { | |
url: 'https://cognito-idp.us-west-2.amazonaws.com/', | |
method: 'POST', | |
header: { | |
'Content-Type' : 'application/x-amz-json-1.1', | |
'X-Amz-Target': 'AWSCognitoIdentityProviderService.InitiateAuth' | |
}, | |
body: { | |
mode: 'application/json', | |
raw: JSON.stringify( |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdint.h> | |
#include <stdio.h> | |
#include <stdlib.h> | |
// munged from https://github.com/simontime/Resead | |
namespace sead | |
{ | |
class Random | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
print("stest") |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Metodo que obtiene el estado de la microSD e imprime un mensaje de error en caso de que no pueda ser | |
* utilizada por el programa | |
* @param mContext Contexto desde el cual se esta invocando el metodo | |
* @return boolean True si la memoria no presenta problemas False si no puede ser utilizada | |
*/ | |
public static Boolean compruebaSD(Context mContext){ | |
String sdStatus = Environment.getExternalStorageState(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public ArticuloED obten(ArticuloED articuloED){ | |
try{ | |
return articulosED.get(articulosED.indexOf(articuloED)); | |
}catch(Exception e){ | |
return null; | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class DividebyZero{ | |
int a; | |
int b; | |
public DividebyZero(int a, int b){ | |
this.a=a; | |
this.b=b; | |
} | |
public double divide() throws MiExcepcion{ | |
if (b==0){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
Created on 01/01/2012 | |
Project Euler - Problema 7 | |
Enlistando los primeros seis numeros primos 2,3,5,7, 11 y 13, | |
podemos ver que el sexto numero primo es 13. | |
Cual es el 10,001vo Numero primo? | |
@author: Rafael Carrillo | |
@version: 1 |