世界を変える御宅族

摘要： 1 #include <iostream> 2 #include <vector> 3 #include <string> 4 #include<random> 5 using namespace std; 6 7 template<class T=long long>class factory { 阅读全文

摘要： 1 #include <iostream> 2 #include<binaryNode.hpp> 3 #include<cassert> 4 #include<queue> 5 #include<vector> 6 7 using namespace std; 8 9 template<class 阅读全文

摘要： 1 #pragma once 2 template<class T>struct binaryNode { 3 binaryNode() = default; 4 binaryNode(T data, binaryNode<T>* father = NULL, binaryNode<T>* lson 阅读全文

摘要： #include <iostream> #include<algorithm> #include<stack> #include<vector> using namespace std; bool nixu(vector<int>cp) { for (size_t i = 2; i < cp.siz 阅读全文

摘要： 1 #include <iostream> 2 #include<my.hpp> 3 using namespace std; 4 5 void line_feed() { 6 cout << endl; 7 } 8 9 template<class T>class List { 10 public 阅读全文

摘要： map<vector<int>::iterator,int*>m; vector<int>vec{ 1,4,31,23,1 }; less<int>s; auto iter = vec.begin(); while (iter != vec.end()) { m[iter] = &(*iter); 阅读全文

摘要： #include <iostream> #include<algorithm> #include<vector> using namespace std; void swap(int& a, int& b) { int t = a; a = b; b = t; } void quicksort(ve 阅读全文

摘要： 1. First, write a simple program called null.c that creates a pointer to an integer, sets it to NULL, and then tries to dereference it. Compile this i 阅读全文

摘要： 2. Now, run free, perhaps using some of the arguments that might be useful (e.g., -m, to display memory totals in megabytes). How much memory is in yo 阅读全文

摘要： 1. Compute the solutions for simulations with 3 jobs and random seeds of 1, 2, and 3. siuwhat@siuwhat-PC:~/Desktop/HW-Lottery$ ./lottery.py -j 3 -s 1 阅读全文