include<stdio.h> #include<stdlib.h> int main() { int N; scanf("%d", &N); int input[N], ind, rem; for(ind=0;ind<N;ind++) scanf("%d", &input[ind]); // 8 7 6 4 int two_digits[22], two_digits_ind; unsignedlonglongint res = 0; two_digits[0] = 1; for(two_digits_ind=1;two_digits_ind<22;two_digits_ind++) two_digits[two_digits_ind] = ((two_digits[two_digits_ind-1])*2)%100; for(ind=0;ind<N;ind++) { if(input[ind]>21) { rem = input[ind] % 22; rem += 2; } else rem = input[ind]; res = res + two_digits[rem]; } printf("%llu", res%.

The code can be explained as follows:The code starts by reading an integer N from the standard…

Answered: #include int main() {…

Engineering

Computer Science

#include int main() { int N; scanf("%d", &N); int input[N], ind, rem; for(ind=0;ind

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 4PP: (Numerical) Write and test a function that returns the position of the largest and smallest values...

See similar textbooks

Related questions

Q: edit code to print letters not numbers #include void main(){ //Required matrices and…

A: Soluton: Given code: #include<stdio.h> void main(){ //Required matrices and variables…

Q: #include int main() { int arr[10]; int i; for (i=0; i<10; i++){ arr[i] =…

A: As given, we need add the following code parts to the given code - (1) Copy the content of the first…

