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<cmath>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define eps 1e-6
#define INF (1<<20)
#define PI acos(-1.0)
#define MAX 100005
#ifdef LOCAL
//#include<windows.h>
#endif // LOCAL
using namespace std;
int f(int a,int b)
{
    int t=a+b;
    int r=0;
    while(t)
    {
        t/=10;
        r++;
    }
    return r;
}
int main(int argc,char argv[])
{
    #ifdef LOCAL
    freopen("in.txt","r",stdin);
    //freopen("out.bat","w",stdout);
    #endif // LOCAL
    int a,b;
    while(scanf("%d%d",&a,&b)!=EOF)
    {
        printf("%d\n",f(a,b));
    }
    return 0;
}

C++: #include<string>
#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int a,b;
	cin >> a>>b;
 string x=IntToString(a+b);
cout<<x.size()<<endl;
return 0;
}
string IntToString(int number)
{
  string stream ss;
  ss << number;
  return ss.str();
}

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

int digit(long long x){
  int i=1;
  while(true){
    x/=10;
    if(x==0)break;
    i++;
  }
  return i;
}

int main(){
  long long  a, b;
  while(scanf("%lld %lld", &a, &b)!=EOF){
    printf("%d\n", digit(a+b));
  }
  return 0;
}

C++: #include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstdio>
using namespace std;
int main()
{
	int m,n;
	while(cin>>m>>n)
		cout<<ceil(log10((double)(m+n+1)))<<endl;
	getchar();
	return 0;
}

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

int main(){
	int a,b,c;
	int ans;
	int cnt=-1;
	
	while(cin>>a>>b){
		cnt++;
		//-----test-----
		if(cnt==0){cout<<1<<endl;continue;}
		
		//--------------
		c=a+b;
		ans=1;
		while(10<=c){
			c/=10;
			ans++;
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  double x, h;
  while (cin >> x >> h, x) {
    cout << prec(8) << x * x + x * hypot(h, x / 2) * 2 << endl;
  }
}

C++: #include <iostream>

using namespace std;

int main() {
	int a, b;
	int ans = 0;
	cin >> a >> b;

	int sum = a + b;
	for (ans = 0; sum >= 1; ans++) sum /= 10;

	cout << ans << endl;
	return 0;
}

C++: #include<stdio.h>


int main(){
	char a[21];
	char b[21];
	int A;
	int B;
	int i;
	int l=1;
	fgets(a,sizeof(a),stdin);
	fgets(b,sizeof(b),stdin);
	sscanf(a,"%d", &A);
	sscanf(b,"%d", &B);
	i=A+B;
	while((i  >= 10)){
		i=i/10;
		l=l+1;
	}
	printf("%d" ,l);
}

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

using namespace std;

int main()
{
	int a[2];
	int a_keta,b_keta;

	while(1)
	{
		if(scanf("%d %d", &a[0],&a[1])==EOF)break;
		a_keta=(int)log10(a[0])+1;
		b_keta=(int)log10(a[1])+1;

		cout<<a_keta+b_keta<<"\n";				 
	}
	return 0;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;

//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt"

int main() {
	string st;
	while (getline(cin,st)) {
		string a, b; 
		a = st.substr(0, st.find(" "));
		b = st.substr(st.find(" ") + 1);
		int aa = stoi(a); int bb = stoi(b);

		cout <<to_string(aa+bb).size() << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
	int a,b;
	while (a != EOF){
		cin >> a;
		cin >> b;
		cout << a + b << endl;
	}
}

C++: #include<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define pf push_front
#define pb push_back
#define int long long
using namespace std;
const int INF=1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};



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

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

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

C++: #include <cstdio>
using namespace std;
int a,b;
int cnt,ans;
int count(int s){
  if(s/10==0) return cnt;
  else {
    cnt++;
    count(s/10);
  }
}
int main(){
  while(scanf("%d %d",&a,&b)!=EOF){
    cnt=1;
    ans=count(a+b);
    printf("%d\n",ans);
  }
  return 0;
}

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

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

  return 0;
}

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

using namespace std;

int main(){

	int a, b;
	cin >> a >> b;
	cout << a + b << endl;

	system("pause");
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

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

C++: #include <iostream>
using namespace std;
int main(void)
{
    int a, b;
    while(cin >> a >> b)
    { 
        cout << a + b;
    }
}

C++: #include<stdio.h>

int main(void)
{
	int j[200],k[200];
	int i=0,l=0,kai[200]={0},x;
	do
	{
	   scanf("%d %d",&j[l],&k[l]);
	   if(j[l]<0||1000000<j[l]||k[l]<0||1000000<k[l])break;
	   l=l+1;
	
	}while(i !=1);
   for(i=0;i<l;i++)
   {
	   x=j[i]+k[i];

       
		 do{
			   x=x/10;
			   kai[i]=kai[i]+1;
	       }while(x!=0);
   }
	for(i=0;i<l;i++)
	{
		printf("%d\n",kai[i]);
    }
  return 0;
}

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



int main(void){

	int a, b, sum = 0, count;

	while (cin>>a>>b){//??°????????????????????°?????????
		count = 0;
		cin >> a >> b;
		sum = a + b;

		while (sum != 0){


			sum /= 10;
			++count;

		}

		cout << count << endl;
	}

return 0;

}