Don't repeat my mistake and remember that you must calculate prime numbers up to 10000 (not to 100!). Maybe this test will help you:

9797
1
1
1
1
1
1
1
1
1

Answer = 4 (9797 = 97 * 101)

Sorry for my English :)

Edited by author 04.04.2010 19:55

ilyas: Please don't call people stupid. Everyone makes mistakes; the author simply forgot to calculate modulo 10.

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long a[10],l,s,z=1,q,f;
    vector<long long>v;
    vector<long long>p;
    bool prime[10000];
    memset(prime,true,sizeof(prime));
    for(int i=2;i<=10000;i++){
        if(prime[i]){
            for(int j=i*2;j<=10000;j=j+i){
                prime[j]=false;
            }
        }
    }
    for(int i=2;i<=10000;i++){
        if(prime[i]){
            v.push_back(i);
        }
    }
    q=v.size();
    f=v[q-1];
    for(int i=2;i<=f;i++){
        p.push_back(0);
    }
    for(int j=0;j<10;j++){
        cin>>a[j];
    }
    for(int i=0;i<10;i++){
        l=0,s=0;
        while(a[i]>=v[l]){
            if(a[i]%v[l]==0){
                //cout<<a[i]<<" "<<v[l]<<endl;
                p[v[l]]++;
                a[i]=a[i]/v[l];
            }
            else{
                l++;
            }
        }
    }
    for(int i=0;i<=p.size();i++){
        z=(z*(p[i]+1))%10000;
    }
    z=z%10;
    cout<<z;
    return 0;
}