output
stringlengths 52
181k
| instruction
stringlengths 296
182k
|
|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
int main() {
ll n,a,b;
cin >> n >> a >>b;
cout <<(max(0ll,b*(n-2)+a*(2-n)+1));
} | ### Prompt
Generate a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> v;
int main() {
ll n,a,b;
cin >> n >> a >>b;
cout <<(max(0ll,b*(n-2)+a*(2-n)+1));
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,A,B;
cin >> N >> A >> B;
long long M,m,a;
a=0;
M=(N-2)*B;
m=(N-2)*A;
cout << max(M-m+1,a) << endl;
} | ### Prompt
Generate a Cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,A,B;
cin >> N >> A >> B;
long long M,m,a;
a=0;
M=(N-2)*B;
m=(N-2)*A;
cout << max(M-m+1,a) << endl;
}
``` |
#include<bits/stdc++.h>
using namespace std;
long long n,a,b;
int main()
{
cin>>n>>a>>b;
if(n==1&&a==b||n>1&&b>=a)
cout<<(b-a)*(n-2)+1<<endl;
else
cout<<0<<endl;
return 0;
} | ### Prompt
Your task is to create a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
long long n,a,b;
int main()
{
cin>>n>>a>>b;
if(n==1&&a==b||n>1&&b>=a)
cout<<(b-a)*(n-2)+1<<endl;
else
cout<<0<<endl;
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
n>1&&b>=a||n==1&&a==b?cout<<(n-2)*(b-a)+1<<endl:cout<<0<<endl;
} | ### Prompt
Please create a solution in Cpp to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
n>1&&b>=a||n==1&&a==b?cout<<(n-2)*(b-a)+1<<endl:cout<<0<<endl;
}
``` |
#include <iostream>
using namespace std;
signed main(){
long long n,a,b; cin>>n>>a>>b;
long long c=a+b*(n-1)-a*(n-1)-b+1;
cout<<(n>1?(c>0?c:0):(a==b?1:0))<<endl;
} | ### Prompt
Develop a solution in Cpp to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
using namespace std;
signed main(){
long long n,a,b; cin>>n>>a>>b;
long long c=a+b*(n-1)-a*(n-1)-b+1;
cout<<(n>1?(c>0?c:0):(a==b?1:0))<<endl;
}
``` |
#include<iostream>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b) cout<<(n-2)*(b-a)+1;
else cout<<0;} | ### Prompt
In CPP, your task is to solve the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b) cout<<(n-2)*(b-a)+1;
else cout<<0;}
``` |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)cout<<(n-2)*(b-a)+1<<endl;
else cout<<0<<endl;
} | ### Prompt
Generate a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)cout<<(n-2)*(b-a)+1<<endl;
else cout<<0<<endl;
}
``` |
#include<cstdio>
long long n,m,k;
signed main()
{
scanf("%lld%lld%lld",&n,&m,&k);
return printf("%lld\n",n>1&k>=m|n==1&m==k?(n-2)*(k-m)+1:0),0;
} | ### Prompt
Develop a solution in Cpp to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<cstdio>
long long n,m,k;
signed main()
{
scanf("%lld%lld%lld",&n,&m,&k);
return printf("%lld\n",n>1&k>=m|n==1&m==k?(n-2)*(k-m)+1:0),0;
}
``` |
#include"bits/stdc++.h"
using namespace std;
int main(){
long long a,b,c;
cin>>a>>b>>c;
if(b>c || c-b>a){
cout<<0;
return 0;
}
cout<<(a-1)*c+b-(c+(a-1)*b)+1;
} | ### Prompt
Develop a solution in CPP to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include"bits/stdc++.h"
using namespace std;
int main(){
long long a,b,c;
cin>>a>>b>>c;
if(b>c || c-b>a){
cout<<0;
return 0;
}
cout<<(a-1)*c+b-(c+(a-1)*b)+1;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b; cin>>n>>a>>b;
long long min_v=a*(n-1)+b;
long long max_v=b*(n-1)+a;
cout<<(max_v-min_v+1>=0 ? max_v-min_v+1:0)<<endl;
} | ### Prompt
Construct a Cpp code solution to the problem outlined:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b; cin>>n>>a>>b;
long long min_v=a*(n-1)+b;
long long max_v=b*(n-1)+a;
cout<<(max_v-min_v+1>=0 ? max_v-min_v+1:0)<<endl;
}
``` |
#include <iostream>
#include <algorithm>
using namespace std;
using ll = long long;
int main(){
ll n, a, b;
cin >> n >> a >> b;
ll ans = max((n-2)*(b-a)+1, 0LL);
cout << ans << endl;
return 0;
}
| ### Prompt
Please create a solution in CPP to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
#include <algorithm>
using namespace std;
using ll = long long;
int main(){
ll n, a, b;
cin >> n >> a >> b;
ll ans = max((n-2)*(b-a)+1, 0LL);
cout << ans << endl;
return 0;
}
``` |
#include "bits/stdc++.h"
using namespace std;
long long n , a , b;
int main(){
cin >> n >> a >> b;
cout << max(0LL , (n - 1) * b + a - (n - 1) * a - b + 1) << endl;
} | ### Prompt
Create a solution in Cpp for the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include "bits/stdc++.h"
using namespace std;
long long n , a , b;
int main(){
cin >> n >> a >> b;
cout << max(0LL , (n - 1) * b + a - (n - 1) * a - b + 1) << endl;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long r,a,b;
cin>>r>>a>>b;
if(r>1 && b>=a || r==1 && a==b)
cout<<(r-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
} | ### Prompt
Please formulate a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long r,a,b;
cin>>r>>a>>b;
if(r>1 && b>=a || r==1 && a==b)
cout<<(r-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
}
``` |
#include<bits/stdc++.h>
using namespace std ;
int main () {
long long N , A , B ;
cin >> N >> A >> B ;
long long ans = 0 ;
if(A>B) ans = 0 ;
else ans =max(ans,(N-2)*(B-A)+1) ;
cout << ans << endl ;
}
| ### Prompt
Develop a solution in Cpp to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std ;
int main () {
long long N , A , B ;
cin >> N >> A >> B ;
long long ans = 0 ;
if(A>B) ans = 0 ;
else ans =max(ans,(N-2)*(B-A)+1) ;
cout << ans << endl ;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
cout<<max(0ll,(b-a)*(n-2)+1)<<endl;
}
| ### Prompt
Develop a solution in Cpp to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
cout<<max(0ll,(b-a)*(n-2)+1)<<endl;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,n;
cin>>n>>a>>b;
if((n>1 && b>=a) || (n==1 && a==b)){
cout<<(n-2)*(b-a)+1<<endl;
}
else{
cout<<0<<endl;
}
return 0;
} | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,n;
cin>>n>>a>>b;
if((n>1 && b>=a) || (n==1 && a==b)){
cout<<(n-2)*(b-a)+1<<endl;
}
else{
cout<<0<<endl;
}
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin >> n >> a >> b;
if((n==1&&a!=b)||(a>b))
cout << 0 << endl;
else
cout << (a+(n-1)*b)-(b+(n-1)*a)+1 << endl;
} | ### Prompt
Develop a solution in Cpp to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin >> n >> a >> b;
if((n==1&&a!=b)||(a>b))
cout << 0 << endl;
else
cout << (a+(n-1)*b)-(b+(n-1)*a)+1 << endl;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N, A, B;
cin >> N >> A >> B;
long long t = (2-N)*A + (N-2)*B + 1;
if(t < 0) t = 0;
cout << t << endl;
return 0;
} | ### Prompt
Generate a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N, A, B;
cin >> N >> A >> B;
long long t = (2-N)*A + (N-2)*B + 1;
if(t < 0) t = 0;
cout << t << endl;
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,s,e;
scanf("%lld%lld%lld",&n,&s,&e);
printf("%lld\n",max(1LL*0,((n-1)*e+s)-((n-1)*s+e-1)));
return 0;
} | ### Prompt
Please formulate a Cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,s,e;
scanf("%lld%lld%lld",&n,&s,&e);
printf("%lld\n",max(1LL*0,((n-1)*e+s)-((n-1)*s+e-1)));
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N,A,B;
cin>>N>>A>>B;
if(A>B)
cout<<0<<endl;
else
cout<<max((B-A)*(N-2)+1,(int64_t)0)<<endl;
} | ### Prompt
Please create a solution in cpp to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N,A,B;
cin>>N>>A>>B;
if(A>B)
cout<<0<<endl;
else
cout<<max((B-A)*(N-2)+1,(int64_t)0)<<endl;
}
``` |
#include<cstdio>
#include<algorithm>
int main(){
long long n,a,b;
scanf("%lld%lld%lld",&n,&a,&b);
printf("%lld",((n==1&&a!=b)||a>b)?0:(b-a)*(n-2)+1);
return 0;
} | ### Prompt
Generate a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<cstdio>
#include<algorithm>
int main(){
long long n,a,b;
scanf("%lld%lld%lld",&n,&a,&b);
printf("%lld",((n==1&&a!=b)||a>b)?0:(b-a)*(n-2)+1);
return 0;
}
``` |
#include<iostream>
using namespace std;
long long n,a,b;
int main()
{ cin>>n>>a>>b;
if((n-2)*(b-a)+1<=0)cout<<0<<endl;
else cout<<(n-2)*(b-a)+1<<endl;
return 0;
}
| ### Prompt
Develop a solution in CPP to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
long long n,a,b;
int main()
{ cin>>n>>a>>b;
if((n-2)*(b-a)+1<=0)cout<<0<<endl;
else cout<<(n-2)*(b-a)+1<<endl;
return 0;
}
``` |
#include <iostream>
using namespace std;
long long n,a,b,x=0;
int main()
{
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&b==a)
cout<<(n-2)*(b-a)+1<<endl;
else
cout<<x<<endl ;
return 0;
} | ### Prompt
Develop a solution in CPP to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
using namespace std;
long long n,a,b,x=0;
int main()
{
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&b==a)
cout<<(n-2)*(b-a)+1<<endl;
else
cout<<x<<endl ;
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N, A, B;
cin>>N>>A>>B;
if(A>B||(N==1&&A!=B)){
cout<<0<<endl;
return 0;
}
cout<<(N-2)*(B-A)+1<<endl;
return 0;
}
| ### Prompt
Please formulate a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N, A, B;
cin>>N>>A>>B;
if(A>B||(N==1&&A!=B)){
cout<<0<<endl;
return 0;
}
cout<<(N-2)*(B-A)+1<<endl;
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b) cout<<(n-2)*(b-a)+1;
else cout<<0;
cout<<endl;
return false;
} | ### Prompt
Please create a solution in CPP to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b) cout<<(n-2)*(b-a)+1;
else cout<<0;
cout<<endl;
return false;
}
``` |
#include<cstdio>
int main(){
long long n,a,b;
scanf("%lld%lld%lld",&n,&a,&b);
if(a>b) printf("0\n");
else if((a!=b) && (n==1)) printf("0\n");
else{
printf("%lld\n",(b-a) * (n-2) + 1);
}
} | ### Prompt
Create a solution in Cpp for the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<cstdio>
int main(){
long long n,a,b;
scanf("%lld%lld%lld",&n,&a,&b);
if(a>b) printf("0\n");
else if((a!=b) && (n==1)) printf("0\n");
else{
printf("%lld\n",(b-a) * (n-2) + 1);
}
}
``` |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n,a,b;
int main(void){
cin>>n>>a>>b;
if(a>b||(n==1&&a!=b))cout<<0<<endl;
else cout<<(n-2)*(b-a)+1<<endl;
} | ### Prompt
In cpp, your task is to solve the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n,a,b;
int main(void){
cin>>n>>a>>b;
if(a>b||(n==1&&a!=b))cout<<0<<endl;
else cout<<(n-2)*(b-a)+1<<endl;
}
``` |
#include <cstdio>
long long N, A, B;
long long res;
int main()
{
scanf("%lld %lld %lld", &N, &A, &B);
res = B*(N-1)+A - (A*(N-1)+B ) + 1;
if(res < 0)
res = 0;
printf("%lld\n", res);
return 0;
} | ### Prompt
Your task is to create a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <cstdio>
long long N, A, B;
long long res;
int main()
{
scanf("%lld %lld %lld", &N, &A, &B);
res = B*(N-1)+A - (A*(N-1)+B ) + 1;
if(res < 0)
res = 0;
printf("%lld\n", res);
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, A, B;
cin >> N >> A >> B;
cout << max((int64_t)0, (A + B * (N - 1)) - (A * (N - 1) + B) + 1) << endl;
}
| ### Prompt
Please create a solution in cpp to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, A, B;
cin >> N >> A >> B;
cout << max((int64_t)0, (A + B * (N - 1)) - (A * (N - 1) + B) + 1) << endl;
}
``` |
#include <iostream>
using namespace std;
typedef long long LL;
LL n,a,b;
int main() {
cin>>n>>a>>b;
cout<<max(((n-1)*b+a)-((n-1)*a+b)+1,0LL)<<endl;
} | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
using namespace std;
typedef long long LL;
LL n,a,b;
int main() {
cin>>n>>a>>b;
cout<<max(((n-1)*b+a)-((n-1)*a+b)+1,0LL)<<endl;
}
``` |
#include<iostream>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)
cout<<(n-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
return 0;
} | ### Prompt
Create a solution in CPP for the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)
cout<<(n-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
return 0;
}
``` |
#include <iostream>
#define ll long long
using namespace std;
int main(){
ll n,a,b; cin>>n>>a>>b;
if(a>b){cout<<0;}
else if(a<b&&n==1){cout<<0;}
else{cout<<b*(n-2)-a*(n-2)+1;}
return 0;
} | ### Prompt
Please provide a CPP coded solution to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
#define ll long long
using namespace std;
int main(){
ll n,a,b; cin>>n>>a>>b;
if(a>b){cout<<0;}
else if(a<b&&n==1){cout<<0;}
else{cout<<b*(n-2)-a*(n-2)+1;}
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e1+1;
const ll p=1e9+7;
int main()
{
ll n,a,b;
cin>>n>>a>>b;
cout<<max(0LL,(b-a)*(n-2)+1);
return 0;
}
| ### Prompt
Your task is to create a Cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e1+1;
const ll p=1e9+7;
int main()
{
ll n,a,b;
cin>>n>>a>>b;
cout<<max(0LL,(b-a)*(n-2)+1);
return 0;
}
``` |
#include<iostream>
using namespace std;
int main(){
long long int n,a,b;
cin>>n>>a>>b;
b=b-a;
a=0;
cout<<max((long long int)0,b*(n-1)+a-(a*(n-1)+b)+1)<<endl;
return 0;
}
| ### Prompt
Construct a Cpp code solution to the problem outlined:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
int main(){
long long int n,a,b;
cin>>n>>a>>b;
b=b-a;
a=0;
cout<<max((long long int)0,b*(n-1)+a-(a*(n-1)+b)+1)<<endl;
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long int n,a,b,c,d;
cin>>n>>a>>b;
c=b+(a*(n-1));
d=a+(b*(n-1));
d=d-c+1;
if(d<=0 || a>b)
{
cout<<0<<endl;
}
else
{
cout<<d<<endl;
}
} | ### Prompt
Generate a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
long int n,a,b,c,d;
cin>>n>>a>>b;
c=b+(a*(n-1));
d=a+(b*(n-1));
d=d-c+1;
if(d<=0 || a>b)
{
cout<<0<<endl;
}
else
{
cout<<d<<endl;
}
}
``` |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N,A,B;
cin>>N>>A>>B;
ll mn = A*(N-1)+B;
ll mx = B*(N-1)+A;
cout<<max(0LL,mx-mn+1);
} | ### Prompt
Develop a solution in cpp to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N,A,B;
cin>>N>>A>>B;
ll mn = A*(N-1)+B;
ll mx = B*(N-1)+A;
cout<<max(0LL,mx-mn+1);
}
``` |
#include<iostream>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)
cout<<(n-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
} | ### Prompt
Your task is to create a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)
cout<<(n-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
}
``` |
#include<iostream>
using namespace std;
long long n,a,b;
int main()
{
cin>>n>>a>>b;
if(a>b||(n==1&&a!=b))
cout<<0;
else
cout<<(n-2)*(b-a)+1;
return 0;
} | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
long long n,a,b;
int main()
{
cin>>n>>a>>b;
if(a>b||(n==1&&a!=b))
cout<<0;
else
cout<<(n-2)*(b-a)+1;
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,A,B;
cin >>N>>A>>B;
long long ans=B*(N-1)+A-A*(N-1)-B+1;
if((N==1&&A!=B)||(A>B))ans=0;
cout<<ans;
return 0;
} | ### Prompt
Create a solution in CPP for the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,A,B;
cin >>N>>A>>B;
long long ans=B*(N-1)+A-A*(N-1)-B+1;
if((N==1&&A!=B)||(A>B))ans=0;
cout<<ans;
return 0;
}
``` |
#include<iostream>
using namespace std;
long long n,a,b;
int main(){
cin>>n>>a>>b;
if(a>b or (n==1 and a!=b))cout<<0<<endl;
else if(a==b)cout<<1<<endl;
else cout<<(a-b)*(2-n)+1<<endl;
} | ### Prompt
Develop a solution in Cpp to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
long long n,a,b;
int main(){
cin>>n>>a>>b;
if(a>b or (n==1 and a!=b))cout<<0<<endl;
else if(a==b)cout<<1<<endl;
else cout<<(a-b)*(2-n)+1<<endl;
}
``` |
#include<iostream>
using namespace std;
int main()
{
long long a,b,n;
cin >> n >> a >> b;
if((n>1&&a<=b)||(n==1&&a==b))cout << (n-2)*(b-a)+1;
else cout << 0;
return 0;
}
| ### Prompt
Please formulate a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
int main()
{
long long a,b,n;
cin >> n >> a >> b;
if((n>1&&a<=b)||(n==1&&a==b))cout << (n-2)*(b-a)+1;
else cout << 0;
return 0;
}
``` |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n, a, b;
cin >> n >> a >> b;
ll ans = max(0LL, (a+(n-1)*b) - ((n-1)*a+b) + 1);
cout << ans << endl;
return 0;
}
| ### Prompt
Construct a CPP code solution to the problem outlined:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n, a, b;
cin >> n >> a >> b;
ll ans = max(0LL, (a+(n-1)*b) - ((n-1)*a+b) + 1);
cout << ans << endl;
return 0;
}
``` |
#include<iostream>
using namespace std;
int main()
{
long long a,b,c,d;
cin>>a>>b>>c;
if(a>1 && c>=b || a==1 && c==b)
cout<<(a-2)*(c-b)+1;
else
cout<<0;
return 0;
} | ### Prompt
Please provide a CPP coded solution to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
int main()
{
long long a,b,c,d;
cin>>a>>b>>c;
if(a>1 && c>=b || a==1 && c==b)
cout<<(a-2)*(c-b)+1;
else
cout<<0;
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n,a,b;
cin >> n >> a >> b;
ll mn = a*(n-1)+b;
ll mx = b*(n-1)+a;
cout << max(0LL,mx-mn+1)<<endl;
}
| ### Prompt
Create a solution in Cpp for the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n,a,b;
cin >> n >> a >> b;
ll mn = a*(n-1)+b;
ll mx = b*(n-1)+a;
cout << max(0LL,mx-mn+1)<<endl;
}
``` |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n, a, b;
cin >> n >> a >> b;
cout << max((b*(n-1)+a) - (b+a*(n-1)) + 1, 0ll) << endl;
return 0;
}
| ### Prompt
Please create a solution in Cpp to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n, a, b;
cin >> n >> a >> b;
cout << max((b*(n-1)+a) - (b+a*(n-1)) + 1, 0ll) << endl;
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
int main(){
ll n,a,b;cin>>n>>a>>b;
if(a>b||n==1&&a^b)cout<<0<<endl;
else cout<<(n-2)*(b-a)+1<<endl;
}
| ### Prompt
Create a solution in CPP for the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
int main(){
ll n,a,b;cin>>n>>a>>b;
if(a>b||n==1&&a^b)cout<<0<<endl;
else cout<<(n-2)*(b-a)+1<<endl;
}
``` |
#include <bits/stdc++.h>
using namespace std;
void solve()
{
long long n, a, b;
cin >> n >> a >> b;
cout << max((b-a)*(n-2)+1, 0LL) << endl;
}
int main ()
{
solve();
return 0;
}
| ### Prompt
Please provide a CPP coded solution to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
void solve()
{
long long n, a, b;
cin >> n >> a >> b;
cout << max((b-a)*(n-2)+1, 0LL) << endl;
}
int main ()
{
solve();
return 0;
}
``` |
#include <iostream>
using namespace std;
int main(){
long long n,a,b,x=0;
cin>>n>>a>>b;
if(a==b) x=1;
else if(a<b&&n!=1) x=(b-a)*(n-1)+a-b+1;
cout<<x<<endl;
return 0;
}
| ### Prompt
Create a solution in cpp for the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
using namespace std;
int main(){
long long n,a,b,x=0;
cin>>n>>a>>b;
if(a==b) x=1;
else if(a<b&&n!=1) x=(b-a)*(n-1)+a-b+1;
cout<<x<<endl;
return 0;
}
``` |
#include<iostream>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(a>b)
cout<<0<<endl;
else if(n==1 and a!=b)
cout<<0<<endl;
else
cout<<(n-1)*b+a-((n-1)*a+b)+1<<endl;
} | ### Prompt
Develop a solution in Cpp to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(a>b)
cout<<0<<endl;
else if(n==1 and a!=b)
cout<<0<<endl;
else
cout<<(n-1)*b+a-((n-1)*a+b)+1<<endl;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b,ans;
cin >> n >> a >> b;
ans=(b-a)*(n-2)+1;
cout << (ans<0?0:ans) << endl;
return 0;
} | ### Prompt
Develop a solution in CPP to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b,ans;
cin >> n >> a >> b;
ans=(b-a)*(n-2)+1;
cout << (ans<0?0:ans) << endl;
return 0;
}
``` |
#include <iostream>
using namespace std;
long long n, a, b;
int main() {
cin>>n>>a>>b;
cout<<(a>b || n==1 && a!=b ? 0 : (b-a)*(n-2)+1);
return 0;
} | ### Prompt
Develop a solution in CPP to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <iostream>
using namespace std;
long long n, a, b;
int main() {
cin>>n>>a>>b;
cout<<(a>b || n==1 && a!=b ? 0 : (b-a)*(n-2)+1);
return 0;
}
``` |
#include<iostream>
using namespace std;
typedef long long int lli;
int main(){
lli n, a, b;
std::cin >> n >> a >> b;
std::cout << max(0LL, (b - a)*(n - 2) + 1) << std::endl;
return 0;
}
| ### Prompt
In cpp, your task is to solve the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
typedef long long int lli;
int main(){
lli n, a, b;
std::cin >> n >> a >> b;
std::cout << max(0LL, (b - a)*(n - 2) + 1) << std::endl;
return 0;
}
``` |
#include<bits/stdc++.h>
long long a,b,n;
int main(){
scanf("%lld%lld%lld",&n,&a,&b);
printf("%ld\n",n==1&&a==b||n>1&&a<=b?(b-a)*(n-2)+1:0);
return 0;
} | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
long long a,b,n;
int main(){
scanf("%lld%lld%lld",&n,&a,&b);
printf("%ld\n",n==1&&a==b||n>1&&a<=b?(b-a)*(n-2)+1:0);
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N , A , B;
cin >> N >> A >> B;
cout << max((long long)0,(B*(N - 1) + A) - (A*(N - 1) + B) + 1) << endl;
return 0;
}
| ### Prompt
Your task is to create a Cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N , A , B;
cin >> N >> A >> B;
cout << max((long long)0,(B*(N - 1) + A) - (A*(N - 1) + B) + 1) << endl;
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
n>1&&b>=a||n==1&&a==b?cout<<(n-2)*(b-a)+1:cout<<0;
} | ### Prompt
Generate a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
n>1&&b>=a||n==1&&a==b?cout<<(n-2)*(b-a)+1:cout<<0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {int64_t n,a,b;cin>>n>>a>>b;if(n==1){if(a==b)cout<<1;else cout<<0;}else{if(a>b)cout<<0;else cout<<(b-a)*(n-2)+1;}} | ### Prompt
In Cpp, your task is to solve the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {int64_t n,a,b;cin>>n>>a>>b;if(n==1){if(a==b)cout<<1;else cout<<0;}else{if(a>b)cout<<0;else cout<<(b-a)*(n-2)+1;}}
``` |
#include<bits/stdc++.h>
using namespace std;
long long n,a,b;
int main(){
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)
cout<<(n-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
} | ### Prompt
Please provide a cpp coded solution to the problem described below:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
long long n,a,b;
int main(){
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)
cout<<(n-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(a>b)cout<<0<<endl;
else if(n==1)cout<<((a==b)?1:0)<<endl;else cout<<(n-2)*(b-a)+1ll<<endl;
return 0;
} | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(a>b)cout<<0<<endl;
else if(n==1)cout<<((a==b)?1:0)<<endl;else cout<<(n-2)*(b-a)+1ll<<endl;
return 0;
}
``` |
// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)cout<<(n-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
} | ### Prompt
Please formulate a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,b;
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)cout<<(n-2)*(b-a)+1<<endl;
else
cout<<0<<endl;
}
``` |
#include<iostream>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
if(n==1&&a==b) cout<<"1";
else if(n==1||a>b) cout<<"0";
else cout<<(n-2)*(b-a)+1;
}
| ### Prompt
Construct a Cpp code solution to the problem outlined:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<iostream>
using namespace std;
int main(){
long long n,a,b;
cin>>n>>a>>b;
if(n==1&&a==b) cout<<"1";
else if(n==1||a>b) cout<<"0";
else cout<<(n-2)*(b-a)+1;
}
``` |
#include <stdio.h>
using namespace std;
long long n,m,x;
int main()
{
scanf("%lld %lld %lld",&n,&m,&x);
return printf("%lld\n",((n-2)*(x-m)+1)<0?0:(n-2)*(x-m)+1)&0;
} | ### Prompt
Please formulate a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include <stdio.h>
using namespace std;
long long n,m,x;
int main()
{
scanf("%lld %lld %lld",&n,&m,&x);
return printf("%lld\n",((n-2)*(x-m)+1)<0?0:(n-2)*(x-m)+1)&0;
}
``` |
#include "cstdio"
int main(){
long long n,a,b;scanf("%lld%lld%lld",&n,&a,&b);
if (n>1&&b>=a||n==1&&a==b)
printf("%lld",(n-2)*(b-a)+1);
else printf ("0");
return 0;
} | ### Prompt
Please create a solution in CPP to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include "cstdio"
int main(){
long long n,a,b;scanf("%lld%lld%lld",&n,&a,&b);
if (n>1&&b>=a||n==1&&a==b)
printf("%lld",(n-2)*(b-a)+1);
else printf ("0");
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
long long n,a,b;
int main()
{
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)
{
cout<<(n-2)*(b-a)+1;
}
else
{
cout<<"0";
}
return 0;
} | ### Prompt
Generate a CPP solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
long long n,a,b;
int main()
{
cin>>n>>a>>b;
if(n>1&&b>=a||n==1&&a==b)
{
cout<<(n-2)*(b-a)+1;
}
else
{
cout<<"0";
}
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long n,a,b,ans;
cin>>n>>a>>b;
ans=(b*n-b+a)-(a*n-a+b)+1;
cout<<(ans>0?ans:0);
} | ### Prompt
Your task is to create a cpp solution to the following problem:
Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How many different possible sums there are?
Constraints
* 1 ≤ N,A,B ≤ 10^9
* A and B are integers.
Input
Input is given from Standard Input in the following format:
N A B
Output
Print the number of the different possible sums.
Examples
Input
4 4 6
Output
5
Input
5 4 3
Output
0
Input
1 7 10
Output
0
Input
1 3 3
Output
1
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long n,a,b,ans;
cin>>n>>a>>b;
ans=(b*n-b+a)-(a*n-a+b)+1;
cout<<(ans>0?ans:0);
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
string S;
cin >>A>>S ;
cout <<"A"<<S.at(0)<<"C";
}
| ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
string S;
cin >>A>>S ;
cout <<"A"<<S.at(0)<<"C";
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
cin>>s;
cout<<"A";
cout<<s[0];
cout<<"C";
return 0;
} | ### Prompt
Construct a cpp code solution to the problem outlined:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
cin>>s;
cout<<"A";
cout<<s[0];
cout<<"C";
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a;
cin >> a >> a;
cout << 'A' << a[0] << 'C';
} | ### Prompt
Create a solution in cpp for the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
string a;
cin >> a >> a;
cout << 'A' << a[0] << 'C';
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
string A, x, C;
cin>>A>>x>>C;
cout<<'A'<<x.at(0)<<'C'<<endl;
} | ### Prompt
In cpp, your task is to solve the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
string A, x, C;
cin>>A>>x>>C;
cout<<'A'<<x.at(0)<<'C'<<endl;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,s;
cin>>S>>s;
cout<<"A"<<s.at(0)<<"C"<<endl;
}
| ### Prompt
Please formulate a cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,s;
cin>>S>>s;
cout<<"A"<<s.at(0)<<"C"<<endl;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A >> A;
cout << 'A' << A[0] << 'C' << endl;
}
| ### Prompt
Your task is to create a Cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A >> A;
cout << 'A' << A[0] << 'C' << endl;
}
``` |
#include <iostream>
using namespace std;
int main() {
string a,x,c;
cin>>a>>x>>c;
cout<<a[0]<<x[0]<<c[0];
return 0;
} | ### Prompt
Generate a cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <iostream>
using namespace std;
int main() {
string a,x,c;
cin>>a>>x>>c;
cout<<a[0]<<x[0]<<c[0];
return 0;
}
``` |
#include<stdio.h>
int main(void) {
char s[101];
scanf("%*s %s %*s",&s);
printf("A%cC\n", s[0]);
return 0;
} | ### Prompt
Construct a cpp code solution to the problem outlined:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<stdio.h>
int main(void) {
char s[101];
scanf("%*s %s %*s",&s);
printf("A%cC\n", s[0]);
return 0;
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
string s;
cin>>S>>s;
cout<<"A"<<s[0]<<"C"<<endl;
} | ### Prompt
Create a solution in CPP for the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
string s;
cin>>S>>s;
cout<<"A"<<s[0]<<"C"<<endl;
}
``` |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s,t;
cin >>s>>t;
cout <<"A"<<t[0]<<"C"<<endl;
}
| ### Prompt
Construct a Cpp code solution to the problem outlined:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <iostream>
#include <string>
using namespace std;
int main(){
string s,t;
cin >>s>>t;
cout <<"A"<<t[0]<<"C"<<endl;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
char s;
cin >> a >> s;
cout << "A" << s << "C";
} | ### Prompt
Please create a solution in cpp to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
char s;
cin >> a >> s;
cout << "A" << s << "C";
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
for(int i=0;i<3;i++){
cin>>N;
cout<<N.at(0);
}
}
| ### Prompt
Please create a solution in Cpp to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
for(int i=0;i<3;i++){
cin>>N;
cout<<N.at(0);
}
}
``` |
#include<iostream>
using namespace std;
int main(){
string S;
cin >> S;
cin >> S;
cout <<"A"<< S.at(0) <<"C"<<endl;
} | ### Prompt
Your task is to create a Cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<iostream>
using namespace std;
int main(){
string S;
cin >> S;
cin >> S;
cout <<"A"<< S.at(0) <<"C"<<endl;
}
``` |
#include<stdio.h>
int main (void) {
char inp[1024];
scanf("AtCoder %s Contest", &inp);
printf("A%cC\n", inp[0]);
return 0;
} | ### Prompt
Construct a cpp code solution to the problem outlined:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<stdio.h>
int main (void) {
char inp[1024];
scanf("AtCoder %s Contest", &inp);
printf("A%cC\n", inp[0]);
return 0;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
getline(cin, s);
cout << "A"<< s.at(8) << "C";
} | ### Prompt
Develop a solution in CPP to the problem described below:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
getline(cin, s);
cout << "A"<< s.at(8) << "C";
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
string s,a,b; cin>>s>>a>>b;
cout<<s[0]<<a[0]<<b[0]<<endl;
}
| ### Prompt
Please formulate a Cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main ()
{
string s,a,b; cin>>s>>a>>b;
cout<<s[0]<<a[0]<<b[0]<<endl;
}
``` |
#include<iostream>
using namespace std;
int main(){
string s, d;
cin >> d >> s >> d;
cout << 'A' << s[0] << 'C' << '\n';
} | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<iostream>
using namespace std;
int main(){
string s, d;
cin >> d >> s >> d;
cout << 'A' << s[0] << 'C' << '\n';
}
``` |
#include<cstdio>
int main()
{
char c[10001];
scanf("%s",&c); scanf("%s",&c);
printf("A%cC",c[0]);
return 0;
}
| ### Prompt
Create a solution in Cpp for the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<cstdio>
int main()
{
char c[10001];
scanf("%s",&c); scanf("%s",&c);
printf("A%cC",c[0]);
return 0;
}
``` |
#include<iostream>
using namespace std;
int main(){string s[3];cin>>s[0]>>s[1]>>s[2];cout<<s[0][0]<<s[1][0]<<s[2][0]<<endl;} | ### Prompt
In cpp, your task is to solve the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<iostream>
using namespace std;
int main(){string s[3];cin>>s[0]>>s[1]>>s[2];cout<<s[0][0]<<s[1][0]<<s[2][0]<<endl;}
``` |
#include<bits/stdc++.h>
using namespace std;
string a;
int main(){
cin>>a>>a;
cout<<'A'<<a[0]<<'C'<<endl;
} | ### Prompt
Generate a Cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
string a;
int main(){
cin>>a>>a;
cout<<'A'<<a[0]<<'C'<<endl;
}
``` |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s,t,y;
cin>>s>>t>>y;
cout<<'A'<<t[0]<<'C';
} | ### Prompt
Please formulate a cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s,t,y;
cin>>s>>t>>y;
cout<<'A'<<t[0]<<'C';
}
``` |
#include <bits/stdc++.h>
using namespace std;
string A,B,C;
int main(){
cin>>A>>B>>C;
cout<<A[0]<<B[0]<<C[0]<<endl;
}
| ### Prompt
Construct a cpp code solution to the problem outlined:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
string A,B,C;
int main(){
cin>>A>>B>>C;
cout<<A[0]<<B[0]<<C[0]<<endl;
}
``` |
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s >> s;
cout << 'A' << s[0] << 'C' << endl;
} | ### Prompt
Your task is to create a Cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s >> s;
cout << 'A' << s[0] << 'C' << endl;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin>>s>>s;
cout<<'A'<<s.at(0)<<'C';
} | ### Prompt
Please formulate a cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin>>s>>s;
cout<<'A'<<s.at(0)<<'C';
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B;
cin >> A >> B;
cout << "A"<<B.at(0)<<"C" << endl;
}
| ### Prompt
Construct a CPP code solution to the problem outlined:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B;
cin >> A >> B;
cout << "A"<<B.at(0)<<"C" << endl;
}
``` |
#include <iostream>
using namespace std;
int main()
{
string a, b, c;
cin >> a >> b >> c;
cout << "A" << b[0] << "C";
}
| ### Prompt
Construct a CPP code solution to the problem outlined:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <iostream>
using namespace std;
int main()
{
string a, b, c;
cin >> a >> b >> c;
cout << "A" << b[0] << "C";
}
``` |
#include <iostream>
using namespace std;
int main() {
string S, a, b; cin >> a >> S >> b;
printf("A%cC\n", S[0]);
} | ### Prompt
Please provide a cpp coded solution to the problem described below:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <iostream>
using namespace std;
int main() {
string S, a, b; cin >> a >> S >> b;
printf("A%cC\n", S[0]);
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
for (string s; cin >> s;) cout << s.at(0);
} | ### Prompt
Develop a solution in CPP to the problem described below:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
for (string s; cin >> s;) cout << s.at(0);
}
``` |
#include<iostream>
using namespace std;
int main()
{
string s;
while(cin>>s)
cout<<s[0];
cout<<endl;
} | ### Prompt
Construct a CPP code solution to the problem outlined:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<iostream>
using namespace std;
int main()
{
string s;
while(cin>>s)
cout<<s[0];
cout<<endl;
}
``` |
#include<iostream>
using namespace std;
int main(){
string s;
while(cin>>s){
cout<<s[0];
}
} | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<iostream>
using namespace std;
int main(){
string s;
while(cin>>s){
cout<<s[0];
}
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t,u; cin>>s>>t>>u;
cout << 'A' << t[0] << 'C' << endl;
} | ### Prompt
Please create a solution in CPP to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t,u; cin>>s>>t>>u;
cout << 'A' << t[0] << 'C' << endl;
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main()
{string t, s; cin >> t >> s;
printf("A%cC\n", s[0]);} | ### Prompt
In CPP, your task is to solve the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{string t, s; cin >> t >> s;
printf("A%cC\n", s[0]);}
``` |
#include<iostream>
using namespace std;
string a,b,c;
int main()
{
cin>>a>>b>>c;
cout<<a[0]<<b[0]<<c[0]<<endl;
return 0;
} | ### Prompt
In cpp, your task is to solve the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<iostream>
using namespace std;
string a,b,c;
int main()
{
cin>>a>>b>>c;
cout<<a[0]<<b[0]<<c[0]<<endl;
return 0;
}
``` |
#include"bits/stdc++.h"
#include<math.h>
using namespace std;
int main() {
string S,A;
cin >> S>>A;
cout <<'A'<< A[0]<<'C';
} | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include"bits/stdc++.h"
#include<math.h>
using namespace std;
int main() {
string S,A;
cin >> S>>A;
cout <<'A'<< A[0]<<'C';
}
``` |
#include<bits/stdc++.h>
using namespace std;
int main (){
string s1,s2,s3;
cin>>s1>>s2>>s3;
cout<<s1.at(0)<<s2.at(0)<<s3.at(0);
}
| ### Prompt
Develop a solution in cpp to the problem described below:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include<bits/stdc++.h>
using namespace std;
int main (){
string s1,s2,s3;
cin>>s1>>s2>>s3;
cout<<s1.at(0)<<s2.at(0)<<s3.at(0);
}
``` |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C;
cin >> A>>B>>C;
cout <<"A"<<B.at(0)<<"C"<<endl;
}
| ### Prompt
Generate a CPP solution to the following problem:
Snuke is going to open a contest named "AtCoder s Contest". Here, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.
Snuke has decided to abbreviate the name of the contest as "AxC". Here, x is the uppercase English letter at the beginning of s.
Given the name of the contest, print the abbreviation of the name.
Constraints
* The length of s is between 1 and 100, inclusive.
* The first character in s is an uppercase English letter.
* The second and subsequent characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
AtCoder s Contest
Output
Print the abbreviation of the name of the contest.
Examples
Input
AtCoder Beginner Contest
Output
ABC
Input
AtCoder Snuke Contest
Output
ASC
Input
AtCoder X Contest
Output
AXC
### Response
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C;
cin >> A>>B>>C;
cout <<"A"<<B.at(0)<<"C"<<endl;
}
``` |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.