Skip to content

Commit 4f40291

Browse files
H4ckOmH4ckOm
committed
Formatted Codes
1 parent 9ab6de4 commit 4f40291

File tree

5 files changed

+289
-292
lines changed

5 files changed

+289
-292
lines changed

Diff for: ‎misc/cardiogram.cpp

+60-56
Original file line numberDiff line numberDiff line change
@@ -1,100 +1,104 @@
11
/*Made by Shivam Solanki*/
2-
#include<bits/stdc++.h>
3-
#pragma GCC optimize ("Ofast")
2+
#include <bits/stdc++.h>
3+
#pragma GCC optimize("Ofast")
44
using namespace std;
55
#define DEBUG(x) cerr << '>' << #x << ':' << x << endl;
66
#define ll long long int
77
#define endl '\n'
88
typedef vector<int> vi;
99
typedef vector<ll> vll;
1010
typedef vector<vll> vvl;
11-
typedef pair<int,int> pii;
12-
typedef pair<ll,ll> pll;
11+
typedef pair<int, int> pii;
12+
typedef pair<ll, ll> pll;
1313
typedef vector<vi> vvi;
1414
typedef vector<bool> vb;
1515
typedef vector<pii> vp;
1616
typedef vector<pll> vpll;
17-
typedef map<int,int> mii;
18-
typedef map<ll,ll> mll;
17+
typedef map<int, int> mii;
18+
typedef map<ll, ll> mll;
1919
typedef set<int> sii;
2020
typedef set<ll> sll;
2121
typedef queue<int> qii;
2222
typedef priority_queue<int> pq;
23-
typedef unordered_map<int,int> umii;
24-
typedef unordered_map<ll,ll> umll;
25-
#define all(x) x.begin(),x.end()
26-
#define rep(i,k,n) for (int i = k; i < n; ++i)
27-
#define repr(i,k,n) for (int i = n; i>=k; --i)
28-
#define repll(i,k,n) for (ll i = k; i < n; ++i)
23+
typedef unordered_map<int, int> umii;
24+
typedef unordered_map<ll, ll> umll;
25+
#define all(x) x.begin(), x.end()
26+
#define rep(i, k, n) for (int i = k; i < n; ++i)
27+
#define repr(i, k, n) for (int i = n; i >= k; --i)
28+
#define repll(i, k, n) for (ll i = k; i < n; ++i)
2929
#define pb push_back
3030
#define mp make_pair
3131
#define gcd __gcd
3232
#define F first
3333
#define S second
34-
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
35-
const int INF = 1e9+5;
36-
const int MOD = 1e9+7;
37-
double pi = 2 * acos(0.0);
34+
#define fastio \
35+
ios_base::sync_with_stdio(false); \
36+
cin.tie(NULL); \
37+
cout.tie(NULL);
38+
const int INF = 1e9 + 5;
39+
const int MOD = 1e9 + 7;
40+
double pi = 2 * acos(0.0);
3841

3942
//Question Link https://codeforces.com/problemset/problem/435/C
4043

