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? Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others) Total Submission(s): 4217 Accepted Submission(s): 1049 Problem Description Give you three sequences

Luke's family TimeLimit: 1 Second   MemoryLimit: 32 Megabyte Totalsubmit: 80   Accepted: 22   Description In the stars’ family, Luke only has seen his father and grandfather. He really wants to

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

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

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

Ride to School Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 15169 Accepted: 6090 Description Many graduate students 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): 14181 Problem Description 输入三个字符后，按各字符的ASCII码从小到大的顺序输出这三个

Friend Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 816 Accepted Submission(s): 380 Problem Description Friend number are defined recursively

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

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

Problem 1913 Easy Comparison Accept: 205    Submit: 284 Time Limit: 1000 mSec    Memory Limit : 32768 KB 1913 Easy Comparison （foj)" TITLE="Problem 1913 Easy Comparison （foj)" /> Problem Descripti

直接暴力枚举，分别枚举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 better Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others) Total Submission(s): 4897 Accepted Submission(s): 1824 Problem Description Mr 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) : 7 Problem Description 输入一个字符串，判断其是否是C的合法标识符。 Input 输入数据包含多个测试

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

Count (foj)" TITLE="2072 Count (foj)" /> Problem 2072 Count Accept: 110    Submit: 295 Time Limit: 1000 mSec    Memory Limit : 65536 KB Count (foj)" TITLE="2072 Count (foj)" /> Problem Descriptio

A + B Problem II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 108726    Accepted Submission(s): 20548 Problem Description I 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; } int month[13]={0

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

成绩转换 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 9   Accepted Submission(s) : 7 Problem 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 long using

题目：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 #include using 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 这种情况，开始没注意，结果Runtime error，在杭电上直接就WA，晕—— #include #include #include #include using 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) : 10 Font: Times New Roman | Verdana | Georgia Font 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