You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
IF x(i) MOD j = 0 THEN p = 0<br />
NEXT j<br />
IF p = 1 THEN<br />
PRINT x(i); "na poziciji:"; i<br />
u = u * x(i)<br />
END IF<br />
NEXT i<br />
PRINT "Umnozak prostih je: "; u<br />
ZADATAK<br />
REM Upisite n<strong>iz</strong> od n prirodnih brojeva.<br />
3<br />
<strong>Zadaci</strong> <strong>iz</strong> <strong>QBASICa</strong> (n<strong>iz</strong>ovi, datoteke, funkcije)<br />
REM Ispisite za svaki broj <strong>iz</strong> tog n<strong>iz</strong>a njegove djelitelje.<br />
REM Ispisite poziciju najveceg clana n<strong>iz</strong>a i taj clan.<br />
CLS<br />
INPUT "Koliko ima brojeva: ", n<br />
DIM x(n)<br />
FOR i = 1 TO n<br />
PRINT i;<br />
INPUT "Broj: ", x(i)<br />
NEXT i<br />
REM djelitelji<br />
FOR i = 1 TO n<br />
PRINT<br />
PRINT "Djelitelji za broj:"; x(i)<br />
FOR j = 1 TO x(i)<br />
IF x(i) MOD j = 0 THEN PRINT j<br />
NEXT j<br />
NEXT i<br />
max = x(1)<br />
p = 1<br />
FOR i = 2 TO n<br />
IF max < x(i) THEN<br />
max = x(i)<br />
p = i<br />
END IF<br />
NEXT i
Change language