Codeforces Round #429 (Div. 2)-（DFS）
Leha plays a computer game, where is on each level is given a connected graph with n vertices and m edges.
Graph can contain multiple edges, but can not contain self loops. Each vertex has an integer di,
which can be equal to 0, 1 or - 1.
To pass the level, he needs to find a «good» subset of edges of the graph or say, that it doesn't exist. Subset is called «good», if by by leaving only edges from this subset in the original graph, we obtain the following: for every vertex i, d
相關推薦
Codeforces Round #429 (Div. 2)-（DFS）
Leha plays a computer game, where is on each level is given a connected graph with n vertices and m edges. Graph can contain multiple edges, but can not
Codeforces Round #247 (Div. 2)（B）（暴力，全排列函式||DFS）
Many students live in a dormitory. A dormitory is a whole new world of funny amusements and possibilities but it does have its drawbacks. There is only
Border Codeforces Round #499 (Div. 2) （數論）
E. Border time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Ast
B. Nirvana Codeforces Round #549 (Div. 2) （遞歸dfs）
imu aps force contains code names closed only spl ---恢復內容開始--- Kurt reaches nirvana when he finds the product of all the digits of some
Codeforces Round #524 (Div. 2)（前3題題解）
這場比賽手速場+數學場，像我這樣讀題都讀不大懂的蒟蒻表示呵呵呵。 第四題搞了半天，大概想出來了，但來不及（中途家裡網炸了）查錯，於是我交了兩次丟了100分。幸虧這次沒有掉rating。 比賽傳送門：https://codeforces.com/contest/1080。 A.Petya
【CF套題】Codeforces Round #524 (Div. 2) （1080A~F）
原題地址 迴歸 CF \text {CF} CF，這場堪堪上紫。 A.Petya and Origa
Codeforces Round #185 (Div. 2)(解題報告）（ABC出DE補）
第一次抽時間做一整套的cf ，可以說是心情複雜，D，E都是什麼神仙題目啊！！！ A Whose sentence is it? （水題） 題目： One day, liouzhou_101 got a chat record of Freda and Rain
Codeforces Round #244 (Div. 2)（強連通分量，字尾陣列）
Police headquarter is monitoring signal on different frequency levels. They have got two suspiciously encoded strings s1 and s2 from two different freque
Codeforces Round #312 (Div. 2) （第三題是位運算，好題）
分析：從0座標分開，負半軸一個數組，正半軸一個數組，來記錄果樹的左邊和數量，可以用結構體陣列來儲存資料，其中少的一個半軸上的果樹肯定會全被採光，而多的一邊樹上會多采一棵樹。 struct p{ int num,x; } p neg[105],pos[105];這樣表
Codeforces Round #439 (Div. 2)（補題） A模擬+set B 數學 C dp or 楊輝三角組合數
— This is not playing but duty as allies of justice, Nii-chan! — Not allies but justice itself, Onii-chan! With hands joined, go everywhere at a speed fas
Codeforces Round #324 (Div. 2) （B排列組合）（C貪心）（D哥德巴赫猜想 數論+暴力）
題意：。。。。 思路：剛開始還想用什麼字串模擬或者大數什麼的，後來想了想差點笑出聲來，樣例就是用來忽悠人的。。。 #include <bits/stdc++.h> #define ll
Codeforces Round #340 (Div. 2) （629A，629B，629C（排列組合，動態規劃），629D（線段樹））
Far Relative’s Birthday Cake 題目連結： 解題思路： Consider that we have rowi chocolates in the i'th row and coli chocolates in the i'th colum
Codeforces Round #365 (Div. 2) （703A，703B（容斥），703C（幾何），703D（樹狀陣列））
Mishka and Game 題目連結： 解題思路： In this problem you had to do use the following algo. If Mishka wins Chris in the current round, then increa
Codeforces Round #493 (Div. 2) （A B C D）
A. Balloons題目大意：讓你把所有的氣球分成兩份，使得兩份的數量不同，隨便分。解題思路：用一個結構體存數量和序號，在根據數量排個序，對於n<=2進行特判下，對於n>2的情況直接輸出1和第一個數的序號即可。AC程式碼：struct node { in
Codeforces Round #532 (Div. 2)（A. Roman and Browser）
A. Roman and Browser time limit per test1 second memory limit per test256 megabytes inputstandard input
Codeforces Round #346 (Div. 2) （659A，659B，659C，659D（幾何叉乘），659E（並查集））
Round House 題目連結： 解題思路： The answer for the problem is calculated with a formula ((a - 1 + b) n + n) n + 1. Such solution has comple
Codeforces Round #493 (Div. 2) （1800分紀念）
A.Balloons 題意：給出長度為n的陣列，問是否可以分成兩組和不一樣的陣列，n<=10 題解：由於n很小，所以列舉子集就好了 #include <bits/stdc++.h> #define pb push_back #define
Codeforces Round #541 (Div. 2)（並查集又稱dsu，拓撲排序）
每次 == auto else if microsoft 沒有 spa pan force #include<bits/stdc++.h>using namespace std;vector<int>g[2007];int fa[2007],vis[
C. Queen Codeforces Round #549 (Div. 2) （搜索）
down pop ger puts ESS wiki closed sca graphic ---恢復內容開始--- You are given a rooted tree with vertices numerated from 11 to nn . A tree
Codeforces Round #324 (Div. 2) （哥德巴赫猜想）
div std 題目 isp fin codeforce printf for space 題目：http://codeforces.com/problemset/problem/584/D 思路： 關於偶數的哥德巴赫猜想：任一大於2的偶數都可寫成兩個素數之和。