stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>

 

#define f(i,a,b) for( ll i = a; i < b ; i++ )

#define af(i,a,b) for( ll i = a; i >= b ; i--)

#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )

#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)

#define ones(x) (ll) __builtin_popcount(x)

#define fs first

#define sc second

#define pb push_back

#define po pop_back

#define mp make_pair  

#define sz(a) (ll) a.size()

#define all(a) a.begin(), a.end()

#define sor(a) sort( a.begin(), a.end() )

#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)

#define ller ios::sync_with_stdio(false);cin.tsie(nullptr);cout.tie(nullptr)

#define watch(x) cout << (#x) << " is #" << (x) <<"#" <<endl

#define PI 3.1415926535

using namespace std;

typedef long long ll;

typedef long double ld; 

typedef pair<ll,ll> ii ;

typedef vector<ll>  vi ;

typedef vector<ii> vii ;

const ll mod = 1e9+7;

const ll MAX = 1e5+5;

const ll inf = 1e18+7;



ll dp[MAX];

bool visited[MAX];

vi adj[MAX];



ll DP(ll u)

{

  ll &ans = dp[u];

  if(ans) return ans;

  for(auto v : adj[u]) ans = max(ans,DP(v)+1);

  return ans;

}



int main() {

  fastio;

  ll n,m,x,y;

  cin>>n>>m;

  while(m--) 

  {

     cin>>x>>y;

     visited[y]=true;

     adj[x].pb(y);

  }

  ll ans=0;

  f(i,1,n+1){

    if(!visited[i]) ans = max(ans,DP(i));

  }

  cout<<ans<<"\n";

  return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 3.4801679302470565x):
#include<bits/stdc++.h>

#define ll          long long int

#define ld          long double

#define pb          push_back

#define mp          make_pair

#define ff          first

#define se          second

#define scan(n)     scanf("%lld", &n);

#define print(n)    printf("%lld\n", n);

#define fd(n)       fixed<<setprecision(n)

#define MAX         1000000000000000000

#define MAXN        100005

#define LOG         19

#define mod         1000000007

using namespace std;





int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    ll n,m,i,x,y,mx=0;

    cin>>n>>m;

    vector<ll> vi[n+1];

    ll deg[n+1];

    queue<ll> qe;

    vector<ll> vi1;

    memset(deg,0,sizeof(deg));

    for(i=1;i<=m;i++){

        cin>>x>>y;

        vi[x].pb(y);

        deg[y]++;

    }

    for(i=1;i<=n;i++){

        if(deg[i]==0){

            qe.push(i);

            vi1.pb(i);

        }

    }

    while(!qe.empty()){

        ll node=qe.front();

        qe.pop();

        for(auto x:vi[node]){

            deg[x]--;

            if(deg[x]==0){

                vi1.pb(x);

                qe.push(x);

            }

        }

    }

    ll dp[n+1];

    memset(dp,0,sizeof(dp));

    for(auto node:vi1){

        for(auto x:vi[node]){

            dp[x]=max(dp[x],dp[node]+1);

        }

    }

    for(i=1;i<=n;i++){

        mx=max(mx,dp[i]);

    }

    cout<<mx;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

const int N=1e5+10;

int memo[N];

bool vis[N];

vector<int> g[N];



int dp(int u){

	if(vis[u]) return memo[u];

	int ans=0;

	for(auto v: g[u]){

	    ans=max(ans, dp(v) + 1);

	}

	vis[u]=true;

	return memo[u]=ans;

}



int main() {

    int n,m;

	cin>>n>>m;

	int a,b;

	for(int i=0;i<m;i++){

		cin>>a>>b;

		g[a].push_back(b);

	}

	int res=0;

	for(int i=1;i<=n;i++){

	    res=max(res,dp(i));

	}

	cout<<res<<"\n";

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 3.4592531049102377x):
#include<bits/stdc++.h>

#define ll          long long int

#define ld          long double

#define pb          push_back

#define mp          make_pair

#define ff          first

#define se          second

#define scan(n)     scanf("%lld", &n);

#define print(n)    printf("%lld\n", n);

#define fd(n)       fixed<<setprecision(n)

#define MAX         1000000000000000000

#define MAXN        100005

#define LOG         19

#define mod         1000000007

using namespace std;





