- 博客(6)
- 收藏
- 关注
RSS订阅原创 ZOJ Problem Set - 3702 Gibonacci number
Gibonacci number Time Limit: 2 Seconds Memory Limit: 65536 KB In mathematical terms, the normal sequence F(n) of Fibonacci numbers is defined by the recurrence relation F(n)=F(n-1)+F(n-
2014-04-30 01:20:06
811
原创 Codeforces Round #243 (Div. 2) C. Sereja and Swaps
A. Sereja and Swaps time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output As usual, Sereja has array a, its elemen
2014-04-28 14:15:51
1030
原创 ZOJ 3712 Hard to Play
Hard to Play Time Limit: 2 Seconds Memory Limit: 65536 KB MightyHorse is playing a music game called osu!. After playing for several months, MightyHorse discovered the way of calcu
2014-04-25 01:59:48
900
原创 POJ 3624 Charm Bracelet
Charm Bracelet Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20499 Accepted: 9293 Description Bessie has gone to the mall's jewelry store and spies a
2014-04-25 00:32:28
760
原创 Light OJ 1008- Fibsieve`s Fantabulous Birthday
直接模拟： #include #include using namespace std; int main() { int t; scanf("%d",&t); for(int ca=1;ca<=t;ca++) { long long n,x,r,c; scanf("%lld",&n); printf("Case %d: ",ca); x=sqrt(n);
2014-04-23 02:40:49
940
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人