-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDecode String.cpp
More file actions
68 lines (64 loc) · 1.45 KB
/
Decode String.cpp
File metadata and controls
68 lines (64 loc) · 1.45 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
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <map>
#include <string>
#include <iomanip>
#include <cstring>
#include <utility>
#include<bits/stdc++.h>
using namespace std;
void init() {
cin.tie(0);
cin.sync_with_stdio(0);
}
int toNum(char c){
return c-48;
}
char toChar(int i, int j){
char c = (i+ (j*10) + 96);
/*if(c<=96)
c+=22;*/
return c;
}
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
init();
int n;
cin >> n;
string arr[n];
for(int i=0 ; i<n ; i++){
arr[i]="";
int s;
cin >>s;
string wo;
cin >> wo;
for(int j=0; j<s ; j++){
if(j<s-3){
if(wo[j+2]!='0' || (wo[j+2]=='0' && wo[j+3]=='0')){
char c1 = wo[j];
arr[i] = arr[i] + toChar(toNum(c1),0);
}
else{
arr[i] = arr[i] + toChar(toNum(wo[j+1]), toNum(wo[j]));
j+=2;
}
}
else{
if(wo[s-1]=='0'){
arr[i] = arr[i] + toChar(toNum(wo[j+1]), toNum(wo[j]));
j+=2;
}
else
arr[i] = arr[i] + toChar(toNum(wo[j]),0);
}
}
}
for(int i=0; i<n; i++){
cout << arr[i] << endl;
}
return 0;
}