97精品国产97久久久久久免费,无码国内精品久久人妻,久久精品国产只有精品66

Pku 1068 Parencodings

Darren — Thu, 30 Oct 2008 11:44:00 GMT

#include < iostream >
#include < vector >

using namespace std;

int main()
{
     int   test;
    scanf( " %d " , & test);

     int d[ 25 ];
     while ( test -- )
     {
         int n;
        vector < char >   t;

        scanf( " %d " , & n );
         for ( int i = 0 ; i < n; ++ i ) scanf( " %d " , d + i );

         int cu = d[ 0 ];
         for ( int i = 0 ; i < cu; ++ i )  t.push_back( ' ( ' ); t.push_back( ' ) ' );

         for ( int i = 1 ; i < n; ++ i )
         {
             int   a = d[i] - cu;
            cu = d[i];

             for ( int j = 0 ; j < a; j ++ )
            t.push_back( ' ( ' );

            t.push_back( ' ) ' );
        }

         bool   b = false ;
         for ( size_t i = 0 ; i < t.size(); ++ i )
         {
             if ( t[i] == ' ) ' )
             {
                 int num = 0 ;
                 int j = i;

                 for ( ; j >= 0 ; j -- )
                 {
                     if ( t[j] == ' ) ' ) num ++ ;
                     else              num -- ;

                     if (  num == 0 ) break ;
                }

                 for ( int k = j; k <= i; ++ k )
                 if (  t[k] == ' ( ' ) num ++ ;

                 if ( ! b )
                 {
                    printf( " %d " , num );
                    b = true ;
                }
                 else printf( " %d " , num );
            }
        }

        printf( " \n " );
    }

     return 0 ;
}

Darren 2008-10-30 19:44 发表评论

Pku 1028 Web Navigation

Darren — Thu, 30 Oct 2008 05:16:00 GMT

#include < stdio.h >
#include < string .h >

#define N 110

char str[ 10 ];
char queue[N][ 100 ];
int   top = 0 ;
int   len = 1 ;

int main()
{
    strcpy( queue[ ++ top], " http://www.acm.org/ " );

     while ( scanf( " %s " , str), strcmp( str, " QUIT " ) != 0 )
     {
         if ( strcmp( str, " VISIT " ) == 0 )
         {
            scanf( " %s " , queue[ ++ top] );
            printf( " %s\n " , queue[top] );

            len = top;
        }
         else if ( strcmp( str, " BACK " ) == 0 )
         {
            top -- ;
             if ( top < 1 )
             {
                printf( " Ignored\n " );
                top ++ ;
            }
             else printf( " %s\n " , queue[top] );
        }
         else if ( strcmp( str, " FORWARD " ) == 0 )
         {
            top ++ ;

             if ( top > len ) {  printf( " Ignored\n " );  top -- ; }
             else   printf( " %s\n " , queue[top] );
        }
    }

     return 0 ;
}

Darren 2008-10-30 13:16 发表评论

Darren — Fri, 24 Oct 2008 15:45:00 GMT

#include < stdio.h >

__int64  result;

__int64  gcd( __int64 a, __int64 b, __int64 & x, __int64 & y )
{
    __int64 t,ret;
     if ( ! b ) {
        x = 1 ,y = 0 ;
         return a;
    }

    ret = gcd( b, a % b, x, y );
    t = x, x = y, y = t - a / b * y;

     return ret;
}

bool   f( __int64 a, __int64 b, __int64 n )
{
    __int64  d, e, x, y, i;

    d = gcd( a, n, x, y );
     if ( b % d != 0 ) return false ;

    result = ( x * (b / d ) % n + n ) % n;
     return true ;
}

int main()
{
    __int64 x, y,m,n,l;

     while ( scanf( " %I64d%I64d%I64d%I64d%I64d " , & x, & y, & m, & n, & l) != EOF )
     {
         if ( f( n - m, x - y, l ) )  printf( " %I64d\n " , result );
         else                       printf( " Impossible\n " );
    }

     return 0 ;
}

Darren 2008-10-24 23:45 发表评论