stablegradients/pie-gem5-bysrc huggingface dataset:
// Original C++ solution (slower):
#include <iostream>

using namespace std;

int main()

{

	int x, y;

	char op;

	cin >> x >> op >> y;

	switch (op)

	{

	case '+':

		cout << x + y << endl;

		break;

	case'-':

		cout << x - y << endl;

	default:

		break;

	}

	return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

	if(op=='+')   printf("%lld\n",a+b);

	if(op=='-')   printf("%lld\n",a-b);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>

using namespace std;

int main() {

  long long a,b;

  char op;

  cin>>a>>op>>b;

 

  if(op=='+'){

    cout<<a+b<<endl;

  }

  else{

  	

    cout<<a-b;

  }

 

}

// Optimized solution to the same problem (faster):
#include<stdio.h>

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

	if(op=='+')   printf("%lld\n",a+b);

	if(op=='-')   printf("%lld\n",a-b);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>



using namespace std;



int main()

{

    int x , y ;

    char op;

    cin >> x >> op >> y ;

    if (op=='+'){

        cout<< x+y << endl;

    }else{

    cout << x-y<<endl;

    }

    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

	if(op=='+')   printf("%lld\n",a+b);

	if(op=='-')   printf("%lld\n",a-b);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include<string>

using namespace std;



int main()

{



int a;cin>>a;

char op;cin>>op;

int b;cin>>b;

if(op=='+')

{

    cout<<a+b;

}else

{

    cout<<a-b;

}

    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

	if(op=='+')   printf("%lld\n",a+b);

	if(op=='-')   printf("%lld\n",a-b);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>



using namespace std;



int main()



{

        int a,b;

     char op;

     cin>>a>>op>>b;

     if(op=='+')

        cout<<a+b<<endl;

     else

        cout<<a-b<<endl;

}

// Optimized solution to the same problem (faster):
#include<stdio.h>

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

	if(op=='+')   printf("%lld\n",a+b);

	if(op=='-')   printf("%lld\n",a-b);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std;

int main() {



int a,b;

cin>> a;

char c;

cin>>c>>b;



if(c=='+'){

int sum =0;

sum= a+b;

cout << sum;  

}else if(c=='-'){

  int sub =0;

  sub = a-b;

  cout<<sub;

}

}

// Optimized solution to the same problem (faster):
#include<stdio.h>

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

	if(op=='+')   printf("%lld\n",a+b);

	if(op=='-')   printf("%lld\n",a-b);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include<stdio.h>

using namespace std;

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

    if(op=='+')

	{

		printf("%lld\n",a+b);

	}

	else if(op=='-')

	{

		printf("%lld\n",a-b);

	}

	else if(op=='*')

	{

		printf("%lld\n",a*b);

	}

	else if(op=='/'&&b>1e-6)

	{

		printf("%lld\n",a/b);

	}

	return 0;

}

// Optimized solution to the same problem (faster):
#include<stdio.h>

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

	if(op=='+')   printf("%lld\n",a+b);

	if(op=='-')   printf("%lld\n",a-b);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>



using namespace std;

 

typedef long long ll;

#define For(i,x,y) for(int i=x; i<y; ++i)

#define mem(x,y) memset(x,y,sizeof(x))

#define ALL(a) a.begin(),a.end()

#define PII pair<int,int>

#define INF 0x3f3f3f3f

#define DOF 0x7f7f7f7f

#define se second

#define fi first

#define endl '\n'

 

template <typename T>

inline void read(T &r){

    static char c; r=0; int f=1;

    for(c=getchar(); c<'0'||c>'9'; c=getchar()) if(c=='-')f=-1; 

    for(; c>='0'&&c<='9'; r=(r<<1)+(r<<3)+(c^48),c=getchar());

    r*=f;

} // -_-



const int N = 220;



int main(){

    ll a, b; char c;

    scanf("%lld %c %lld",&a, &c, &b);

    if(c == '-') b = -b;

    printf("%lld\n", a + b);

    // system("pause");

}

// Optimized solution to the same problem (faster):
#include<stdio.h>

int main()

{

	long long a,b;

	char op;

	scanf("%lld %c %lld",&a,&op,&b);

	if(op=='+')   printf("%lld\n",a+b);

	if(op=='-')   printf("%lld\n",a-b);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>





using namespace std;



int main()

{

    long long a  , b;

    char ch;

    cin >> a >> ch >> b;

    if(ch == '+') cout << (a + b) << endl;

    else cout << (a - b) << endl;



    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>



using namespace std;



int main()

{

    long long int a, b;

    char ch;



    scanf("%lld %c %lld", &a, &ch, &b);



    if(ch=='+') printf("%lld\n", a+b);

    else printf("%lld\n", a-b);

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>

using namespace std;

int main(){

long long a,b,x;

char ch;

scanf("%lld %c %lld",&a,&ch,&b);

if(ch=='+'){

    x=a+b;

printf("%lld\n",x);



}

else if(ch=='-'){

       x=a-b;

printf("%lld\n",x);

}





return 0;



}


// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std;



int main()

{

    int x, y;

    string s;

    cin >> x >> s >> y;

    if(s == "+") cout << x + y << '\n';

    else cout << x - y << '\n';

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;



int main(){

    int a, b;

    char op;

    scanf("%d %c %d",&a, &op, &b);

    int res;

    if(op == '+') res = a + b;

    if(op == '-') res = a - b;

    printf("%d\n", res);

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <cstdio>

#include <cmath>

#include <cstring>

#include <algorithm>

#include <vector>

#include <map>

#include <cstdlib>

#include <set>

#include <queue>

using namespace std;



#define X first

#define Y second

#define N 62

typedef long long ll;

typedef pair<int,int> pii;

const int Mod=1000000007;



const double INF=1e18;





int main()

{

	//freopen("in.in","r",stdin);

	//freopen("out.out","w",stdout);

	

	int a,b; char op;

	scanf("%d %c %d",&a,&op,&b);

	if (op=='+') printf("%d\n",a+b);

	else printf("%d\n",a-b);

	

	return 0;



}


// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>



using namespace std;



int main()

{

	int a,b;

	char c;

	scanf("%d %c %d",&a,&c,&b);

	if (c=='+') printf("%d\n",a+b);

	else printf("%d\n",a-b);

}

// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>



using namespace std;



typedef long long LL;



int main() {

    int a, b;

    char c;

    scanf("%d %c %d", &a, &c, &b);

    printf("%d\n", c == '+' ? a + b : a - b);

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;

int main()

{

    int a,b;

    char c;

    cin >> a >> c >> b;

    switch (c){

        case '+':

            cout << a+b << endl;

            break;

        case '-':

            cout << a-b << endl;

            break;

    }

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

int a,b,c,d,i,j,k;

char t;

int main(){

	scanf("%d %c %d",&a,&t,&b);

	if (t=='-'){

		printf("%d\n",a-b);

	}	

	if (t=='+'){

		printf("%d\n",a+b);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>

using namespace std;

int main() {

  int a,b;

  char c;

  cin>>a>>c>>b;

  if (c=='+') cout<<a+b;

  else cout<<a-b;

  

}

// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>



using namespace std;



int main() {

	int a,b;

	string c;

	cin >> a >> c >> b;

	if (c == "+") cout << a + b;

	else cout << a - b;

	return 0;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<iostream>

using namespace std;

int main()

{

    int a,b;

    char x,y,z;

    scanf("%d",&a);

    scanf("%c",&x);

    scanf("%c",&y);

    scanf("%c",&z);

    scanf("%d",&b);

    if(y=='+')

    {

        cout<<a+b<<endl;

    }else

    cout<<a-b<<endl;

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>



using namespace std;



int main()

{

int A,B;

char x;

cin>>A>>x>>B;

if(x=='-'){cout<<A-B;}

if(x=='+'){cout<<A+B;}



return 0;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>



using namespace std;



int main()

{

   int a , b ;

   char op;

   cin>>a>>op>>b;

   if(op=='+'){

        cout<<a+b;}

   else if (op=='-'){cout<<a-b;}

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std;

int main()

{

    int A,B;

    A>=1 && A<=1000000000 ;

    B>=1 && B<=1000000000 ;

    char op;

    cin>>A>>op>>B;

    if((op) == '+') cout << A + B;

    if ((op) == '-') cout << A - B;

    return 0;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>

#include<string>

using namespace std;



int main() {

int a,b;

char c;

cin>>a>>c>>b;

if(c=='+')

    cout<<a+b;

else{cout<<a-b;}

    return 0;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>



using namespace std;



int main()

{

    int A,b;

    char x;

    cin>>A>>x>>b;

    if (x=='+')

        cout<<A+b;

    else

        cout<<A-b;

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>



using namespace std;



int main()

{

    int a,b; char op = ('+' || '-');

    cin >>a>>op>>b;

    switch(op)

    {

    case '+':

        cout <<a+b;

        break;

    case '-':

        cout <<a-b;

        break;

    }

    return 0;

}


// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<iostream>

using namespace std;

int main(){

  int a,b; char op;

  cin >> a >> op >>b;

  if(op =='+')

    cout << a + b << endl;

  else

    cout << a - b << endl;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <cstdio>

using namespace std;

const int N = 100005;

int a,b;

char op;

int main(){

	cin>>a>>op>>b;

	if(op == '+')

		cout<<a+b<<endl;

	else

		cout<<a-b<<endl;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define x first

#define y second

#define mp make_pair

#define pb push_back

#define kk 1000000007

int n,m,k,a,b,c,tmp,cc[300005];

vector<int > ee;

map<int ,int > mm;

char g;

int main(){

	scanf("%d%c%c%d",&a,&g,&g,&b);

	if (g == '+') printf("%d\n",a+b);

	else printf("%d\n",a-b);

	return 0;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

	scanf("%d %c %d",&a,&c,&b);

	if (c == '+') printf("%d\n",a+b);

	else if (c == '-') {

		if (a > b) printf("%d\n",a-b);

		else if (b > a) printf("-%d\n",b-a);

	}

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std;

long long a,b;

string x;

int main()

{

    cin>>a>>x>>b;

    if (x=="+")

    {

        cout<<a+b<<endl;

    }

    else if (x=="-")

    {

        cout<<a-b<<endl;

    }

}

// Optimized solution to the same problem (faster):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}


// Fastest known solution for this problem:
// Original C++ solution (slower):


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    int b,c;

    cin>>b>>a>>c;

    if(a=='+')cout<<b+c;

    else cout<<b-c;

}










// Optimized solution to the same problem (faster):
#include<iostream>

#include<cstring>

#include<cstdio>

using namespace std;

int main()

{

 int a,b;

 char ch;

 scanf("%d %c %d",&a,&ch,&b);

 if(ch=='+') printf("%d\n",a+b);

 else printf("%d\n",a-b);



}


// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <stdio.h> 



using namespace std;

int main(){

	int A, B;

	string op;

	cin>>A>>op>>B;

	if(op=="+"){

		cout<<A+B;

	}else if(op=="-"){

		cout<<A-B;

	}

	return 0;

	

}

// Optimized solution to the same problem (faster):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;} 

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include "string.h"

using namespace std;

int main(){

long n,m;

string x;

cin>>n>>x>>m;

if(x=="+"){

    cout<<n+m<<endl;

}

if(x=="-"){

    cout<<n-m<<endl;

}



}


// Optimized solution to the same problem (faster):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;} 

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<iostream>

using namespace std;

int main(){

int a,b;

char op;

cin>>a;

cin>>op;

cin>>b;

if(op=='+')

  cout<<a + b;

else 

  cout<<a - b;

return 0;

}

// Optimized solution to the same problem (faster):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;} 

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>





using namespace std;



int main()

{

int a , b;

char op;

scanf("%d %c %d",&a,&op,&b);



if(op=='+')

printf("%d",a+b);

if(op=='-')

printf("%d",a-b);

    return 0;

}


// Optimized solution to the same problem (faster):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;} 

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std;

int main(){

int x,y,result;char m;

cin >> x>> m >> y;

if (m=='+'){

  result=x+y;

}

else if (m=='-'){

  result = x-y;

}cout << result;

return 0;}

// Optimized solution to the same problem (faster):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;} 

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std ;

int main() {

    int a, b;

    char op;

    cin >> a >> op >> b;

    if (op == '+') cout << a+b;

    else cout << a-b;

    return 0;

}

// Optimized solution to the same problem (faster):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;} 

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std;



//Compiler version g++ 6.3.0



int main()

{

    int a, b;

    char s;

    cin >>a>>s>>b;

    if (s=='+' ) cout<<a+b;

    if(s=='-' )cout<<a-b;

}

// Optimized solution to the same problem (faster):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;} 

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <string>

using namespace std;

int main()

{

int a,b;

char op;

cin>>a>>op>>b;

if(op=='+'){

cout<<a+b;

}

if(op=='-'){

cout<<a-b;

}



 return 0;

}

// Optimized solution to the same problem (faster):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;} 

// Fastest known solution for this problem: