Find The Multiple 分类：搜索 POJ 2015-08-09 15:19 3人阅读评论(0) 收藏

【Find The Multiple 分类：搜索 POJ 2015-08-09 15:19 3人阅读评论(0) 收藏】的更多相关文章

Find The Multiple 分类：搜索 POJ 2015-08-09 15:19 3人阅读评论(0) 收藏

Find The Multiple Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21851 Accepted: 8984 Special Judge Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only t…

A Plug for UNIX 分类： POJ 图论函数 2015-08-10 14:18 2人阅读评论(0) 收藏

A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14786 Accepted: 4994 Description You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an interna…

哈希-Snowflake Snow Snowflakes 分类： POJ 哈希 2015-08-06 20:53 2人阅读评论(0) 收藏

Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 34762 Accepted: 9126 Description You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your…

XHTML 结构化：使用 XHTML 重构网站分类： C1_HTML/JS/JQUERY 2014-07-31 15:58 249人阅读评论(0) 收藏

http://www.w3school.com.cn/xhtml/xhtml_structural_01.asp 我们曾经为本节撰写的标题是:"XHTML : 简单的规则,容易的方针."原因之一是,本节讨论的规则和方针是简单和容易的.原因之二是,一本简单和容易的 WEB 设计图书,就像超级市场的新式的免费商品一样,虽然常见却可以有效地吸引人的眼球,这样的东西可以刺激人的兴趣,并且鼓励人们尝试. 我确实希望本节的内容可以激发你的兴趣,并鼓励你去尝试.为什么这么说呢?因为一旦你掌握了本章包…

POJ 1068 AC 2014-01-07 15:24 146人阅读评论(0) 收藏

POJ的题目都是英文的,所以,,,还是直接贴代码吧 #include<stdio.h> int main(){ int x,y,z; int n,nm,max; scanf("%d",&n); while(n--){ int num[60]={0}; scanf("%d",&nm); for(x = 0;x < nm; x++){ scanf( "%d",&y); num[ y+x+1 ]=1; } fo…

DZY Loves Chemistry 分类： CF 比赛图论 2015-08-08 15:51 3人阅读评论(0) 收藏

DZY Loves Chemistry time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output DZY loves chemistry, and he enjoys mixing chemicals. DZY has n chemicals, and m pairs of them will react. He wants to pou…