Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

求这两个代码的区别！！！！！！！！！

Posted by wjjay003 at 2012-04-25 13:38:54 on Problem 2230

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>

using namespace std  ;

const int maxn = 10000+10 ;
const int maxe = 50000*2+10 ;

int to[maxe] , nxt[maxe] ;
int head[maxn] , vis[maxe] ;
int n , m , cnt ;

void addedge( int u , int v )
{
    to[cnt] = v ;
    nxt[cnt] = head[u] ;
    head[u] = cnt++ ;
}

void dfs( int u )
{
    for( int e = head[u] ; e!=-1 ; e=nxt[e] )
    {
        int v = to[e] ;
        if( !vis[e] )
        {
            vis[e] = 1 ;
            dfs( v );
        }
    }
    cout << u << endl ;
}

int main()
{
    int u , v ;
    while(scanf("%d%d",&n,&m)!=EOF )
    {
        memset(head,-1,sizeof(head));
        memset(vis,0,sizeof(vis));
        cnt = 0 ;
        for( int i = 0 ; i < m ; ++i )
        {
            scanf("%d%d",&u,&v);
            addedge(u,v);
            addedge(v,u);
        }
        dfs(1);
    }
    return 0 ;
}
------------------------------------------------------------------------------------------------------------------------------------------------------
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>

using namespace std  ;

const int maxn = 10000+10 ;
const int maxe = 50000*2+10 ;

int to[maxe] , nxt[maxe] ;
int head[maxn] , vis[maxe] ;
int n , m , cnt ;

void addedge( int u , int v )
{
    to[cnt] = v ;
    nxt[cnt] = head[u] ;
    head[u] = cnt++ ;
}

void dfs( int u )
{
    cout << u << endl ;
    for( int e = head[u] ; e!=-1 ; e=nxt[e] )
    {
        int v = to[e] ;
        if( !vis[e] )
        {
            vis[e] = 1 ;
            dfs( v );
        }
    }
}

int main()
{
    int u , v ;
    while(scanf("%d%d",&n,&m)!=EOF )
    {
        memset(head,-1,sizeof(head));
        memset(vis,0,sizeof(vis));
        cnt = 0 ;
        for( int i = 0 ; i < m ; ++i )
        {
            scanf("%d%d",&u,&v);
            addedge(u,v);
            addedge(v,u);
        }
        dfs(1);
    }
    return 0 ;
}

Followed by:

Re:求这两个代码的区别！！！！！！！！！ (2347) wjjay003 2012-04-25 13:39:59
- Re:求这两个代码的区别！！！！！！！！！ (23) 455462586 2013-08-31 23:19:22
提供一组能让你的第二个代码出错的数据 (39) changmu 2014-08-04 15:11:39

Post your reply here:

User ID:
Password:
Title:

Content:

> #include <iostream>
> #include <cstring>
> #include <cstdio>
> #include <cstdlib>
> #include <cmath>
> 
> using namespace std  ;
> 
> const int maxn = 10000+10 ;
> const int maxe = 50000*2+10 ;
> 
> int to[maxe] , nxt[maxe] ;
> int head[maxn] , vis[maxe] ;
> int n , m , cnt ;
> 
> void addedge( int u , int v )
> {
>     to[cnt] = v ;
>     nxt[cnt] = head[u] ;
>     head[u] = cnt++ ;
> }
> 
> void dfs( int u )
> {
>     for( int e = head[u] ; e!=-1 ; e=nxt[e] )
>     {
>         int v = to[e] ;
>         if( !vis[e] )
>         {
>             vis[e] = 1 ;
>             dfs( v );
>         }
>     }
>     cout << u << endl ;
> }
> 
> int main()
> {
>     int u , v ;
>     while(scanf("%d%d",&n,&m)!=EOF )
>     {
>         memset(head,-1,sizeof(head));
>         memset(vis,0,sizeof(vis));
>         cnt = 0 ;
>         for( int i = 0 ; i < m ; ++i )
>         {
>             scanf("%d%d",&u,&v);
>             addedge(u,v);
>             addedge(v,u);
>         }
>         dfs(1);
>     }
>     return 0 ;
> }
> ------------------------------------------------------------------------------------------------------------------------------------------------------
> #include <iostream>
> #include <cstring>
> #include <cstdio>
> #include <cstdlib>
> #include <cmath>
> 
> using namespace std  ;
> 
> const int maxn = 10000+10 ;
> const int maxe = 50000*2+10 ;
> 
> int to[maxe] , nxt[maxe] ;
> int head[maxn] , vis[maxe] ;
> int n , m , cnt ;
> 
> void addedge( int u , int v )
> {
>     to[cnt] = v ;
>     nxt[cnt] = head[u] ;
>     head[u] = cnt++ ;
> }
> 
> void dfs( int u )
> {
>     cout << u << endl ;
>     for( int e = head[u] ; e!=-1 ; e=nxt[e] )
>     {
>         int v = to[e] ;
>         if( !vis[e] )
>         {
>             vis[e] = 1 ;
>             dfs( v );
>         }
>     }
> }
> 
> int main()
> {
>     int u , v ;
>     while(scanf("%d%d",&n,&m)!=EOF )
>     {
>         memset(head,-1,sizeof(head));
>         memset(vis,0,sizeof(vis));
>         cnt = 0 ;
>         for( int i = 0 ; i < m ; ++i )
>         {
>             scanf("%d%d",&u,&v);
>             addedge(u,v);
>             addedge(v,u);
>         }
>         dfs(1);
>     }
>     return 0 ;
> }

Home Page Go Back To top