UVA 414 - Machined Surfaces Solution

- 
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
    int n;
    char s[26];
    while (scanf("%d",&n)==1)
    {
        if (!n) return 0;
        int max_x=0;
        int total_x=0;
        getchar();
        for (int i=0;i<n;i++)
        {
            gets(s);
            int cnt=0;
            for (int j=0;j<25;j++)
            {
                if (s[j]=='X') cnt++;
            }
            total_x+=cnt;
            max_x=max(max_x,cnt);
        }
        int ans=max_x*n-total_x;
        printf("%d\n",ans);
    }
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Codeforces 698A - Vacations

-
# include < cstdio > using namespace std ; int main ( ) { int n ; scanf ( " %d " , & n ) ; int a [ n ] ; for ( int i = 0 ; i < n ; i + + ) scanf ( " %d " , & a [ i ] ) ; int rest = 0 ; int p = 0 ; for ( int i = 0 ; i < n ; i + + ) { if ( a [ i ] = = 0 ) { rest + + ; p = 0 ; } else if ( ! p ) { p = a [ i ] ; } else if ( p = = 3 ) { p = a [ i ] ; } else if ( p = = 2 & & a [ i ] ! = 2 ) { p = 1 ; } else if ( p = = 2 & & a [ i ] = = 2 ) { p = 0 ; rest + + ; } else if ( p = = 1 & & a [ i ] ! = 1 ) { p = 2 ; } else if ( p = = 1 & & a [ i ] = = 1 ) { p = 0 ; rest + + ; } } p...
Read more

UVA 11364: Parking -Solution

-
# include < stdio.h > int main ( ) { int t , n , p , i , max , min , d ; scanf ( " %d " , & t ) ; while ( t - - ) { scanf ( " %d " , & n ) ; max = 0 ; min = 50000 ; for ( i = 0 ; i < n ; i + + ) { scanf ( " %d " , & p ) ; if ( max < p ) max = p ; if ( min > p ) min = p ; } d = ( max - min ) * 2 ; printf ( " %d \n " , d ) ; } return 0 ; }
Read more

UVA 11503 - Virtual Friends Solution

-
# include < iostream > # include < cstdio > # include < string > # include < vector > # include < map > # include < algorithm > using namespace std ; class DS { private : vector < int > parent , rank , setSize ; int numSets ; public : DS ( int n ) { numSets = n ; parent . assign ( n , 0 ) ; rank . assign ( n , 0 ) ; setSize . assign ( n , 1 ) ; for ( int i = 0 ; i < n ; i + + ) parent [ i ] = i ; } int findParent ( int i ) { return parent [ i ] = = i ? i : parent [ i ] = findParent ( parent [ i ] ) ; } bool isSame ( int i , int j ) { return findParent ( i ) = = findParent ( j ) ; } void unionSet ( int x , int y ) { int xRoot = findParent ( x ) ; int yRoot = findParent ( y ) ; if ( xRoot = = yRoot ) return ; if ( rank [ xRoot ] > rank [ yRoot ] ) { ...
Read more