Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #define ii long long int
- using namespace std;
- map<int,bool> mp;
- map<int,int> mp_ind;
- map<int,int> :: iterator it;
- vector<int> v1,v2;
- bool gen(int a,bool ss)
- {
- mp[a]=1;
- int new_num=0;
- while(1)
- {
- if(new_num==1)
- {
- mp.clear();
- return 0;
- }
- new_num=0;
- while(a!=0)
- {
- int digit=a%10;
- //printf("d:%d\n",digit);
- a/=10;
- new_num=new_num+(digit*digit);
- }
- if(mp.find(new_num)!=mp.end())
- break;
- mp[new_num]=1;
- a=new_num;
- if(ss==0)
- v1.push_back(a);
- else
- v2.push_back(a);
- }
- mp.clear();
- return 1;
- }
- int main()
- {
- // freopen("in.txt","r",stdin);
- // freopen("out.txt","w",stdout);
- int a,b;
- while(scanf("%d %d",&a,&b)==2)
- {
- v1.push_back(a);
- v2.push_back(b);
- int f1=gen(a,0);
- int f2=gen(b,1);
- for(int i=0;i<v1.size();i++)
- {
- printf("%d ",v1[i]);
- }
- printf("\n");
- for(int i=0;i<v2.size();i++)
- {
- printf("%d ",v2[i]);
- }
- printf("\n");
- if(f1!=f2)
- {
- printf("0\n");
- }
- else
- {
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement