Share your template! (Using Carbon)

→ Обратите внимание

Соревнование идет
2023 Post World Finals Online ICPC Challenge powered by Huawei
2 недели
Зарегистрироваться »

До соревнования
Kotlin Heroes: Practice 10
13:20:33
Зарегистрироваться »

→ Трансляции

CodeChef Starters 133 Solution Discussion

aryanc403

До начала 40:45:33

Всё →

→ Лидеры (рейтинг)

№	Пользователь	Рейтинг
1	tourist	3690
2	jiangly	3647
3	Benq	3581
4	orzdevinwang	3570
5	Geothermal	3569
5	cnnfls_csy	3569
7	Radewoosh	3509
8	ecnerwala	3486
9	jqdai0815	3474
10	gyh20	3447

Страны | Города | Организации

Всё →

→ Лидеры (вклад)

№	Пользователь	Вклад
1	maomao90	174
2	awoo	165
3	adamant	161
4	TheScrasse	160
5	nor	158
6	maroonrk	156
7	-is-this-fft-	152
8	orz	146
9	SecondThread	145
9	pajenegod	145

Всё →

→ Найти пользователя

→ Прямой эфир

Детальнее →

Блог пользователя Tameshk

Share your template! (Using Carbon)

Автор Tameshk, 4 года назад, По-английски

I want to invite you to share your template code which you're using for Codeforces contests using Carbon(free and open-sourse) project. Mine (First but not Best!):

Hope you guys take care in this time of corona-related hardship!

#template, #code

Tameshk
4 года назад
115

Комментарии (97)

Показать архивные | Написать комментарий?

ishank162

4 года назад, # |

+10

here is an ugly looking Template. ;)

→ Ответить

albertolg101

4 года назад, # ^ |

LOL

→ Ответить

smax

4 года назад, # |

+15

Not a macro guy so mine's prob shorter than most. The stuff at the top is just debugging template.

→ Ответить

SuperJ6

4 года назад, # ^ |

+28

Not shorter than this. ;) Btw carbon looks very nice Tameshk, and I love the name.

→ Ответить

ishank162

4 года назад, # |

Thankx for letting us know about Carbon. It's AMAZING ;)

→ Ответить

Chilli

4 года назад, # |

+87

Unsurprisingly, the length of the template has (from the examples so far) been inversely correlated with CF rating :^)

→ Ответить

ILoveBitches

4 года назад, # ^ |

Not true for this guy : Egor. Look at the code lengh XD

→ Ответить

Egor

4 года назад, # ^ |

+18

I have no template at all (or, strictly speaking, here is my submission template:

%Code%

int main() {
#ifdef LOCAL
        signal(SIGABRT, &signalHandler);
#endif
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
#ifdef LOCAL_RELEASE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    auto time = clock();
#endif
	%ClassName% solver;
	%Input%
	%Output%
	%SolverCall%
	fflush(stdout);
#ifdef LOCAL_RELEASE
	cerr << clock() - time << endl;
#endif
	return 0;
}

). I do use inliner though

→ Ответить

ILoveBitches

4 года назад, # ^ |

Can you please share your library on GitHub or something ? Egor

→ Ответить

Egor

4 года назад, # ^ |

Here you go

I'd appreciate any suggestions

→ Ответить

ILoveBitches

4 года назад, # ^ |

Sure. Thank you!

→ Ответить

amit_dwivedi

4 года назад, # ^ |

← Rev. 2 →

Hey Egor! Thanks for sharing your library with us. I have a doubt. This link does not include code inliner.(Or Is it?)
If not, Can you please give a link to it? Thanks in advance.

→ Ответить

Egor

4 года назад, # ^ |

Google "JHelper"

→ Ответить

Chilli

4 года назад, # ^ |

I'll count this as a win for my predictive model :)

→ Ответить

Thallium54

4 года назад, # ^ |

Waiting for your analysis! This is going to be interesting

→ Ответить

riadwaw

4 года назад, # ^ |

Do you use patched JHelper? Noticed you have removed the in/out params but didn't notice any new code in your fork

→ Ответить

Egor

4 года назад, # ^ |

Yep, I think I just forgot to push

