734B - Anton and Digits
- #include<iostream>
- using namespace std;
- int main()
- {
- long long d2,d3,d5,d6;
- cin>>d2>>d3>>d5>>d6;
- long long mn= min( min(d2,d5),d6 );
- long long mn2=min(d2-mn,d3);
- long long ans = mn*256+mn2*32;
- cout<<ans;
- }
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...
Comments
Post a Comment