a week-long smart contract coding competition powered by theTact language. This challenge is designed to push your problem-solving skills to the limit as you tackle real-world blockchain development tasks on The Open Network (TON). With a $20,000 prize pool and unique opportunities for recogni...
Am I allowed to use outside resources during the contest? You may only refer to language documentation. Can I solve problems in Rust? No, the only languages supported are C, C++, Java, and Python. Consult the instructions for language-specific technical details. Will Rust support be added?
Teams of 3 ready to rock and roll! No programming language, affiliation or problem solving methods restrictions. You only need to be at least 18 years old and have a slightly concerning enthusiasm for coding challenges. Save the Date
vc[len +1] =-1;// 防止后面 mi + 1 爆字符集上限mxp[0] = mxp[1] =-1;for(LL i =1;i <= len;i ++) mxp[vc[i]] = i;for(LL i =1;i <= len;i ++){ nxt[i] =0;for(LL j = i +1;j <= len;j ++){if(vc[i] != vc[j]){ nxt[i] = j;break; } } }// 下...
void add(int a,int b,int c,int d){add(P(a,b),P(c,d));} void del(){now[frm[tot]]=pre[tot],tot--;} void tarjan(int x){ dfn[x]=low[x]=++tim,q[++top]=x,ins[x]=1; for (int y=now[x];y;y=pre[y]){
1515C-PhoenixAndTowers.cpp 1516A-TitForTat.cpp 1517A-SumOf2050.cpp 1519A-RedAndBlueBeans.cpp 1519B-TheCakeIsALie.cpp 1519C-BerlandRegional.cpp 1520A-DoNotBeDistracted.cpp 1520B-OrdinaryNumbers.cpp 1520C-NotAdjacentMatrix.cpp ...
Each of the scientists knows exactly one language. For convenience, we enumerate all lan... 算法进阶指南 CodeForces - 670C Cinema 离散化 莫斯科正在举办一个大型国际会议,有n个来自不同国家的科学家参会。 每个科学家都只懂得一种语言。 为了方便起见,我们把世界上的所有语言用11到109109之间的整数编号...
Petya wrote a program in this language, but it turned out to be too long. Write a program in CALPAS that does the same thing as the Petya's program, and consists of no more than 5 lines. Your program should return the same integer as Petya's program for all arguments from 0 to 102...
1914B-PreparingForTheContest.cpp 1914C-Quests.cpp 1914D-ThreeActivities.cpp 1914E1-GameWithMarblesEasyVersion.cpp 1914E2-GameWithMarblesHardVersion.cpp 1915A-OddOneOut.cpp 1915B-NotQuiteLatinSquare.cpp 1915C-CanISquare.cpp 1915D-UnnaturalLanguageProcessing.cpp ...
* @Language: C++ */ #include <bits/stdc++.h> using namespace std; const int MAXN = 55; const int MAXM = 105; int dp[MAXN], w[MAXN]; bool path[MAXN][MAXN]; int main() { int t, n, m; while (scanf("%d", &m), m) { ...