Advertisement
add1ctus

Petya and Strings

Sep 30th, 2015
102
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.78 KB | None | 0 0
  1. #include <iostream>
  2. #include <string>
  3. #include <algorithm>
  4.  
  5. using namespace std;
  6.  
  7. bool leksikografskiPomal(string a, string b)
  8. {
  9.     int limit=min(a.size(),b.size());
  10.     for(int i=0;i<limit;++i)
  11.         if(a[i]>b[i])
  12.             return false;
  13.         else if(a[i]<b[i])
  14.             return true;
  15.     if(a.size()>b.size())
  16.         return false;
  17.     return true;
  18. }
  19.  
  20. int main()
  21. {
  22.     string str1,str2;
  23.     cin>>str1>>str2;
  24.     for(int i=0;i<str1.size();++i)
  25.         if(str1[i]>='A' && str1[i]<='Z')
  26.             str1[i]+=32;
  27.     for(int i=0;i<str2.size();++i)
  28.         if(str2[i]>='A' && str2[i]<='Z')
  29.             str2[i]+=32;
  30.     if(str1==str2)
  31.         cout<<0;
  32.     else if(leksikografskiPomal(str1,str2))
  33.         cout<<-1;
  34.     else
  35.         cout<<1;
  36.     return 0;
  37. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement