Skip to content

Instantly share code, notes, and snippets.

View Florian3k's full-sized avatar
🎩
doing things

Mikołaj Fornal Florian3k

🎩
doing things
37 followers · 28 following
View GitHub Profile
@Florian3k
Florian3k / analysis.draft.md
Created February 16, 2024 11:14 — forked from MattPD/analysis.draft.md
Program Analysis Resources (WIP draft)
@Florian3k
Florian3k / main.cpp
Created March 21, 2018 20:48
#include <algorithm>
#include <numeric>
#include <iterator>
int findWinner( float c[30][5] )
{
float maxes[30];
for ( int i = 0; i < 30 ; i++ ) {
auto minmax = std::minmax_element(
std::begin(c[i]),
@Florian3k
Florian3k / los.py
Created December 12, 2017 21:37
#!/usr/bin/python3
from random import shuffle
def filter_list(lst, nums):
return list( filter( lambda x: x not in nums, lst ) )
excludes = [7,10,13]
sources = filter_list( range( 1, 32 ), excludes)
targets = sources[:]
@Florian3k
Florian3k / fornal.cpp
Created November 26, 2017 18:33
#include <algorithm>
namespace fornal {
int calcLoad(int sectors[], int n)
{
//return 0;
if (n > 43) {
n = 43;
}
int max = std::accumulate(sectors, sectors + (n > 7 ? 7 : n), 0);
@Florian3k
Florian3k / szczepionki.cpp
Created November 26, 2017 13:26
void calcDelivery(int stock[], int demand[], int n)
{
int begin = 0;
int end = 0;
int deficit = 0;
for (int i = 0; i < n; ++i) {
int diff = stock[i] - demand[i];
if ( deficit == 0 ) {
@Florian3k
Florian3k / working.cpp
Created November 25, 2017 16:53
enum class direction {
up, right, down, left
};
inline void rotate(direction& dir) {
switch (dir) {
case direction::right:
dir = direction::down;
return;
case direction::down:
dir = direction::left;
@Florian3k
Florian3k / xd.cpp
Created November 25, 2017 16:49
enum class direction {
up, right, down, left
};
inline void rotate(direction& dir) {
switch (dir) {
case direction::right:
dir = direction::down;
return;
case direction::down:
dir = direction::left;
@Florian3k
Florian3k / test.cpp
Created November 24, 2017 21:37
int calcLoad(int sectors[], int n)
{
//return 0;
if (n > 43)
{
n = 43;
}
int max = std::accumulate(sectors, sectors + (n > 7 ? 7 : n), 0);
if (n <= 7)
{
@Florian3k
Florian3k / main.java
Created September 20, 2017 19:03
import java.util.Scanner;
import java.io.PrintWriter;
public class HelloWorld {
private static Scanner s;
public static void main(String[] args){
System.out.println(Bownik() + Chuj());
s = new Scanner(System.in);
try {
System.out.print("Podaj liczbę ciągów: ");