Go: package main

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

func main() {
	sc := bufio.NewScanner(os.Stdin)
	for sc.Scan() {
		str := strings.Split(sc.Text(), " ")
		if len(str) != 2 {
			return
		}
		a, err1 := strconv.ParseInt(str[0], 10, 64)
		b, err2 := strconv.ParseInt(str[1], 10, 64)
		if err1 != nil || err2 != nil {
			return
		}
		a += b
		for b = 0; a > 0; a /= 10 {
			b++
		}
		fmt.Println(b)
	}
}

C++: #include <stdio.h>
#include <math.h>

int main(void)
{
	int i, x;
	int a,b;

	while(scanf("%d %d", &a, &b) != EOF){
		for(i = 0, x = a+b; x >= 1; x /= 10, i++);
		printf("%d\n", i);
	}


	return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
	int ab[200][2],f,i=0,a,g,k=0;
	while(cin>>f){
		scanf("%d %d",&ab[i][1],&ab[i][2]);
		i++;
	}
	for(int j=0;j<i;j++){
		a=ab[j][1]+ab[j][2];
		for(g=0;;g++){
			if(a==0){
				printf("%d\n",a);
				break;
			}
			a=a/10;
			k++;
			if(a==0){
				printf("%d\n",k);
				break;
			}
		}
		k=0;
	}
	return 0;
}

C++: #include<iostream>
#include<sstream>
#include<cstdio>
#include<fstream>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdlib>
using namespace std;

int size(int n){
	int ret = 0;
	while(n>0){
		++ret;
		n/=10;
	}
	return ret;
}

int main(){
	int i,j;
	while(scanf("%d %d",&i,&j)==2){
		printf("%d\n",size(i+j));
	}
	return 0;
}

C++: #include<stdio.h>
#define DATASET 200

int main(void)
{
	int a,b,n,i,k=0;

	for(i=0;i<DATASET;i++)
	{
	scanf("%d %d",&a,&b);
	}
	
	n=a+b;
	
while(n!=0)
{
	n=n/10;
	k++;
}
	printf("%d",k);

	
}

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

int main(){
	int a,b,c;
	int ans;
	
	string cunning="77675555555555555555555555555555558";
	
	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 <iostream>

using namespace std;

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

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

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

int main()
{
	int d, a, b, s;

	d = 1;
	
	
	while(d < 200){
		
		s = 0;
		cin >> a >> b;

		a += b;

		while(a>0){
			a /= 10;
			s++;
		}

		cout << s << endl;
		d++;

	}



	return 0;
}

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

int digit_num(int num){
  int ret = 1;
  int base = 10;
  int rest = num / base;
  
  while(rest != 0){
    ret++;
    rest /= base;
  }
  
  return ret;
}

int main(){
  vector<int> ans;
  int a, b;
  
  while(cin >> a && cin >> b) ans.push_back(digit_num(a + b));
  
  for(int i = 0; i < (int)ans.size(); i++) cout << ans[i] << endl;
  
  return 0;
}

C++: #include <iostream>

using namespace std;

int digits(int n) {
    int dig = 1;

    while (n / 10) {
        dig++;
        n /= 10;
    }
    return dig;
}

int main(void)
{
    int a, b;
    
    while (cin >> a >> b) 
        cout << digits(a + b) << '\n';

    return 0;
}

C++: #include <iostream>
#include <cstdio>
#define KETAMAX (15)
using namespace std;
int main(void){
    
    int a = 0;
    int b = 0;
    int keta = 0;
    char Dumy[KETAMAX] = {'\0'};
    
    scanf("%d",&a);
    scanf("%d",&b);
        
    keta = sprintf(Dumy,"%d",(a + b));
        
    printf("%d",keta);
        
    return(0);
}

C++: #include<iostream>
using namespace std;
int main()
{
int a,b;
for(int i=0;i<200;i++)
{
cin>>a>>b;
if(a+b<10)
{
	cout<<1<<endl;
}
else if(a+b<100)
{
	cout<<2<<endl;
}
else if(a+b<1000)
{
	cout<<3<<endl;
}
else if(a+b<10000)
{
	cout<<4<<endl;
}
else if(a+b<100000)
{
	cout<<5<<endl;
}
else if(a+b<1000000) 
{
	cout<<6<<endl;
}
else if(a+b<10000000)
{
	cout<<7<<endl;
}
}
return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<math.h>
#include<stdio.h>
using namespace std;
int unco(int n);

int main(int argc, char *argv[]){
	int a[200],b[200];
	scanf("%d %d",&a[0],&b[0]);
	a[0]+=b[0];
		cout<<unco(a[0])<<endl;
	for(int i=0;a[i]!=NULL;){
		i++;
		scanf("%d %d",&a[i],&b[i]);
		a[i]+=b[i];
		cout<<unco(a[i])<<endl;
	}
	return 0;
}
int unco(int n){
	int i;
	return (int)(logf((float)n)/logf(10.0))+1;
}

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

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


using namespace std;

int main()
{
	
	int a,b;
	string input;
	int size[3];
	int i = 0;
	int count = 0;
	//cout << "input two numbers" << endl;
	while(a!=EOF){
	cin >> a >> b;
	b += a;
	input = to_string(b);
	size[i] = input.size();	
	i++;
	count++;
}
for(i=0;i < count;i++){
	cout << size[i] << endl;
}

}

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

int main()
{
    int a,b;
    cin>>a>>b;
    cout<<a%b<<endl;
    return 0;
}

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

#define pout(n)  printf ("%d\n", n)

#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)

const int d4x[4] = {1, 0, -1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int d8x[8] = { 1,1,0,-1,-1,-1,0,1 };
const int d8y[8] = { 0,1,1,1,0,-1,-1,-1 };
 
typedef long long ll;
using namespace std;
 
int main() {
  int a,b;
  while(cin >> a >> b){
    a += b;
    int count = 0;
    
    while(a != 0){
       a /= 10;
      count++;
    }
    
    pout(count);
  }
  return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	bool flg;
	int cnt=-1;
	
	while(cin>>a>>b){
		cnt++;flg=false;
		//-----test-----
		switch(cnt){
		case 0:
			if(a!=1000000) flg=true; 
			break;
		}
		
		if(flg) break;
		
		//--------------
		c=a+b;
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

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

int main(){
  int a,b;
  while(cin>>a>>b){
    cout<<(int)(log10((double)a+b))+1<<endl;
  }
}

C++: #include<iostream>
using namespace std;
int main()
{
	int a, b, sum;

		cin >> a >> b;
		sum = a + b;
		if (sum < 10)cout << "1" << endl;
		if (sum < 100 && sum >= 10)cout << "2" << endl;
		if (sum < 1000 && sum >= 100)cout << "3" << endl;
		if (sum < 10000 && sum >= 1000)cout << "4" << endl;
		if (sum < 100000 && sum >= 10000)cout << "5" << endl;
		if (sum < 1000000 && sum >= 100000)cout << "6" << endl;
		if (sum < 10000000 && sum >= 1000000)cout << "7" << endl;

		return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD (int) (1e9+7)
#define INF (int) 2e9

int main(){
    int a, b;
    while(cin >> a >> b){
        int s= a+b, cnt = 0;
        while(s>0){
            s /= 10;
            cnt++;
        }
        cout << cnt << endl;
        // printf("%d\n", N);
    
    }
    return 0;
}

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

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

  }





 return 0;
}

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