模拟
欧莎
啦啦啦,啦啦啦,让我们一起洗刷刷
展开
-
Farmer Bill's Problem
Farmer Bill’s Problem Time Limit: 1000msMemory Limit: 32768KB 64-bit integer IO format: %I64d Java class name: Main Submit Status PID: 24433 Peter has n cigarettes. He smokes them one by one ke原创 2016-05-01 09:31:06 · 320 阅读 · 0 评论 -
“玲珑杯”ACM比赛 Round #7
A#include#include#include #include #include #include #include const int INF = 0x3f3f3f3f;const int N = 100005;const int maxs = 1e6+5;const double eps = 1e-10;#define left lll#define rig原创 2016-12-24 15:56:32 · 354 阅读 · 0 评论 -
Codeforces Round #402 (Div. 2) B. Weird Rounding
Polycarp is crazy about round numbers. He especially likes the numbers divisible by10k.In the given number of n Polycarp wants to remove the least number of digits to get a number that is divisibl原创 2017-02-26 20:05:52 · 478 阅读 · 0 评论 -
Codeforces Round #402 (Div. 2) A. Pupils Redistribution
In Berland each high school student is characterized by academic performance — integer value between 1 and5.In high school 0xFF there are two groups of pupils: the groupA and the group B. Each原创 2017-02-26 20:17:23 · 340 阅读 · 0 评论 -
2017广东工业大学程序设计竞赛决赛Problem H: tmk买礼物
Description今天是校赛的日子,为了庆祝这么喜庆的日子,TMK打算买些礼物给女票LSH庆祝一下。 TMK进入了雪梨超市,然后刚踏入的一瞬间,店主就对TMK说:“恭喜你成为了本店第2147483647位顾客,本店在搞一个活动,对本店第2147483647位顾客进行赠送活动。你先看看你有多少钱?” TMK一摸口袋,发现只有n个硬币,每个硬币的价值为a[i]。 然后店主继续说:“现在你用你的原创 2017-03-27 19:56:16 · 666 阅读 · 0 评论 -
POJ 宇航员 (大模拟)
Description 问题描述: 宇航员在太空中迷失了方向,在他的起始位置现在建立一个虚拟xyz坐标系,称为绝对坐标系,宇航员正面的方向为x轴正方向,头顶方向为z轴正方向,则宇航员的初始状态如下图所示: 现对六个方向分别标号,x,y,z正方向分别为0,1,2,负方向分别为3,4,5;称它们为绝对方向。宇航员在宇宙中只沿着与绝对坐标系xyz轴平行的方向行走,但是他不知道自己当前绝对坐标和自原创 2017-03-30 17:07:41 · 477 阅读 · 0 评论 -
第八届河南省程序设计大赛 挑战密室(化学式模拟)
题目描述 R组织的特工Dr. Kong 为了寻找丢失的超体元素,不幸陷入WTO密室。Dr. Kong必须尽快找到解锁密码逃离,否则几分钟之后,WTO密室即将爆炸。Dr. Kong发现密室的墙上写了许多化学方程式中。化学方程式,也称为化学反应方程式,是用化学式表示物质化学反应的式子。化学方程式反映的是客观事实。因此书写化学方程式要遵守两个原则:一是必须以客观事实为基础;二是要遵守质量守恒定律。化学方原创 2017-04-18 08:37:27 · 309 阅读 · 0 评论 -
ZOj 3950 How Many Nines (日起模拟,打表,预处理)
If we represent a date in the format YYYY-MM-DD (for example, 2017-04-09), do you know how many 9s will appear in all the dates between Y1-M1-D1 and Y2-M2-D2 (both inclusive)?Note that you should take原创 2017-04-16 20:25:14 · 289 阅读 · 0 评论 -
hdu 1296 Polynomial Problem(多项式模拟)
Problem Description We have learned how to obtain the value of a polynomial when we were a middle school student. If f(x) is a polynomial of degree n, we can letIf we have x, we can get f(x) easily. B原创 2017-03-29 21:38:45 · 353 阅读 · 0 评论 -
Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial B. Spotlights
Theater stage is a rectangular field of size n × m. The director gave you the stage's plan which actors will follow. For each cell it is stated in the plan if there would be an actor in this cell or原创 2016-11-22 19:27:32 · 339 阅读 · 0 评论 -
codefroces Codeforces Round #378 (Div. 2) A. Grasshopper And the String
One day, the Grasshopper was jumping on the lawn and found a piece of paper with a string. Grasshopper became interested what is the minimum jump ability he should have in order to be able to reach原创 2016-11-01 22:01:51 · 254 阅读 · 0 评论 -
codeforces Codeforces Round #378 (Div. 2) B. Parade
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even kno原创 2016-11-01 21:58:56 · 466 阅读 · 0 评论 -
The Same Color
DescriptionDiao Yang has many balls with different colors. Today he wants to divide his balls into two groups. But he does not know how to divide. Then Diao Ze gives him a suggestion: first you choose原创 2016-05-15 20:54:44 · 559 阅读 · 0 评论 -
Problem H: Eat Candy
DescriptionThere is a box with infinite volume. At first there are n candies in the box. Then every second you will eat some candies, left half of candies (round down) in the box. Then add k candies in原创 2016-05-15 20:56:48 · 258 阅读 · 0 评论 -
Problem I: Catching Dogs
DescriptionDiao Yang keeps many dogs. But today his dogs all run away. Diao Yang has to catch them. To simplify the problem, we assume Diao Yang and all the dogs are on a number axis. The dogs are numb翻译 2016-05-15 21:48:39 · 366 阅读 · 0 评论 -
Happy Reversal
Happy Reversal Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 34988 Elfness is studying in an operation “NOT”. For a binary num翻译 2016-05-05 16:43:48 · 267 阅读 · 0 评论 -
Winner
Time Limit: 1000msMemory Limit: 65536KB This problem will be judged on CodeForces. Original ID: 2A 64-bit integer IO format: %I64d Java class name: (Any) Prev Submit Status Statistics Discuss N转载 2016-05-08 09:58:11 · 643 阅读 · 0 评论 -
hdu 5867
题目链接“直接模拟,不过我比较笨花了好长时间#include<stdio.h>#include<iostream>#include<algorithm>#include<map>#include<string.h>using namespace std;int a[1010];int b[1010]= {0,3,3,5,4,4,3,5,5,4,3,6,6,8,8,7,7,9,8,8,原创 2016-08-18 17:12:28 · 578 阅读 · 0 评论 -
codeforces H. Delete Them(2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, )
H. Delete Themtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputPolycarp is a beginner programmer. He is stu原创 2016-10-26 22:03:56 · 489 阅读 · 0 评论 -
hdu 5944 Fxx and string
Problem DescriptionYoung theoretical computer scientist Fxx get a string which contains lowercase letters only.The string S contains n lowercase letters S1S2…Sn.Now Fxx wants to know how m原创 2016-10-30 10:27:32 · 285 阅读 · 0 评论 -
poj 2420 A Star not a Tree?(模拟退火求费马点)
DescriptionLuke wants to upgrade his home computer network from 10mbs to 100mbs. His existing network uses 10base2 (coaxial) cables that allow you to connect any number of computers together in a li...原创 2017-03-13 18:27:01 · 449 阅读 · 0 评论