int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    ll n,m,i,x,y,mx=0;

    cin>>n>>m;

    vector<ll> vi[n+1];

    ll deg[n+1];

    queue<ll> qe;

    vector<ll> vi1;

    memset(deg,0,sizeof(deg));

    for(i=1;i<=m;i++){

        cin>>x>>y;

        vi[x].pb(y);

        deg[y]++;

    }

    for(i=1;i<=n;i++){

        if(deg[i]==0){

            qe.push(i);

            vi1.pb(i);

        }

    }

    while(!qe.empty()){

        ll node=qe.front();

        qe.pop();

        for(auto x:vi[node]){

            deg[x]--;

            if(deg[x]==0){

                vi1.pb(x);

                qe.push(x);

            }

        }

    }

    ll dp[n+1];

    memset(dp,0,sizeof(dp));

    for(auto node:vi1){

        for(auto x:vi[node]){

            dp[x]=max(dp[x],dp[node]+1);

        }

    }

    for(i=1;i<=n;i++){

        mx=max(mx,dp[i]);

    }

    cout<<mx;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define PI acos(-1)

#define falcon ios_base::sync_with_stdio(false) ; cin.tie(NULL) ;

typedef long long ll ;

using namespace std ;



vector <int> g[100001] , d(100001 , -1) ;

int maxlength = INT_MIN ;



void DFS(int s)

{

    d[s] = 0 ;

    for(int i = 0 ; i < g[s].size() ; i++)

    {

        int n = g[s][i] , length = 0 ;

        if(d[n] == -1) DFS(n) ;

        length = 1 + d[n] ;

        d[s] = max(d[s] , length) ;

    }

    maxlength = max(maxlength , d[s]) ;

}



int main()

{

    falcon ;



    int n , m ;

    cin >> n >> m ;

    for(int i = 0 ; i < m ; i++)

    {

        int u , v ;

        cin >> u >> v ;

        g[u].push_back(v) ;

    }

    for(int i = 1 ; i <= n ; i++) DFS(i) ;

    cout << maxlength << "\n" ;

}

// Faster C++ solution for the same problem (measured speedup: 3.878560982398939x):
#include<bits/stdc++.h>

#define ll          long long int

#define ld          long double

#define pb          push_back

#define mp          make_pair

#define ff          first

#define se          second

#define scan(n)     scanf("%lld", &n);

#define print(n)    printf("%lld\n", n);

#define fd(n)       fixed<<setprecision(n)

#define MAX         1000000000000000000

#define MAXN        100005

#define LOG         19

#define mod         1000000007

using namespace std;





int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    ll n,m,i,x,y,mx=0;

    cin>>n>>m;

    vector<ll> vi[n+1];

    ll deg[n+1];

    queue<ll> qe;

    vector<ll> vi1;

    memset(deg,0,sizeof(deg));

    for(i=1;i<=m;i++){

        cin>>x>>y;

        vi[x].pb(y);

        deg[y]++;

    }

    for(i=1;i<=n;i++){

        if(deg[i]==0){

            qe.push(i);

            vi1.pb(i);

        }

    }

    while(!qe.empty()){

        ll node=qe.front();

        qe.pop();

        for(auto x:vi[node]){

            deg[x]--;

            if(deg[x]==0){

                vi1.pb(x);

                qe.push(x);

            }

        }

    }

    ll dp[n+1];

    memset(dp,0,sizeof(dp));

    for(auto node:vi1){

        for(auto x:vi[node]){

            dp[x]=max(dp[x],dp[node]+1);

        }

    }

    for(i=1;i<=n;i++){

        mx=max(mx,dp[i]);

    }

    cout<<mx;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

using namespace std;

ll n,m,x,y;

vector<ll>v[100009];

ll dp[100009];



ll f(ll N){

	if (v[N].empty())return 0;

	if(dp[N]!=-1)return dp[N];

	ll z=0;

	for(int i=0; i<v[N].size(); i++){

		z=max(z,f(v[N][i])+1);

	}

	dp[N]=z;

	return dp[N];

}



int main(){

	cin >> n >> m;

	memset(dp,-1,sizeof dp);

	for(int i=1; i<=m; i++){

		cin >> x >> y;

		v[x].push_back(y);

	}

	ll jwb=0;

	for(int i=1; i<=n; i++){

		jwb=max(jwb,f(i));

	}

	cout << jwb << endl;

}//j

// Faster C++ solution for the same problem (measured speedup: 1.2309172153868209x):
#include <bits/stdc++.h>

using namespace std;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);



const int MAXN = 1e5 + 5;



int n, m, d[MAXN];

vector<int> G[MAXN];



