其他 模拟
Yishui_Blog
Try our best
展开
-
51Nod 1009 数字1的数量 (数学
1009 数字1的数量基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注 给定一个十进制正整数N,写下从1开始,到N的所有正数,计算出其中出现所有1的个数。 例如:n = 12,包含了5个1。1,10,12共包含3个1,11包含2个1,总共5个1。 Input输入N(1 <= N <= 10^9)Output输出包含1的个数Input示例12Out原创 2017-02-04 21:49:06 · 433 阅读 · 0 评论 -
白皮书 阶乘的精确度(大数阶乘)
题目:输入不超过1000的正整数n,输出n!=1x2x3···xn的精确结果。 样例输入:30 样例输出:265252859812191058636308480000000分析:先存个 大的数组求a[3000],让a[0]保存结果的个位(方便进位)白皮书代码(看啦好几遍才看懂QAQ)#include#include#defi原创 2016-11-22 17:56:10 · 387 阅读 · 0 评论 -
UESTC - 1512 可怜的非洲人 (模拟
可怜的非洲银 Edit Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status原创 2017-03-27 07:35:16 · 605 阅读 · 0 评论 -
ICPC2017南宁邀请赛1005&&HDU6197 (模拟
CS CourseDescriptionLittle A has come to college and majored in Computer and Science.Today he has learned bit-operations in Algorithm Lessons, and he got a problem as homework.Here is the problem:You a原创 2017-09-19 14:26:28 · 582 阅读 · 0 评论 -
Codeforces Educational 38 A. Word Correction
题目描述Victor tries to write his own text editor, with word correction included. However, the rules of word correction are really strange.Victor thinks that if a word contains two consecutive vowels,...原创 2018-02-18 04:03:20 · 292 阅读 · 0 评论 -
CCCC题集 L2-002. 链表去重 ( 简单模拟
题目描述给定一个带整数键值的单链表L,本题要求你编写程序,删除那些键值的绝对值有重复的结点。即对任意键值K,只有键值或其绝对值等于K的第一个结点可以被保留。同时,所有被删除的结点必须被保存在另外一个链表中。例如:另L为21→-15→-15→-7→15,则你必须输出去重后的链表21→-15→-7、以及被删除的链表-15→15。输入输入第一行包含链表第一个结点的地址、以及结点个数...原创 2018-03-28 19:41:30 · 331 阅读 · 0 评论 -
GYM 101350 A. Sherlock Bones
A. Sherlock Bones 题目描述The great dog detective Sherlock Bones is on the verge of a new discovery. But for this problem, he needs the help of his most trusted advisor -you- to help him fetch the a...原创 2018-04-24 01:11:48 · 258 阅读 · 0 评论 -
GYM 101350 H. Mirrored String I
题目描述The gorillas have recently discovered that the image on the surface of the water is actually a reflection of themselves. So, the next thing for them to discover is mirrored strings.A mirr...原创 2018-04-24 16:10:32 · 199 阅读 · 0 评论 -
GYM 101350 I. Mirrored String II
I. Mirrored String II题目描述Note: this is a harder version of Mirrored string I.The gorillas have recently discovered that the image on the surface of the water is actually a reflection of themse...原创 2018-04-24 16:12:19 · 249 阅读 · 0 评论 -
GYM 101350J. Lazy Physics Cat
J. Lazy Physics Cat 题目描述Physics cat likes to draw shapes and figure out their area. He starts by drawing a circle. Then inside the circle, he draws the triangle X, Y, Z - where Y is the center poi...原创 2018-04-24 16:18:09 · 183 阅读 · 0 评论 -
2018 CodeM 资格赛 A.下单
下单题目描述美团在吃喝玩乐等很多方面都给大家提供了便利。最近又增加了一项新业务:小象生鲜。这是新零售超市,你既可以在线下超市门店选购生鲜食品,也可以在手机App上下单,最快30分钟就配送到家。 新店开张免不了大优惠。我们要在小象生鲜超市里采购n个物品,每个物品价格为ai,有一些物品可以选择八折优惠(称为特价优惠)。 有m种满减优惠方式,满减优惠方式只有在所有物品都不选择特价优惠时才能...原创 2018-06-04 13:46:35 · 366 阅读 · 0 评论 -
51Nod 1289 大鱼吃小鱼 ( 模拟
Orz 其实就是一个栈的模拟,因为鱼的位置是从左向右给出的,那么我们方向为右边的扔进栈中,方向为左的输入时候一定是最由的情况,#include <bits/stdc++.h>using namespace std;#define ls st<<1#define rs st<<1|1#define LL long longconst int ...原创 2018-06-27 21:19:20 · 191 阅读 · 0 评论 -
51Nod 2020 排序相减
数据好水。。。#include <bits/stdc++.h>using namespace std;#define ls st<<1#define rs st<<1|1#define LL long longconst int MAXN= (int) 26;int arr[MAXN];bool check(char ch) { ...原创 2018-06-28 16:00:08 · 145 阅读 · 0 评论 -
Codeforces #410(div2) B. Mike and strings (暴力枚举
B. Mike and stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has n strings s1, s2, …, sn each consisting of lowercase English letters. I原创 2017-04-23 10:46:36 · 1014 阅读 · 0 评论 -
URAL - 1014 Product of Digits (模拟
Product of DigitsDescriptionYour task is to find the minimal positive integer number Q so that the product of digits of Q is exactly equal to N.InputThe input contains the single integer number N (0 ≤原创 2017-04-30 14:56:00 · 356 阅读 · 0 评论 -
HDoj1047Integer Inquiry(大数连续相加)
Integer InquiryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19438 Accepted Submission(s): 5087Problem DescriptionOne of the fi原创 2016-12-19 23:58:39 · 355 阅读 · 0 评论 -
LightOJ1078 Integer Divisibility (同余定理)
If an integer is not divisible by 2 or 5, some multiple of that number in decimal notation is a sequence of only a digit. Now you are given the number and the only allowable digit, you should report t原创 2016-12-19 00:03:20 · 278 阅读 · 0 评论 -
LightOJ1214 Large Division (大数求余,同余定理)
Given two integers, a and b, you should check whethera is divisible by b or not. We know that an integera is divisible by an integer b if and only if there exists an integerc such that a = b * c原创 2016-12-19 00:01:01 · 319 阅读 · 0 评论 -
hdoj2023杨辉三角(二位数组)
杨辉三角Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62736 Accepted Submission(s): 25884Problem Description还记得中学时候学过的杨辉三角吗?具体的定义这里原创 2016-12-18 23:52:39 · 320 阅读 · 0 评论 -
大数加法(递推)
#include#include#includeusing namespace std;int sum[100][10000];int main(){ int a,b,c,m,n,q; while(~scanf("%d%d%d",&a,&b,&c)){ if(a==0&&b==0&&c==0) { printf("0\n"); continue; }原创 2016-12-16 23:36:58 · 433 阅读 · 0 评论 -
HPUOJ1163: 大数A + B [字符串](水)
1163: 大数A + B [字符串]时间限制: 1 Sec 内存限制: 128 MB提交: 31 解决: 8[提交][状态][讨论版]题目描述给定两个整数A和B,让你求出A+B的值。输入第一行输入一个整数T,代表有T组测试数据。每组数据占两行,第一行输入一个整数A,第二行输入一个整数B。注:1=T=30,1=A,B=原创 2016-11-23 01:25:47 · 422 阅读 · 0 评论 -
lightoj 1338 - Hidden Secret! (字符串
1338 - Hidden Secret!Time Limit: 1 second(s) Memory Limit: 32 MB In this problem you are given two names, you have to find whether one name is hidden into another. The restrictions are:You can change原创 2017-04-02 23:51:49 · 396 阅读 · 0 评论 -
NYoj 906杨辉三角(二维数组)
杨辉三角时间限制:1000 ms | 内存限制:65535 KB难度:1描述 还记得中学时候学过的杨辉三角吗?具体的定义这里不再描述,你可以参考以下的图形:11 11 2 11 3 3 11 4 6 4 11 5 10 10 5 1输入输入数据包含多个测试实例,每个测试实例的输入只包含一个正整数n(1输出对应于每一个输入,请输出相应层数的杨辉三角,每原创 2016-12-06 20:38:16 · 362 阅读 · 0 评论 -
Poj1852Ants
AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15943 Accepted: 6868DescriptionAn army of ants walk on a horizontal pole of length l cm, each with a c原创 2016-12-15 20:21:30 · 228 阅读 · 0 评论 -
HDoj1715大菲波数(大数)
大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18616 Accepted Submission(s): 6256Problem DescriptionFibonacci数列,定义如下:f(1)=原创 2016-12-13 19:14:42 · 964 阅读 · 0 评论 -
入门训练 兰顿蚂蚁 (模拟
#兰顿蚂蚁 兰顿蚂蚁,是于1986年,由克里斯·兰顿提出来的,属于细胞自动机的一种。 平面上的正方形格子被填上黑色或白色。在其中一格正方形内有一只“蚂蚁”。 蚂蚁的头部朝向为:上下左右其中一方。 蚂蚁的移动规则十分简单: 若蚂蚁在黑格,右转90度,将该格改为白格,并向前移一格; 若蚂蚁在白格,左转90度,将该格改为黑格,并向前移一格。 规则虽然简单,蚂蚁的行为却十分复杂。刚刚开始原创 2017-03-25 17:08:21 · 449 阅读 · 0 评论 -
Codeforces 803 B. Distances to Zero (模拟
B. Distances to ZeroDescriptionYou are given the array of integer numbers a0, a1, …, an - 1. For each element find the distance to the nearest zero (to the element which equals to zero). There is at le原创 2017-04-29 14:28:01 · 680 阅读 · 0 评论 -
CodeForces - 1006D Two Strings Swaps
题意:原创 2018-07-18 22:25:46 · 173 阅读 · 0 评论