2016 Qingdao Network race roll Rough kee

tonyfang+sps+ Me =5/12

It's a big, rough roll.

Three I Count II

Test instructions: Minimum value greater than n in the number of the same shape

The puzzle: Pre-treatment of all (5,194), two points in this area

#include <map>#include<stack>#include<queue>#include<cstdio>#include<string>#include<vector>#include<cstring>#include<complex>#include<iostream>#include<assert.h>#include<algorithm>using namespacestd;#defineINF 1001001001#defineINFLL 1001001001001001001LL#definell Long Long#defineDBG (vari) cerr<< #vari << "=" << (vari) <<endl#defineGmax (a) (a) =max ((a), (b))#defineGmin (a) (a) =min ((a), (b))#defineRi Register int#defineGC GetChar ()#defineIl inline#include<Set>ilintRead () {BOOLf=true; Ri x=0;CharCh while(!isdigit (CH=GC))if(ch=='-') f=false; while(IsDigit (CH)) {x= (x<<1) + (x<<3) +ch-'0'; CH=GC;}returnf?x:-x;}#defineGI Read ()ll p[10000],_p;Set<ll>Q;intMain () {Q.insert (1); intCnt=0;  while(!Q.empty ()) {p[++_p]=*Q.begin ();         Q.erase (p[_p]); ll T=P[_p]; if(t>1000000000){ Break;} if(2*t<=1000000000) Q.insert (2*t); if(3*t<=1000000000) Q.insert (5*t); if(5*t<=1000000000) Q.insert (3*t); if(7*t<=1000000000) Q.insert (7*t); }    intt=gi;  while(t--){        intn=gi; intpos = Lower_bound (p+1, p+_p+1, N)-p; printf ("%i64d\n", P[pos]); }}

02

Test instructions: request, input file <1m

The main puzzle: obviously convergence, if n is very large output a fixed value, otherwise violence

03

Test instructions: Given the set of shielding words and the article, the result of the output shielding

The following: AC automata. Card Space * * * *

0405

Test instructions: Expand Stone scissors Step Sale way, n kind of shot, ask whether the game balance

Solving the puzzle: to judge parity, odd, even.

06

Test instructions: Maximizing the point-of-rights XOR on the Euler path

The puzzle: If it is the Euler circuit, the piece raises the point. Otherwise, Obi Road is the only one, judge the degree.

07

080910

11

Test instructions: Benquan for 1 of the graph, each side has a cost, the minimum cost so that the 1~n shortest path per strip is truncated

1~n: Minimum cut on the shortest path map, same as bzoj1266 [AHOI2006] School Route route

I wrote Qaq Qnmdsps the wrong side of the problem.

1213

Again a pit.

2016 Qingdao Network race roll Rough kee