C++ code for MUL prob

[kkjsk]

#include<iostream>
using namespace std;
int main()
{
    int i,t,*k,*s;
    cin >> t;
    k = new int[t];
    s = new int[t];
    for(i=0;i<t;i++)
    {
        cin >> k[i] >> s[i];
    }
    for( i=0 ; i<t ; i++)
    {
        cout << k[i]*s[i] << endl;
    }
    return 0;
}

its showing wrong ans..
can anyone tell me mistake??

[leppyr64]

Welcome to the forum!

Please note that I have added code tags to your post, whenever you post code, please use them.

As for your question, make sure that you read the problem statement in it's entirety and note all of the details.

l1 l2 [numbers to multiply (at most 10000 decimal digits each)]

int only holds values less than 2^31. 10^10000 is much larger than that. You will need to find a more creative solution to this problem. This is a much more advanced problem than the factorial problem that you are also working on.