Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- typedef struct ipaddress
- {
- int d[4], b[4], db[4];
- }ip;
- int main()
- {
- int n, i=0;
- scanf("%d", &n);
- ip ipp[n];
- while(i<n)
- {
- int j=0, k=0;
- while(j<8)
- {
- if(j<4) scanf("%d", &ipp[i].d[k]);
- else scanf("%d", &ipp[i].b[k]);
- int remainder, x=1, binn=0;
- while(ipp[i].d[k]!=0)
- {
- remainder=ipp[i].d[k]%2;
- ipp[i].d[k]/=2;
- binn+=remainder*x;
- x*=10;
- }
- ipp[i].db[k]=binn;
- k++;
- if(k==4) k=0;
- j++;
- }
- if((ipp[i].b[0]==ipp[i].db[0])&&(ipp[i].b[1]==ipp[i].db[1])&&(ipp[i].b[2]==ipp[i].db[2])&&(ipp[i].b[3]==ipp[i].db[3])) printf("Case %d: YES\n", i+1);
- else printf("Case %d: NO\n", i+1);
- i++;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement