-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathuva10082.cpp
More file actions
159 lines (146 loc) · 3.88 KB
/
uva10082.cpp
File metadata and controls
159 lines (146 loc) · 3.88 KB
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
/*
Author: Golam Rahman Tushar
........Aust Cse 27th batch.........
*/
//{ Template
//{ C-headers
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cfloat>
#include <cctype>
#include <cassert>
#include <ctime>
//}
//{ C++-headers
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <utility>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
using namespace std;
//}
//}
//{ Floating-points
#define EPS DBL_EPSILON
#define abs(x) (((x) < 0) ? - (x) : (x))
#define zero(x) (abs (x) < EPS)
#define equal(a,b) (zero ((a) - (b)))
#define PI 2 * acos (0.0)
//}
#define max(a,b) (a)>(b)?(a):(b)
#define min(a,b) (a)<(b)?(a):(b)
#define memo(a,v) memset(a,v,sizeof(a))
#define all(a) a.begin(),a.end()
#define INF 1<<29
#define ll long long
#define db double
#define pii pair<int ,int >
#define NL puts("")
#define G getchar()
template <typename T>
std::string to_string(T const& value) {
stringstream sstr;
sstr << value;
return sstr.str();
}
//}
//compute b^p
ll Pow(ll b,ll p){
ll ret = 1;
while(p){
if(p&1) ret *= b ;
p >>= (1ll) , b *= b ;
}
return ret ;
}
//compute b^p%m
ll BigMod(ll b,ll p ,ll m ){
ll ret = 1 ;
while(p) {
if(p&1) ret = (ret * b ) % m ;
p >>= (1ll) , b = (b*b)%m ;
}
return ret ;
}
//compute gcd of (a,b)
ll GCD(ll a , ll b){
while(b) b ^= a ^= b ^= a %= b ;
return a;
}
//compute lcm of (a,b)
ll LCM(ll a , ll b) {
return (a / GCD(a,b)*b);
}
ll power(ll n,ll m)
{
ll ans=1,p=n;
while(m)
{
if(m&1) ans*=p;
p*=p;
m=m>>1;
}
return ans;
}
int main ()
{
char c;
while(scanf("%c",&c)==1)
{
if(c=='1') printf("`");
if(c=='2') printf("1");
if(c=='3') printf("2");
if(c=='4') printf("3");
if(c=='5') printf("4");
if(c=='6') printf("5");
if(c=='7') printf("6");
if(c=='8') printf("7");
if(c=='9') printf("8");
if(c=='0') printf("9");
if(c=='-') printf("0");
if(c=='=') printf("-");
if(c=='W') printf("Q");
if(c=='E') printf("W");
if(c=='R') printf("E");
if(c=='T') printf("R");
if(c=='Y') printf("T");
if(c=='U') printf("Y");
if(c=='I') printf("U");
if(c=='O') printf("I");
if(c=='P') printf("O");
if(c=='[') printf("P");
if(c==']') printf("[");
if(c=='\\') printf("]");
if (c=='S') printf("A");
if (c=='D') printf("S");
if (c=='F') printf("D");
if (c=='G')printf("F");
if (c=='H') printf("G");
if (c=='J') printf("H");
if (c=='K') printf("J");
if (c=='L') printf("K");
if (c==';') printf("L");
if (c=='\'') printf(";");
if (c=='X') printf("Z");
if (c=='C') printf("X");
if (c=='V') printf("C");
if (c=='B') printf("V");
if (c=='N') printf("B");
if (c=='M') printf("N");
if (c==',') printf("M");
if (c=='.') printf(",");
if (c=='/') printf(".");
if (c==' ') printf(" ");
if (c=='\n') printf("\n");
}
return 0;
}