HackerRank Repeated String Solution

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int main(){
    char* s = (char *)malloc(512000 * sizeof(char));
    scanf("%s",s);
    long n,o,p,i; 
    scanf("%ld",&n);
    o=0;
    for(i=0;s[i]!='\0';i++)
        {
        if(s[i]=='a')
            o++;
    }
    p=n%i;
    n=n/i;
    o=o*n;
    n=0;
    for(i=0;i<p;i++)
        if(s[i]=='a')
        n++;
        printf("%ld",o+n);
    return 0;
}

#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <cmath>
#include <ctime>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector< vector<int> > vvi;
typedef vector<ll> vl;
typedef vector< vector<ll> > vvl;
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define forv(i, v) forn(i, v.size())
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
int main() {
#ifdef NEREVAR_PROJECT
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    string s;
    ll n;
    cin >> s >> n;
    ll ca = 0;
    forv(i, s) if (s[i] == 'a') ca++;
    int m = (int)s.size();
    ll k = n / m;
    int r = n % m;
    ll ans = k * ca;
    forn(i, r) if (s[i] == 'a') ans++;
    cout << ans << endl;
    return 0;
}

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        long n = in.nextLong();
        long num = n/s.length();
        long rem = n%s.length();
        long ans = 0;
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i)=='a') {
                ans += num;
                if (i < rem)
                    ans++;
            }
        }
        System.out.println(ans);
    }
}

#!/bin/python
import sys
s = raw_input().strip()
n = long(raw_input().strip())
cnt=0
cnt1=0
L=len(s)
k=n%L
for i in range(L):
    if s[i]=='a':
        cnt+=1
        if i<k: cnt1+=1
print cnt*(n/L)+cnt1

process.stdin.resume();
process.stdin.setEncoding('ascii');
var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;
process.stdin.on('data', function (data) {
    input_stdin += data;
});
process.stdin.on('end', function () {
    input_stdin_array = input_stdin.split("\n");
    main();    
});
function readLine() {
    return input_stdin_array[input_currentline++];
}
/////////////// ignore above this line ////////////////////
function main() {
    var s = readLine().split("");
    var n = parseInt(readLine());
    
    var stringSize = s.length;
    var a = s.filter((a) => a == 'a').length;
    
    var repeat = Math.floor(n/stringSize);
    
    var left = n-(repeat*stringSize);
    
    
    
    console.log((repeat*a) + s.filter((a,i) => a == 'a' && i < left).length);

object Solution {
    def main(args: Array[String]) {
        val sc = new java.util.Scanner (System.in);
        val s = sc.next();
        val n = sc.nextLong();
        
        if (n <= s.length) {
            println(s.take(n.toInt).count(c => c == 'a'))
        }
        else {
            val noOfA = s.count(c => c == 'a')
            val k = n % s.length
            val x = n/s.length
            val ans = noOfA * x + s.take(k.toInt).count(c => c == 'a')
            println(ans)
        }
    }
}

(* Enter your code here. Read input from STDIN. Print output to STDOUT *)
uses math;
var  n,m,ans:int64;
     i:longint;
     s:ansistring;
 begin
 readln(s);
 readln(n);
 m:=length(s);
 for i:=1 to length(s) do
  if (s[i]='a') then inc(ans);
  ans:=(n div m)*ans;
  for i:=1 to n mod m do
  if s[i]='a' then inc(ans);
writeln(ans);
 end.