Tyre problem | Problem - 37 | Beginner level | C language | CodeChef

Link to the problem statement: https://www.codechef.com/submit/TYRE


Solution: 

#include <stdio.h>

int main(void) {
int t, n, m;
scanf("%d", &t);
while(t--)
{
    scanf("%d %d", &n, &m);
    n = 2*n + 4*m;
    printf("%d\n", n);
}
return 0;
}

Hope this will help you, if you want anything else leave a comment.

Thank you 

Comments

Post a Comment

Popular posts from this blog

My very 1st contest! | Problem - 1 | Beginner level | C language | CodeChef

Link to the problem statement:   https://www.codechef.com/submit-v2/MY1STCONTEST Solution:  #include <stdio.h> int main(void) { int n, a, b; scanf("%d %d %d", &n, &a, &b); int c, d; c = n - a; //user made submissions and will get a rating. d = c - b; //user that were able to solve at least 1 problem and hence will get a            //rating greater than 1000. printf("%d %d", c, d); return 0; } You can watch the video solution of this problem: Hope this will help you, if you want anything else leave a comment. Thank you
Read more

Implementing linked list in C language

#include <stdio.h> #include <stdlib.h> // Define the structure for a node in the linked list struct node {     int data; // The data stored in the node     struct node *next; // Pointer to the next node in the list }; struct node* head = NULL; // Initialize the head of the list as NULL // Function to insert nodes at the end of the list void insert(struct node **head) {     int num = 0, i, data;     printf("\nEnter the number of elements to be inserted: ");     scanf("%d", &num); // Get the number of nodes to be inserted     // Loop to insert the nodes     for(i = 0; i<num; i++) {         // Allocate memory for a new node and get the data for it         struct node* newNode = malloc(sizeof(struct node));         struct node *last = *head;         printf("\nEnter the element %d: ", i+1);         scanf("%d", &data); // Get the data for the node         // Initialize the new node with the given data and set its next pointer to
Read more