Skip to content

Assignment 2 done kavy_v #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Platypus4356 wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Assignment 2 done kavy_v #2

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b409991
Everything finished other than grp project
Platypus4356 May 27, 2024
92830bf
Update Readme.md
Platypus4356 May 27, 2024
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
301 changes: 301 additions & 0 deletions assignment-2/Kavy/Q1.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,301 @@
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <iostream>
using namespace std;
#define ll long long

int main()
{
int n = 4, k = 5, t = 0;

// 1
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i + 1; j++)
{
printf("*");
}
cout << endl;
}
cout << endl;

// 2
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n - i - 1; j++)
{
printf(" ");
}
for (int j = 0; j < i + 1; j++)
{
printf("*");
}
cout << endl;
}
cout << endl;

// 3
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n - i; j++)
{
printf("*");
}
for (int j = 0; j < i; j++)
{
printf(" ");
}
cout << endl;
}
cout << endl;

// 4
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i; j++)
{
printf(" ");
}
for (int j = 0; j < n - i; j++)
{
printf("*");
}
cout << endl;
}
cout << endl;

// 5
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i; j++)
{
printf(" ");
}
for (int j = 0; j < (n - i); j++)
{
printf("* ");
}
cout << endl;
}
cout << endl;

// 6
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n - i - 1; j++)
{
printf(" ");
}
for (int j = 0; j < i + 1; j++)
{
printf("* ");
}
cout << endl;
}
cout << endl;

// 7
for (int i = 0; i < n + 1; i++)
{
if (i % 2)
{
cout << " ";
}

// for (int j = 0; j < n - i - 1; j++)
// {
// printf(" ");
// }
for (int j = 0; j < i / 2 + 1; j++)
{
printf("* ");
}
cout << endl;
}
for (int i = 0; i < n; i++)
{
if ((n - 1 + i) % 2)
{
cout << " ";
}

// for (int j = 0; j < n - i - 1; j++)
// {
// printf(" ");
// }
for (int j = 0; j < n / 2 - i / 2; j++)
{
printf("* ");
}
cout << endl;
}
cout << endl;

// 8

for (int i = 0; i < n + 1; i++)
{
for (int j = 0; j < n - i; j++)
{
printf(" ");
}
for (int j = 0; j < i / 2 + 1; j++)
{
printf(" *");
}
if (i % 2)
{
cout << " ";
}
cout << endl;
}

for (int i = 0; i < n; i++)
{
for (int j = 0; j < i + 1; j++)
{
printf(" ");
}
for (int j = 0; j < n / 2 - i / 2; j++)
{
printf(" *");
}
if ((n - 1 + i) % 2)
{
cout << " ";
}
cout << endl;
}
cout << endl;

// 9
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i; j++)
{
printf(" ");
}
for (int j = 0; j < (n - i); j++)
{
printf("* ");
}
cout << endl;
}

for (int i = 1; i < n; i++)
{
for (int j = 0; j < n - i - 1; j++)
{
printf(" ");
}
for (int j = 0; j < i + 1; j++)
{
printf("* ");
}
cout << endl;
}
cout << endl;

// 10

for (int i = 0; i < n - 1; i++)
{
for (int j = 0; j < n - i - 1; j++)
{
printf(" ");
}
for (int j = 0; j < i + 1; j++)
{
printf("* ");
}
cout << endl;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i; j++)
{
printf(" ");
}
for (int j = 0; j < (n - i); j++)
{
printf("* ");
}
cout << endl;
}
cout << endl;

// 11
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i + 1; j++)
{
printf("%d ", i + 1);
}
cout << endl;
}
cout << endl;

// 12
k = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i + 1; j++)
{
printf("%d ", k++);
}
cout << endl;
}
cout << endl;

return 0;
}


/*

for (int i = 0; i < n + 1; i++)
{
for (int j = 0; j < n - i; j++)
{
printf(" ");
}
for (int j = 0; j < i / 2 + 1; j++)
{
printf(" *");
}
if (i % 2)
{
cout << " ";
}
cout << endl;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i + 1; j++)
{
printf(" ");
}
for (int j = 0; j < n / 2 - i / 2; j++)
{
printf(" *");
}
if ((n - 1 + i) % 2)
{
cout << " ";
}
cout << endl;
}
cout << endl;


*
*
* *
* *
* * *
* *
* *
*
*

*/
Binary file added assignment-2/Kavy/Q2Q3.jpeg
View file
Open in desktop
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file added assignment-2/Kavy/Q3Q4.jpeg
View file
Open in desktop
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
83 changes: 83 additions & 0 deletions assignment-2/Kavy/Q5.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,83 @@
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
// LLONG_MIN
// O(n^3)
ll subarrON3(vector<ll> &v)
{
ll m1 = v[0];
ll n = v.size();
ll i = 0;
for (; i < n; ++i)
{
for (ll j = i; j < n; ++j)
{
ll sum = 0;
for (ll k = i; k <= j; ++k)
{
sum += v[k];
}
m1 = max(m1, sum);
}
}
i = 0;
return max(m1, i);
// return max(*(&m1), 0);
}

// O(n^2)
ll subarrON2(vector<ll> &v)
{
ll m1 = v[0];
ll n = v.size();
ll i = 0;
for (; i < n; ++i)
{
ll sum = 0;
for (ll j = i; j < n; ++j)
{
sum += v[j];
m1 = max(m1, sum);
}
}
i = 0;
return max(m1, i);
}

// O(n^1)
ll subarrON1(vector<ll> &v)
{
ll m1 = v[0];
ll m2 = v[0];

for (ll i = 1; i < v.size(); ++i)
{
m2 = max(v[i], m2 + v[i]);
m1 = max(m1, m2);
}

m2 = 0;
return max(m1, m2);
}

int main()
{
ll n = 9, k = 0, t = 0;
vector<ll> v = {-5, -7, -2, -8};
// vector<ll> v = {-5, 6, -3, -7, 10};
// vector<ll> v = {-2, 1, -3, 4, -1, 2, 1, -5, 4};

k = subarrON1(v);
cout << k << "\n";

// k = subarrON2(v);
// cout << k << "\n";

// k = subarrON3(v);
// cout << k << "\n";

return 0;
}
2 changes: 1 addition & 1 deletion assignment-2/Kavy/Readme.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1 +1 @@

submission links in sub.dat
Loading