Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
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
let arr = [[1, 3, 4, 2], [5, 3, 2], [1, 1, 3, 7]] | |
let lowVal = arr[0][0] | |
let secLowVal = arr[0][0] | |
let preVal = arr[0][0] | |
for(let i=0; i<arr.length; i++) { | |
for(let j=0; j<arr[i].length; j++) { | |
// finden der kleinsten Zahl, die zuvor gefundene Zahl wird zwischengespeichert | |
if(arr[i][j] < lowVal) { |
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
if (process.argv.length < 3) { | |
console.log('Usage: node ' + process.argv[1] + ' FILENAME') | |
process.exit(1) | |
} | |
const fs = require('fs') | |
let filename = process.argv[2] | |
fs.readFile(filename, 'utf8', function (err, data) { | |
if (err) throw err |
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
function colMax(mrx) { | |
let mLen = []; | |
let len = 0, lVal = true; | |
for(var m=0; m<mrx[0].length; m++) { | |
for(var n in mrx) { | |
let eLen = mrx[n][m].toString().length; | |
lVal = eLen ? lVal<eLen : lVal; | |
if(len<eLen) | |
len = eLen; | |
} |
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
function makeString(len,cha) { | |
let str = ""; | |
for(var i=0; i<len;i++) | |
str += cha; | |
return str; | |
} | |
// example: | |
// makeString(3, "foo") === "foofoofoo" |
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
// | |
// Made by Bob Walter in 2k18 | |
// Version 1.2.0 | |
// | |
// ––– INPUT ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– // | |
// input string | |
let str = "8fOo Bar8 fOo8bar fOo-Bar fOo_Bar 8.8 888 ,_?!"; |
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
if(cmd == 'top' || cmd == 'rank' || cmd == 'tr') { // top 10 users by given argument | |
cmdLog(cmd, args, msg); | |
let usrArr = sortArr(gidArrSrch(msg,args[0]),2); | |
let count = args[1] || 10; | |
if(usrArr.length < count) | |
count = usrArr.length; | |
console.log(`\n> Top ${count} on ${msg.guild.name} at ${args[0]}`); | |
const topList = () => { | |
let msg = ""; |
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() { | |
int r[2800 + 1]; | |
int i, k; | |
int b, d; | |
int c = 0; | |
for (i = 0; i < 2800; i++) { | |
r[i] = 2000; |
NewerOlder