Roly

题目：http://ac.jobdu.com/problem.php?pid=1553/* 　　分别算出时针和分针的度数，做差之后分几种情况讨论，(-360,-180),[-180,0),[0,180],(180,360). */#include int main(){ int h,m; while (~scanf("%d:%d",&h,&m)) {

Can you find it?TimeLimit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K(Java/Others)Total Submission(s): 4217 Accepted Submission(s):1049Problem DescriptionGive you three sequences

Luke's familyTimeLimit: 1 Second  MemoryLimit: 32MegabyteTotalsubmit: 80  Accepted: 22 DescriptionIn the stars’ family, Luke only has seen his father andgrandfather. He really wants to

Humble NumbersTimeLimit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 8304 Accepted Submission(s):3618Problem DescriptionA number whose only prime fa

统计元音Time Limit : 2000/1000ms (Java/Other) Memory Limit :65536/32768K (Java/Other)Total Submission(s) : 10 Accepted Submission(s) : 5Font: Times New Roman | Verdana |GeorgiaFont Size: ← →Problem

Lucky NumberTimeLimit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K(Java/Others)Total Submission(s): 1057 Accepted Submission(s):540Problem DescriptionTo Chinese people, 8 is a lucky

Ride to SchoolTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 15169Accepted: 6090DescriptionMany graduatestudents of Peking University are living in Wanliu Campus, which is

ASCII码排序Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 34205 Accepted Submission(s):14181Problem Description输入三个字符后，按各字符的ASCII码从小到大的顺序输出这三个

FriendTimeLimit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K(Java/Others)Total Submission(s): 816 AcceptedSubmission(s): 380Problem DescriptionFriend number are defined recursively

A hard puzzleTimeLimit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 14539 Accepted Submission(s):5135Problem Descriptionlcy gives a hard puzzle to f

Easier Done Than Said?TimeLimit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 3492 Accepted Submission(s):1771Problem DescriptionPassword security is

Problem 1913 Easy ComparisonAccept:205    Submit:284Time Limit: 1000mSec    MemoryLimit : 32768 KB1913 Easy Comparison （foj)" TITLE="Problem 1913 Easy Comparison （foj)" /> ProblemDescripti

直接暴力枚举，分别枚举hei#include #include #include #include #include #include using namespace std;typedef long long ll;const int maxn = 2005;int grid[maxn][maxn];ll a[maxn<<1],b[maxn<<1];int n;in

More is betterTimeLimit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K(Java/Others)Total Submission(s): 4897 Accepted Submission(s):1824Problem DescriptionMr Wang wants some boys to

C语言合法标识符Time Limit : 2000/1000ms (Java/Other) Memory Limit :65536/32768K (Java/Other)Total Submission(s) : 9 Accepted Submission(s) : 7Problem Description输入一个字符串，判断其是否是C的合法标识符。Input输入数据包含多个测试

Text ReverseTimeLimit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 7906 Accepted Submission(s):3015Problem DescriptionIgnatius likes to write words

Count (foj)" TITLE="2072 Count (foj)" /> Problem2072 CountAccept:110    Submit:295Time Limit: 1000mSec    MemoryLimit : 65536 KBCount (foj)" TITLE="2072 Count (foj)" /> ProblemDescriptio

A + B Problem IITimeLimit: 2000/1000 MS(Java/Others)    MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):108726    AcceptedSubmission(s): 20548Problem DescriptionI have a very

题目：http://acm.hdu.edu.cn/showproblem.php?pid=4515向前和向后略有不同#include#include #include using namespace std;bool leapyear(int year){    return(year%4==0&&year0!=0)||year@0==0;}intmonth[13]={0

骨牌铺方格TimeLimit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 11419 Accepted Submission(s):5575Problem Description在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出

成绩转换Time Limit : 2000/1000ms(Java/Other)   MemoryLimit : 65536/32768K (Java/Other)Total Submission(s) :9   AcceptedSubmission(s) : 7Problem Description输入一个百分制的成绩t，将其转换成对应的等级，具体转换规则如下：90~100为A

题目：http://codeforces.com/contest/304/problem/B#include #include #include string>#include string.h>#include #include #include #include #include #include #include #include #inclu

题目：http://acm.hdu.edu.cn/showproblem.php?pid=4422这题一开始没有理解题意，输入的n表示已经采摘的山头有几个，在这个时候会依次碰到他们，然后还可以继续采摘没有被采摘过的山，因此，当n#include#include#include#include#include#define ll long longusing

题目：http://acm.hdu.edu.cn/showproblem.php?pid=4054模拟题，因该是这场比赛最水的题了。#include #include #include #include using namespace std ;char str[4120];int main() {while (gets(str)){       i

http://acm.hit.edu.cn/hoj/problem/view?id=1138#include#include#include#includeusing namespace std;int s ,n ,len;char digit[10];int dig[5][20];void drawline(int s,int n){    fo

题目：http://ac.jobdu.com/problem.php?pid=1016有0，0，1   0，0，1 这种情况，开始没注意，结果Runtimeerror，在杭电上直接就WA，晕——#include#include #include #includeusing namespace std;char a[600],b[600];int as[600]

简单模拟题。思路：分别统计

密码Time Limit : 2000/1000ms (Java/Other) Memory Limit :65536/32768K (Java/Other)Total Submission(s) : 20 Accepted Submission(s) : 10Font: Times New Roman | Verdana |GeorgiaFont Size: ← →Problem

将图形分成几个部分，大框，两个小框，和递归部分（注意方向上下颠倒了）。然后递推的画出不同规模的图形 。#include #include #include using namespace std;const int maxn = 1200;char table[15][maxn][maxn];void draw(int id,int x,int y,int n){ fo