1 条题解

  • 0
    @ 2025-4-14 18:45:29

    C :

    #include <stdio.h>
    int main()
    {
        long int n;
        int s=0,i;
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            s=s+i;
        }
        printf("%d\n",s);
        return 0;
    }
    
    

    Pascal :

    var
      i,w,n : longint;
      a : array[1..100] of longint;
    
    procedure jia(k : longint);
    var
      j,x : longint;
    begin
      x := a[1]+k;
      w := 0;
      while x>0 do
      begin
        w := w+1;
        a[w] := x mod 10;
        x := a[w+1]+x div 10;
       end;
    end;
    
    begin
      //assign(input,'ja.in');  reset(input);
     // assign(output,'ja.out');  rewrite(output);
      readln(n);
      w := 1;
      for i := 1 to n do jia(i);
      for i := w downto 1 do write(a[i]);
      writeln;
      //close(input);  close(output);
    end.
    
    • 1

    信息

    ID
    3418
    时间
    1000ms
    内存
    128MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者