编写程序，求以3为底，1000的对数值

i = 1

s = 0

DO

IF i MOD 3 = 0 THEN

s = s + i

ELSE

i = i + 1

LOOP UNTIL i >= 1000

PRINT s

END

或者

1到1000能被3整除的数的和为：166833，代码如下：

*************************************************************************

<script>

document.write("1到1000能被3整除的数的和为：")

var a=0

for (var i=1i<=1000i++)

if(i%3==0)a+=i

document.write(a)

</script>

**************************************************************************

把以上代码复制到记事本里面保存为：aaa.html，然后双击看看结果！

import java.io.File

import java.io.FileWriter

import java.util.Comparator

import java.util.Iterator

import java.util.TreeSet

public class Prime {

public TreeSet<Integer>primes

public Iterator<Integer>it

public FileWriter fw

public Prime() {

try {

primes = new TreeSet<Integer>(new Comparator<Integer>() {

@Override

public int compare(Integer i, Integer j) {

if (i >j)

return 1

if (i <j)

return -1

return 0

}

})

fw = new FileWriter(new File("./design.dat"))

} catch (Exception e) {

e.printStackTrace()

}

}

public void addPrime(int max) {

for (int i = 2i <maxi++) {

if (isPrime(i)) {

primes.add(i)

}

}

}

public boolean isPrime(int i) {

it = primes.iterator()

while (it.hasNext()) {

if (i % (it.next()) == 0) {

return false

}

}

return true

}

public void write() {

try {

it = primes.iterator()

while (it.hasNext()) {

fw.write(it.next() + "\n")

}

} catch (Exception e) {

e.printStackTrace()

}

}

public void close(){

try {

fw.close()

} catch (Exception e) {

e.printStackTrace()

}

}

public static void main(String[] args) {

try {

Prime p = new Prime()

p.addPrime(1000)

p.write()

p.close()

} catch (Exception e) {

e.printStackTrace()

}

}

}

pascal:

var

n,a,b,c,d,s:integer

begin

write('Input n:')

readln(n)

a:=n div 1000

b:=n div 100 mod 10

c:=n div 10 mod 10

d:=n mod 10

s:=a+b+c+d

writeln(s)

end.

---