ACM (UVa) : 11074


// http://online-judge.uva.es/p/v110/11074.html

#include <stdio.h>

int s, t, n;

void drawing_line ()
{
    int length = (s * n) + ((n + 1) * t);

    for ( int i = 0; i < t; i++ ) {
        for ( int j = 0; j < length; j++ )
            printf ("*");
        printf ("\n");
    }
}

void grid ()
{
    for ( int i = 0; i < s; i++ ) {
        for ( int j = 0; j < n; j++ ) {
            for ( int k = 0; k < t; k++ )
                printf ("*");
            for ( int k = 0; k < s; k++ )
                printf (".");
        }

        for ( int k = 0; k < t; k++ )
            printf ("*");
        printf ("\n");
    }



}

int main ()
{
    int cases = 0;

    while ( scanf ("%d %d %d", &s, &t, &n) ) {
        if ( s == 0 && t == 0 && n == 0 )
            return 0;

        printf ("Case %d:\n", ++cases);

        for ( int i = 0; i < n; i++ ) {
            drawing_line ();
            grid ();
        }

        drawing_line ();

        printf ("\n");
    }

    return 0;
}

One thought on “ACM (UVa) : 11074

  1. Critical Input :
    0 0 1
    0 1 0
    0 1 1
    1 0 0
    1 0 1
    1 1 0
    1 1 1
    0 1 2
    1 2 3
    0 0 0
    
    Critical Output :
    Case 1:
    
    Case 2:
    *
    
    Case 3:
    **
    **
    
    Case 4:
    
    Case 5:
    .
    
    Case 6:
    *
    
    Case 7:
    ***
    *.*
    ***
    
    Case 8:
    ***
    ***
    ***
    
    Case 9:
    ***********
    ***********
    **.**.**.**
    ***********
    ***********
    **.**.**.**
    ***********
    ***********
    **.**.**.**
    ***********
    ***********
    
    

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s