2013 gzhu 校赛

题目描述：

　　　　　　　　　　　　　　　　　　　　IP Checking

　　　　Time Limit: 2000/1000 MS (Java/Others)            Memory Limit: 128000/64000 KB (Java/Others)

 

Problem Description

An IP address is a 32 bit address formatted in the following way:

a.b.c.d

where a, b, c, d are integers each ranging from 0 to 255. Now you are given two IP addresses, first one in decimal form and second one in binary form, your task is to find if they are same or not.

Input

Each case starts with two lines.

First line contains an IP address in decimal form, and second line contains an IP address in binary form. In binary form, each of the four parts contains 8 digits. Assume that the given addresses are valid.

Output

For each case, print "Yes" if they are same, otherwise print "No".

Sample Input

192.168.0.100
11000000.10101000.00000000.11001000
65.254.63.122
01000001.11111110.00111111.01111010

Sample Output

No
Yes

 

 

　　死改死改死改！！！原来"No" 和 "Yes" 输出变成 "NO" 和 "YES" 了，而且还是问asdfgg的，瘀死了 = =！！记录下来是警醒自己以后不能再犯这种错误了！！！

 

#include <iostream>
#include <cstdio> 
#include <cstdlib> 
#include <cstring> 
using namespace std;   

const int maxn = 50; 
char s2[maxn]; 
int s[5];   

int main() 
{     
    char ch; 
    int t1, t2, t3, t4, l1, l2, l, i, j, p, tmp;     
    while (scanf("%d%c%d%c%d%c%d", &t1, &ch, &t2, &ch, &t3, &ch, &t4) != EOF)     
    {         
        scanf("%s", s2);         
        l2 = strlen(s2);         
        l1 = 7, l = tmp = 0;        
        for (i = 0; i < l2; i++)        
        {             
            if (s2[i] != '.')            
            {                 
                p = 1;                
                for (j = 1; j <= l1; j++)                   
                    p *= 2;               
                tmp += p * (s2[i]-'0');                
                l1--;           
             }             
            else           
            {                
                s[l++] = tmp;          
                tmp = 0;                
                l1 = 7;             
            }         
        }         
        s[l++] = tmp;      
        if (s[0] == t1 && s[1] == t2 && s[2] == t3 && s[3] == t4)           
            printf("Yes\n");         
        else            
            printf("No\n");     
    }     
    return 0; 
}