Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var (
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	for sc.Scan() {
		chunks := strings.Split(sc.Text(), " ")
		if len(chunks) != 2 {
			break
		}
		a, _ := strconv.Atoi(chunks[0])
		b, _ := strconv.Atoi(chunks[1])
		fmt.Println(a + b)
	}
}

C++: #include <iostream>
#include <stdlib.h>
using namespace std;

int main(){
    int a,b;
    while(true){
        int sum,digit;
        a=-1;
        digit = 0;
        
        cin >> a >> b;
        
        if(a == -1){
            break;
        }
        
        sum = a + b;
        
        while(true){
            if(sum != 0){
                sum /= 10;
                digit++;
            }
            else{
                break;
            }
        }
        
        cout << digit << endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
	int a,b,c;
	while(cin>>a>>b)
	{
		c=a+b;
		int k=0;
		while(c>0)
		{
			c/=10;
			k++;
		}
		cout<<k<<endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
unsigned short digitsofnum(unsigned short n) {
	int j = 0;
	while (n > 0) {
		n = n / 10;
		j++;
	}
	return j;
}
int main()
{
	unsigned short a, b;
	vector<unsigned short> dst;
	while (cin >> a >> b)
		cout <<digitsofnum(a + b) << endl;
	return 0;
}

C++: #include <iostream>
using namespace std;

int c = 0;

void keta(int C) {
	if (C > 9) {
		c++;
		keta(C/10);
	}
	return;
}

int main()
{
	while (1) {
		if (cin.eof()) {
			break;
		}
		c = 0;
		int A, B,C;
		cin >> A>> B;
		C = A + B;
		keta(C);
		c++;
		cout << c<<endl;
	}
    return 0;
}

C++: #include <stdio.h>

int main(){
  int a, b, sum;
  int count;

  while(scanf("%d %d", a, b)!=EOF){
    sum=a+b;
    count=1;
    while(sum/10!=0) count++;
    printf("%d\n", count);
  }
  return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;

int main(){
	int a,b;

	while(scanf("%d %d",&a,&b) !=EOF){
	
		int tag = (a+b)/1000000;
		int keta = 7;
		if(tag==0){
			tag = (a+b)/100000;
			keta = 6;
		}
		if(tag==0){
			tag = (a+b)/10000;
			keta = 5;
		}
		if(tag==0){
			tag = (a+b)/1000;
			keta = 4;
		}
		if(tag==0){
			tag = (a+b)/100;
			keta = 3;
		}
		if(tag==0){
			tag = (a+b)/10;
			keta = 2;
		}
		if(tag==0){
			tag = (a+b)/1;
			keta = 1;
		}

		cout << keta << endl;
	}
	
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a[2];
	while(cin>>a[0]>>a[1]){
	int sum=a[0]+a[1];
	int  i=0;
	while(1){
		i++;
	if(sum>=0&&9>=sum)break;
	sum/=10;
	}
	cout<< i<<endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;

int main()
{
	int a,b,c,d=1000000;
	cin>>a>>b;
	
	for(int i=1;i<=200;i++){
		a+=b;
		short answer=7;
		while(1){
			if(a/d==0){
				answer--;
			        d/=10;
			}
			else{
				cout<<answer<<endl;
				break;
			}
		}
		d=1000000;
		answer=7;
		cin>>a>>b;
	}
	return 0;
}

C++: #include <iostream>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
//#include <boost/multiprecision/cpp_int.hpp>

#define BIT(a) (1 << (a))
#define EPS (1e-10)

using namespace std;
//using namespace boost::multiprecision;

const long long MOD = 1000000007;
const int COUNTER_CLOCKWISE = 1;
const int CLOCKWISE = -1;
const int ONLINE_BACK = 2;
const int ONLINE_FRONT = -2;
const int ON_SEGMENT = 0;

class DisjointSet{
    public:
        vector<int> rank, p;

        DisjointSet(){}
        DisjointSet(int size){
            rank.resize(size, 0);
            p.resize(size, 0);
            for (int i = 0; i < size; i++) makeSet(i);
        }

        void makeSet(int x){
            p[x] = x;
            rank[x] = 0;
        }

        bool same(int x, int y){
            return findSet(x) == findSet(y);
        }

        void unite(int x, int y){
            link(findSet(x), findSet(y));
        }

        void link(int x, int y){
            if (rank[x] > rank[y]){
                p[y] = x;
            }else{
                p[x] = y;
                if (rank[x] == rank[y]){
                    rank[y]++;
                }
            }
        }

        int findSet(int x){
            if (x != p[x]){
                p[x] = findSet(p[x]);
            }
            return p[x];
        }
};

class Point{
    public:
    double x, y;

    Point(double x = 0, double y = 0): x(x), y(y) {}

    Point operator+(Point p){return Point(x + p.x, y + p.y);}
    Point operator-(Point p){return Point(x - p.x, y - p.y);}
    Point operator*(double a){return Point(a * x, a * y);}
    Point operator/(double a){return Point(x / a, y / a);}

    bool operator < (const Point &p) const {
        return y != p.y ? y < p.y : x < p.x;
    }

    double norm(){return x * x + y * y;}
};
typedef Point Vector;
typedef vector<Vector> Polygon;

double cross(Vector a, Vector b){
    return a.x*b.y - a.y*b.x;
}

double dot(Vector a, Vector b){
    return a.x * b.x + a.y * b.y;
}

int ccw(Point p0, Point p1, Point p2){
    Vector a = p1 - p0;
    Vector b = p2 - p0;
    if (cross(a, b) > EPS)return COUNTER_CLOCKWISE;
    if (cross(a, b) > -EPS)return CLOCKWISE;
    if (dot(a, b) < -EPS)return ONLINE_BACK;
    if (a.norm() < b.norm())return ONLINE_FRONT;

    return ON_SEGMENT;
}

Polygon andrewScan(Polygon s){
    Polygon u, l;
    if (s.size() < 3) return s;
    sort(s.begin(), s.end());
    u.push_back(s[0]);
    u.push_back(s[1]);
    l.push_back(s[s.size()-1]);
    l.push_back(s[s.size()-2]);

    for (size_t i = 2; i < s.size(); i++){
        for (size_t n = u.size(); n >= 2 && ccw(u[n-2], u[n-1], s[i]) == COUNTER_CLOCKWISE; n--){
            u.pop_back();
        }
        u.push_back(s[i]);
    }

    for (int i = (int)s.size() - 3; i >= 0; i--){
        for (size_t n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], s[i]) == COUNTER_CLOCKWISE; n--){
            l.pop_back();
        }
        l.push_back(s[i]);
    }

    reverse(l.begin(), l.end());
    for (size_t i = u.size() - 2; i >= 1; i--) l.push_back(u[i]);

    return l;
}

long long mod_pow(long long x, long long n){
    long long res = 1;
    for(int i = 0;i < 60; i++){
        if(n >> i & 1) res = res * x % MOD;
        x = x * x % MOD;
    }
    return res;
}

int main(void){
    int N, M;
    while(cin >> N >> M){
        int sum = N + M;
        int ans = 7;
        for (int i = 1000000; i > 0; i /= 10){
            if (sum / i){
                cout << ans << endl;
                break;
            }
            --ans;
        }
    }
    return 0;
}

C++: #include <iostream>
#include <iomanip>
using namespace std;

void OutputSolution(int a, int b, int c, int d, int e, int f)
{
	int B = b;
	a *= e;
	b *= e;
	c *= e;
	d *= B;
	e *= B;
	f *= B;
	double x = (c-f) / (a-d);
	double y = (c-a*x) / b;
	cout << fixed << setprecision(3) << x << ' ' << y << endl;
}

int main()
{
	while(true){
		int a, b, c, d, e, f;
		cin >> a >> b >> c >> d >> e >> f;
		if(cin.eof()) break;
		OutputSolution(a, b, c, d, e, f);
	}
	return 0;
}

C++: #import <iostream>
#import <sstream>
using namespace std;

void problemOne(){
      int a;
      int b;
      while (cin >> a >> b){
            int sum = a + b;
            int intLength = 0;
            while (sum != 0) {
                  sum /= 10;
                  intLength += 1;
            }
            cout << intLength << endl;
      }
}

int main(){
      problemOne();
}

C++: #include <iostream>
using namespace std;

int main() {
  int a, b, sum, res;

  while(cin >> a >> b) {
    res = 0;
    sum = a+b;

    while(sum/10 != 0) res++;
    cout << res << endl;
  }
}