- Fork
- Clone your fork
- Add upstream : git remote add upstream <github_repo>
- git checkout master
- git pull upstream master && git push origin master
- git checkout -b feature-branch
- git push -u feature-branch
- Create de PR
#General Find the most frequent integer in an array Find pairs in an integer array whose sum is equal to 10 (bonus: do it in linear time) Given 2 integer arrays, determine of the 2nd array is a rotated version of the 1st array. Ex. Original Array A={1,2,3,5,6,7,8} Rotated Array B={5,6,7,8,1,2,3} Write fibbonaci iteratively and recursively (bonus: use dynamic programming) Find the only element in an array that only occurs once. Find the common elements of 2 int arrays Implement binary search of a sorted array of integers Implement binary search in a rotated array (ex. {5,6,7,8,1,2,3}) Use dynamic programming to find the first X prime numbers
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
Host dvi-cajamar | |
HostName smartris-dvi-cajamar.ddns.net | |
Port 4242 | |
User proradis | |
Host croma-santos | |
HostName smartris-croma-santos.ddns.net | |
Port 4242 | |
User proradis |
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
#!/bin/bash | |
mkdir -p /vagrant/dcm | |
cd /vagrant/dcm/ | |
wget -O dcm4chee-2.17.3.zip 'http://downloads.sourceforge.net/project/dcm4che/dcm4chee/2.17.3/dcm4chee-2.17.3-mysql.zip?r=http%3A%2F%2Fsourceforge.net%2Fprojects%2Fdcm4che%2Ffiles%2Fdcm4 chee%2F2.17.3%2F&ts=1378999040&use_mirror=ufpr' & | |
wget -O dcm4che-2.0.23.zip 'http://downloads.sourceforge.net/project/dcm4che/dcm4che2/2.0.23/dcm4che-2.0.23-bin.zip?r=http%3A%2F%2Fsourceforge.net%2Fprojects%2Fdcm4che%2Ffiles%2Fdcm4che2 %2F2.0.23%2F&ts=1378999971&use_mirror=ufpr' & | |
wget -O jboss-4.2.3.zip 'http://downloads.sourceforge.net/project/jboss/JBoss/JBoss-4.2.3.GA/jboss-4.2.3.GA-jdk6.zip?r=http%3A%2F%2Fsourceforge.net%2Fprojects%2Fjboss%2Ffiles%2FJBoss%2FJ Boss-4.2.3.GA%2F&ts=1378999423&use_mirror=ufpr' & | |
# wget -O dcmtk-3.6.0.zip 'ftp://dicom.offis.de/pub/dicom/offis/software/dcmtk/dcmtk360/dcmtk-3.6.0.zip' & | |
wget -O oviyam-1.war 'https://dl.dropboxusercontent.com/u/28191834/proradis-config/programas/oviyam-1.war' & | |
wget -O oviyam2.war 'https://dl.dropboxu |
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 <stdio.h> | |
int main() | |
{ | |
char o; | |
float num1,num2; | |
printf("Digite a operação desejada + ou - ou * ou dividir : "); | |
scanf("%c",&o); | |
printf("Digite os dois operandos: "); | |
scanf("%f%f",&num1,&num2); | |
switch(o) { |
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
{ | |
"dsNumeroMultiplus" : "35101530816" | |
} |