HackeRank Problem John Watson performs an operation called a right circular rotation on an array of integers, . After performing one right circular rotation operation, the array is transformed from to . Watson performs this operation times. To test Sherlock's ability to identify the current element at a particular position in the rotated array, Watson asks queries, where each query consists of a single integer, , for which you must print the element at index in the rotated array (i.e., the value of ). -----Solution---- #include <math.h> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <assert.h> #include <limits.h> #include <stdbool.h> int main(){ int n,k,q scanf("%d %d %d",&n,&k,&q); int *a = malloc(sizeof(int) * n); for(int a_i = 0; a_i < n; a_i++){ scanf("%d",&a[a_i]); } for(int a0 = 0; a0 < q; a0++){
Popular posts from this blog
Library Fine
Library Fine Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is as follows: If the book is returned on or before the expected return date, no fine will be charged (i.e.: . If the book is returned after the expected return day but still within the same calendar month and year as the expected return date, . If the book is returned after the expected return month but still within the same calendar year as the expected return date, the . If the book is returned after the calendar year in which it was expected, there is a fixed fine of . --Solution-- #include<stdio.h> int main() { unsigned int dd1,mm1,yy1; unsigned int dd2,mm2,yy2; int dif=0; scanf("%d%d%d",&dd1,&mm1,&yy1); scanf("%d%d%d",&dd2,&mm2,&yy2); if(dd1==6 &&
Comments
Post a Comment