void dfs(int u) {

    d[u] = 1;

    for (int v : G[u]) {

        if (!d[v]) {

            dfs(v);

        }

        d[u] = max(d[u], d[v] + 1);

    }

}



int main() {

    IOS



    cin >> n >> m;

    

    int x, y;

    for (int i = 0; i < m; i++) {

        cin >> x >> y;

        G[x].push_back(y);

    }



    for (int i = 1; i <= n; i++) {

        if (!d[i]) {

            dfs(i);

        }

    }



    int ans = 0;

    for (int i = 1; i <= n; i++) {

        ans = max(ans, d[i]);        

    }

    cout << ans - 1 << '\n';

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define ull unsigned long long

#define mst(a, b) memset((a), (b), sizeof(a))

#define mp(a, b) make_pair(a, b)

#define pi acos(-1)

#define pii pair<int, int>

#define pb push_back

const int INF = 0x3f3f3f3f;

const double eps = 1e-10;

const int maxn = 1e5 + 7;

const int maxm = 5e5 + 10;

const int mod = 1e9 + 7;

vector<int> s[maxn];

int vis[maxn];

int dp[maxn];

int main()

{

    ios::sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

    mst(vis, 0);

    mst(dp, 0);

    queue<int> q;

    int n, m;

    cin >> n >> m;

    for (int i = 0; i < m; ++i)

    {

        int x, y;

        cin >> x >> y;

        vis[y]++;

        s[x].pb(y);

    }

    for (int i = 1; i <= n; ++i)

    {

        if (!vis[i])

            q.push(i);

    }

    while (!q.empty())

    {

        int now = q.front();

        q.pop();

        int len = s[now].size();

        for (int i = 0; i < len; ++i)

        {

            dp[s[now][i]] = max(dp[s[now][i]], dp[now] + 1);

            vis[s[now][i]]--;

            if (vis[s[now][i]] == 0)

                q.push(s[now][i]);

        }

    }

    int ans = 0;

    for (int i = 1; i <= n; ++i)

        ans = max(ans, dp[i]);

    cout << ans << endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.2443568948003745x):
#include <bits/stdc++.h>

using namespace std;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);



const int MAXN = 1e5 + 5;



int n, m, d[MAXN];

vector<int> G[MAXN];



void dfs(int u) {

    d[u] = 1;

    for (int v : G[u]) {

        if (!d[v]) {

            dfs(v);

        }

        d[u] = max(d[u], d[v] + 1);

    }

}



int main() {

    IOS



    cin >> n >> m;

    

    int x, y;

    for (int i = 0; i < m; i++) {

        cin >> x >> y;

        G[x].push_back(y);

    }



    for (int i = 1; i <= n; i++) {

        if (!d[i]) {

            dfs(i);

        }

    }



    int ans = 0;

    for (int i = 1; i <= n; i++) {

        ans = max(ans, d[i]);        

    }

    cout << ans - 1 << '\n';

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



#define el				'\n'

#define sz(v)			((int)((v).size()))

#define all(v)          ((v).begin()),((v).end())

#define clr(v, d)		memset(v, d, sizeof(v))



double const EPS = 1e-8, PI = acos(-1);

const int N = 1e5 + 9, M = 50 + 9, OO = (int) 1e9 + 1;

const long long MOD = 1e9 + 7;



typedef long long ll;



void OUTPUT() {

	cout << fixed << setprecision(12);

	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

}



void INPUT() {

#ifndef ONLINE_JUDGE

	freopen("input.txt", "r", stdin);

	//freopen("output.txt", "w", stdout);

#endif

	cout << fixed << setprecision(0);

//	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

}



int n, m, x, y, vis[N], ans;

vector<vector<int>> edges(N);



int DFS(int node) {

	if (vis[node] != -1)

		return vis[node];

	vis[node] = 0;

	for (auto child : edges[node]) {

		DFS(child);

		vis[node] = max(vis[node], vis[child] + 1);

	}

	return 0;

}



int main() {

//	INPUT();

	OUTPUT();

	clr(vis, -1);

	cin >> n >> m;

	for (int i = 0; i < m; ++i) {

		cin >> x >> y;

		edges[x].push_back(y);

	}

	for (int j = 1; j <= n; j++) {

		DFS(j);

	}

	for (int i = 1; i <= n; i++) {

		ans = max(ans, vis[i]);

	}

	cout << ans;



	return 0;



}


// Faster C++ solution for the same problem (measured speedup: 1.121602371707199x):
#include <bits/stdc++.h>

using namespace std;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);



