Greedy algorithm--coin problem

There are 1 yuan, 5 yuan, 10 yuan, 50 yuan, 100 yuan, 500 yuan coins each c1,c5,c10,c50,c100,c500 pieces. Now it's time to use these coins to pay a, at least how many coins you need.

#include <iostream>
using namespace std;
int v[6] = {1, 5, 10, 50, 100, 500};//coin face
int c[6] = {3, 2, 1, 3, 0, 2};//coin corresponds to the number of
int count = 0;
int A;
Calculate the minimum required number of coins
void Solve ()
{for
    (int i = 5; 0 <= i; i)
    {
        int t = min (A/v[i], c[i]);
        A-=  v[i] * t;
        Count + = t;
    }
    if (A = = 0)
    cout << count;
    else
    cout << "There is no way!";
}
int main ()
{
    cin >> A;
    Solve ();
    return 0;
}