Breaking News: Grepper is joining You.com. Read the official announcement!

convert in c

joytun siddika answered on August 11, 2021 Popularity 7/10 Helpfulness 1/10

answer convert in c

related c to c convertor

convert in c

Comment

#include<iostream>
#include<string>
using namespace std;

int main()
{
   int n,k,ans,t1;
   cin>>n>>k;
   ans=240-k;
   for(int i=1;i<=n;i++)
   {
       ans-=(i*5);
       if(ans<0)
       {
           t1=i-1;break;
       }
   }
   if(ans>=0)
   {cout<<n<<endl;}
   else {cout<<t1<<endl;}

return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

Popularity 7/10 Helpfulness 1/10 Language whatever

Source: www.programmersought.com

Tags: c whatever

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

joytun siddika

0 Answers Avg Quality 2/10

Closely Related Answers

c to c convertor

Comment

// C++ program to delete middle
// of a linked list
#include <bits/stdc++.h>
using namespace std;

/* Link list Node */
struct Node {
int data;
struct Node* next;
};
// count of nodes
int countOfNodes(struct Node* head)
{
int count = 0;
while (head != NULL) {
head = head->next;
count++;
}
return count;
}

// Deletes middle node and returns
// head of the modified list
struct Node* deleteMid(struct Node* head)
{
// Base cases
if (head == NULL)
return NULL;
if (head->next == NULL) {
delete head;
return NULL;
}
struct Node* copyHead = head;

// Find the count of nodes
int count = countOfNodes(head);

// Find the middle node
int mid = count / 2;

// Delete the middle node
while (mid-- > 1) {
head = head->next;
}

// Delete the middle node
head->next = head->next->next;

return copyHead;
}

// A utility function to print
// a given linked list
void printList(struct Node* ptr)
{
while (ptr != NULL) {
cout << ptr->data << "->";
ptr = ptr->next;
}
cout << "NULL\n";
}

// Utility function to create a new node.
Node* newNode(int data)
{
struct Node* temp = new Node;
temp->data = data;
temp->next = NULL;
return temp;
}

/* Driver program to test above function*/
int main()
{
/* Start with the empty list */
struct Node* head = newNode(1);
head->next = newNode(2);
head->next->next = newNode(3);
head->next->next->next = newNode(4);

cout << "Given Linked List\n";
printList(head);

head = deleteMid(head);

cout << "Linked List after deletion of middle\n";
printList(head);

return 0;
}

Popularity 1/10 Helpfulness 1/10 Language c

Source: Grepper

Tags: c

Link to this answer
Share Copy Link

Contributed on Aug 11 2021

Jittery Jay

0 Answers Avg Quality 2/10

convert in c

Contents

More Related Answers

convert in c

Closely Related Answers

c to c convertor

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.