-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathVersion Checker.cpp
63 lines (56 loc) · 1.68 KB
/
Version Checker.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/**
* E:\Dropbox\Code\Toph\ProgKriya May'16\Version Checker.cpp
* Created on: 2016-05-01-18.54.44, Sunday
* Verdict: Not Solved
* Author: Enamul Hassan
**/
#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define SZ(a) ((ll)a.size())
#define sz 200005
#define pb push_back
#define pp pop_back()
#define all(a) a.begin(),a.end()
#define ll long long
#define cntbit(mask) __builtin_popcount(mask)
#define unify(a) stable_sort(a.begin(),a.end());a.resize(distance(a.begin(),unique(all(a))));
#define fread freopen("input.txt","r",stdin)
#define fwrite freopen("output.txt","w",stdout)
#define inf (1e18)
#define chng(a,b) a^=b^=a^=b;
#define clr(abc,z) memset(abc,z,sizeof(abc))
#define PI acos(-1)
#define pi 3.14159265358979323846264338327950288419716939937510
#define fr(i,a,b) for(i=a;i<=b;i++)
#define cspf printf("Case %d:", cas++);
#define csco cout<<"Case "<<cas++<<": ";
#define mod 1000000007
#ifdef ENAM
#define deb(args...) {dbg,args; cerr<<endl;}
#else
#define deb(args...)
#endif
ll bigmod(ll sonkha,ll ghat,ll vag_const){ll vag_shesh=1;while(ghat>0){if(ghat%2==1){vag_shesh=(vag_shesh*sonkha)%vag_const;}ghat/=2;sonkha=(sonkha*sonkha)%vag_const;}return vag_shesh;}
ll inverse_mod(ll bivajok, ll vag_const){return bigmod(bivajok,vag_const-2, vag_const);}
using namespace std;
int main()
{
#ifdef ENAM
// fread;
// fwrite;
#endif // ENAM
_
int cas = 1,t,n,m,x,y,z;
// clock_t begin, end;
// double time_spent;
// begin = clock();
string a,b;
cin>>a>>b;
if(a>b) cout<<a;
else cout<<b;
cout<<"\n";
// end = clock();
// time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
// cerr<<"Time spent = "<<time_spent<<endl;
return 0;
}