Найдите значение выражения
a mod (b div c +5)-10, при a=100, b=20, c=3.

jrjkj rjkf_rjkjrjkf b yf rjkf[_rjkjrjkf

#include < stdio.h> # define in "input.txt"# define out "output.txt"unsigned long long sum(int n){unsigned long long otv=0; for (int i=1; i*i< =n; i++)if %i)){otv+=i; if(i*i! =n)otv+=n/i; }return otv; }int main(void){unsigned long long n,otv=0; freopen(in,"r",stdin); freopen(out,"w",stdout); scanf("%i64d",& n); otv=sum(n); printf("%i64d",otv); return 0; }

var i,s,p: integer; a: array [1..100] of integer;

begin 

s: =0; p: =0;

writeln('vvedite masiv a: ');  

for i: =1 to 10 do begin

write('a[',i,']=');

readln(a[i]);

end;

for i: =1 to 10 do begin

if a[i]> 0 then s: =s+a[i];  

end;

s: =s*2;

writeln('udvoennaya suma polozhitelnih elementov=',s);

writeln('indexi elementov kotorie bolshe prediduschego: ');

writeln;

for i: =2 to 10 do begin

if a[i]> a[i-1] then write(i,', ');

end;

for i: =2 to 10 do begin

if ((a[i]> =0) and (a[i-1]> =0)) or ((a[i]< 0) and (a[i-1]< 0)) then p: =p+1;

end;

writeln;

if p> 0 then writeln('masiv imeet pari sosednih elementov s odnakovimi znakami') else   writeln('masiv ne imeet pari sosednih elementov s odnakovimi znakami');  

readln(s);

end. 

20-25=-5