jungrae-prestolabs

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <fcntl.h>
#include <sys/mman.h>

#define SIZE 4

int main(int argc, char** argv)
{

jungrae-prestolabs

#include"fpga_api.h"
#include<stdio.h>
#include<fcntl.h>
#include<unistd.h>
#include<sys/mman.h>
#include<cstring>

#define min(x,y) (((x)<(y))?(x):(y))

FPGA::FPGA(off_t data_addr, off_t output_addr, int m_size, int v_size)

jungrae-prestolabs

#include"fpga_api.h"
#include<stdio.h>
#include<iostream>
#include<cstring>
#include<unistd.h>

using namespace std;

#define min(x,y) (((x)<(y))?(x):(y))

jungrae-prestolabs

#include <stdio.h>
#include <vector>
#include <queue>
#define M 100009
using namespace std;
struct pp{
	int a,b,d;
	pp(){};
	pp(int _a, int _b, int _d){ a=_a; b=_b; d=_d; }
};

jungrae-prestolabs

import java.io.*;
import java.util.*;

class Heap{
	int[] A;
	int N;
	Heap(int MAXSIZE) {
		N = 0;
		A = new int[MAXSIZE + 1];
	}

jungrae-prestolabs

#include <stdio.h>
#include <vector>
using namespace std;

int n,root,cnt,chk[100];
vector<int> v[100];
void dfs(int a){
    chk[a]=1;
    bool flag=true;
    for (int i=0;i<v[a].size();i++){

jungrae-prestolabs

#include <stdio.h>
#define M 59

int n,m,k,s[M][M],chk[M][M],x[4]={-1,1,0,0},y[4]={0,0,1,-1};
void dfs(int a,int b){
	chk[a][b]=1;
	for (int i=0;i<4;i++) if (s[a+x[i]][b+y[i]] && !chk[a+x[i]][b+y[i]])
		dfs(a+x[i], b+y[i]);
}
int main(){