OJ Board

thanks , rio. i got accepted.
I am very weak in presentation.

I got PE in 983 . plz help me

here 's my code:

///edit

divisors formula something like this :
( q1+1)(q2+1).........(qn+1) -2 ; u must extracted first and last divisor.
20=2x2x5
so , there r (2+1)(1+1) -2 = 4 divisors.
there r (1 + 2/2)(1 + 1 / 2) = 2 divisor of the form x^2,x^3,...........................
so ,total = 4+2 = 6

read system call reads up to n bytes of data from the file associated with the file descriptor f1 & places them in the data area buf . u can learn more reading any book about system programming in Linux or Unix , there's a lot of thing to learn other then acm.
:wink:

code:

#include<unistd.h ...

Why WA??

'cause it's wrong.
try this simple input:
5
1 1 1 1 1
output:
11111

but ur out put:
0
which is simply wrong .

If the problem is simple & specific, then where is our challenges?

so from ur point of view it's a challenging problem , what's the challenge , to write a simple
sieve without any optimization.

thanks for ur Help.

I need to make a tiny notepad in java .The notepad consists a JTextArea , a JTextField
for selecting the file location, and 4 JButton . JButton save for save the text written in JTextArea , JButton Open for Open the file written in JTextField , JButton clean for clear the
text written in JTextArea ...