# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364961 | maozkurt | Mobitel (COCI14_mobitel) | C++17 | 1 ms | 364 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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <stack>
#include <numeric>
#include <cassert>
#define endl '\n'
#define sp ' '
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
string org[] = {
"",
"", "abc", "def",
"ghi", "jkl", "mno",
"pqrs", "tuv", "wxyz"
};
int main(){
ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);cerr.tie(nullptr);
map<char,string> mm;
for(int i=1;i<=9;i++){
int cur;cin>>cur;
for(int j=0;j<org[cur].size();j++){
for(int k=0;k<=j;k++)
mm[org[cur][j]] += (char)i + '0';
}
}
string msg;cin>>msg;
int n = msg.size();
for(int i=0;i<n;i++){
cout << mm[msg[i]];
if(i+1<n && mm[msg[i+1]][0] == mm[msg[i]][0])
cout << '#';
}
cout << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |