Hobbits' Party
来源:互联网 发布:人工智能次新股有哪些 编辑:程序博客网 时间:2024/04/30 05:36
Description
Everyone knows that hobbits love to organize all sorts of parties and celebrations. There aren hobbits living in the Shire. They decided to organize the Greatest Party (GP) that would last for several days. Next day the hobbits wrote a guest list, some non-empty set containing all the inhabitants of the Shire. To ensure that everybody enjoy themselves and nobody gets bored, for any two days (say, days A and B) of the GP there existed at least one hobbit, invited to come on day A and on day B. However, to ensure that nobody has a row, for any three different days A, B, C there shouldn't be a hobbit invited on days A, B and C. The Shire inhabitants are keen on keeping the GP going for as long as possible. Your task is given numbern, to indicate the GP's maximum duration and the guest lists for each day.
Input
The first line contains an integer n (3 ≤ n ≤ 10000), representing the number of hobbits.
Output
In the first output line print a number k — the maximum duration of GP in days. Then onk lines print the guest lists, (the guests should be separated by spaces). Print each guest list on the single line. Each list can contain an arbitrary positive number of hobbits. The hobbits are numbered with integers from 1 to n.
Sample Input
4
31 2 1 3 2 3
5
31 2 1 3 2 3
#include<stdio.h>int main(){ int n,m,k1,k2,i,j,b[150][150]; while(scanf("%d",&n)!=EOF) { for(m=3;m<=150;m++) { if(2*n<m*(m+1)) break; } printf("%d\n",m); n=m*(m-1)/2;h k1=1; k2=1; for(i=1;i<=m;i++) { for(j=i;j<=m-1;j++) { b[i][j]=k1++; } } for(j=1;j<=m-1;j++) { for(i=j+1;i<=m;i++) { b[i][j]=k2++; } } for(i=1;i<=m;i++) { for(j=1;j<=m-1;j++) printf("%d ",b[i][j]); printf("\n"); } } return 0;}
- Hobbits' Party
- 【CF 125C】 Hobbits' Party
- URAL 1533 Fat Hobbits
- Party
- Party
- Party
- Party
- Party
- CodeForces Gym 100646D Party Party Party
- Head First Java第3章练习“我是编译器”——Hobbits类
- Anniversary party
- JOJ2701 Party
- Party Lamps
- C2. Party
- B. Party
- BOOL party
- Anniversary Party
- Party Lamps
- HDU-4651 整数分解(生成函数)
- sqlite 清空表 自增长id还原为1
- FAT32转换成NTFS
- ORACLE 函数使用大全
- SecureCRT提示--数据库里没找到防火墙“无”
- Hobbits' Party
- 表和用户已经删除,但是数据文件的空间没有释放
- CentOS发送邮件(sendmail/mstmp)方法总结
- SOA On Tomcat专题4--整合步骤之准备
- SDJZU oj N的N次方
- 创建一个属于你自己的JavaScript库
- SQLSERVER 语句返回表结构
- IOS学习笔记41--图片的缩放(二)
- iOS 类的get set,属性等