hdu 1295 Move Move Look
来源:互联网 发布:parsley.js 手册 编辑:程序博客网 时间:2024/06/05 05:45
找出规律即可。
#include <iostream>#include<stdio.h>using namespace std; int main(){ int n; while(scanf("%d",&n)!=EOF) printf("%d\n",n); return 0;}
- hdu 1295 Move Move Look
- Move Move Look
- hdu 1295 Move Move Look 数学问题,代码能猜出来,思路想不通
- hdoj.1295 Move Move Look【水题】 2015/08/06
- Move
- Move
- Move
- Move..
- HDU 1050 move tables
- Move!Move!!Move!!!
- Move.c && Move.h
- Move.h && Move.c
- Move on
- Move函数
- ----Move on-----
- move 操作
- Move Type
- Oracle9i - move
- hdu 2647 Reward
- hdu 1811 Rank of Tetris
- hdu 1158 Employment Planning
- poj 1018 Communication System
- hdu 1827 Summer Holiday
- hdu 1295 Move Move Look
- poj 2367 Genealogical tree
- poj 3660 Cow Contest
- poj 3553 Task schedule
- C++ 简单实现HTTP GET/POST 请求
- poj 2488 A Knight's Journey
- 问题集2
- How compiler works
- AjaxPro版自动完成(Autocomplete)功能实现