41-
void solve(){
44+
void solve() {
4245
int n;
43-
cin>>n;
46+
cin >> n;
4447
vi a(n);
45-
int sm=0;
46-
rep(i,0,n) cin>>a[i],sm+=a[i];
47-
vector<string>canvas;
48-
int mx=0,my=INF,ss=0;
49-
rep(i,0,n){
50-
if(i&1) ss-=a[i];
51-
else ss+=a[i];
52-
mx=max(ss,mx);
53-
my=min(ss,my);
48+
int sm = 0;
49+
rep(i, 0, n) cin >> a[i], sm += a[i];
50+
vector<string> canvas;
51+
int mx = 0, my = INF, ss = 0;
52+
rep(i, 0, n) {
53+
if (i & 1)
54+
ss -= a[i];
55+
else
56+
ss += a[i];
57+
mx = max(ss, mx);
58+
my = min(ss, my);
5459
// cout<<mx<<' '<<my<<'\n';
5560
}
56-
int s=abs(mx)+abs(my);
61+
int s = abs(mx) + abs(my);
5762
// cout<<s<<'\n';
58-
rep(i,0,2*s){
59-
string test="";
60-
rep(i,0,sm){
61-
test+=" ";
63+
rep(i, 0, 2 * s) {
64+
string test = "";
65+
rep(i, 0, sm) {
66+
test += " ";
6267
}
6368
canvas.pb(test);
6469
}
65-
int x=mx,y=0;
66-
rep(i,0,n){
67-
if(i&1){
68-
rep(j,0,a[i]) canvas[++x][y++]=(char)(92);
70+
int x = mx, y = 0;
71+
rep(i, 0, n) {
72+
if (i & 1) {
73+
rep(j, 0, a[i]) canvas[++x][y++] = (char)(92);
74+
} else {
75+
rep(j, 0, a[i]) canvas[x--][y++] = (char)(47);
6976
}
70-
else{
71-
rep(j,0,a[i]) canvas[x--][y++]=(char)(47);
72-
}
73-
}
74-
rep(i,0,2*s){
75-
bool f=0;
76-
rep(j,0,sm){
77-
if(canvas[i][j]!=' '){
78-
f=1;
77+
}
78+
rep(i, 0, 2 * s) {
79+
bool f = 0;
80+
rep(j, 0, sm) {
81+
if (canvas[i][j] != ' ') {
82+
f = 1;
7983
break;
8084
}
8185
}
82-
if(f){
83-
cout<<canvas[i];
84-
cout<<'\n';
86+
if (f) {
87+
cout << canvas[i];
88+
cout << '\n';
8589
}
86-
}
90+
}
8791
}
8892

89-
int main(){
90-
// #ifndef ONLINE_JUDGE
91-
// freopen("input.txt", "r", stdin);
92-
// freopen("output.txt", "w", stdout);
93-
// #endif
93+
int main() {
94+
// #ifndef ONLINE_JUDGE
95+
// freopen("input.txt", "r", stdin);
96+
// freopen("output.txt", "w", stdout);
97+
// #endif
9498
fastio;
95-
int t=1;
99+
int t = 1;
96100
// cin>>t;
97-
while(t--)
101+
while (t--)
98102
solve();
99103
return 0;
100104
}

Diff for: ‎misc/cube.cpp

+54-58
Original file line numberDiff line numberDiff line change
@@ -1,107 +1,103 @@
11
/*Made by Shivam Solanki*/
2-
#include<bits/stdc++.h>
3-
#pragma GCC optimize ("Ofast")
2+
#include <bits/stdc++.h>
3+
#pragma GCC optimize("Ofast")
44
using namespace std;
55
#define DEBUG(x) cerr << '>' << #x << ':' << x << endl;
66
#define ll long long int
77
#define endl '\n'
88
typedef vector<int> vi;
99
typedef vector<ll> vll;
1010
typedef vector<vll> vvl;
11-
typedef pair<int,int> pii;
12-
typedef pair<ll,ll> pll;
11+
typedef pair<int, int> pii;
12+
typedef pair<ll, ll> pll;
1313
typedef vector<vi> vvi;
1414
typedef vector<bool> vb;
1515
typedef vector<pii> vp;
1616
typedef vector<pll> vpll;
17-
typedef map<int,int> mii;
18-
typedef map<ll,ll> mll;
17+
typedef map<int, int> mii;
18+
typedef map<ll, ll> mll;
1919
typedef set<int> sii;
2020
typedef set<ll> sll;
2121
typedef queue<int> qii;
2222
typedef priority_queue<int> pq;
23-
typedef unordered_map<int,int> umii;
24-
typedef unordered_map<ll,ll> umll;
25-
#define all(x) x.begin(),x.end()
26-
#define rep(i,k,n) for (int i = k; i < n; ++i)
27-
#define repr(i,k,n) for (int i = n; i>=k; --i)
28-
#define repll(i,k,n) for (ll i = k; i < n; ++i)
23+
typedef unordered_map<int, int> umii;
24+
typedef unordered_map<ll, ll> umll;
25+
#define all(x) x.begin(), x.end()
26+
#define rep(i, k, n) for (int i = k; i < n; ++i)
27+
#define repr(i, k, n) for (int i = n; i >= k; --i)
28+
#define repll(i, k, n) for (ll i = k; i < n; ++i)
2929
#define pb push_back
3030
#define mp make_pair
3131
#define gcd __gcd
3232
#define F first
3333
#define S second
34-
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
35-
const int INF = 1e9+5;
36-
const int MOD = 1e9+7;
37-
double pi = 2 * acos(0.0);
34+
#define fastio \
35+
ios_base::sync_with_stdio(false); \
36+
cin.tie(NULL); \
37+
cout.tie(NULL);
38+
const int INF = 1e9 + 5;
39+
const int MOD = 1e9 + 7;
40+
double pi = 2 * acos(0.0);
3841

3942
//Question Link: https://codeforces.com/contest/887/problem/C
4043

4144
vi cube(25);
4245
vvi sides{
43-
{1,3,5,7,9,11,24,22},
44-
{2,4,6,8,10,12,23,21},
45-
{13,14,5,6,17,18,21,22},
46-
{15,16,7,8,19,20,23,24},
47-
{1,2,18,20,12,11,15,13},
48-
{3,4,17,19,10,9,16,14}
49-
};
46+
{1, 3, 5, 7, 9, 11, 24, 22},
47+
{2, 4, 6, 8, 10, 12, 23, 21},
48+
{13, 14, 5, 6, 17, 18, 21, 22},
49+
{15, 16, 7, 8, 19, 20, 23, 24},
50+
{1, 2, 18, 20, 12, 11, 15, 13},
51+
{3, 4, 17, 19, 10, 9, 16, 14}};
5052

51-
bool check_cube(){
52-
if(
53-
(cube[1]==cube[2] and cube[3]==cube[4] and cube[1]==cube[3])
54-
and (cube[13]==cube[14] and cube[15]==cube[16] and cube[13]==cube[15])
55-
and (cube[9]==cube[10] and cube[11]==cube[12] and cube[9]==cube[11])
56-
and (cube[5]==cube[6] and cube[7]==cube[8] and cube[5]==cube[8])
57-
and (cube[17]==cube[18] and cube[19]==cube[20] and cube[17]==cube[20])
58-
and (cube[21]==cube[22] and cube[23]==cube[24] and cube[21]==cube[23])
59-
) return 1;
53+
bool check_cube() {
54+
if (
55+
(cube[1] == cube[2] and cube[3] == cube[4] and cube[1] == cube[3]) and (cube[13] == cube[14] and cube[15] == cube[16] and cube[13] == cube[15]) and (cube[9] == cube[10] and cube[11] == cube[12] and cube[9] == cube[11]) and (cube[5] == cube[6] and cube[7] == cube[8] and cube[5] == cube[8]) and (cube[17] == cube[18] and cube[19] == cube[20] and cube[17] == cube[20]) and (cube[21] == cube[22] and cube[23] == cube[24] and cube[21] == cube[23])) return 1;
6056
return 0;
6157
}
6258

63-
void right_shift(vi &side){
64-
int x=cube[side[0]],y=cube[side[1]];
65-
for(int i=2;i<8;i+=2)
66-
swap(cube[side[(i)%8]],x),swap(cube[side[(i+1)%8]],y);
67-
cube[side[0]]=x,cube[side[1]]=y;
59+
void right_shift(vi &side) {
60+
int x = cube[side[0]], y = cube[side[1]];
61+
for (int i = 2; i < 8; i += 2)
62+
swap(cube[side[(i) % 8]], x), swap(cube[side[(i + 1) % 8]], y);
63+
cube[side[0]] = x, cube[side[1]] = y;
6864
}
6965

70-
void left_shift(vi &side){
71-
int x=cube[side[0]],y=cube[side[1]];
72-
for(int i=8;i>=2;i-=2)
73-
swap(cube[side[(i)%8]],x),swap(cube[side[(i+1)%8]],y);
74-
cube[side[0]]=x,cube[side[1]]=y ;
66+
void left_shift(vi &side) {
67+
int x = cube[side[0]], y = cube[side[1]];
68+
for (int i = 8; i >= 2; i -= 2)
69+
swap(cube[side[(i) % 8]], x), swap(cube[side[(i + 1) % 8]], y);
70+
cube[side[0]] = x, cube[side[1]] = y;
7571
}
7672

77-
void solve(){
78-
rep(i,1,25) cin>>cube[i];
79-
rep(i,0,6){
73+
void solve() {
74+
rep(i, 1, 25) cin >> cube[i];
75+
rep(i, 0, 6) {
8076
left_shift(sides[i]);
81-
if(check_cube()){
82-
cout<<"YES\n";
77+
if (check_cube()) {
78+
cout << "YES\n";
8379
return;
8480
}
8581
right_shift(sides[i]);
86-
right_shift(sides[i]);
87-
if(check_cube()){
88-
cout<<"YES\n";
82+
right_shift(sides[i]);
83+
if (check_cube()) {
84+
cout << "YES\n";
8985
return;
9086
}
9187
left_shift(sides[i]);
9288
}
93-
cout<<"NO\n";
89+
cout << "NO\n";
9490
}
9591

96-
int main(){
97-
// #ifndef ONLINE_JUDGE
98-
// freopen("input.txt", "r", stdin);
99-
// freopen("output.txt", "w", stdout);
100-
// #endif
92+
int main() {
93+
// #ifndef ONLINE_JUDGE
94+
// freopen("input.txt", "r", stdin);
95+
// freopen("output.txt", "w", stdout);
96+
// #endif
10197
fastio;
102-
int t=1;
98+
int t = 1;
10399
// cin>>t;
104-
while(t--)
100+
while (t--)
105101
solve();
106102
return 0;
107103
}

0 commit comments

Comments
 (0)