This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[ | |
{ | |
"id": "A001", | |
"name": "Tom", | |
"math": 60, | |
"physics": 66, | |
"chemistry": 61 | |
}, | |
{ | |
"id": "A002", |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdio.h> | |
#include <string.h> | |
int getInput(char [128]); | |
int removeSpaces(char [128]); | |
int main() | |
{ | |
char input[128]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
struct treenode | |
{ | |
int info; | |
struct treenode *left; | |
struct treenode *right; | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
#include <math.h> | |
using namespace std; | |
int fact(int n) | |
{ | |
if (n <= 1) | |
return 1; | |
return n*fact(n-1); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
void findLargestSmallest(int a[] , int n) | |
{ | |
int large = INT_MIN , small = INT_MAX; | |
for(int i=0 ; i<n ; i++) | |
{ | |
//when a[i] is smaller than a[i+1] | |
if(a[i] < a[i+1]) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<bits/stdc++.h> | |
using namespace std; | |
void findLargestSmallest(int a[] , int n) | |
{ | |
int large = a[0]; | |
int small = a[0]; | |
for(int i=0 ; i<n ; i++) | |
{ | |
//when a[i] is smaller than small |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
print("\t\t\t\t\t\t ~~~~~~~~~~~~~~~~~~~~~~~~~~~") | |
print("\t\t\t\t\t\t || THE HEALTH MANAGER ||") | |
print("\t\t\t\t\t\t ~~~~~~~~~~~~~~~~~~~~~~~~~~~") | |
print("\tHi! Save your DIET & EXERCISE here.\n") | |
while(1): | |
answer = int(input("Enter 1:View Saved Data\t\t\t2:Add Data\t\t\t3:EXIT\n")) | |
if answer ==3: | |
exit(0) |