→ Ответить

ishank162

4 года назад, # ^ |

Don't worry I get it.

→ Ответить

bleh0.5

4 года назад, # ^ |

your statement spectacularly fails for Savior-of-Cross and his beauty

(yes I know that Savior-of-Cross doesn't use this in contest)

→ Ответить

Chilli

4 года назад, # ^ |

You really can't consider that a template. It's an algorithm library. For example, you can't compile that as is (variable names are reused, etc.). I use KACTL (https://github.com/kth-competitive-programming/kactl), which also has a ton of lines of code total, but doesn't have a very long template.

→ Ответить

ChaosAngel

4 года назад, # ^ |

-6

Hitting on 1000 lines and I'm not a newbie (yet). Behold the outliers :)

→ Ответить

mishra_tanay

4 года назад, # |

[Here is a simple one.]()

→ Ответить

harshraj22

4 года назад, # |

Here's mine :) Different sections are imported when needed (not by default).

P.S. Your project is really awesome ^_^

→ Ответить

Tameshk

4 года назад, # ^ |

Thanks for comment. It's not mine, but it's really awesome ^_^

→ Ответить

soumitri2001

4 года назад, # |

Here's the JAVA code template I use:

)

→ Ответить

Lelouch.Lamperouge

4 года назад, # |

Well just those common macros nothing fancy(as expected from a noob xD ()

→ Ответить

hellfr

4 года назад, # ^ |

was curious about how you wrote cubefreak777 ?? like is there a script or something or you did it manually?

→ Ответить

Lelouch.Lamperouge

4 года назад, # ^ |

Yeah, I used figlet for writing this you can install it on Linux or just use this online figlet generator it has lots of other fonts here as well

→ Ответить

phyzzmat

4 года назад, # |

← Rev. 3 →

+55

I don't have a proper template :) Probably, because I'm too lazy. For people with big templates: please, consider hiding them in spoilers, it would make the thread much more readable.

→ Ответить

TwentyOneHundredOrBust

4 года назад, # ^ |

+26

This is what I call big brain

→ Ответить

shahil_005

4 года назад, # |

Can someone tell me how to use that clock to check execution time,its not working.

→ Ответить

smax

4 года назад, # ^ |

Maybe you're not compiling with the correct preprocessor directive? Your code snippet seems to require LOCAL_RELEASE to be defined.

→ Ответить

mightymercado

4 года назад, # |

→ Ответить

qwerty

4 года назад, # |

← Rev. 2 →

Spoiler

→ Ответить

Kognition

4 года назад, # ^ |

You can call both power1 and power2 power; the difference in header will overload the function signature and the version called will just depend on whether you pass in the mod argument. Also, it probably won't matter because ll overflow is rare, but you may want to rewrite the lcm argument as (x/gcd(x,y))*y to prevent x*y from overflowing.

→ Ответить

qwerty

4 года назад, # ^ |

Thanks for the suggestions!

→ Ответить

towhid1zaman

4 года назад, # |

here is mine, it's so simple btw carbon looks very nice, great work Tameshk

Spoiler

→ Ответить

Rudraksh

4 года назад, # |

+11

Spoiler

→ Ответить

Theo830

4 года назад, # |

← Rev. 2 →

→ Ответить

kostia244

4 года назад, # ^ |

← Rev. 2 →

+27

Hi. I see you are using c++17 on cf. I'd like to tell you about one funny thing. Your template has lcm function which is defined for long longs, but c++17 has it's own function with the same name, so it replaces yours with the std one. Why does it matter? Std function's return type is the same as argument type, so if you run

cout << lcm(1000000000, 1000000000 - 1);

You will see 1808348672( overflow ), because args are of type int. It's very tricky, isn't it? Here's how you can fix it:

add #define lcm(x, y) lcm((ll)(x), (ll)(y)) instead of implementing your own lcm function
add #define lcm randomlongstringwhichyouwillneveruseasanameorsomethinglikethat after including libraries, this way your function will be used

p. s. talking about lcm I suggest that shahil_005 throws that weird-ass lcm function out of his template there are so many things wrong with it

UPD: soumitri2001 you have fucked up lcm function as well(but for a different reason. Change (long) (a*b/gcd(a,b)) to (long) ((long)a*b/gcd(a,b)). The a*b part gives you overflow

→ Ответить

Theo830

4 года назад, # ^ |

Thank you very much! I didn't notice that.

→ Ответить

Qualified

4 года назад, # ^ |

I would just do

#define gcd(a, b) ggcd(a, b)

where the function ggcd has the gcd function.

→ Ответить

malfple

4 года назад, # |

← Rev. 7 →

+49

I don't know how to use macro

→ Ответить

towhid1zaman

4 года назад, # ^ |

+48

right, you don't know :p

→ Ответить

malfple

4 года назад, # ^ |

← Rev. 3 →

+23

→ Ответить

prabowo

4 года назад, # |

+92

Here's mine:

carbon-1

Usually, I start from scratch, or copy-paste from my last code
I don't have any macros

→ Ответить

lexiyvv

4 года назад, # ^ |

how do you save it?I pressed the "Image" button but nothing happens:(

→ Ответить

spookywooky

4 года назад, # |

+18

Whats the point in posting screenshots of sourcecode?

→ Ответить

lexiyvv

4 года назад, # |

← Rev. 3 →

1000 lines of code just make it stucked... UPD:Just like this code

→ Ответить

dush1729

4 года назад, # |

+11

→ Ответить

lexiyvv

4 года назад, # ^ |

how do you save it?I pressed the "Image" button but nothing happens:(

→ Ответить

amarnathsama

4 года назад, # |

← Rev. 3 →

This is mine, I saw Geothermal use it in his Div. 3 unofficial editorial and thought it was good and that I wouldn't have to change it for a long period of time, and so far it's served me really well. Though I made a few edits of my own. Pastebin link because I just can't get carbon to upload the template

→ Ответить

AnonySharma

4 года назад, # |

Here's mine template, ugly but fun. ;D

→ Ответить

SPyofgame

4 года назад, # |

My query template

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
using namespace std;

#define FOR(i, l, r)  for (int(i) = int(l); int(i) <= int(r); ++i)
#define FORD(i, r, l) for (int(i) = int(r); int(i) >= int(l); --i)
#define hashmap unordered_map
#define hashset unordered_set
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define itr iterator
#define rtr reverse_iterator

enum enum_t {White, Black, Gray};
typedef double          db;
typedef long long       ll;     typedef unsigned long long  ull;
typedef pair<int, int>  pi;     typedef pair<ll, ll>    pll;
typedef map<int, int>   mi;     typedef map<ll, ll>     mll;
typedef set<int>        si;     typedef vector<si>      vsi;
typedef set<ll>         sll;    typedef vector<sll>     vsll;
typedef set<pi>         spi;    typedef vector<spi>     vspi;
typedef set<pll>        spll;   typedef vector<spll>    vspll;
typedef vector<enum_t>  ve;     typedef vector<ve>      v2_e;
typedef vector<string>  vs;     typedef vector<vs>      v2_s;
typedef vector<bool>    vb;     typedef vector<vb>      v2_b;
typedef vector<char>    vc;     typedef vector<vc>      v2_c;
typedef vector<int>     vi;     typedef vector<vi>      v2_i;    
typedef vector<ll>      vll;    typedef vector<vll>     v2_ll;
typedef vector<pi>      vpi;    typedef vector<vpi>     v2_pi;
typedef vector<pll>     vpll;   typedef vector<vpll>    v2_pll;
typedef vector<v2_i>    v3_i;   typedef vector<v3_i>    v4_i;   
typedef vector<v2_ll>   v3_ll;  typedef vector<v3_ll>   v4_ll;   

inline int readInt()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll  n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline void getInt(int& n) {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();    n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';      if(sign)n=-n;}
inline void getLong(ll& n) {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();    n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';      if(sign)n=-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}
char bufWrite[20];
template<typename T>inline void writeInt(T x)               {if(x<0)putchar('-'),x=-x;char*bufPos=bufWrite;do{*bufPos++=x%10+'0';}while(x/=10);do{putchar(*--bufPos);}while(bufPos>bufWrite);}
template<typename T>inline void printInt(T x, char c = EOF) {if(x<0)putchar('-'),x=-x;char*bufPos=bufWrite;do{*bufPos++=x%10+'0';}while(x/=10);do{putchar(*--bufPos);}while(bufPos>bufWrite);if(c!=EOF)putchar(c);}
template<typename T>inline T gcd(T a,T b){while(b!=0)swap(b,a%=b);return a;}
template<typename T>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<typename T>inline tuple<T,T,T>extgcd(T a,T b){if(!a)return mt(b,0,1);T g,x,y;tie(g,x,y)=extgcd(b%a,a);return mt(g,y-(b/a)*x,x);}
template<typename T>inline bool bitGet   (T  x, int bit)         { return T(1) & (x >> bit); }
template<typename T>inline void bitSet   (T &x, int bit)         { x |=  (T(1) << bit); }
template<typename T>inline void bitReset (T &x, int bit)         { x &= ~(T(1) << bit); }
template<typename T>inline void bitFlip  (T &x, int bit)         { x ^=  (T(1) << bit); }
template<typename T>inline void bitMake  (T &x, int bit, bool v) { x ^=  (T(1) << bit) & (-v ^ x); }
/// ======================================================================
/// ======================================================================
// const db oo = 0.1 / 0; /// inf
const ll LINF = (1LL << 60); /// 1e18
const int INF = (1 << 30); /// 1e9
const int LIM = (1 << 24); /// 1e7
const int MOD = 1e9 + 7;
const int BASE = 1e4;
const int DIGIT = 4;


/// ======================================================================


int query()
{


    return 0;
}

int main()
{
    


    for (int q = readInt(); q--;)
    {
        if (query());


    }

    return 0;
}

My graph template

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
using namespace std;

#define FOR(i, l, r)  for (int(i) = int(l); int(i) <= int(r); ++i)
#define FORD(i, r, l) for (int(i) = int(r); int(i) >= int(l); --i)
#define hashmap unordered_map
#define hashset unordered_set
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define itr iterator
#define rtr reverse_iterator

enum color_t {White, Black, Gray};
typedef double          db;
typedef long long       ll;     typedef unsigned long long  ull;
typedef pair<int, int>  pi;     typedef pair<ll, ll>    pll;
typedef map<int, int>   mi;     typedef map<ll, ll>     mll;
typedef set<int>        si;     typedef vector<si>      vsi;
typedef set<ll>         sll;    typedef vector<sll>     vsll;
typedef set<pi>         spi;    typedef vector<spi>     vspi;
typedef set<pll>        spll;   typedef vector<spll>    vspll;
typedef vector<enum_t>  ve;     typedef vector<ve>      v2_e;
typedef vector<string>  vs;     typedef vector<vs>      v2_s;
typedef vector<bool>    vb;     typedef vector<vb>      v2_b;
typedef vector<char>    vc;     typedef vector<vc>      v2_c;
typedef vector<int>     vi;     typedef vector<vi>      v2_i;    
typedef vector<ll>      vll;    typedef vector<vll>     v2_ll;
typedef vector<pi>      vpi;    typedef vector<vpi>     v2_pi;
typedef vector<pll>     vpll;   typedef vector<vpll>    v2_pll;
typedef vector<v2_i>    v3_i;   typedef vector<v3_i>    v4_i;   
typedef vector<v2_ll>   v3_ll;  typedef vector<v3_ll>   v4_ll;   

inline int readInt()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll  n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline void getInt(int& n) {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();    n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';      if(sign)n=-n;}
inline void getLong(ll& n) {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();    n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';      if(sign)n=-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}
char bufWrite[20];
template<typename T>inline void writeInt(T x)               {if(x<0)putchar('-'),x=-x;char*bufPos=bufWrite;do{*bufPos++=x%10+'0';}while(x/=10);do{putchar(*--bufPos);}while(bufPos>bufWrite);}
template<typename T>inline void printInt(T x, char c = EOF) {if(x<0)putchar('-'),x=-x;char*bufPos=bufWrite;do{*bufPos++=x%10+'0';}while(x/=10);do{putchar(*--bufPos);}while(bufPos>bufWrite);if(c!=EOF)putchar(c);}
template<typename T>inline T gcd(T a,T b){while(b!=0)swap(b,a%=b);return a;}
template<typename T>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<typename T>inline tuple<T,T,T>extgcd(T a,T b){if(!a)return mt(b,0,1);T g,x,y;tie(g,x,y)=extgcd(b%a,a);return mt(g,y-(b/a)*x,x);}
template<typename T>inline bool bitGet   (T  x, int bit)         { return T(1) & (x >> bit); }
template<typename T>inline void bitSet   (T &x, int bit)         { x |=  (T(1) << bit); }
template<typename T>inline void bitReset (T &x, int bit)         { x &= ~(T(1) << bit); }
template<typename T>inline void bitFlip  (T &x, int bit)         { x ^=  (T(1) << bit); }
template<typename T>inline void bitMake  (T &x, int bit, bool v) { x ^=  (T(1) << bit) & (-v ^ x); }
// ======================================================================
/// ======================================================================
// const db oo = 0.1 / 0; /// inf
const ll LINF = (1LL << 60); /// 1e18
const int INF = (1 << 30); /// 1e9
const int LIM = (1 << 24); /// 1e7
const int MOD = 1e9 + 7;
const int BASE = 1e4;
const int DIGIT = 4;


/// ======================================================================


int n, m, k;
v2_i G; /// Weighted   Graph

vb mark; /// Graph
ve color; /// Graph
vi dep, deg, par; /// Tree: Depth - Degree - Parent
vi lvl, cap, ori; /// DSU:  Level - Capacity - Origin

inline void DSU_make(int u) { ori[u] = -1; cap[u] = 1; lvl[u] = 1; }
inline int DSU_find(int u) { return ori[u] < 0 ? u : (ori[u] = DSU_find(ori[u])); }
inline void DSU_union(int u, int v)
{
    u = DSU_find(u), v = DSU_find(v);
    if (u == v) return ;

    if (lvl[u] < lvl[v]) swap(u, v);
    ori[v] = u;
    cap[u] += cap[v];
    lvl[u] += (lvl[u] == lvl[v]);
}

int readGraph()
{
    n = readInt();
    m = readInt();

    G.resize(n + 1);
    mark.assign(n + 1, false);
    // color.assign(n + 1, White);
    // dep.assign(n + 1, 0); deg.assign(n + 1, 0); par.assign(n + 1, -1);
    // cap.assign(n + 1, 1); lvl.assign(n + 1, 1); ori.assign(n + 1, -1);
    for (int i = 0; i < m; ++i)
    {
        int u = readInt();
        int v = readInt();
        G[u].push_back(v); 
        G[v].push_back(u);
        
        // int c = readInt();
        // G[u].push_back({v, c});
        // G[u].push_back({u, c});

        // deg[u]++; deg[v]++;
        // DSU_union(u, v);
    }



    return 0;
}

int main()
{
    readGraph();


    return 0;
}

My Hello-World template

#include <iostream>

using namespace std;

int main()
{


    return 0;
}

My normal template

#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;

int main()
{



    return 0;
}

→ Ответить

dmkz

4 года назад, # |

+13

You can avoid to use macro CONFIG:

const bool ready = [](){
    std::ios_base::sync_with_stdio(false); std::cin.tie(0);
    std::cout << std::fixed << std::setprecision(12);
    return true;
}();

This lambda will be called before main. Example

→ Ответить

Tameshk

4 года назад, # ^ |

Oh, Pretty neat.

→ Ответить

ch_egor

4 года назад, # ^ |

Are you sure that "std::cout" will be initialized before "ready"?

Seems to be UB.

→ Ответить

dmkz

4 года назад, # ^ |

It is not UB with C++11 and later.

→ Ответить

CodingKnight

4 года назад, # ^ |

Thanks for sharing this elegant lambda expression.

The followng is a slight update that uses auto as the return type of the expression.

Update

→ Ответить

sys.

4 года назад, # |

My template

→ Ответить

Bassel

4 года назад, # |

← Rev. 2 →

C++:

Rust:

→ Ответить

ChaosAngel

4 года назад, # |

Ok so I was preparing to post but I really didn't want to drown everybody's codes with my monster, gotta share the spotlight. See any of my submissions 78664902 to understand :p

→ Ответить

ishank162

4 года назад, # ^ |

Nobody asked for your whole library. He just asked for your template. ;)

→ Ответить

ChaosAngel

4 года назад, # ^ |

This is my template. I put it before every code even if it's int n; cin>>n; cout<<n<<endl; :D

→ Ответить

ishank162

4 года назад, # ^ |

xD.

→ Ответить

Errichto

4 года назад, # |

+35

Creating images instead of pasting code with CF formatting. Heavier page to load, and nobody can't copy-paste something useful from here, nice.

→ Ответить

Theo830

4 года назад, # ^ |

+10

You don't learn from copy-paste! You should make your own template without taking exactly the same template from random red guys!

→ Ответить

Errichto

4 года назад, # ^ |

← Rev. 2 →

People can anyway go to submissions of that red coder, and open any code.

→ Ответить

waltz47

4 года назад, # ^ |

Yes errichto, I copied yours. Thank you for that brilliant suggestion.

→ Ответить

ivan100sic

4 года назад, # |

Short, efficient, unique.

I use snippet shortcuts to insert algorithms and implementations when needed.

→ Ответить

Errichto

4 года назад, # ^ |

+38

Should be typedef long unsigned long lul;

→ Ответить

ivan100sic

4 года назад, # ^ |

I'll give you that honor

→ Ответить

Arturgo

4 года назад, # |

I don't use it during contests, because I don't have time to complete it yet, but I published mine on my blog : Input/Output.

I also have a tool that includes functions that I need at compile-time on my github : C-Tool

→ Ответить

kdjonty31

4 года назад, # |

← Rev. 2 →

Here's my submission template :)

→ Ответить

towrist

4 года назад, # |

Short and simple, loaded and ready for multiple test-cases and focus only on the solve function.

→ Ответить

Justinianus

4 года назад, # |

Too much templates !!! I will have long long time to learn all of this. Thank you everyone <3

→ Ответить

kingmanas

4 года назад, # |

← Rev. 2 →

My UltiSnips snippet for vim

→ Ответить

orz

4 года назад, # |

-19

It failed to accommodate the whole code, so a huge part of this picture is just black.

→ Ответить

ishank162

4 года назад, # ^ |

These are just another Level TEMPLATES.

→ Ответить

Thallium54

4 года назад, # |

Why does every body using dark theme? :)

→ Ответить

N.N_2004

4 года назад, # |

+18

it's mine :)

→ Ответить

chandanagrawal23

4 года назад, # |

I want this theme for my compiler...anyone knows either online or offline compiler which contain this theme .

→ Ответить

Thallium54

4 года назад, # ^ |

I guess you can install themes on your editor since those themes are not created by the author.

→ Ответить

_andyli

4 года назад, # |

→ Ответить

SPyofgame

4 года назад, # |

← Rev. 2 →

→ Ответить

SPyofgame

4 года назад, # ^ |

← Rev. 2 →

My ugly template

#include <algorithm>
#include <iostream>
#include <cmath>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
// #include <queue>
// #include <deque>
// #include <stack>
// #include <ctime>
// #include <iomanip>
// #include <cstdlib>
using namespace std;

/// ================================ Define Part ================================
#define minimize(a, b) a = min(a, b)
#define maximize(a, b) a = max(a, b)
#define FOR(i, l, r)     for (int(i) = int(l); int(i) <= int(r); i += 1)
#define FORD(i, r, l)    for (int(i) = int(r); int(i) >= int(l); i -= 1)
#define REP(i, n)        for (int(i) = int(n); int(i) >=     1 ; i -= 1)
#define REPE(i, s, e, d) for (int(i) = int(s); int(i) != int(e); i += d)
#define hashmap unordered_map
#define hashset unordered_set
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eol '\n'
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define itr iterator
#define rtr reverse_iterator

enum enum_t {White, Black, Gray};
typedef unsigned long long ull;    typedef long long       ll;
typedef unsigned int    uint;      typedef double          db;
typedef pair<int, int>  pi;        typedef pair<ll, ll>    pll;
typedef map<int, int>   mi;        typedef map<ll, ll>     mll;
typedef set<int>        si;        typedef vector<si>      vsi;       typedef vector<vsi>     v2_si;     typedef vector<v2_si>    v3_si;
typedef set<ll>         sll;       typedef vector<sll>     vsll;      typedef vector<vsll>    v2_sll;    typedef vector<v2_sll>   v3_sll;
typedef set<pi>         spi;       typedef vector<spi>     vspi;      typedef vector<vspi>    v2_spi;    typedef vector<v2_spi>   v3_spi;
typedef set<pll>        spll;      typedef vector<spll>    vspll;     typedef vector<vspll>   v2_spll;   typedef vector<v2_spll>  v3_spll;
typedef vector<enum_t>  ve;        typedef vector<ve>      v2_e;      typedef vector<v2_e>    v3_e;      typedef vector<v3_e>     v4_e;
typedef vector<string>  vs;        typedef vector<vs>      v2_s;      typedef vector<v2_s>    v3_s;      typedef vector<v3_s>     v4_s;
typedef vector<bool>    vb;        typedef vector<vb>      v2_b;      typedef vector<v2_b>    v3_b;      typedef vector<v3_b>     v4_b;
typedef vector<char>    vc;        typedef vector<vc>      v2_c;      typedef vector<v2_c>    v3_c;      typedef vector<v3_c>     v4_c;
typedef vector<int>     vi;        typedef vector<vi>      v2_i;      typedef vector<v2_i>    v3_i;      typedef vector<v3_i>     v4_i;
typedef vector<ll>      vll;       typedef vector<vll>     v2_ll;     typedef vector<v2_ll>   v3_ll;     typedef vector<v3_ll>    v4_ll;
typedef vector<pi>      vpi;       typedef vector<vpi>     v2_pi;     typedef vector<v2_pi>   v3_pi;     typedef vector<v3_pi>    v4_pi;
typedef vector<pll>     vpll;      typedef vector<vpll>    v2_pll;    typedef vector<v2_pll>  v3_pll;    typedef vector<v3_pll>   v4_pll;

/// ================================ Independent  Functions ================================
template<typename T>inline void getString (T& s) {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');s=c;
                                                        while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s.pb(c);}
template<typename T>inline void getUnsign (T& n) {char c;while(c=getchar(),c<'0'||c>'9');
                                                        while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';}
template<typename T>inline void getSigned (T& n) {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign(c=='-');if(sign)c=getchar();n=c-'0';
                                                        while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';if(sign)n=-n;}

inline int    readInt()    { int x;    return getSigned(x), x; }
inline ll     readLong()   { ll  x;    return getSigned(x), x; }
inline uint   readUINT()   { uint x;   return getUnsign(x), x; }
inline ull    readULL()    { ull  x;   return getUnsign(x), x; }
inline string readString() { string s; return getString(s), s; }

char bufWrite[20];
template<typename T>inline void writeInt (T x)               {if(x<0)putchar('-'),x=-x;char*bufPos=bufWrite;do{*bufPos++=x%10+'0';}while(x/=10);do{putchar(*--bufPos);}while(bufPos>bufWrite);}
template<typename T>inline void printInt (T x, char c = EOF) {writeInt(x);if(c!=EOF)putchar(c);}
template<typename T>inline         T       gcd(T a,T b) { while (b != 0) swap(b, a %= b); return a; }
template<typename T>inline         T       lcm(T a,T b) { return a / gcd(a, b) * b; }
template<typename T>inline tuple<T,T,T> extgcd(T a,T b) { if(a==0)return mt(b,0,1);T g,x,y;tie(g,x,y)=extgcd(b%a,a);return mt(g,y-(b/a)*x,x); }
template<typename T>inline T med(T a, T b, T c) { return max(min(a, b), min(c, max(a, b))); }
template<typename T>inline bool bitGet   (T  x, int bit)         { return T(1) & (x >> bit); }
template<typename T>inline void bitSet   (T &x, int bit)         { x |=  (T(1) << bit); }
template<typename T>inline void bitReset (T &x, int bit)         { x &= ~(T(1) << bit); }
template<typename T>inline void bitFlip  (T &x, int bit)         { x ^=  (T(1) << bit); }
template<typename T>inline void bitMake  (T &x, int bit, bool v) { x ^=  (T(1) << bit) & (-v ^ x); }
/// ================================ Dependent  Functions ================================
// db eulerpow(double x, int n = 18) { db e = 1.0; while (--n) e = 1 + x * e / n; return e; }
// const db NAPIER = eulerpow(1); // 15 digits
// const db oo = 0.1 / 0; /// inf
// const db PI = acos(-1);
const ll LINF = (1LL << 60); /// 1e18
const int INF = (1 << 30); /// 1e9
const int LIM = (1 << 24); /// 1e7
const int MOD = 1e9 + 7;
const int BASE = 1e4;
const int DIGIT = 4;

inline ll  bigmodMul(ll  a, ll  b, ll  mod = MOD) { ll res=0;for(a%=mod,b%=mod;b>0;a<<=1,b>>=1){if(a>=mod)a-=mod;if(b&1){res+=a;if(res>=mod)res-=mod;}}return res;}
inline ll  bigmodPow(ll  x, ll  n, ll  mod = MOD) { ll res=1;for(x%=mod;n>0;x=bigmodMul(x,x,mod),n>>=1)if(n&1)res=bigmodMul(res,x,mod);return res;}
inline int    modMul(int a, int b, int mod = MOD) { return (1LL * a * b) % mod; }
inline int    modPow(int x, int n, int mod = MOD) { int res=1;for(x%=mod;n>0;x=modMul(x,x,mod),n>>=1)if(n&1)res=modMul(res,x,mod);return res;}
inline ll  biginvs(ll  x, ll  mod = MOD) { return bigmodPow(x, mod - 2, mod); }
inline int    invs(int x, int mod = MOD) { return    modPow(x, mod - 2, mod); }
/// ================================ Main part ================================

inline void file(const string FILE = "Test")
{
    freopen((FILE + ".INP").c_str(), "r", stdin);
    freopen((FILE + ".OUT").c_str(), "w", stdout);
}

int query()
{


    return 0;
}

int main()
{
    file();



    for (int q = readInt(); q--; )
    {
        if (query());



    }



    return 0;
}

→ Ответить

Qualified

4 года назад, # |

My template is

here

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string.h>
#include <cstring>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <set>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <numeric>
#include <cassert>
#include <chrono>
#include <random>

using namespace std;
using ll = long long;
using ld = long double;

#define nl "\n"
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define eb emplace_back
#define ins insert
#define mp make_pair
#define f first
#define s second
#define trav(x) for(auto& i: x)
#define sz(s) (int)(s).size()

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef vector<int> vi; 
typedef vector<ll> vl;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	
}

Standard I think. Not using

Header

#include <bits/stdc++.h>

I feel like it is too slow when running on test cases...

→ Ответить

saurabhyadavz

4 года назад, # |

Here you g----->o

→ Ответить

johnwick2b67

4 года назад, # |

← Rev. 3 →

→ Ответить

Arcane

4 года назад, # |

Template

Small and simple

→ Ответить

lrvideckis

4 года назад, # |

The main thing is #define int long long. WA from overflow too many times

→ Ответить

Arcane

4 года назад, # ^ |

Why do u have both #define int long long and typedef long long ll.

→ Ответить

okwedook

4 года назад, # ^ |

Sometimes you've gotta optimize real hard =)

→ Ответить

lrvideckis

4 года назад, # ^ |

Some of the code from my alg. repo still uses ll. I should probably change that sometime

→ Ответить

amit_dwivedi

4 года назад, # |

Template

Debugger that you might like, since it can be used without writing a single line of code in your final submission file.
(See sample_program in the link given above.)

→ Ответить

_rey

4 года назад, # |

I try to keep it as simple as possible, and not exaggerated.

→ Ответить

LilyWhite

4 года назад, # |

→ Ответить

Соревнования по программированию 2.0

Время на сервере: 07.05.2024 03:14:27 (k1).

Десктопная версия, переключиться на мобильную.

При поддержке