harshraj22

#include<bits/stdc++.h>
using namespace std;
#define ll long long int 

/*
for each index, dp[0][i] stores length of longest increasing sequence starting at index i, and dp[1][i] stores length
of longest decreasing sequence starting at index i,
*/

int main(){

harshraj22

// https://practice.geeksforgeeks.org/problems/ways-to-sum-to-n/0
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll mx=1e9+7,n,m;
ll dp[1008];
vector<ll> v;
ll compute(ll sum);

int main(){

harshraj22

// Your file with changes

#include<bits/stdc++.h>
using namespace std;
//no need to pass the whole array every time as :
//	you are not changing the array
// 	rather make the array global .

int i,j,k,c=0,n,en=0,on=0,b;
int f(int b,int i,int c,int a[]){

harshraj22

This is supposed to be ^superscript and this is _subscript .

Contributors	Github	Year
Harsh Raj	harshraj22	2018-2022

harshraj22

this is incomplete documentation

How to use ?

1. Create an instance (object) by either of the following ways :

1.1 Without providing any initial value -

    bigint b;
    cout<<b<<"\n"; 

0

1.2. With a long long int -

harshraj22

#include<iostream>
#include<vector>
#include<utility>	// for std:: pair
#include<stdbool.h>	// for bool datatype
#include<iomanip>	// for formatted printing ( padding ) in show()
using namespace std;

template<typename T>
class matrix{
	private:	

harshraj22

// https://codeforces.com/contest/569/problem/C
/*
on test case 6 4, the value inside if() is false still it is executed, leading to wrong answer. 
can be verified by un-commenting line 44. fails when low=152, high = 182
*/


#include<bits/stdc++.h>
using namespace std;
#define ll long long int

harshraj22

used the same logic described here.I wonder why there is so much diffrence when array of fixed size is used instead of unordered_map. Also, why the later solution gives TLE as well.

harshraj22

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int N=104;
vector<int> g[N],lt,in,ap,vis;
int tim=0;
#define eb emplace_back

void dfs(int node,int par=-1){
	vis[node]=1;

harshraj22

academic_records_management

A C-program for academic records management.

What does it do ? 🤔❓

It stores academic records of students, instructors and courses in a college.

How is it implemented ? 🤷‍♂️

• The ideas used are :
  • structure
  • pointers