Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int binary[50000],binary2[50000];
- int bin(int x)
- {
- int deci=0,i=0,rem;
- while(x!=0)
- {
- rem=x%10;
- x/=10;
- deci+=(rem*pow(2,i));
- ++i;
- }
- return deci;
- }
- int main()
- {
- long long int a,a1,a2,b,b1,b2,c,c1,c2,d,d1,d2,t,i,j,k;
- cin>>t;
- for(i=1;i<=t;i++)
- {
- scanf("%lld.%lld.%lld.%lld",&a,&b,&c,&d);
- scanf("%lld.%lld.%lld.%lld",&a1,&b1,&c1,&d1);
- a2=bin(a1);
- b2=bin(b1);
- c2=bin(c1);
- d2=bin(d1);
- if(a2==a && b2==b && c2==c && d2==d)
- cout<<"Case "<<i<<": "<<"Yes"<<endl;
- else
- cout<<"Case "<<i<<": "<<"No"<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement