Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string>
- #include <algorithm>
- using namespace std;
- bool leksikografskiPomal(string a, string b)
- {
- int limit=min(a.size(),b.size());
- for(int i=0;i<limit;++i)
- if(a[i]>b[i])
- return false;
- else if(a[i]<b[i])
- return true;
- if(a.size()>b.size())
- return false;
- return true;
- }
- int main()
- {
- string str1,str2;
- cin>>str1>>str2;
- for(int i=0;i<str1.size();++i)
- if(str1[i]>='A' && str1[i]<='Z')
- str1[i]+=32;
- for(int i=0;i<str2.size();++i)
- if(str2[i]>='A' && str2[i]<='Z')
- str2[i]+=32;
- if(str1==str2)
- cout<<0;
- else if(leksikografskiPomal(str1,str2))
- cout<<-1;
- else
- cout<<1;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement