Black Square (431A - Black Square)

-
431A - Black Square


Complexity 0(n)

    

  1. #include<iostream>
    2. 

  2. using namespace std;
    3. 

  3. int main(){
    4. 

  4.  
    5. 

  5. int a,b,c,d;
    6. 

  6. string s;
    7. 

  7. cin>>a>>b>>c>>d;
    8. 

  8. cin>> s;
    9. 

  9. int j=0,k=0,l=0,m=0;
    10. 

  10.  
    11. 

  11. for(int i=0;i<s.length();i++){
    12. 

  12.  if(s[i]=='1') j++;
    13. 

  13.  if(s[i]=='2') k++;
    14. 

  14.  if(s[i]=='3') l++;
    15. 

  15.  if(s[i]=='4') m++;
    16. 

  16.  
    17. 

  17.   }
    18. 

  18.  
    19. 

  19. cout<<a*j+b*k+c*l+d*m;
    20. 

  20.  
    21. 

  21. }
    22. 

  22.

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