fork download
copy 
  1. var t, i, n, sum, j : longint;
  2. begin
  3. readln(t);
  4. for i:=1 to t do
  5.     begin
  6.     readln(n);
  7.     sum:=0;
  8.     for j:=(n-1) downto 1 do
  9.         begin
  10.         if n mod j = 0 then sum:=sum+j;
  11.         end;
  12.     writeln(sum);
  13.     end;
  14. end.
Success #stdin #stdout 0s 9136KB
comments (?)
stdin
copy 
1
99999
stdout
copy 
48513
https://ideone.com/delpkz
problem DIVSUM, based on SPOJ submission 19741781 (PAS-GPC), 2017-07-06 03:34:59
language:
Pascal (gpc 20070904)
created:
6 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!