Both the submissions link for round 1031(Div. 2) Problem A: 324461703 and 324461494

MikeMirzayanov

https://www.acmicpc.net/problem/11047

int n, k;

cin >> n >> k;

vector<int> coins(n);

for (int i = 0; i < n; ++i) cin >> coins[i];

int ans = 0;

for (int i = 0; i < n; ++i) {

    int c = coins[i];

    while (k >= c) {

        int cnt = k / c;

        ans += cnt;

        k -= cnt * c;

    }

}

cout << ans << endl;

return 0;

https://www.naukri.com/code360/library/minimum-number-of-operation-required-to-convert-number-x-into-y

both these problems have a similar solution, which I didn't used but I guess it is a very simple greedy logic which atleast more than 1 of my friends( 324464959) have used and still its acceptable but not in my case maybe due to even the variable name being same but I guess this question had a quiet simple solution and shouldn't even be checked for plag but even if checked I don't think my solution is some uncommon one? I would like it to go through a recheck process for this question if possible.