const int MAXN = 1e5 + 5;



int n, m, d[MAXN];

vector<int> G[MAXN];



void dfs(int u) {

    d[u] = 1;

    for (int v : G[u]) {

        if (!d[v]) {

            dfs(v);

        }

        d[u] = max(d[u], d[v] + 1);

    }

}



int main() {

    IOS



    cin >> n >> m;

    

    int x, y;

    for (int i = 0; i < m; i++) {

        cin >> x >> y;

        G[x].push_back(y);

    }



    for (int i = 1; i <= n; i++) {

        if (!d[i]) {

            dfs(i);

        }

    }



    int ans = 0;

    for (int i = 1; i <= n; i++) {

        ans = max(ans, d[i]);        

    }

    cout << ans - 1 << '\n';

}
// Slower C++ solution:
// Author : Syed Mujtaba

// Seek knowledge from the Cradle to the Grave !!

// https://www.linkedin.com/in/syed-mujtaba-064a5016a 



#include <bits/stdc++.h>

using namespace std;

#define int     long long

#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

#define mod ((int)(1e9 + 7))

vector < int > to[100005];

vector < int > from[100005];

vector < int > roots;

int dp[100005];

int cal(int i)

{

	if(dp[i] != -1)

		return dp[i];

	int dist = -1;

	for(int j = 0; j < to[i].size(); j++)

	{

		dist = max(dist, 1 + cal(to[i][j]));

	}

	return dp[i] = dist;

}

signed main()

{

	fast_io

	int n, m;

	int x, y;

	cin >> n >> m;

	for(int i = 0; i < m; i++)

	{	

		cin >> x >> y;

		to[y].push_back(x);

		from[x].push_back(y);

	}

	for(int i = 1; i <= n; i++)

		dp[i] = -1;

	for(int i = 1; i <= n; i++)

	{

		if(to[i].size() == 0)

		{

			roots.push_back(i);

			dp[i] = 0;

		}

	}

	for(int i = 1; i <= n; i++)

	{

		if(dp[i] == -1)

			dp[i] = cal(i);

	}

	int ans = -1;

	for(int i = 1; i <= n; i++)

	{

		ans = max(ans, dp[i]);

	}

	cout << ans << endl;

}

// Faster C++ solution for the same problem (measured speedup: 1.8074504777991556x):
#include <bits/stdc++.h>

using namespace std;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);



const int MAXN = 1e5 + 5;



int n, m, d[MAXN];

vector<int> G[MAXN];



void dfs(int u) {

    d[u] = 1;

    for (int v : G[u]) {

        if (!d[v]) {

            dfs(v);

        }

        d[u] = max(d[u], d[v] + 1);

    }

}



int main() {

    IOS



    cin >> n >> m;

    

    int x, y;

    for (int i = 0; i < m; i++) {

        cin >> x >> y;

        G[x].push_back(y);

    }



    for (int i = 1; i <= n; i++) {

        if (!d[i]) {

            dfs(i);

        }

    }



    int ans = 0;

    for (int i = 1; i <= n; i++) {

        ans = max(ans, d[i]);        

    }

    cout << ans - 1 << '\n';

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define ull unsigned long long

#define PII pair<int,int>

#define PSI pair<string,int>

#define PIII pair< int, pair<int,int> >

const int MaxN = 1e5+5;

vector<int> g[MaxN];

int dp[MaxN];

int N;



int dfs(int node, int pr){



    auto &ret = dp[node];

    if(ret!=-1) return ret;

    ret = 0;

    for(auto i: g[node]){

        if(i==pr) continue;

        ret = max( ret, dfs(i,node)+1 );

    }



    return ret;

}



void read(){



    int i,edge;

    memset(dp,-1,sizeof dp);

    cin>>N>>edge;

    for(i=0; i<edge; i++){

        int u,v;

        cin>>u>>v;

        g[u].push_back(v);

    }

}



void solve(){



    read();

    int res = 0;

    for(int i=1; i<=N; i++){

        res = max( res, dfs(i,0) );

    }



    cout<< res << "\n";

}



int main(){



    //freopen("input.txt","r",stdin);

    ios_base::sync_with_stdio(false);

    cin.tie(nullptr);

    solve();

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.1141538998681688x):
#include <bits/stdc++.h>

using namespace std;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);



const int MAXN = 1e5 + 5;



int n, m, d[MAXN];

vector<int> G[MAXN];



void dfs(int u) {

    d[u] = 1;

    for (int v : G[u]) {

        if (!d[v]) {

            dfs(v);

        }

        d[u] = max(d[u], d[v] + 1);

    }

}



int main() {

    IOS



    cin >> n >> m;

    

    int x, y;

    for (int i = 0; i < m; i++) {

        cin >> x >> y;

        G[x].push_back(y);

    }



    for (int i = 1; i <= n; i++) {

        if (!d[i]) {

            dfs(i);

        }

    }



    int ans = 0;

    for (int i = 1; i <= n; i++) {

        ans = max(ans, d[i]);        

    }

    cout << ans - 1 << '\n';

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define f(i,s,v) for(int i=(int)s;i<(int)v;++i)

#define rf(i,s,v) for(int i=(int)s-1;i>(int)v;--i)

#define pb push_back

#define all(v) ((v.begin()),(v.end()))

#define memset(c, value) memset(c, (int)value, sizeof(c))

using namespace std;

typedef long long ll;

const ll oo = 1e18;

const ll MOD =1e9+7;

const double pi = acos(-1);

void fast(){

    ios_base :: sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

}

int n, m;

bool valid (int r,int c){

    return (r < n && r >= 0 && c >= 0 && c < m);

}



int row[] = {0 , 1 , 0, -1};

int column[] = {1 , 0, -1, 0};



vector<int> adj[100001];

int path[100001];

int vis[100001];



int dp(int u){

    if(path[u]!=-1)

        return path[u];



    vis[u] = true;



    int sz = adj[u].size();



    path[u] = 0;

    f(j, 0, sz){

        if(!vis[adj[u][j]])

            path[u] = max( path[u], 1 + dp(adj[u][j]));

    }

    vis[u] = false;



    return path[u];

}





int main()

{

    fast();



    int u, v;

    cin>>n>>m;

    f(i, 0, m){

        cin>>u>>v;

        adj[u].push_back(v);

    }

    int maxi = 0;

    memset(vis, 0);

    memset(path, -1);



    f(i, 1, n+1){



        maxi = max(maxi, dp(i));

    }



    cout<<maxi<<'\n';

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.2379870797432981x):
#include <bits/stdc++.h>

using namespace std;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);



const int MAXN = 1e5 + 5;



int n, m, d[MAXN];

vector<int> G[MAXN];



void dfs(int u) {

    d[u] = 1;

    for (int v : G[u]) {

        if (!d[v]) {

            dfs(v);

        }

        d[u] = max(d[u], d[v] + 1);

    }

}



int main() {

    IOS



    cin >> n >> m;

    

    int x, y;

    for (int i = 0; i < m; i++) {

        cin >> x >> y;

        G[x].push_back(y);

    }



    for (int i = 1; i <= n; i++) {

        if (!d[i]) {

            dfs(i);

        }

    }



    int ans = 0;

    for (int i = 1; i <= n; i++) {

        ans = max(ans, d[i]);        

    }

    cout << ans - 1 << '\n';

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define PI acos(-1)

#define falcon ios_base::sync_with_stdio(false) ; cin.tie(NULL) ;

typedef long long ll ;

using namespace std ;



vector <int> g[100001] , d(100001 , -1) ;

int maxlength = INT_MIN ;



void DFS(int s)

{

    d[s] = 0 ;

    for(int i = 0 ; i < g[s].size() ; i++)

    {

        int n = g[s][i] , length = 0 ;

        if(d[n] == -1) DFS(n) ;

        length = 1 + d[n] ;

        d[s] = max(d[s] , length) ;

    }

    maxlength = max(maxlength , d[s]) ;

}



int main()

{

    falcon ;



    int n , m ;

    cin >> n >> m ;

    for(int i = 0 ; i < m ; i++)

    {

        int u , v ;

        cin >> u >> v ;

        g[u].push_back(v) ;

    }

    for(int i = 1 ; i <= n ; i++) DFS(i) ;

    cout << maxlength << "\n" ;

}

// Faster C++ solution for the same problem (measured speedup: 1.114905524669245x):
#include <bits/stdc++.h>

using namespace std;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0);



const int MAXN = 1e5 + 5;



int n, m, d[MAXN];

vector<int> G[MAXN];



void dfs(int u) {

    d[u] = 1;

    for (int v : G[u]) {

        if (!d[v]) {

            dfs(v);

        }

        d[u] = max(d[u], d[v] + 1);

    }

}



