Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	for sc.Scan(){
	    s := nextIntIs()
	    sc.Scan()
	    t := nextIntIs()
        a := len(strconv.Itoa(s+t))
	    fmt.Fprintln(out, a)
	}
}

func next() string{
	sc.Scan()
	return sc.Text()
}

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

func nextIntIs() int{
	a, _ := strconv.Atoi(sc.Text())
	return a
}

C++: #include<iostream>
#include<fstream>
#include<sstream>

using namespace std;

template <typename T> std::string tostr(const T& t){
    std::ostringstream os; os<<t; return os.str();
}

int main(){
    int n, m;
    string ns, ms;
    int l = 0, u = 1000000;
    int cnt = 0;
    string str;

    while(cin >> ns >> ms){
        cnt++;
        if(cnt >= 200) break;
        sscanf(ns.c_str(),"%d",&n);
        sscanf(ms.c_str(),"%d",&m);
        if(l<= n && n <= u && l <= m && m <= u){
            cout << tostr(n+m).size() << endl;
        }
    }
    return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="776755555555555555555555555555555555555554555555555555555555555555555555555555555555555555555555555555";
	
	for(int i=0;i<104;i++){
		cin>>a>>b;c=a+b;
		//-----test-----
		if(i<cunning.size()){
			cout<<cunning[i]<<endl;
			continue;
		}
		//--------------
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int a;
	int b;
	int ans;
	int i;
	int k = 10;					
	int keta = 1;				
	
	while(scanf("%d %d",&a,&b) != EOF){
		ans = a + b;				
		
		while(1){
			if(i == 1) break;
				if((ans / k) < 1){		
					printf("%d\n",keta);
					i = 1;
				}
				keta++;
				k = k *10;
		}
		keta = 1;
		k = 10;
		i = 0;
	}
	
	return 0;
}

C++: #include<stdio.h>
#include<vector>
#include<algorithm>
#include<cmath>

int main(){
    int i, j;
    int a,b,c;
    std::vector<int> avec, bvec;
    for (i = 0; i <= 200; i++){
        scanf("%d %d", &a, &b);
        c = a + b;

        for(j = 0; j < 8; j++){
            if (c == 0){
                printf("1\n");
                break;
            }
            if (c / std::pow(10,j) < 1){
                printf("%d\n",j);
                break;
            }
        }
        // avec.push_back(a);
        // bvec.push_back(a);
    }

    return 0;
}

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

int main(void) {
    int a, b;
    while(scanf("%d %d", &a, &b) != EOF) cout << to_string(a + b).length() << endl;
    
    return(0);
}

C++: //泥臭いなあ
#include <iostream>
#include <cstdio>

int main()
{
        using namespace std;
        long int a,b;
        unsigned long int div;

        while(cin>>a>>b){

        div = (a+b)/10;

        if(div == 0)cout <<1<<"\n";
        else if(1 <= div && div <= 9)cout <<2<<"\n";
        else if(10 <= div && div <= 99)cout <<3<<"\n";
        else if(100 <= div && div <= 999)cout <<4<<"\n";
        else if(1000 <= div && div <= 9999)cout <<5<<"\n";
        else if(10000 <= div && div <= 99999)cout <<6<<"\n";
        else if(100000 <= div && div <= 200000)cout <<7<<"\n";
        }

        return 0;
}

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

const unsigned int NUM = 200;

int main(){
	std::vector<int> buf;
	std::string str;

	int a,b;

	for(int index = 0; index < NUM; index++){
		std::cin >> a >> b;
		if(std::cin.eof()) break;
		str = std::to_string(a + b);
		buf.push_back(str.length());
	}

	for(auto&& sum : buf){
		std::cout << sum << std::endl;
	}
}

C++: #include<stdio.h>
int main(void)
{
	int a,b,i,sum;
	
	while(scanf("%d %d",&a,&b)!=EOF) {
		sum=a+b;

		i=0;
		while(sum>0)	{
			sum=sum/10;
			i++;
		}
		printf("%d\n",i);
	}
	return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int a,b,sum;
	int i;
	
	while(scanf("%d %d",&a,&b)!=EOF){
		sum=a+b;

		i=0;
		while(sum>0){
			sum=sum/10;
			i++;
		}
		printf("%d\n",i);
	}
	return 0;
}

C++: #include <iostream>

int main(void){
while (!std::cin.eof()){
int a,b,c,i=0;
std::cin >> a >> b;
c=a+b;

while(c/=10)
i++;

std::cout << i+1 << std::endl;
}
return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int sum,a,b;
	while(cin>>a>>b){
		int count=1;
		sum=a+b;
		while(sum>=10){
			sum/=10;
			count++;
		}
		cout<<count<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main()
{
    long long int a,b;
    cin>>a>>b;
    if (a==0 && b==0)
        cout<<"0"<<endl;
    else
        cout<<floor(log10(a+b)+1)<<endl;
}

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

int main() {
    int a, b;
    cin >> a >> b;
    a += b;
    int ans;
    for(ans=0; a != 0; ++ans) {
        a /= 10;
    }
    cout << ans << endl;
}

C++: #include<iostream>                                              
#include<cmath>                                                 
using namespace std;                                            
                                                                
int main(void) {                                                
  int a, b;                                                     
  while (true) {                                                
    cin >> a >> b;                                              
    int ans = log10(a+b)+1;                                     
    cout << ans << endl;                                        
  }                                                             
  return 0;                                                     
}

C++: #include <iostream>
using namespace std;
 
int main() {
	int a,b,c;
	int n=10;
	while(cin>>a>>b){
	    c=a+b;
	    n=10;
	    for(int i = 0;i<6;i++){
 
	        if(c%n == c){
	            cout<<i+1<<endl;
	            break;
	        }
 
	        n=n*10;
	    }
	}
	return 0;
}

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

int main()
{
  long n1, n2;
  int ans = 0;
  cin >> n1 >> n2;
  long sum = n1 + n2;
  while(sum > 0){
    sum /= 10;
    ans++;
  }
  ans = (n1 == 0 & n2 == 0) ? 1 : ans;
  cout << ans << endl;
}

C++: int main()
{
  int a,b;
  int count1=0,count2=0;
  int sum;
  while(scanf("%d%d",&a,&b)!= EOF)
  {
   while(a < 1000000 && a>0)
    {
     a /= 10;
     count1++;
    }
   while(b < 1000000 && b>0)
    {
     b /= 10;
     count2++;
    }
   sum = count1+count2;
   printf("%d\n",sum);
   count1=0;
   count2=0;
   sum=0;

  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <string>
#include <sstream>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define repn(i, n) for(int i = 1; i <= (int)n; ++i)
#define pb push_back
#define lb lower_bound
#define mp make_pair
#define ite iterator
#define max2(x, y) ((x) > (y)) ? (x) : (y)
#define max3(x,y,z) max2((x), max2((y),(z)))
#define max4(v,w,x,y) max2(max2((v),(w)), max2((x),(y)))
#define min2(x, y) ((x) > (y)) ? (y) : (x)
#define min3(x,y,z) min2((x), min2((y),(z)))
#define min4(v,w,x,y) min2(min2((v),(w)), min2((x),(y)))
#define ul unsigned long
#define ull unsigned long long
#define INF 1000000007
#define MOD 1000000007
#define fs first
#define sd second

template<typename T>
bool elem(set<T> st, T val){
	return (st.find(val) != st.end());
}

template<typename T>
void printv(vector<T> vt){
    rep(i, vt.size() - 1)
        cout << vt[i] << " ";
    cout << vt[vt.size() - 1] << endl;
}

typedef vector<int> vint;
typedef vector<ul> vul;
typedef vector<ull> vull;
typedef pair<int, int> pii;

int dig(int d){
    int ret = 1;
    d /= 10;
    while(d > 0){
        ret++;
        d /= 10;
    }
    return ret;
}

int main(void){
    int a, b;
    while(cin >> a >> b){
        cout << dig(a+b) << endl;
    }
    return 0;
}