1 条题解

  • 0
    @ 2024-12-24 9:59:18

    C :

    int main(int argc, char* argv[])
    {char str[100];
    int i,len,x,cnt=0;
    while(~scanf("%s",str))
    {  x=0;
    	if(str[0]=='0')break;
    	++cnt;
            if (cnt > 10) break;
    printf("%s ",str);
      len=strlen(str);
    for (i =len - 1; i >= 0;i--)
         x = x * 10 + (str[i] - '0');
    printf("%d\n",x);
    }
    	return 0;
    }
    
    

    C++ :

    #include <cstdio>
    #include <cstring>
    
    int main() {
        //freopen("test.in", "r", stdin);
        //freopen("test.out", "w", stdout);
        int cnt = 0;
        char s[100];
        while (scanf("%s", s)) {
            if ('0' == s[0]) break;
            ++cnt;
            if (cnt > 10) break;
            printf("%s ", s);
            int n = strlen(s), x = 0;
            for (int i = n - 1; i >= 0; --i)
                x = x * 10 + (s[i] - '0');
            printf("%d\n", x);
        }
        return 0;
    }
    
    

    Java :

    import java.util.Scanner;
    public class Main{
    
    		public static void main(String[] args){
    
    		class DealInt{
    			private int num;
    			public DealInt(){}
    			public DealInt(int num){
    				this.num = num;
    			}
    			public int getNum(){
    				return num;
    			}
    			public void setNum(int num){
    				this.num = num;
    			}
    			public int invertNum(){
    				int temp;
    				int savenum = 0;
    				if(num < 0){
    					temp = -num;
    				}else{
    					temp = num;
    				}
    				while(temp != 0){  //12345
    					savenum += temp % 10; 
    					if(temp >= 10){
    						savenum *= 10;
    					}
    					temp /= 10;
    				}
    				if(num < 0){
    					return -savenum;
    				}else{
    					return savenum;
    				}
    			}
    		}	
    			Scanner in = new Scanner(System.in);
    			int count = 10;
    			while(in.hasNext()){
    				int num = in.nextInt();
    				if(num == 0 || count == 0){
    					break;
    				}
    				DealInt dealint = new DealInt(num);
    				System.out.print(num);
    				System.out.println(" " + dealint.invertNum());
    				count--;
    			}
    		
    	}
    }
    
    • 1

    信息

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