湖南大学ACM程序设计新生杯大赛（同步赛）L-Liao Han【打表规律+二分】

时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 32768K，其他语言65536K
64bit IO Format: %lld
题目描述
Small koala special love LiaoHan (of course is very handsome boys), one day she saw N (N<1e18) guys standing in a row, because the boys had some strange character,The first time to Liao them will not be successful, but the second time will be successful; third times to Liao them will not be successful, but the fourth time will be successful;……. By analogy (toxic psycho)
So the little koala burst odd thought of a fancy up method. The N is the sum of handsome boys, and labeled from 1 to N, starting from the first guy, whose number is 1, she will Liao all the boys whose number is Multiple of 1, then number 2 and all the boys whose number is Multiple of 2(toxic method)
Later, little Kola found that some handsome guys did not get her Liao, she asked the smart you to help her look for how many handsome guys did not successfully be Liaoed?

输入描述:
Multiple groups of Case. (no more than 10000 groups)
Each group of data is 1 lines, with an integer N per line.
The N is 0 at the end of the input.
输出描述:
Each group of Output1 rows, a number of 1 lines representing the number of boys with no Liao to the group of data.
示例1
输入

1
2
3
4
0
输出

1
1
1
2

分析：打表找个规律。

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
#define ll long long int
using namespace std;
const ll maxn = 1e18;
const ll m = 2e9+10;
//void init() {//  ll tmp = 3; int i;
//  ll ans = 0;
//  for (i = 1;; i++) {//      if (ans > maxn) break;
//      ans += tmp;
//      a[i] = ans;
//      tmp += 2;
//  }
//  len = i-1;
//}
ll judge(ll x) {return x*(3 + x * 2 + 1)/2;
}
int main() {ll n;while (scanf("%lld", &n) && n) {int L = 1, R = m ,mid;while (L < R) {mid = (L + R) / 2;if (judge(mid)>= n) {R = mid;}else {L = mid + 1;}}printf("%d\n", L);}return 0;
}

湖南大学ACM程序设计新生杯大赛（同步赛）L-Liao Han【打表规律+二分】相关推荐

湖南大学第十四届ACM程序设计新生杯（重现赛）- FFind the AFei Numbers(数位dp)
题目链接题目描述 AFei loves numbers. He defines the natural number containing "520" as the AFei n ...
湖南大学第十四届ACM程序设计新生杯（重现赛）L-The Digits String (矩阵快速幂)
题目链接题目描述 Consider digits strings with length n, how many different strings have the sum of digits a ...
第八届“图灵杯”NEUQ—ACM程序设计竞赛个人赛（同步赛）
A题--切蛋糕龙龙有一块蛋糕,现在他想将蛋糕平均切成k块,分给他的k名hxd.但是不幸的是,因为龙龙不擅长切蛋糕,他每一次只能将一块蛋糕平均分成两份.例如,将一块大小为1的蛋糕分割成两块大小为1/2 ...
师创杯”山东理工大学第九届ACM程序设计竞赛（网络同步赛）--I皮卡丘的梦想2
作为水题王者前去水了一波山东理工大学的校赛,这道题一个小细节坑了我2个小时,思路其实很简单,就是线段树单点更新的模板,用一个60的数组标记,如果这个区间内有I种类的化石,那么就是1,否则为0,加入新化 ...
2021暨南大学轩辕杯ACM程序设计新生赛题解
title : 2021暨南大学轩辕杯ACM程序设计新生赛 date : 2021-12-12 tags : ACM,练习记录 author : Linno 题目链接:https://ac.nowco ...
第八届“图灵杯”NEUQ-ACM程序设计竞赛个人赛（同步赛） 2021.1.30
第八届"图灵杯"NEUQ-ACM程序设计竞赛个人赛(同步赛) B小宝的幸运数组 C上进的凡凡 D Seek the Joker I E Seek the Joker II H 数羊 ...
第八届“图灵杯”NEUQ-ACM程序设计竞赛个人赛（同步赛）解题报告
第八届"图灵杯"NEUQ-ACM程序设计竞赛个人赛(同步赛) 题目总结 A题切蛋糕题目信息解题思路如果我们将 1/k展开到二进制的形式,那么就可以计算出需要多少块1/( ...
第十二届蓝桥杯大赛软件赛省赛 Python 大学 A 组试题
第十二届蓝桥杯大赛软件赛省赛 Python 大学 A 组试题大家好,我叫亓官劼(qí guān jié ),在GitHub & CSDN中记录学习的点滴历程,时光荏苒,未来可期,加油~ ...
蓝桥杯大赛软件赛省赛，C/C++大学B组，改革后2019-2021真题知识点分类
1.蓝桥杯比赛时长: 四个小时比赛规则: 蓝桥杯比赛跟天梯赛.ACM还不太一样,比赛中提交的答案并没有反馈机制,也就是说你提交了答案以后,自己并不知道是对是错,就像考试一样,只有交了卷,成绩下来以 ...
第十三届蓝桥杯大赛软件赛省赛真题
第十三届蓝桥杯大赛软件赛省赛Java 大学 B 组文章目录第十三届蓝桥杯大赛软件赛省赛Java 大学 B 组 [考生须知] 试题 A: 星期计算试题 B: 山试题 C: 字符统计试题 D: ...

湖南大学ACM程序设计新生杯大赛（同步赛）L-Liao Han【打表规律+二分】

湖南大学ACM程序设计新生杯大赛（同步赛）L-Liao Han【打表规律+二分】相关推荐

最新文章

热门文章