Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

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

C++: #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
    long long int a,b;
    long long int op=0;
    while((cin>>a>>b)){
        long long int res=a+b;
        long long int k=1;
        while((res/k)!=0){
            k=k*10;
            op++;
        }
        if(res==0)
        {
            op=1;
        }
        cout<<op<<endl;
        op=0;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int a,b;
    for(int i = 0; i< 3; i++){
        cin >> a;
        cin >> b;
        cout << a+b << endl;
    }
}

C++: #include<stdio.h>
int main(){
  int n=1; 
  long long int a=0;
  long long int b=0;
  while(scanf("%d",&a) != EOF){
    scanf("%d",&b);
    a+=b;
    while(a/10!=0){
      n++;
      a=a/10;
    }
    printf("%d\n",n);
    n=1;
  }
  return(0);
}

C++: #include<iostream>

using namespace std;

int main(){
	
	int num,i;

	int a[3],b[3],sum[3],figure;
	
	for(i=0;i<3;i++){
		do{
			cin >> a[i] >> b[i];
		}while((a[i]<0||a[i]>100000)&&(b[i]<0||b[i]>100000));
		
		sum[i] = a[i] + b[i];
		
	}
	
	for(i=0;i<num;i++){
		figure = 1;
		while(sum[i]/10!=0){
			sum[i] = sum[i]/10;
			figure++;
		}
		cout << figure << "\n";
	}
	
	return 0;
}

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

int main(){
  int a,b,ans;
  string fig;
  while(cin >> a >> b){
    ans=a+b;
    fig=to_string(ans);
    cout << fig.size() << endl;
  }
}

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

int main() {
	while (1) {
		int i,a, b, c;
		cin >> a >> b;
		c = a + b;
		for (i = 0; c != 0; i++) {
			c /= 10;
		}
		if (i == 0)
			i = 1;
		cout << i << "\n";
 	}
	
	return 0;
}

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

int main(){
	int a, b, i = 0;
	cin >> a >> b;
	num = a*b;
	while(1){
		if(num < 10) break;
		i++;
		num /= 10;
	}
	cout << i << endl;
    return 0;
}

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

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

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
    int a,b,sum,ans,a1,b1;
    for(int i=0;i<100;i++){
        cin>>a>>b;
        if(a1==a&&b1==b&&a!=0)break;
        a1=a;
        b1=b;
        sum=a+b;
        ans=0;
        if(sum==0)ans=1;
        while(sum>0){
            ans++;
            sum/=10;
        }
        cout<<ans<<endl;
    }
    return 0;
}

C++: #include <iostream>

int disit_number(int num)
{
	if (num / 10 == 0) {
		return 1;
	}
	return disit_number(num / 10) + 1;
}

int main()
{
	int a, b;
	while (std::cin >> a >> b) {
		std::cout << disit_number(a + b) << std::endl;
	}
	return 0;
}

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

int main()
{
  int a,b;
  int answer[20];
  int count = 0;
  while(cin >> a >> b){
    answer[count] = (int)log10(a+b) +1;
    count++;
  }
  for(int i=0; i<count; i++){
    cout << answer[i] << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld",a)

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//char ch;
string S, T, U;
ll i, j, k, a, b, c, d, f, g, h, l, m, n, p, q, r, s, t, w, x, y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin>>x>>y;
    n=x+y;
    while(n>0)
    {
        cnt++;
        n/=10;
    }
    cout<<cnt<<endl;

    return 0;
}

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

int main() {
    
    int a;
    int b;
    int sum;
    int flag = 0;
    int count = 0;
    
    while(cin >> a >> b) {
        sum = a + b;
        while (!flag) {
            sum = sum / 10;
            count++;
            if(sum < 1) {
                flag = 1;
                cout << count << endl;
            }
        }
        flag = 0;
        count = 0;
    }
    return 0;
}

C++: #include<stdio.h>
#include<math.h>
int main(){
	int a,b;
	while(~scanf("%d%d",&a,&b)){
		printf("%d\n",(int)log10((double)(a+b))+1);
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
  string a,b;
  for(;;){
    cin >> a >> b;
    if(cin.eof()) break;

    int l=max(a.size(),b.size());
    vector<int> c(l,0),d(l,0);
    for(int i=a.size()-1,j=0; i>=0; i--,j++)
      c[j] = a[i]-'0';
    for(int i=b.size()-1,j=0; i>=0; i--,j++)
      d[j] = b[i]-'0';

    /*    for(int i=0; i<l; i++)
      cout << c[i] << " ";
    cout << endl;

    for(int i=0; i<l; i++)
      cout << d[i] << " ";
      cout << endl; */


    int flag=0;
    for(int i=0; i<l; i++){
      if(c[i]+d[i]+flag>9)
	flag=1;
      else
	flag=0;
    }
    
    cout << l+flag << endl;
  }
}

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

int main() {
/*	int a[3];
	cin >> a[0] ;
	a[1] = 3;
	a[2] = a[0] * 10;

	cout << a[0] <<" " << a[1] <<" "<< a[2] << endl;
	
	for (int i = 0; i < 3; i++) {
		cout << a[i] << endl;
	}


	sort(a,a+5);
*//*
	int a[10];
	for (int i = 0; i < 10; i++) {
		cin >> a[i];
	}
	
	sort(a,a+10,greater<int>());

	for (int i = 0; i < 3; i++) {
		cout << a[i]<<endl;
	}
*/
	int ans = 0;
	int a, b,c;
	for(int i=0;i<200;i++) {
		ans = 0;
		cin >> a >> b;
		c = a + b;

		while (c > 0) {
			c /= 10;
			ans++;
		}cout << ans << endl;
	}
	
	return 0;;
}

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

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

	while(1){
		cin >> a >> b;
		
		if(cin.fail()){
			break;
		}

		sum = a + b;

		if(sum >= 1000000){
			cout << 7 << endl;
		}
		else if(sum >= 100000){
			cout << 6 << endl;
		}
		else if(sum >= 10000){
			cout << 5 << endl;
		}
		else if(sum >= 1000){
			cout << 4 << endl;
		}
		else if(sum >= 100){
			cout << 3 << endl;
		}
		else if(sum >= 10){
			cout << 2 << endl;
		}
		else if(sum >= 1){
			cout << 1 << endl;
		}
		else{
			cout << 0 << endl;
		}
	}
	

	return 0;
}