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
public class SudokuData | |
{ | |
int[][] values = new int[9][9]; | |
public JTextField[][] convertToJTF() | |
{ | |
//you implement this, it's REALLY easy | |
} |
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 <iostream> | |
using namespace std; | |
long long log_epic(long long a) | |
{ | |
long temp = a; | |
int low = 0; | |
int high = 0; | |
int shift = 32; |
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
long long log_epic(long long a) | |
{ // takes the log base 2 of a in log(log(a)) time | |
long temp = a; | |
int low = 0; | |
int high = 0; | |
int shift = 32; | |
while(shift > 0) | |
{ | |
while(temp > 0) | |
{ |
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 <iostream> | |
using namespace std; | |
class BankEvent | |
{ | |
private: | |
int time; | |
public: | |
int getTime() | |
{ |
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
each.rankings.map(function(each){ | |
return each.rank | |
}).reduce(+)); |
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> | |
#include <stdlib.h> | |
#include <string.h> | |
#include <unistd.h> | |
#include <math.h> | |
#include <time.h> | |
#include "bathroom.h" | |
typedef struct indiv_info |
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
// Ted Meyer | |
// Bathroom.c | |
// License: GPL v2 | |
#include "bathroom.h" | |
#include <stdio.h> | |
#include <time.h> | |
#include <pthread.h> | |
//enum gender = |
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
asmlinkage long receive(pid_t* sender, void* mesg, int* len, bool block) | |
{ | |
mailbox* my_mail; | |
message* msg; | |
my_mail = map_get(current->pid); | |
if (!my_mail) | |
{ | |
my_mail = make_mailbox(current -> pid); |
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
pthread_t sysinthread; | |
pthread_create(&sysinthread, NULL, sysin, NULL); | |
while(!running) | |
{ | |
usleep(100000); | |
} | |
while(running) | |
{ |
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> | |
#include <stdlib.h> | |
char* int2bin(unsigned x){ | |
char* res = malloc(32); | |
int i = 32; | |
while(i>0){ | |
i--; |