Skip to content

Instantly share code, notes, and snippets.

#include <QtCore/QCoreApplication>
#include <math.h>
#include <QtDebug>
static QList<QList<qint16> >currentList;
void findMore(QList<qint16> l)
{
for(int i = 0;i < l.size();i++) {
int c = l.at(i);
if(c > 1) {
QList<qint16> n = l;
#include <QtCore/QCoreApplication>
#include <QMap>
#include <QMapIterator>
#include <QDebug>
#define START_POP 70
#define MW_ASYM 0.5
#define MAR_YEAR 25
#define CHILD_COUNT 4
#define MAX_YEARS 130
struct people
#include <QtCore/QCoreApplication>
#include <iostream>
#include <QTextStream>
#include <QStringList>
#include <math.h>
#include <QtDebug>
using namespace std;
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
#include <QtCore/QCoreApplication>
#include <QList>
#include <QLinkedList>
#include <QtDebug>
QList<int> l;
int alg4( QList<int> list)
{
int max = 0;
int mright = 0;
foreach(int i, list) {
#include <QtCore/QCoreApplication>
#include <QtDebug>
#include <QFile>
#include <QString>
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
QFile file("H:\\test.txt");
if (!file.open(QIODevice::ReadOnly | QIODevice::Text))
module Set (
Set,
empty,
insert,
delete,
--isEmpty,
--isElement,
--card,
--intersection,
--union,
@metaxy
metaxy / stapel
Created August 30, 2010 10:48
Ein Stapel in Haskell
module Stapel (
Stapel,
empty,
isEmpty,
push,
top,
pop
) where
data Stapel a = E | S a (Stapel a) deriving(Eq,Show)
empty = E
{--polylist a@([q,p]:xs) = pl' a p []
where
p' ([q,p]:xs) e l
pl' [] _ l = l
| p == e = pl' xs (e-1) (l++[q])
| otherwise = pl' ([q,e]:xs) (e-1) (l++[0])--}
type Polynom = [(Int,Int)]
polyplus :: Polynom -> Polynom -> Polynom
--polyplus [] p = p
---polypuls p [] = p
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApplication1
{
class Blatt<T> : Blattbaum
{
T val { get; set; }
class Baum
{
public Baum()
{
child0 = null;
child1 = null;
value = 0;
}
public Baum child0{set; get;}