forked from imabhinav-am/Competetive-Programming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRepeatedString.cpp
More file actions
53 lines (48 loc) · 775 Bytes
/
Copy pathRepeatedString.cpp
File metadata and controls
53 lines (48 loc) · 775 Bytes
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
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
int main(){
string s;
cin >> s;
int N= s.size();
long long n,res=0,ctr=0,rem,qt;
cin >> n;
for(int i=0;i<s.size();i++)
{
if(s[i]=='a')
ctr++;
}
if(ctr!=0)
{
rem=n%N;
qt=n/N;
res=qt*ctr;
for(int i=0;i<rem;i++)
{
if(s[i]=='a')
res++;
}
}
cout<<res;
return 0;
}