Skip to content

Instantly share code, notes, and snippets.

#include <fstream>
using namespace std;
int visit[1000002];
unsigned long long indes [1000002];
char buf[1000000];
int main()
{
ifstream fin("fracdec.in");
ofstream fout("fracdec.out");
*/
#include <fstream>
using namespace std;
#define maxint 500000
class node
{
public:
node(){next = NULL;}
int weight;
int name;
#include <fstream>
using namespace std;
int main()
{
ifstream fin("agrinet.in");
ofstream fout("agrinet.out");
int N;
fin>>N;
#include <fstream>
#include <cmath>
#include <iomanip>//precision
using namespace std;
#define infnty 150000;
class point
{
public:
double x,y;
};
#include <fstream>
using namespace std;
char maze[201][77];
int dist[2][201][77];
class outdoor
{
public:
int i,j;
#include <fstream>
using namespace std;
char grid[10][10];
class state
{
public:
int i,j;
char direct;
};
int main()
#include <fstream>
using namespace std;
class node
{
public:
node(){next=NULL;j=0;persent=0;}
int j;
int persent;
node* next;
};
#include <fstream>
using namespace std;
int visit[1000002];
unsigned long long indes [1000002];
char buf[1000000];
int main()
{
ifstream fin("fracdec.in");
ofstream fout("fracdec.out");
#include <fstream>
#include <cmath>
using namespace std;
void BFS(int , int ,int dist[26][30]);
int col,row;
//char square[30][26];
int allk[26][30];
int pickup[26][30];
int maxx(int i , int j)
{
#include <fstream>
using namespace std;
int square[250][250];
int ncount[251];
int min_tri(int i, int j , int k)
{
int temp = min(i,j);
return min(temp,k);
}