-
Notifications
You must be signed in to change notification settings - Fork 86
/
Copy pathtyama_stepic~2~2~7.cpp
20 lines (20 loc) · 1010 Bytes
/
tyama_stepic~2~2~7.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int i=0,k;
string s="atcaatgatcaacgtaagcttctaagcatgatcaaggtgctcacacagtttatccacaacctgagtggatgacatcaagataggtcgttgtatctccttcctctcgtactctcatgaccacggaaagatgatcaagagaggatgatttcttggccatatcgcaatgaatacttgtgacttgtgcttccaattgacatcttcagcgccatattgcgctggccaaggtgacggagcgggattacgaaagcatgatcatggctgttgttctgtttatcttgttttgactgagacttgttaggatagacggtttttcatcactgactagccaaagccttactctgcctgacatcgaccgtaaattgataatgaatttacatgcttccgcgacgatttacctcttgatcatcgatccgattgaagatcttcaattgttaattctcttgcctcgactcatagccatgatgagctcttgatcatgtttccttaaccctctattttttacggaagaatgatcaagctgctgctcttgatcatcgtttc";
map<string,int>m;
vector<pair<int,string> >v;
k=5;
for(;i<s.size()-k;i++){
m[s.substr(i,k)]++;
}
map<string,int>::iterator it=m.begin();
for(;it!=m.end();it++)v.push_back(make_pair(-it->second,it->first));
sort(v.begin(),v.end());
for(i=0,k=v[0].first;i<v.size()&&k==v[i].first;i++)cout<<v[i].second<<endl;
}