Codeforces Round #236 402C - Searching for Graph
来源:互联网 发布:网络追逃 编辑:程序博客网 时间:2024/05/18 03:09
题目链接:http://codeforces.com/problemset/problem/402/C
莫名其妙的过了。。。。。。。只能想明白前两个条件,第三个想不出来了。。。。大概就是不能让边太密集。。第一次过掉C题
AC代码:
#include<stdio.h>int main(){ int t; scanf("%d",&t); while(t--) { int n,p; scanf("%d%d",&n,&p); int i,j,a=1,b=2,c; for(i=0;i<2*n+p;i++) { printf("%d %d\n",a,b); b++; if(b>n) { a++;b=a+1; } } } return 0;}
0 0
- Codeforces Round #236 402C - Searching for Graph
- Codeforces Round #236 (Div. 2)C. Searching for Graph
- codeforces #402C Searching for Graph 构造
- Codeforces 402C Searching for Graph【构造】
- codeforces Searching for Graph
- codeforces#236_div2_C Searching for Graph
- CF 402C - Searching for Graph
- cf 402c Searching for Graph
- CF 236 C. Searching for Graph
- Codeforces Round #236 (Div. 2)__Searching for Graph
- Codeforces Round #237 (Div. 2)-C. Restore Graph
- Codeforces Round #371 (Div. 2)D. Searching Rectangles交互题
- Codeforces Round #371 (Div. 1)B Searching Rectangles
- Codeforces Round #237 (Div. 2) / 404C Restore Graph (构造最短路径树)
- Codeforces Round #192 (Div. 1) C. Graph Reconstruction (随机化算法)
- Codeforces - AIM Tech Round (Div. 2)C - Graph and String(练习)
- Codeforces Round #237 (Div. 2)__Restore Graph
- Codeforces Round #372 Complete The Graph
- accessRules用法
- Android selector背景选择器 用法汇总
- LinuxCast学习笔记二十九rsyslog
- Java内存分区
- Union和Union All的区别
- Codeforces Round #236 402C - Searching for Graph
- c++常用函数及头文件
- SSH框架,AjaxJson显示数据,项目框架搭建;注意action跳转不用叹号,springMVC和springAnnotation要修改spring配置文件
- C++第二周作业
- 【VC++】(一):MFC在Picture control控件中显示Bitmap
- Java基础 之软引用、弱引用、虚引用
- LinuxCast学习笔记三十IPtable_basic
- Hibernate+Spring+Servlet整合开发中的分页显示方案
- 掃描工作原理