From Olympiads School, Codeforces, UCC Coding Competition 2021
About
September 7 2020: Started Competitive Programming
January 2021: First USACO contest (promoted to silver)
March 2021: 100 points on DMOJ
March 13 2021: First IOI problem: Party Lamps
May 5: 200 points and 100 problems solved on DMOJ
C++ template
#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define LL long long
#define pii pair<int,int>
#define x first
#define y second
#define pb push_back
#define MEM(x) memset(x,0,sizeof(x))
#define MEMS(x) memset(x,-1,sizeof(x))
using namespace std;
int main(){
cin.sync_with_stdio(0);
cin.tie(0);
}
C Code by Andy Sloane
int main() {
float A = 0, B = 0;
float i, j;
int k;
float z[1760];
char b[1760];
printf("\x1b[2J");
for(;;) {
memset(b,32,1760);
memset(z,0,7040);
for(j=0; j < 6.28; j += 0.07) {
for(i=0; i < 6.28; i += 0.02) {
float c = sin(i);
float d = cos(j);
float e = sin(A);
float f = sin(j);
float g = cos(A);
float h = d + 2;
float D = 1 / (c * h * e + f * g + 5);
float l = cos(i);
float m = cos(B);
float n = sin(B);
float t = c * h * g - f * e;
int x = 40 + 30 * D * (l * h * m - t * n);
int y= 12 + 15 * D * (l * h * n + t * m);
int o = x + 80 * y;
int N = 8 * ((f * e - c * d * g) * m - c * d * e - f * g - l * d * n);
if(22 > y && y > 0 && x > 0 && 80 > x && D > z[o]) {
z[o] = D;
b[o] = ".,-~:;=!*#$@"[N > 0 ? N : 0];
}
}
}
printf("\x1b[H");
for(k = 0; k < 1761; k++) {
putchar(k % 80 ? b[k] : 10);
A += 0.00004;
B += 0.00002;
}
usleep(30000);
}
return 0;
}
To-do
https://dmoj.ca/problem/ccc13s3 https://dmoj.ca/problem/bts17p5 https://dmoj.ca/problem/ccc15s4 https://dmoj.ca/problem/ccc01s3 https://dmoj.ca/problem/ccc20s4 https://dmoj.ca/problem/ioi13p1 https://dmoj.ca/problem/ccc21s5 https://dmoj.ca/problem/ioi00p1 https://dmoj.ca/problem/brittlebridges https://dmoj.ca/problem/ccc18s3