Q: int FindSmallestVal() { int num = 0, min = 0; // reads num until the num > 0 while (num > num; //…

A: Program Approach:- 1. Include header file 2. Create the user-defined function whose name is…

Q: double tab1[5] = {2,3,4,5,6}; double tab2[5] = {6,5,4,3,2}; for(int i = 0;i<5;i++)…

A: The program declares two array named tab1 of size 5 and tab2 of size 5. For loop is used to iterate…

Q: #include #include using namespace std; int main() { int arr [7] = {9, 4, 1, 6, 2}; int i, j, k,…

A: Answer: A function is a block of code that runs when we call any function. You can pass data into…

Q: #include <stdio.h>int main(){int d;int s[20],i, j, p, lg=0,m,t=0;char c;printf("Enter number…

A: The function getch() defines under <conio.h> header file, include <conio.h> header file…

Q: #include <stdio.h>int main(){int d;int s[20],i, r, p, lg=0,m;char c;printf("Enter number of…

A: Add the statement “i+1” in the print statement: printf("salesman %d ",i+1); Add another array to…

Q: #include struct dna { int number; char text; char stringvalue[30]; }; int main() {…

A: NOTE: - As asked the comments are being added on each line of the program. Any modification other…

Q: #include using namespace std; const int y = 1; int main () ( int static y - 2; int i = 3, j - 4, m…

A: The output along with the explanation is given below:

Q: In this lab, you use what you have learned about searching an array to find an exact match to…

A: #include <iostream>#include <string>using namespace std; int main() { string…

Q: MichiganCities.cpp - This program prints a message for invalid cities in Michigan. // Input:…

A: Start declare inCity declare constant NUM_CITIES = 10 declare citiesInMichigan[] = {"Acme",…

Q: include using namespace std; bool isPalindrome(int x) { int n=0,val; val = x; while(x > 0) { n = n *…

A: Solution :

Q: #include #include int MAX_SIZE = 10; int n = 0; //A counter variable which will keep track of…

A: The objective is to solve the given code using struct type.

Q: 1、Counting Primitive Operations void STRAITMAXMIN(A,n,max,min) //Set the maximum value in A to max…

A: Given : { int i,n max=min=A[1] for i=2 to n { if A[i]> max…

Q: // MichiganCities.cpp - This program prints a message for invalid cities in Michigan. // Input:…

A: I have written the program using C++ PROGRAMMING LANGUAGE OUTPUT : CODE : //…

Q: Rewrite the code snippet in "What is the Output, Question #1" using do-while loops

A: Introduction: Write in do-while loop

Q: CFG: Example 1 • Draw the CFG for the following code: int f(int n){ } int m = n* n; if (n < 0) else…

A: CFG for the code has been written in step2

Q: main(){ int M-20; if(M=340) cout<<M:} 20 O 40 O 21 O

A: Answer: Nothing will be printed last option i guess because its missing the first 3 options are…

Q: cmpl $4 , %edi movl %edi , %edi jmp .L4(,%rdi,8) .L3: movl $17, %eax ret .L5: movl $3, %eax int A (…

A: A = X B = W

Q: #include #include #include int main() { int i, j; printf("Columns I JIn"); for (i = 1; i< 4; ++i)…

A: Given:

Q: #include #include #define r 3 #define c 4 int z[r][c] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};…

A: An array is a data structure that contains the elements of the same type. It helps to store…

Q: // MichiganCities.cpp - This program prints a message for invalid cities in Michigan. // Input:…

A: You need to check with each and every element in the array of strings and if it equals the input…

Q: 1. Why does little-endian vs. big-endian matter here in this code 2. Describe how pointer casting…

A: Answer: I have given answer in the brief explanation.

Q: #include #include int MAX_SIZE = 10; int n = 0; //A counter variable which will keep track of…

A: Task : In the given C code, the output of the code is not correct. The task is to debug the code…

Q: main(){ float y3D20.3; int x-20; float z; z=x+y; cout<<z;} 40.3 O 20 40

A: The corrected option is 40.3

Q: #include #include int MAX_SIZE = 10; int n = 0; //A counter variable which will keep track of…

A: the program is given below:-

Q: int func(int a, int b) { return (a<b)? a: b; } int main( ) { int x = 1, y = 3, z = 5; int w; w =…

A: Answer: 1

Q: const int SIZE = 22; char value[] = ('c', 'e', 'E', 'p', 'T', 'u', ‘s’, ‘P’ //ASCII code of A to Z…

A: Code is below:

Q: Why does little-endian vs. big-endian matter here in this code

A: Answer: Little-endian: The little-endian show is a kind of addressing that alludes to the request…

Q: #include #include int MAX_SIZE = 10; int n = 0; //A counter variable which will keep track of…

A: The Answer is

Q: #include #include int findRepeat(char* s) { int p , i , j; p = -1; for (i = 0 ; i < strlen(s) ;…

A: #include <stdio.h>#include <string.h> int findRepeat(char* s){int p , i , j; p = -1; for…

Q: return midpt; else if (arr[midpt] < value) return else return find(arr,value, left, midpt-1); } void…

A: Given:

Q: #include #include #include #define SIZE 5 int nums [SIZE] = [5,0,6,1,2); int main() { int i;…

A: The fork() function is utilized to make another interaction by copying the current cycle from which…

Q: #include using namespace std; //swapping void swapping(int &a, int &b) { //variable…

A: The modified code without using function is written below:…

Q: include #include #define SIZE 6 struct Student{ char name[50]; int id; float mark; }; int…

A: Algorithm: Start Implement a template function SearchInArray() which takes an array and search…

Question

include<stdio.h>
	#include<stdlib.h>

	int main()
	{

	int N;
	scanf("%d", &N);
	int input[N], ind, rem;
	for(ind=0;ind<N;ind++) scanf("%d", &input[ind]); // 8 7 6 4
	int two_digits[22], two_digits_ind;
	unsignedlonglongint res = 0;
	two_digits[0] = 1;
	for(two_digits_ind=1;two_digits_ind<22;two_digits_ind++)
	two_digits[two_digits_ind] = ((two_digits[two_digits_ind-1])*2)%100;

	for(ind=0;ind<N;ind++)
	{
	if(input[ind]>21)
	{
	rem = input[ind] % 22;
	rem += 2;
	}
	else rem = input[ind];
	res = res + two_digits[rem];
	}

	printf("%llu", res%.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: INtroduction

VIEW

Step 2: FULL CODE

VIEW

Solution

VIEW

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

int sum = 0; for (int i 0; i < 5; i++){ sum += i; } cout << sum;
int main(){ long long int total; long long int init; scanf("%lld %lld", &total, &init); getchar(); long long int max = init; long long int min = init; int i; for (i = 0; i < total; i++) { char op1 = '0'; char op2 = '0'; long long int num1 = 0; long long int num2 = 0; scanf("%c %lld %c %lld", &op1, &num1, &op2, &num2); getchar(); long long int maxr = max; long long int minr = min; if (op1 == '+') { long long int sum = max + num1; maxr = sum; minr = sum; long long int res = min + num1; if (res > maxr) { max = res; } if (res < minr) { minr = res; } } else { long long int sum = max * num1; maxr = sum; minr = sum; long long int res = min * num1;…
Number of digits int main() {int c=0;int i=3856; int l=i; while(l>0) {l=l/10; c++; } printf("%d",c); return 0; } Summation of digits int main() {int sum=0; int i=384; int l=i; while(l>0) { sum+=l%10; l=l/10;} printf("%d",sum); return 0; }
remove the error from program( C programming language)
C language programming .
int pertambahan(int pilihan, int now){ int result; result =pilihan + now; return result;} int perkalian(int pilihan, int now){ int result; result = pilihan*now; return result;} int main(){ int NoR,initial; int now; int temp1, temp2; scanf("%d %d", &NoR, &initial); getchar(); now=initial; for(int o=0;o<NoR;o++){ char a,b; int pilihan1,pilihan2; scanf("%c %d %c %d",&a, &pilihan1,&b, &pilihan2); getchar(); if(a=='+') { if(pilihan1>=-1000 && pilihan1<=1000) { temp1 = pertambahan(pilihan1,now); } else{ temp1=-10000; } } else if(a=='x') { if(pilihan1>=-2 && pilihan1<=2){ temp1 = perkalian(pilihan1,now); } else { temp1=-10000; } } if(b=='+') { if(pilihan2>=-1000 && pilihan2<=1000) { temp2 = pertambahan(pilihan2,now); } else {…
JAVA LANGUAGE CODE Postfix Calculator by CodeChum Admin One good implementation of computing infix expressions is to transform them to postfix and then evaluate via the postfix expression. Infix expressions is the common way of writing arithmetic expressions. The binary operator come between them as shown below: 2 * 5 + 9 - 10 / 20 In postfix expressions, the operands come first before the operator: 2 5 * 9 + 10 20 / - A stack can be used to evaluate postfix expressions. The operands are pushed onto the Stack and when an operator is found two operands are popped and the operation is performed and finally the result is pushed back onto the Stack. The final answer will be the lone element of the Stack. Input The first line contains a positive integer n representing the number of postfix expressions. What follows are n postfix expressions themselves. 5 10 20 + 30 15 2 * + 100 20 30 + / 90 20 10 + + 0 / 9 3 - 10 + 2 * Output A single line containing the result of…
1、Counting Primitive Operations void STRAITMAXMIN(A,n,max,min) //Set the maximum value in A to max and the minimum value to min { int i,n max=min=A[1] for i=2 to n { if A[i]> max max=A[i]; if A[i]< min min=A[i]; } }
struct ID { int x; int y; }; struct name { ID r; }; int main() { name a[2]; for (int i=0;i<2;i++) { a[i).r.x=i; a[i].r.y=i+1; } for(int i=0;i<2;i++) cout<
#include void main(void) { int c =2 ^3; cout<< c; }
In C Languege
C programming language question