RNDr. Simon Toth HappyCerberus

## koza.c
/* Copyright (c) 2012 Mgr. Simon Toth (kontakt@simontoth.cz)
 * Licensed under the MIT license: http://www.opensource.org/licenses/mit-license.php
 */

#include <stdio.h>

#define STATE_BAD 1
#define STATE_FINAL 2

/** \brief Kodovaci funkce pro zakodovani expandovaneho stavu do unikatniho cisla

## stdin_or_file.c
/* Copyright (c) 2012 Mgr. Simon Toth (kontakt@simontoth.cz)
* Licensed under the MIT license: http://www.opensource.org/licenses/mit-license.php
*/

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
	FILE *input = stdin;

## pole.c
/* Copyright (c) 2012 Mgr. Simon Toth (kontakt@simontoth.cz)
* Licensed under the MIT license: http://www.opensource.org/licenses/mit-license.php
*/

#include <stdio.h>
#include <string.h>

union multipole
{
	int pole1[35];

## bludiste.c
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

int search(char **bludiste, int y, int x)
{
	/* cil */
	if (bludiste[y][x] == 'C') return 1;

	/* policko neni volne, ani start */

## frekvence.cpp
#include <unordered_map>
#include <algorithm>
#include <iterator>
#include <iostream>
using namespace std;

int main(int argc, char *argv[])
{
	unordered_map<int,int> freq;
	istream_iterator<int> input(cin);

## array.c
#include <stdio.h>

int main()
{
	int x[][3] = { { 1, 2, 3}, {1, 2, 3}};
	int (*xptr)[3] = x;

	for (int i = 0; i < 2; i++)
		for (int j = 0; j < 3; j++)
			printf("%d ",xptr[i][j]);

## main.cpp
#include <iostream>
#include <chrono>
#include <thread>
#include <atomic>
using namespace std;

// int notify;
// volatile int notify;
atomic<int> notify;

## iiter.cpp
#include <iostream>
#include <iterator>
using namespace std;

int main()
{
	istream_iterator<int> in(cin);
	istream_iterator<int> eof;

	long suma = 0;

## oiter.cpp
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;

int main()
{
	int pole[] = { 10, 20, 30 };
	ostream_iterator<int> out(cout,", ");

## ioiter.cpp
#include <iostream>
#include <iterator>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
	istream_iterator<double> in(cin);
	istream_iterator<double> eof;
	/* Copyright (c) 2012 Mgr. Simon Toth (kontakt@simontoth.cz)
	* Licensed under the MIT license: http://www.opensource.org/licenses/mit-license.php
	*/

	#include <stdio.h>

	#define STATE_BAD 1
	#define STATE_FINAL 2

	/** \brief Kodovaci funkce pro zakodovani expandovaneho stavu do unikatniho cisla
	#include <stdio.h>
	#include <stdlib.h>
	#include <assert.h>

	int search(char **bludiste, int y, int x)
	{
	/* cil */
	if (bludiste[y][x] == 'C') return 1;

	/* policko neni volne, ani start */
	#include <unordered_map>
	#include <algorithm>
	#include <iterator>
	#include <iostream>
	using namespace std;

	int main(int argc, char *argv[])
	{
	unordered_map<int,int> freq;
	istream_iterator<int> input(cin);
	#include <stdio.h>

	int main()
	{
	int x[][3] = { { 1, 2, 3}, {1, 2, 3}};
	int (*xptr)[3] = x;

	for (int i = 0; i < 2; i++)
	for (int j = 0; j < 3; j++)
	printf("%d ",xptr[i][j]);
	#include <iostream>
	#include <chrono>
	#include <thread>
	#include <atomic>
	using namespace std;

	// int notify;
	// volatile int notify;
	atomic<int> notify;