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
echo "mannaggia $(curl -s santiebeati.it/$(date +%m/%d)/|sort -R|awk -F'[<>]' '{if($7~/[:alpha:]/){print $7$9}}'|head -n1)" |
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
package main | |
import ( | |
"github.com/deckarep/golang-set" | |
"strings" | |
"fmt" | |
"sort" | |
) | |
func main() { |
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
L[1] = Genera gli elementi di dimensione 1 | |
Calcola la frequenza degli elementi di dimensione 1 che superano minsup | |
C[1] = L[1] | |
Per K=2, finchè L[K-1] != vuoto; k++ { | |
C[K] = genera le coppie da L[K-1] con cardinalità K | |
L[K] = Calcola la frequenza degli elementi in C[K] che superano minsup | |
} | |
Ritorna L[K] |
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
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
Valle d'aosta | Pila | 19 | 7.2899 | 45.7214 | Montagna | |
---|---|---|---|---|---|---|
Piemonte | Arona | 33 | 8.5582 | 45.7586 | Lago | |
Valle d'aosta | Châtillon | 13 | 7.6128 | 45.7486 | Montagna | |
Valle d'aosta | Saint Nicolas | 12 | 2.77939 | 50.30413 | Montagna | |
Piemonte | Bardonecchia | 35 | 6.69888 | 45.07462 | Montagna | |
Piemonte | Sestriere | 47 | 6.87751 | 44.95864 | Montagna | |
Piemonte | Pragelato | 25 | 6.94161 | 45.01364 | Montagna | |
Valle d'aosta | La Thuile | 33 | 6.95099 | 45.71366 | Montagna | |
Valle d'aosta | Courmayeur | 69 | 6.96893 | 45.79659 | Montagna | |
Valle d'aosta | Pré-Saint-Didier | 17 | 6.98579 | 45.76416 | Montagna |
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
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
import java.io.*; | |
import java.util.*; | |
class Solution { | |
static int getNumberOfIslands(int[][] binaryMatrix) { | |
int island = 0; | |
for(int i = 0; i < binaryMatrix.length; i++){ | |
for(int j = 0; j < binaryMatrix[i].length; j++){ | |
if(binaryMatrix[i][j] == 1){ |
OlderNewer