10719 - Quotient Polynomial

[Victor Barinov]

I cant uderstand what is wrong.
Help, please

[Eduard]

Hello Victor Barinov.
I think if your algo is right you won't get WA, because I think ther aren't spesial cases.Tell me your algorithm and may be I can help you.

Eduard.

[Victor Barinov]

///// c[] - array of coefficients p(x)

.....

lc = 0;
for (i = 1; i < n; ++i) {
cc = k*lc + c; /// calculating coefficient for q(x)
printf(" %ld", cc); /// out coefficient for q(x)
lc = cc;
}

cc = k*lc + c; /// calculating reminder r
printf("\nr = %ld\n", cc); /// out reminder r

....

May be you can give me some tests?

[wook]

Hi.

How about this input?

for example

Code: Select all

3
1

or

q(x) = x
q(x) = 2 * x


I think that if your algorithm is correct,

you will get accepted

(Check for output format, too )

[Victor Barinov]

Can anybody give me correct output file for this input:

3
1 -7 15 -8
3
1 -7 15 -9
3
1
3
0 0 0 0 5

[Eduard]

My AC solution outputs.
Output

Code: Select all

q(x): 1 -4 3
r = 1
q(x): 1 -4 3
r = 0
q(x):
r = 1
q(x): 0 0 0 0
r = 5

[bugzpodder]

there maybe some residue spaces/endlines in the end of input.

[Victor Barinov]

My mistake was very silly. I forgot that k may be negative
But now I got AC, and I very happy.
Thanks to everybody who tried to help me!

[yiuyuho]

I find something interesting, when I implemented it, I actually have
q(x) : 0

if p(x) is constant and get WA.

So much for unnecessary steps

[soumit]

How on earth can i get TLE in 10719 ... any ideas ????

heres my code

#include<stdio.h>
#include<math.h>
#include<ctype.h>
#define MAXN 10020


long p[MAXN],q[MAXN],r;
char input[MAXN*12];


void swap(long &a,long &b)
{
long temp;
temp=a;
a=b;
b=temp;
}


long read_p()
{
long i,j,n;

gets(input);

n=0;

for(i=0;input;i++)
{
sscanf(&input,"%ld",&p[n++]);

do{
i++;
}while(input=='-' || isdigit(input));

if(input==0)
break;
}

--n;
for(i=0,j=n;i<=j;i++,j--)
swap(p,p[j]);

return n;
}



int main()
{
long i,n,k;

// freopen("in10719.txt","r",stdin);

while(scanf("%ld\n",&k)==1)
{
n=read_p();

q[n]=0;

for(i=1;i<=n;i++)
{
q[n-i]=p[n-i+1]+k*q[n-i+1];
}

r=p[0]+k*q[0];

printf("q(x):");

for(i=n-1;i>=0;i--)
{
printf(" %ld",q);
}

printf("\nr = %ld\n\n",r);
}

return 0;
}

[Zuberul]

sscanf(&input,"%ld",&p[n++]);

use only input as the first param.
i havnt tested your code.
but looking at it i think there may be some problem in input
parsing.
try to use strtok().

[Sanny]

I'm not sure if this TLE is for input parsing. But I'm pretty much sure that if you use strtok(), you'll get TLE. I took input character by character in this problem.

Regards
Sanny

[sohel]

But I'm pretty much sure that if you use strtok(), you'll get TLE

Not quite..
.. I used strtok() and got it AC.

[Sanny]

Then maybe you use strtok() in a more efficient way than me. During contest time, I got TLE on this problem for using strtok().

Regards
Sanny

[sohel]

I use strtok() in the standard way, I think.

Code: Select all

#include<string.h>
#include<vector>

using namespace std;

int main() {
 char *p;
 int a;
 char str[1000];
 vector<int> V;
 gets(str);
 p = strtok(str, " ");
 sscanf(p, "%d", &a);
 V.push_back(a);
 while(1) {
  p = strtok(NULL, " ");
  if( !p ) break;
  sscanf(p, "%d", &a);
  V.push_back(a);
 }
}