Taddy and Tweety

Problem:-

Teddy has N chocolates. Tweety asks him to give few chocolates to her. Teddy is very generous and kind hearted. So he decides to give all chocolates to Tweety, but only on one condition.
If integer N can be divided into 3 parts, such that these three parts can form sides of an equilateral triangle, then Teddy gives all chocolates to Tweety. Otherwise he won’t give any chocolate to her.
Print “YES” (without quotes) if Teddy will give all chocolates to Tweety. Otherwise print “NO” (without quotes).
Input:
Integer N
Output:
YES or NO depending on problem.
Constraints:
1 <= N  <= 10000
SAMPLE INPUT
 
6
SAMPLE OUTPUT
 
YES
Explanation

6 can be divided in three parts – 2, 2, 2. These can form sides on equilateral triangle.
Time Limit:5.0 sec(s) for each input file.
Memory Limit:256 MB
Source Limit:1024 KB

solution:-

#include<stdio.h>
void main()
{
int n;
scanf(“%d”,&n);
if(n%3==0)
printf(“YES”);
else
printf(“NO”);
}

Leave a Reply

Your email address will not be published.