- 博客(51)
- 收藏
- 关注
原创 rust实现Fibonacci数列
v以for循环实现,v1以递归方式实现fn fun(mut v: Vec<i32>, n: usize, i: usize) -> Vec<i32>{ match i < n { true => { let tmp = v[i-1] + v[i-2]; v.push(tmp); ...
2019-03-19 17:13:26 858
原创 Codeforces 710C_Magic Odd Square(构造)
C. Magic Odd Squaretime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFind an n × n matrix with different numb
2016-09-01 20:13:28 385
原创 UVA 12291 Polyomino Composer
1.若sma(small中‘*’的个数)!=lar(large中'*'的个数),必不成立。2.求出small的有效长height宽width,然后枚举i(0~n-height),j(0~n-width),找出第一个与small匹配的位置,并将其copy到origin数组,在找第二次的时候每找到与small匹配的位置都要与origin遍历一次看是否有重合,若没有即输出1。代码如下:#in
2016-07-24 10:00:26 335
原创 POJ 1860 最短路
Bellman Ford可以求是否存在负权回路,我们把他改成求正权回路。#include <cstdio>#include <cstring>#include <algorithm>#include <queue>#include <cmath>#include <set>#include <iostream>const double PI=acos(-1.0);using name
2016-07-23 10:37:57 292
原创 POJ3295
/***********************************Problem: 3295 User: 626478972Memory: 212K Time: 16MSLanguage: C++ Result: Accepted************************************/#include #include #include #incl
2016-07-19 10:04:46 322
原创 POJ2586
#include #include #include #include #include #include #include const double PI=acos(-1.0);using namespace std;typedef long long ll;int main(){ int s,d; while(~scanf("%d%d",&s,&d))
2016-07-19 10:02:54 296
原创 POJ1328
#include #include #include #include #include #include #include const double PI=acos(-1.0);using namespace std;typedef long long ll;struct node{ int x,y; double l,r;}isl[1005];doub
2016-07-19 10:01:52 304
原创 POJ2965-The Pilots Brothers' refrigerator
与POJ1753思想基本一致,刚开始用栈记录路径,结果超时,后来想用两个数组覆盖路径即可。#include #include #include #include #include #include #include const double PI=acos(-1.0);using namespace std;typedef long long ll;bool str[6][
2016-07-17 17:10:32 226
原创 POJ1753-Flip Game
Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 39581 Accepted: 17186DescriptionFlip game is played on a rectangular 4x4 field with two-sided p
2016-07-17 16:15:55 216
原创 Uva 10340 - All in All
#include#include#include#includeusing namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1int main(){ char ch[210005],s[210005]; while(~scanf("%s%s",ch,s)) { int j=0,
2016-07-15 10:14:56 222
原创 UVa 1225
#include#include#include#includeusing namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1int dp[10000+10][11];void fun(int n){ int nn=n; while(nn) { int temp=nn%10;
2016-07-15 09:56:45 324
原创 hdu 5651
xiaoxin juju needs helpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1376 Accepted Submission(s): 392Problem DescriptionAs
2016-03-31 18:49:42 380
原创 hdu 1087
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30593 Accepted Submission(s): 13705Problem Descript
2016-03-14 18:39:35 267
原创 poj 3723 Conscription(最大生成树)
ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10171 Accepted: 3574DescriptionWindy has a country, and he wants to build an army to protect
2016-03-04 18:45:15 287
原创 hdu 5596__GTW likes gt
GTW likes gtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 727 Accepted Submission(s): 264Problem DescriptionLong long ago
2015-12-15 20:58:41 383
原创 CodeForces 602C__The Two Routes
C. The Two Routestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Absurdistan, there are n towns (number
2015-12-02 20:28:18 492
原创 Codeforces 505B __Mr. Kitayuta's Colorful Graph(floyd)
B. Mr. Kitayuta's Colorful Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Kitayuta has just bough
2015-11-24 19:16:05 325
原创 CF593A__2Char
A. 2Chartime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndrew often reads articles in his favorite magazi
2015-11-09 19:21:38 518
原创 hdu 5115__Dire Wolf
Dire WolfTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1106 Accepted Submission(s): 623Problem DescriptionDire wolves, al
2015-10-25 16:12:34 383
原创 poj 3299__Humidex
HumidexTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19054 Accepted: 6885DescriptionAdapted from Wikipedia, the free encyclopediaThe humidex is a me
2015-10-21 19:35:38 325
原创 最长公共子序列
输入第1行:字符串A第2行:字符串B(A,B的长度 输出输出最长的子序列,如果有多个,随意输出1个。输入示例abcicbaabdkscab输出示例abcadp的时候记录路径,从终点反向寻找路径即可代码如下:#include#incl
2015-10-20 15:20:14 377
原创 poj 1163__The Triangle(dp)
The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 41674 Accepted: 25203Description73 88 1 02 7 4 44 5 2 6 5(Figure
2015-10-13 20:54:17 284
原创 hdu 5119__Happy Matt Friends
Happy Matt FriendsTime Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 1642 Accepted Submission(s): 646Problem DescriptionMatt h
2015-10-09 19:27:41 316
原创 hdu 5131__Song Jiang's rank list
Song Jiang's rank listTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 799 Accepted Submission(s): 405Problem Description《Sh
2015-10-01 15:10:23 295
原创 hdu 5135__Little Zu Chongzhi's Triangles
Little Zu Chongzhi's TrianglesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 900 Accepted Submission(s): 497Problem Descriptio
2015-10-01 15:07:30 285
原创 hdu 5455__Fang Fang
Fang FangTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 987 Accepted Submission(s): 415Problem DescriptionFang Fang says she
2015-09-29 20:43:44 329
原创 hdu 5477__A Sweet Journey
A Sweet JourneyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 403 Accepted Submission(s): 223Problem DescriptionMaster Di pl
2015-09-29 19:49:17 317
原创 hdu5475__An easy problem(线段树单点更新)
An easy problemTime Limit: 8000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 593 Accepted Submission(s): 342Problem DescriptionOne day, a u
2015-09-28 20:02:01 349
原创 关于pow函数。
pow(),是math.h中的一个函数。通常我们用它来完成计算整数或者浮点数的n次方的操作。但是有可能在使用的过程中有些问题需要注意,以下所有代码编译工具都是codeblocks。比如下面这个简单的代码。#include#include#includeusing namespace std;int main(){ printf("%d\n",(int)pow(10,2
2015-09-10 20:14:32 1418
原创 hdu 5014__Number Sequence
Number SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2044 Accepted Submission(s): 798Special JudgeProblem Description
2015-09-09 21:10:32 291
原创 hdu 5012__Dice
DiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1457 Accepted Submission(s): 746Problem DescriptionThere are 2 special di
2015-09-09 20:31:41 375
原创 hdu 5241__Friends
FriendsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 582 Accepted Submission(s): 293Problem DescriptionMike has many frie
2015-09-07 17:41:41 474
原创 hdu 5245__Joyful
JoyfulTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 515 Accepted Submission(s): 224Problem DescriptionSakura has a very mag
2015-09-06 19:22:58 418
原创 hdu 5239__Doom
DoomTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 705 Accepted Submission(s): 171Problem DescriptionTHE END IS COMINGGGG
2015-09-05 15:44:09 591
原创 hdu 5237__Base64
Base64Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 546 Accepted Submission(s): 221Problem DescriptionMike does not want ot
2015-09-05 10:13:00 576
原创 hdu 4006__The kth great number(STL)
The kth great numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 8641 Accepted Submission(s): 3407Problem DescriptionXiao Ming
2015-09-04 08:44:45 355
原创 poj 2240__Arbitrage (Floyd)
ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18152 Accepted: 7676DescriptionArbitrage is the use of discrepancies in currency exchange rates t
2015-09-03 09:58:21 277
原创 Codeforces 570B__Simple Game
链接请戳这里:Simple GameB. Simple Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Misha and And
2015-08-20 14:50:03 426
原创 Codeforces 569B__Inventory
B. Inventorytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCompanies always have a lot of equipment, furni
2015-08-20 14:30:16 384
原创 codeforces 569A__Music
A. Musictime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Lesha loves listening to music via his smar
2015-08-19 15:12:17 455
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人