2799.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Source

Problem Id:2799  User Id:fzk 
Memory:40K  Time:90MS
Language:G++  Result:Accepted

Source 

#include <stdio.h>

int main( ) {
    int a[32], i, j, n, t[4], m[4];
    bool s[32];
    scanf( "%d", &n );
    scanf( "%d.%d.%d.%d", &t[0], &t[1], &t[2], &t[3] );
    for( i=0; i<32; i++ ) {
        a[i] = ( t[i/8] & (1<<7-(i%8)) );
        s[i] = false;
    }
    for( i=1; i<n; i++ ) {
        scanf( "%d.%d.%d.%d", &t[0], &t[1], &t[2], &t[3] );
        for( j=0; j<32; j++ ) {
           if( a[j] != ( t[j/8] & (1<<7-(j%8)) ) )
              s[j] = true;
        }
    }
    t[0] = t[1] = t[2] = t[3] = 0;
    m[0] = m[1] = m[2] = m[3] = 0;
    for( i=0; i<32 && !s[i]; i++ ) {
        if( a[i] )
            t[i/8] |= 1<<7-i%8;
        m[i/8] |= 1<<7-i%8;
    }
    
    printf( "%d.%d.%d.%d\n%d.%d.%d.%d\n", t[0], t[1], t[2], t[3], m[0], m[1], m[2], m[3] );
    scanf( "%s" );
    return 0;
}