UVA
素宇
这个作者很懒,什么都没留下…
展开
-
Puzzle
Puzzle 这个题就是我们小时候玩的拼图。 我感觉只要把那些存在的的情况考虑到了一般没问题。#include <stdio.h>#include <string.h>int main(){ char a[10][10],b[1010]; int t=0,x,y,x1,y1,flag; while(gets(a[0])){ if (a[0][0]==原创 2017-02-19 17:49:28 · 529 阅读 · 0 评论 -
Good Teacher UVA - 12662
Good Teacher UVA - 12662题目链接:https://cn.vjudge.net/problem/UVA-12662#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <vector>using namespace std;struct Node {原创 2017-07-28 09:58:34 · 279 阅读 · 0 评论 -
Funny Car Racing UVA - 12661
Funny Car Racing UVA - 12661 题目链接:https://cn.vjudge.net/problem/UVA-12661#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <vector>#include <queue>#define INF 0x3原创 2017-07-28 09:57:22 · 818 阅读 · 0 评论 -
Almost Palindrome UVA - 12656
Almost Palindrome UVA - 12656题目链接:https://cn.vjudge.net/problem/UVA-12656#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <cctype>using namespace std;const int max原创 2017-07-28 09:56:26 · 302 阅读 · 0 评论 -
Tiling UVALive - 6046
Tiling UVALive - 6046题目链接:https://cn.vjudge.net/problem/UVALive-6046#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <math.h>using namespace std;struct node{原创 2017-07-28 09:32:00 · 317 阅读 · 0 评论 -
Let's Go Green UVALive - 6039
Let’s Go Green UVALive - 6039 题目链接:https://cn.vjudge.net/problem/UVALive-6039#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <vector>using namespace std;vector<原创 2017-07-28 09:30:58 · 345 阅读 · 0 评论 -
Grandpa's Walk UVALive - 6038
Priyanka and Toys HackerRank - priyanka-and-toys Little Priyanka visited a kids’ shop. There are toys and their weight is represented by an array . Each toy costs 1 unit, and if she buys a toy with we原创 2017-07-28 09:29:52 · 207 阅读 · 0 评论 -
UVA - 12503
Robot Instructions #include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;int main(){ string a[110]; int t; scanf("%d",&t); while(t--){原创 2017-06-10 20:30:44 · 221 阅读 · 0 评论 -
UVA - 12504
Updating a Dictionary #include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <map>#include <string>using namespace std;int main(){ int t; char s[110],ss[110];原创 2017-06-10 20:31:35 · 282 阅读 · 0 评论 -
UVA - 12506
Shortest Names 比赛时队友直接上的纯暴力,结果超时,我就想先排一下序,之后每次判断相邻的两个,实时更新每个字符串的喊出长度#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <map>#include <string>#include <vector>usin原创 2017-06-10 20:34:29 · 227 阅读 · 0 评论 -
R - Floating-Point Numbers
R - Floating-Point Numbers Floating-point numbers are represented differently in computers than integers. That is why a 32-bit floating-point number can represent values in the magnitude of 1038 while原创 2017-03-11 15:57:53 · 259 阅读 · 0 评论 -
Crossword Answers
Crossword Answers A crossword puzzle consists of a rectangular grid of black and white squares and two lists of de nitions (or descriptions). One list of de nitions is for \words” to be written left原创 2017-02-23 21:28:48 · 374 阅读 · 0 评论 -
DNA Consensus String
DNA Consensus String Figure 1. DNA (Deoxyribonucleic Acid) is the molecule which con- tains the genetic instructions. It consists of four different nucleotides, namely Adenine, Thymine, Guanine, an原创 2017-02-23 21:27:40 · 386 阅读 · 0 评论 -
Repeating Decimals
Repeating Decimals The decimal expansion of the fraction 1/33 is 0 : 03, where the 03 is used to indicate that the cycle 03 repeats inde nitely with no intervening digits. In fact, the decimal expa原创 2017-02-23 21:26:38 · 343 阅读 · 0 评论 -
All in All
All in All You have devised a new encryption technique which encodes a message by inserting between its charac- ters randomly generated strings in a clever way. Because of pending patent issues we原创 2017-02-23 21:25:35 · 264 阅读 · 0 评论 -
Bone Collector
Bone Collector Time Limit: 1000MS Memory Limit: 65536KB Problem Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of原创 2017-02-18 15:57:13 · 459 阅读 · 0 评论 -
Circular Sequence
Circular Sequence 我的理解:刚开始没看题目只看到题的图时候,第一感觉好像是约瑟夫环,这个题的就是给你一个字符串,但是这个字符串的最后一个字符的后面是第一个字符,实际上就是构成了一个环,你需要做的就是把从环的任意一个位置把环跑一遍,找出ASCII最小的那个字符串。 我的思路是:建立一个字符串数组储存每一次的字符串,之后输出最小的就行了。#include <stdio.h>#i原创 2017-02-19 14:58:09 · 335 阅读 · 0 评论 -
Interesting Calculator UVA - 12664
Interesting Calculator UVA - 12664题目链接:https://cn.vjudge.net/problem/UVA-12664#include <cstdio>#include <cstring>#include <iostream>#include <vector>#include <queue>#define ms(s, x) memset(s, x, s原创 2017-07-28 10:40:00 · 250 阅读 · 0 评论