Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
41 changes: 41 additions & 0 deletions Store_Display_Information_Using_Structure
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
#include <iostream>
using namespace std;

struct student
{
char name[50];
int roll;
float marks;
} s[10];

int main()
{
cout << "Enter information of students: " << endl;

// storing information
for(int i = 0; i < 10; ++i)
{
s[i].roll = i+1;
cout << "For roll number" << s[i].roll << "," << endl;

cout << "Enter name: ";
cin >> s[i].name;

cout << "Enter marks: ";
cin >> s[i].marks;

cout << endl;
}

cout << "Displaying Information: " << endl;

// Displaying information
for(int i = 0; i < 10; ++i)
{
cout << "\nRoll number: " << i+1 << endl;
cout << "Name: " << s[i].name << endl;
cout << "Marks: " << s[i].marks << endl;
}

return 0;
}
30 changes: 30 additions & 0 deletions coin_change.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
#include <bits/stdc++.h>
using namespace std;


int minCoins(int coins[], int total_coins, int N) // Function to return the minimum // coins needed
{
if (N == 0) // If we have a combination then
return 0;

int result = INT_MAX; // Currently result is initialised as INT_MAX

for (int i = 0; i < total_coins; i++) // run until availability of coins
{
if (coins[i] <= N) { // Add to the list of counting
int sub_res = 1 + minCoins(coins, total_coins, N - coins[i]); // add 1 due to the coin inclusion
// see if result can minimize
if (sub_res < result)
result = sub_res;
}
}
return result;
}

int main()
{
int coins[] = { 10, 25, 5 };
int sum = 30; // the money to convert
int total_coins = 3; // total availability of coins
cout << "Minmum coins needed are " << minCoins(coins, total_coins, sum);
}