#include<stdio.h>
#include<stdio.h>
#include<string.h>
#define MAXSIZE 100
int stack[MAXSIZE] = {0};
int top=0;
void push(int k)
{
if(top==MAXSIZE)
{
printf("stack is full\n");
return ;
}
stack[top] = k;
top++;
}
int pop()
{
int k;
top--;
return stack[top];
}
int main(){
char a[101],b[101];
int i,j,tmp,c=0,z;
scanf("%s %s",a,b);
i=strlen(a)-1;
j=strlen(b)-1;
for(z=0;z<;z++)
{
tmp = a[i]+b[j]-48-48+c;
push(tmp%10);
c=tmp/10;
i--; j--;
}
printf("%d",tmp);
}
/*
#include<stdio.h>
#define MAXSIZE 6
int q[MAXSIZE] = {0};
int front=0,rear=0;
void enqueue(int k)
{
if((rear+1)%MAXSIZE==front) return;
rear = (rear+1)%MAXSIZE;
q[rear]=k;
}
int dequeue(){
if(rear==front)
{
return 0;
}
front = (front+1)%MAXSIZE;
return q[front];
}
void view()
{
if(front==rear)
{printf("queue is empty\n"); return ;}
printf("========================\n");
for(int i = front+1; i<=rear ; i++){
printf("%d ",q[i]);
}
printf("\n========================\n");
}
int main()
{
int a,b,c;
while(1)
{
printf("1.en 2.de 3.view \n");
scanf("%d",&a);
if(a==1)
{
printf("input data : ");
scanf("%d",&b);
enqueue(b);
}
else if(a==2)
{
printf("dequeue data is %d\n",dequeue());
}
else
{
view();
}
}
}
*/