Ravi Kiran Selvam ravikiran0606

## heee
https://github.com/ravikiran0606/FoodWasteManagement/invitations

## tcget.py
#! /usr/bin/env python
# -*- coding: utf-8 -*-

'''
tcget.py

Kosei Moriyama <cou929@gmail.com>
'''

import BeautifulSoup

## mst.cpp
#include<bits/stdc++.h>

using namespace std;

vector<int>d,parent,mark;
vector< pair<int,int> >edges;
map< pair<int,int> ,int>weight;
vector< vector< pair<int,int> > >graph;

void prim(int s,int n){

## SP in Weighted Graph.cpp
#include<bits/stdc++.h>

using namespace std;

vector<int>d;
vector< vector< pair<int,int> > >graph;
vector<bool>mark;

void dijkstra(int s,int n){
    int u,i;

## SP in Unweighted Graph.cpp
#include<bits/stdc++.h>

using namespace std;

vector< vector<int> >graph;
vector<int>d;
vector<bool>vis;

void bfs(int s){
    int t;

## graphsearch.cpp
#include<bits/stdc++.h>

using namespace std;

vector< vector<int> >graph;
vector<bool>vis;

void dfs(int s){
    vis[s]=true;
    cout<<s<<" ";

## DFS.cpp
#include<bits/stdc++.h>

using namespace std;

vector< vector<int> >graph;
vector<bool>vis;

void dfsvisit(int s){
    vis[s]=true;
    cout<<s<<" ";

## Segment.cpp
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <memory>

## ExpressionValidation.cpp
#include<iostream>
#define maxi 1000

using namespace std;

template<class T>
class sstack{
    T a[maxi];
    int top;

## dualstack.cpp
#include<iostream>
#define maxi 10

using namespace std;

template<class T>
class dualstack{
    T a[maxi];
    int top1,top2;
	#! /usr/bin/env python
	# -- coding: utf-8 --

	'''
	tcget.py

	Kosei Moriyama <cou929@gmail.com>
	'''

	import BeautifulSoup
	#include<bits/stdc++.h>

	using namespace std;

	vector<int>d,parent,mark;
	vector< pair<int,int> >edges;
	map< pair<int,int> ,int>weight;
	vector< vector< pair<int,int> > >graph;

	void prim(int s,int n){
	#include<bits/stdc++.h>

	using namespace std;

	vector<int>d;
	vector< vector< pair<int,int> > >graph;
	vector<bool>mark;

	void dijkstra(int s,int n){
	int u,i;
	#include<bits/stdc++.h>

	using namespace std;

	vector< vector<int> >graph;
	vector<int>d;
	vector<bool>vis;

	void bfs(int s){
	int t;
	#include <iostream>
	#include <string>
	#include <sstream>
	#include <vector>
	#include <set>
	#include <map>
	#include <list>
	#include <queue>
	#include <stack>
	#include <memory>
	#include<iostream>
	#define maxi 1000

	using namespace std;

	template<class T>
	class sstack{
	T a[maxi];
	int top;
	#include<iostream>
	#define maxi 10

	using namespace std;

	template<class T>
	class dualstack{
	T a[maxi];
	int top1,top2;