Advertisement
Farjana_akter

Untitled

Jan 21st, 2020
106
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.31 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. long long int numbr[200000];
  5. int main()
  6. {
  7. long long int i,j,k,num,cas=1;
  8. while(cin>>num && num)
  9. {
  10. for(i=0;i<num;i++)
  11. cin>>numbr[i];
  12. long long int suru,sesh,len,flag=0,pos;
  13. string s1,s2;
  14. cout<<"Case "<<cas++<<":"<<endl;
  15. for(i=0;i<num;i++)
  16. {
  17. if(numbr[i]+1 == numbr[i+1])
  18. {
  19. suru=i;
  20. j=i;
  21. while(numbr[j]+1 == numbr[j+1])
  22. {
  23. j++;
  24. }
  25. sesh=j;
  26. cout<<"0"<<numbr[suru]<<"-";
  27. s1=to_string(numbr[suru]);
  28. s2=to_string(numbr[sesh]);
  29. flag=0;
  30. for(k=0;k<s2.length();k++)
  31. {
  32. if(s1[k]!=s2[k])
  33. {
  34. pos=k;
  35. break;
  36. }
  37. }
  38. // cout<<"Pos "<<pos<<endl;
  39. for(k=pos;k<s2.length();k++)
  40. cout<<s2[k];
  41. cout<<endl;
  42. i=j;
  43. }
  44. else
  45. {
  46. cout<<"0"<<numbr[i]<<endl;
  47. }
  48. }
  49. cout<<endl;
  50. }
  51. return 0;
  52. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement