# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713567 | ALTAKEXE | Mobitel (COCI14_mobitel) | C++14 | 1 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
//freopen("input.txt","r",stdin);
char s[101];
int a[11];
string ss;
string v[] = {"2", "22", "222", "3", "33", "333", "4", "44", "444", "5", "55", "555", "6", "66", "666", "7", "77", "777", "7777", "8", "88", "888", "9", "99", "999", "9999"};
for (int i = 0; i < 9; ++i) {
int x;
scanf("%d",&x);
a[x] = i + 1;
}
scanf("%s", s); int len = strlen(s);
int last = -1;
for (int i = 0; i < len; ++i) {
if (last == v[s[i] - 'a'][0] - '0') ss += "#";
last = v[s[i] - 'a'][0] - '0'; ss += v[s[i] - 'a'];
}
for (int i = 0; i < (int) ss.size(); ++i) {
if (ss[i] == '#') printf("#"); else printf("%c", '0' + a[ss[i] - '0']);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |