- 博客(6)
- 收藏
- 关注
原创 ZOJ Problem Set - 3962 Seven Segment Display
写一个从0x000000到x的结果的函数,依此来推出结果#include<iostream>#include<string>using namespace std;int s[] = { 6,8,13,18,22,27,33,36,43,49,55,60,64,69,74,78 };long long int f(long long int x){ long long int t
2017-04-24 19:36:08 475
原创 Spanning Tree Fraction
0 1分数规划#include<iostream>#include<vector>#include<algorithm>using namespace std;int pre[100005] = {};int n, m;int findroot(int t){ if (pre[t] != t) pre[t] = findroot(pre[t]); return pre[t
2017-04-15 18:48:27 620
原创 Problem D. Fashion Show
Problem You are about to host a fashion show to show off three new styles of clothing. The show will be held on a stage which is in the most fashionable of all shapes: an N-by-N grid of cell
2017-04-09 14:22:38 434
原创 Problem C. Bathroom Stalls
Problem A certain bathroom has N + 2 stalls in a single row; the stalls on the left and right ends are permanently occupied by the bathroom guards. The other N stalls are for users. Whe
2017-04-09 14:21:03 600
原创 Problem B. Tidy Numbers
Problem Tatiana likes to keep things tidy. Her toys are sorted from smallest to largest, her pencils are sorted from shortest to longest and her computers from oldest to newest. One day, whe
2017-04-09 14:19:46 468
原创 Problem A. Oversized Pancake Flipper(googlejam资格赛)
ProblemLast year, the Infinite House of Pancakes introduced a new kind of pancake. It has a happy face made of chocolate chips on one side (the “happy side”), and nothing on the other side (the “blank
2017-04-09 14:18:23 726
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人