int main() {

    IOS



    cin >> n >> m;

    

    int x, y;

    for (int i = 0; i < m; i++) {

        cin >> x >> y;

        G[x].push_back(y);

    }



    for (int i = 1; i <= n; i++) {

        if (!d[i]) {

            dfs(i);

        }

    }



    int ans = 0;

    for (int i = 1; i <= n; i++) {

        ans = max(ans, d[i]);        

    }

    cout << ans - 1 << '\n';

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

using namespace std;

ll n,m,x,y;

vector<ll>v[100009];

ll dp[100009];



ll f(ll N){

	if (v[N].empty())return 0;

	if(dp[N]!=-1)return dp[N];

	ll z=0;

	for(int i=0; i<v[N].size(); i++){

		z=max(z,f(v[N][i])+1);

	}

	dp[N]=z;

	return dp[N];

}



int main(){

	cin >> n >> m;

	memset(dp,-1,sizeof dp);

	for(int i=1; i<=m; i++){

		cin >> x >> y;

		v[x].push_back(y);

	}

	ll jwb=0;

	for(int i=1; i<=n; i++){

		jwb=max(jwb,f(i));

	}

	cout << jwb << endl;

}//j

// Faster C++ solution for the same problem (measured speedup: 1.110378423554287x):
#include<bits/stdc++.h>

using namespace std;



vector<int> adj[100005];

int n,m;



int level[100005];

int dfs(int source){

    if(level[source]!=-1) return level[source];

    int res=0;

        for(int i=0;i<adj[source].size();i++){

            int v;

            v=dfs(adj[source][i]);

            res=max(res,v);

    }

    res++;

    level[source]=res;

    return res;

   

}

int main(){

   

     memset(level,-1,sizeof(level));

    cin >> n >> m;

    while(m--){

        int a,b;

        cin >> a >> b;

        adj[a].push_back(b);

    }

    vector<int> xoxo;

    for(int i=1;i<=n;i++){

        xoxo.push_back(dfs(i));

    }

    sort(xoxo.begin(),xoxo.end(),greater<int>());

    

    cout << xoxo[0]-1 << endl;

    

   

    

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define ull unsigned long long

#define mst(a, b) memset((a), (b), sizeof(a))

#define mp(a, b) make_pair(a, b)

#define pi acos(-1)

#define pii pair<int, int>

#define pb push_back

const int INF = 0x3f3f3f3f;

const double eps = 1e-10;

const int maxn = 1e5 + 7;

const int maxm = 5e5 + 10;

const int mod = 1e9 + 7;

vector<int> s[maxn];

int vis[maxn];

int dp[maxn];

int main()

{

    ios::sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

    mst(vis, 0);

    mst(dp, 0);

    queue<int> q;

    int n, m;

    cin >> n >> m;

    for (int i = 0; i < m; ++i)

    {

        int x, y;

        cin >> x >> y;

        vis[y]++;

        s[x].pb(y);

    }

    for (int i = 1; i <= n; ++i)

    {

        if (!vis[i])

            q.push(i);

    }

    while (!q.empty())

    {

        int now = q.front();

        q.pop();

        int len = s[now].size();

        for (int i = 0; i < len; ++i)

        {

            dp[s[now][i]] = max(dp[s[now][i]], dp[now] + 1);

            vis[s[now][i]]--;

            if (vis[s[now][i]] == 0)

                q.push(s[now][i]);

        }

    }

    int ans = 0;

    for (int i = 1; i <= n; ++i)

        ans = max(ans, dp[i]);

    cout << ans << endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.1225020090024012x):
#include<bits/stdc++.h>

using namespace std;



vector<int> adj[100005];

int n,m;



int level[100005];

int dfs(int source){

    if(level[source]!=-1) return level[source];

    int res=0;

        for(int i=0;i<adj[source].size();i++){

            int v;

            v=dfs(adj[source][i]);

            res=max(res,v);

    }

    res++;

    level[source]=res;

    return res;

   

}

int main(){

   

     memset(level,-1,sizeof(level));

    cin >> n >> m;

    while(m--){

        int a,b;

        cin >> a >> b;

        adj[a].push_back(b);

    }

    vector<int> xoxo;

    for(int i=1;i<=n;i++){

        xoxo.push_back(dfs(i));

    }

    sort(xoxo.begin(),xoxo.end(),greater<int>());

    

    cout << xoxo[0]-1 << endl;

    

   

    

}