1 solutions

  • 0
    @ 2025-11-5 16:54:38

    C :

    #include<stdio.h>
    #include<string.h>
    void daoxu(char x[],int n)
    {
      char s;
      int k;
      for(k=0;k<n/2;k++)
      {
        s=x[k];x[k]=x[n-k-1];x[n-k-1]=s;
      }
    }
      #define MA 100
      main()
      {
        char a[MA];
        int m;
        scanf("%s",a);
        m=strlen(a);
        daoxu(a,m);
        printf("%s\n",a);
        getchar();
      }
    
    

    C++ :

    #include<stdio.h>
    #include<string.h>
    int main()
    {
      int zifuchuan(char lxz[]);
      char lxz[100];
      scanf("%s",lxz);
      zifuchuan(lxz);
      printf("%s\n",lxz);
      return 0;
    }
    
    int zifuchuan(char lxz[])
    { char q;
     int w,e;
     for(w=0,e=strlen(lxz);w<(strlen(lxz)/2);w++,e--)
     {q=lxz[w];
      lxz[w]=lxz[e-1];
        lxz[e-1]=q;
     }
    }
    

    Pascal :

    var st:string;
        i:longint;
    begin
      readln(st);
      for i:=length(st) downto 1 do
      write(st[i]);
    end.
    
    • 1

    Information

    ID
    18063
    Time
    1000ms
    Memory
    12MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By