- 博客(10)
- 收藏
- 关注
RSS订阅原创 找规律！
Description有一串数列，只知道每一个数字都是前一个数字乘以一个整数A再加上一个整数B，但AB具体是多少就不知道了。现在给你这个数列的前三个数，求第四个数。Input三个整数x、y、z(-1000Output输出仅一行，包含要求的第四个数。但如果前三个数无法符合任何规律，则输出"impossible"。Sample Input0 3 18Sample Ou
2012-03-09 20:45:57
901
原创 NBU OJ1196
1196 骨牌铺放 Time Limit : 1000 MS | Memory Limit : 32768 KB Submits : 45 | Solved : 23 Description在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数.例如n=3时,为2× 3方格，骨牌的铺放方案有三种,如下图：Input输入数据由多行组成，
2012-02-26 16:39:55
1578
原创 1171最小公倍数
Input首先输入一个整数n表示有n个数，然后输入这n个整数。（nOutput求出n个整数的最小公倍数。Sample Input5 3 5 7 11 9Sample Output3465我的代码：#includeint main(){ int n,i,a[100],t=0; scanf("%d",&n); for(i=0;i
2012-02-24 13:28:30
497
原创 Light OJ 1042
This is the tale of Zephyr, the greatest time traveler theworld will never know. Even those who are aware of Zephyr's existence know verylittle about her. For example, no one has any clue as to which
2012-02-02 20:56:22
968
原创 Light OJ 1015
Sometimes I feel angry to arrange contests, because I am toolazy. Today I am arranging a contest for AIUB students. So, I made a plan.While they will be busy with the contest, as a punishment I will c
2012-01-31 21:02:18
930
原创 Light OJ 1022
A circle is placed perfectly into a square. The termperfectly placed means that each side of the square is touched by the circle,but the circle doesn't have any overlapping part with the square. See t
2012-01-31 13:21:53
712
原创 Light OJ 1008
1008 - Fibsieve`s Fantabulous Birthday .InputInput starts with an integer T (≤ 200),denoting the number of test cases.Each case will contain an integer S (1 ≤
2012-01-30 20:23:09
1196
原创 Lingt OJ 1006
1006int a, b, c, d, e, f;int fn( int n ) { if( n == 0 ) return a; if( n == 1 ) return b; if( n == 2 ) return c; if( n == 3 ) return d; if( n == 4 ) return e; if( n
2012-01-29 16:10:42
776
2
原创 Light OJ 1001
1001This problem gives you a flavor the concept of specialjudge. That means the judge is smart enough to verify your code even though itmay print different results. In this problem you are asked t
2012-01-29 14:42:21
1277
1
原创 Light OJ 1000
刚开始做light oj，就记录下自己做的，比较下其它大侠的代码1000求和我的代码：#includeintmain(){ int n,i,sum[200]; scanf("%d",&n); for(i=1;i { int a,b; scanf("%d%d",&a,&b); s
2012-01-29 13:29:30
580
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人