Try to use fread to read e fwrite to write:
char aux[2000000], *p = aux;
fread(aux, 1, 2000000, stdin);
while(1)
{
n = atoi(p);
while(*p != '\n')
p++ ;
p++;
}
I think this is not the objective of the problem!
Wladimir Araujo Tavares
*Federal University of Ceará
*
On Sat, Jun 25, 2011 at 7:08 AM, prathimzn <[email protected]> wrote:
> somebody answer how to reduce time....
>
> *- - - - -
> WITH REGARDS,
>
> *
> *
> PRAMENDRA RATHI
> *
> **
>
> *B.TECH 2ND YEAR*
> *COMPUTER SCIENCE AND ENGINEERING*
> *NIT ALLAHABAD*
>
>
>
> On Sat, Jun 25, 2011 at 12:27 AM, prathimzn <[email protected]> wrote:
>
>> sorry my time is 0.2 and i use simple int array and sort function of
>> <algorithm>...
>>
>> *- - - - -
>> WITH REGARDS,
>>
>> *
>> *
>> PRAMENDRA RATHI
>> *
>> **
>>
>> *B.TECH 2ND YEAR*
>> *COMPUTER SCIENCE AND ENGINEERING*
>> *NIT ALLAHABAD*
>>
>>
>>
>> On Sat, Jun 25, 2011 at 12:04 AM, sunny agrawal
>> <[email protected]>wrote:
>>
>>> i am not sure about this
>>> but when i solved this problem using simple scanf, printf and sort
>>> function of algorithm library, my time was 0.08 so might be reading the
>>> values in character buffer and then parsing then in ints may help
>>>
>>> how did you implemented ?
>>> did you implemented your own sort funtion ?
>>> which input/output methods you used ?
>>>
>>>
>>> On Fri, Jun 24, 2011 at 11:23 PM, prathimzn <[email protected]> wrote:
>>>
>>>>
>>>> http://www.spoj.pl/problems/FASHION/
>>>>
>>>> i summit this question and my time is 0.02 as i used sorting and then
>>>> multiply corresponding index value and sum them to get ans.
>>>>
>>>> but best time is 0.00 and 1.6M in C.
>>>> can anyone tell me what is the best algo to solve this problem in 0.00
>>>> i.e. best algo
>>>>
>>>> *
>>>>
>>>> - - - - -
>>>> WITH REGARDS,
>>>> PRAMENDRA RATHI
>>>> *
>>>> **
>>>> *B.TECH 2ND YEAR*
>>>> *COMPUTER SCIENCE AND ENGINEERING*
>>>> *NIT ALLAHABAD*
>>>>
>>>> --
>>>> You received this message because you are subscribed to the Google
>>>> Groups "Algorithm Geeks" group.
>>>> To post to this group, send email to [email protected].
>>>> To unsubscribe from this group, send email to
>>>> [email protected].
>>>> For more options, visit this group at
>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>
>>>
>>>
>>>
>>> --
>>> Sunny Aggrawal
>>> B-Tech IV year,CSI
>>> Indian Institute Of Technology,Roorkee
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to [email protected].
>>> To unsubscribe from this group, send email to
>>> [email protected].
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
