A+B

python

while True:
    try:
        print(sum(map(int,input().replace(",","").split())))

    except:
        break

} 

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		while(scanner.hasNext()){
			String strNum1 = scanner.nextLine();
			String[] num = 	strNum1.split(" ");
			long num1 = Long.valueOf(num[0].toString().replace(",",""));
			long num2 = Long.valueOf(num[1].toString().replace(",",""));
			System.out.println(num1+num2);
		}
	}
}

#include<stdio.h>//1.字符数组转整数数组 2.整数数组转整数
#include<string.h>
#include<math.h>
int change(char n[])
{
    int num1,i,j,a[15],fushu=0;
    num1=strlen(n);
    //1.字符数组转换成整数数组
    for(i=num1-1,j=0;i>=0;i--)//倒序存放方便计算个位放在a[0]
    {
        if(n[i]!=','&&n[i]!='-')//仅为数字的时候转换并且下标加1
            a[j++]=n[i]-'0';
        else      //若为, 或者- 此时不放在整数数组,并且数组长度减一
            num1--;//位数-1
        if(n[i]=='-') fushu=1;//判断是否是素数
    }
    //2.整数数组转换成整数
    int sum=0;
    for(i=0;i<num1;i++)//i=0是个位的数字        
          sum+=a[i]*pow(10,i);
    if(fushu) sum=sum*(-1);//把数转换成负数
    return sum;
}
int main()
{
    char n1[15],n2[15];int m,n;
    scanf("%s%s",n1,n2);
    m=change(n1);n=change(n2);
    printf("%d\n",m+n);
}

/** \brief 处理字符串的相关函数很有用
 *
 * \param 
 * \param 
 * \return 
 *
 */     

#include <iostream>
#include <string>
using namespace std;
string& remove_pun(string& str){
    string::size_type pos=0;
    while((pos=str.find(',',pos))!=string::npos){
        str.erase(pos,1);
        ++pos;
    }
    return str;
}

int main(){
    int a,b;
    string s1,s2;
    while(cin>>s1>>s2){
        s1=remove_pun(s1);
        s2=remove_pun(s2);
        a=stoi(s1);
        b=stoi(s2);
        cout<<a+b<<endl;
    }
    return 0;
}

#include <iostream>
#include <string>
using namespace std;

int main(){
	string str1,str2;
	while(cin>>str1>>str2){
		for(int i(str1.size()-1);i>=0;--i){
			if(str1[i]== ',')
				str1.erase(i,1);
		}
		for(int i(str2.size()-1);i>=0;--i){
			if(str2[i]== ',')
				str2.erase(i,1);
		}

		cout<<stol(str1)+stoi(str2)<<endl;
	}
    return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

int to_int(string a)
{
    a.erase(remove(a.begin(), a.end(), ','), a.end());
    return stoi(a);
}

int main()
{
    string a, b;
    while (cin >> a >> b)
    {
        cout << to_int(a) + to_int(b) << endl;
    }
    
}

import java.util.Scanner;
public class Main{
    /*
    不用重复造轮子就是方便啊哈哈
    */
    public static void main(String[] args){
        try(Scanner in = new Scanner(System.in)){
            String s1 = in.next(),s2 = in.next();
            System.out.println(helper(s1,s2));
        }
    }
    public static int helper(String s1,String s2){
        String[] str1 = s1.split(","),str2 = s2.split(",");
        StringBuffer sb1 = new StringBuffer(),sb2 = new StringBuffer();
        for(String s:str1){
            sb1.append(s);
        }
        for(String s:str2){
            sb2.append(s);
        }
        int num1 = Integer.valueOf(sb1.toString()),num2 = Integer.valueOf(sb2.toString());
        return num1 + num2;
    }
}

            String line = sin.nextLine();
            String[] nums = line.split(" ");
            String[] k1 = nums[0].split(",");
            String[] k2 = nums[1].split(",");
            String a = "";
            String b = "";
            for(int i = 0;i<k1.length;i++){
                a += k1[i];
            }
            for(int i = 0;i<k2.length;i++){
                b += k2[i];
            }
            BigInteger ba = new BigInteger(a);
            BigInteger bb = new BigInteger(b);
            BigInteger br = ba.add(bb);
            System.out.println(br);

#include<iostream>
#include<string.h>
using namespace std;

int main()
 {
       char a[100],b[100];
       while(cin>>a>>b)
         {
            int m=0,n=0,SUM;
            int flag1=0,flag2=0;  //记录两个数字a，b的正负（0正1负）
            long k1=10,k2=10;
            int len1=strlen(a);   //得到两个字符串的长度，如strlen（-2,223）=6
            int len2=strlen(b);
			long sum1=a[len1-1]-'0',sum2=b[len2-1]-'0';  //为了方便，先将个位存入到sum中，也就是两个字符串的最后一位
            for(int i=len1-2;i>=0;i--)  //从倒数第二位及以后（非'-'和‘，’）开始累加
               {
                  if(a[i]=='-')
                      flag1=1;
                  if((a[i]!=',')&&(a[i]!='-'))
                     {                       
                       sum1+=(a[i]-'0')*k1;
                       k1*=10;
                     }
               } 
           if(flag1==1)
                sum1=0-sum1;
            
           for(int i=len2-2;i>=0;i--)
               {
                  if(b[i]=='-')
                      flag2=1;
                  if((b[i]!=',')&&(b[i]!='-'))
                     {
                       sum2+=(b[i]-'0')*k2;
					   k2*=10;
                     }
               } 
            if(flag2==1)
                sum2=0-sum2;
           
           SUM=sum1+sum2;
           cout<<SUM<<endl;
           
         }   
 }

我这样也能通过，我怎么感觉我这么写有问题，尴尬

import java.util.Scanner;
public class Main {
   public static void main(String[] args) {
	  Scanner sc=new Scanner(System.in);
	  while(sc.hasNext()){
		  int a1=sc.nextInt();
		  int a2=sc.nextInt();
		  System.out.println(a1+a2);
	  }	  
   }
}

这题最好通过valueOf()来做~~

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while(in.hasNext()){
            fun(in.nextLine());
        }
        in.close();
    }
    public static void fun(String str){
        StringBuffer stra = null,strb = null;
        for(int i = 0; i < str.length(); i++){
            if(str.charAt(i) == ' '){
                stra = new StringBuffer(str.substring(0, i));
                strb = new StringBuffer(str.substring(i+1));
                break;
            }
        }
        for(int i = 0; i < stra.length(); i++)
            if(stra.charAt(i) == ',')
                stra.deleteCharAt(i);
        for(int i = 0; i < strb.length(); i++)
            if(strb.charAt(i) == ',')
                strb.deleteCharAt(i);

        System.out.println(Long.valueOf(stra.toString())+Long.valueOf(strb.toString()));
    }
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

// 处理数据
int solve(string str)
{
    int tmp = 0;
    for(int i = 0; i < str.length(); ++i)
    {
        if(str[i] == ',' || str[i] == '-')
        {
            continue;
        }
        else
        {
            tmp = tmp*10 + (str[i]-'0');
        }
    }
    if(str[0] != '-') return tmp;
    else return -tmp;
}

int main()
{
    
    int a, b;
    string str1, str2;
    while(cin >> str1 >> str2)
    {
        a = solve(str1);
        b = solve(str2);
        cout << a+b << endl;
    }

    return 0;
}