Help me in solving CLEARDAY problem

help
,
1

My issue

Chef classifies a day to be either rainy, cloudy, or clear.

In a particular week, Chef finds
�
X days to be rainy and
�
Y days to be cloudy.
Find the number of clear days in the week.

Input Format
The first and only line of input will contain two space-separated integers
�
X and
�
Y, denoting the number of rainy and cloudy days in the week.
Output Format
Output the number of clear days in the week.

Constraints
0
≤
�
,
�
≤
7
0≤X,Y≤7
0
≤
�
+
�
≤
7
0≤X+Y≤7
Sample 1:
Input
Output
2 3
2
Explanation:
There are
7
7 days in a week. If there are
2
2 rainy days and
3
3 cloudy days, then the remaining
7
−
2
−
3

2
7−2−3=2 days are clear.

Sample 2:
Input
Output
3 4
0
Explanation:
If there are
3
3 rainy days and
4
4 cloudy days, then the remaining
7
−
3
−
4

0
7−3−4=0 days are clear.

My code

#include <stdio.h>

int main
{
    if 0<=3 , 2<=7

	return 0;
}

Problem Link: CLEARDAY Problem - CodeChef

2

include
using namespace std;

int main() {
// your code goes here
// x = rainy day and y = cloudy
int x, y;
cin>>x>>y;
//calculating total clear days
int clear = 7 - (x+y);
cout<<clear<<endl;
return 0;
}

I hope this code will help you.