1 solutions

  • 0
    @ 2025-11-5 15:12:21

    C :

    #include <stdio.h>
    #include <stdlib.h>
    
    int main()
    {
        int a, N;
        while(scanf("%d%d",&a,&N) != EOF) {
            int Q = a;
            int A[40], sum = 0;
            while(Q > 0) {
                int MOD = Q % 10;
                A[sum++] = MOD;
                Q /= 10;
            }
            int ans = 0;
            for(int i = 0,j = 1;i < sum; i++) {
                ans += A[i] * j;
                j *= N;
            }
            printf("%d\n",ans);
        }
        return 0;
    }
    

    C++ :

    #include<iostream>
    #include<string>
    using namespace std;
    int main()
    {
    	string s;
    	int n;
    	cin>>s>>n;
    	int len=s.size(),ans=0;
    	for (int i=0; i<len; i++)
    		if (s[i]>'9') ans=n*ans+s[i]-'A'+10;
    		else ans=n*ans+s[i]-'0';
    	cout<<ans<<endl;
    	return 0;	
    }
    

    Pascal :

    var
      s21,s1:string;
      j,s2,c,a,s,n,i:longint;
    begin
      c:=1;
      read(s1);
      s2:=pos(' ',s1);
      s21:=copy(s1,s2+1,length(s1)-s2);
      delete(s1,s2,length(s1)-s2+1);
      s2:=0;
      val(s21,s2);
      for i:=length(s1) downto 1 do
        begin
          if not(s1[i] in ['0'..'9']) then
            a:=ord(s1[i])-55
          else
            a:=ord(s1[i])-48;
          s:=s+c*a;
          c:=c*s2;
        end;
      write(s);
    end.
    
    • 1

    Information

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