Skip to content

Instantly share code, notes, and snippets.

Avatar
💭
I may be slow to respond.

Ghastlcon Ghastlcon

💭
I may be slow to respond.
View GitHub Profile
View SMOJ 2355.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <functional>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define N 200020
#define INFINITE 999999999999999LL
#define int long long
View SMOJ 2334.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#define N 200020
#define M 18
#define B 30
using namespace std;
int n;
int a[N];
View SMOJ 2367.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#define N 100020
#define MOD 1000000007
using namespace std;
class Point
{
View SMOJ 2350.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#define N 300020
using namespace std;
int t[N], u[N], v[N];
vector<int> e[N];
View SMOJ 2356.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
int main() //2356.cpp
{
int x0, y0, x1, y1;
View SMOJ 2354.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#define N 200020
using namespace std;
int l[N], r[N];
int f[N], g[N];
int main() //2354.cpp
View SMOJ 2366.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int main() //2366.cpp
{
int q, n;
freopen("2366.in" , "r", stdin );
View SMOJ 2341.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <stack>
#include <utility>
#define N 500020
using namespace std;
typedef struct
View score.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
int main() //score.cpp
{
int a, b, c;
freopen("score.in" , "r", stdin );
freopen("score.out", "w", stdout);
View SMOJ 2330.cpp
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <set>
#define N 100020
#define INFINITE 1000000000
using namespace std;
int n;
int a[N];
You can’t perform that action at this time.