A. Neverending competitions Codeforces Round #397
来源:互联网 发布:全角转半角 js 编辑:程序博客网 时间:2024/06/03 06:43
、、、、
#include<cstdio>int main(){ int n; scanf("%d", &n); if(n%2) printf("contest"); else printf("home"); return 0;}
阅读全文
1 0
- A. Neverending competitions Codeforces Round #397
- 【codeforces 765A】Neverending competitions
- Codeforces Round #397(Div. 1 + Div. 2 combined)A. Neverending competitions【水题】
- CF 397 A. Neverending competitions
- A. Neverending competitions
- 【Codeforces Round 397】Codeforces 765A-D
- codeforces Gym 101341 K Competitions
- codeforces round#283 A
- Codeforces Round #234A
- Codeforces Round #439 A
- codeforces div2 round#231 A
- codeforces div2 round#230 A
- Codeforces Round #2A Winner
- Codeforces Round #4A. Watermelon
- Codeforces Round #270 A~D
- Codeforces Round #274 A. Expression
- A. Expression(Codeforces Round #274)
- codeforces Round #474--A.Keyboard
- BZOJ-4034: [HAOI2015]树上操作 (树链剖分 入门题 子树整体修改 线段树 区间修改+查询)
- 《送你一颗子弹》精彩文章
- 深入浅出Mybatis系列(十)---SQL执行流程分析(源码篇)
- mybatis的mapper配置方式
- No Pain No Game(树状数组)
- A. Neverending competitions Codeforces Round #397
- centos6.4配置网络yum源
- Spring MVC入门知识总结
- Java IO流(二)
- Deep learning:一(基础知识_1)
- Linux环境下通过shell脚本一键安装redis
- vim无法使用系统剪切板的问题
- windows安装nvm 管理nodejs
- win10下Python3.5.4安装流程