448A Rewards solution

-
  1. #include<iostream>
  2. using namespace std;
  3. int main()
  4. {
  5. int a1,a2,a3;
  6. int b1,b2,b3;
  7. int n;
  8. cin>>a1>>a2>>a3;
  9. cin>>b1>>b2>>b3;
  10. cin>>n;
  11. int s=a1+a2+a3;
  12. int m=0;
  13. int b=b1+b2+b3;
  14. if(s%5>0){m=s%5; s=s+(5-m);}
  15. //cout<<s;
  16. if(n==1 and s>=1 and b>=1 ) cout<<"NO"<<endl;
  17. else {n=n*5;
  18. if((n-s)*2>=b ) cout<<"YES"<<endl;
  19. else cout<<"NO";
  21. return 0;
  22.  
  23. }

Comments

Post a Comment

Popular posts from this blog

Codeforce Problem 1703A. YES or YES?

-
A. YES or YES?   There is a string  s �  of length  3 3 , consisting of uppercase and lowercase English letters. Check if it is equal to " YES " (without quotes), where each letter can be in any case. For example, " yES ", " Yes ", " yes " are all allowable. Input The first line of the input contains an integer  t �  ( 1 ≤ t ≤ 10 3 1 ≤ � ≤ 10 3 ) — the number of testcases. The description of each test consists of one line containing one string  s �  consisting of three characters. Each character of  s �  is either an uppercase or lowercase English letter. Output For each test case, output " YES " (without quotes) if  s �  satisfies the condition, and " NO " (without quotes) otherwise. You can output " YES " and " NO " in any case (for example, strings " yES ", " yes " and " Yes " will be recognized as a positive response). Example input Copy 10 YES yES yes Yes YeS Noo orZ yEz Y...
Read more

Aptitude test assistant programmer 2018

-
 #include <stdio.h> #include <stdlib.h> int main() { char str[100]; int i; int space=0;     printf("Enter a string\n");     fgets(str,sizeof(str),stdin);     i=0;     while(i<=str[i]){  if(str[i]==' '){         space++;     }     i++; } printf("Total word count :%d" ,space+1);       return 0; }
Read more

1041A. Heist solution

-
#include <iostream> #include <algorithm> using namespace std ; int main () { long int n ; cin >> n ;   long long arr [ n ]; for ( int j = 0 ; j < n ; j ++){ cin >> arr [ j ];}   sort ( arr , arr + n );   int b = arr [ 0 ];   int l = arr [ n - 1 ];   int x = 0 ;   for ( int i = b ; i <= l ; i ++) {   x ++; }   cout << x - n ;   return 0 ; }
Read more