Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
来源:互联网 发布:九鼎彩社用的软件 编辑:程序博客网 时间:2024/06/06 00:00
特判就行了,用1,2来特判
#include <bits\stdc++.h>using namespace std;#define pb() push_back()#define mp make_pairconst int maxn=10;int main(){ //freopen("test.in","r",stdin);int n;cin>>n;if(n==1){ printf("1 1\n"); printf("1\n"); return 0; }printf("%d %d\n",n*2-2,2);printf("1 2\n"); return 0;}
阅读全文
0 0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- Codeforces MemSQL start[c]up Round 1
- MemSQL Start[c]UP 2.0 Round 2
- MemSQL Start[c]UP 2.0 - Round 2
- Codeforces Round MemSQL start[c]up Round 1
- CodeForces MemSQL start[c]up Round 1 A题
- codeforces MemSQL Start[c]UP 2.0 - Round 1 A. Eevee
- Codeforces MemSQL Start[c]UP 2.0 - Round 1
- Attention Is All You Need 论文阅读笔记
- 初识Node.js
- (M)Dynamic Programming: 413. Arithmetic Slices
- 伪类三角形
- 史上最全量化交易资源整理
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- mac OSX10.12 sierra 安装python-ldap报missing sasl.h错误
- 单例模式之懒汉的并发问题
- Java 数据结构
- 87.乱串追源
- Codeforces 863DYet Another Array Queries Problem
- 为什么V8引擎这么快?
- bzoj 2212(线段树合并)
- 干货 | 深度学习之DNN的多种正则化方式