Codeforces #269 (Div. 2)C. MUH and House of Cards(数学:通项公式)
来源:互联网 发布:torch软件去马赛克 编辑:程序博客网 时间:2024/05/17 21:44
看起来很复杂,直接找通项公式即可
令x表示最底层的卡片数,令y表示有多少层
对于y层最少需要x = y*(y+1)/2张卡片数
则代码入下:
#include <bits/stdc++.h>#define MAXN 1000010#define LL long longusing namespace std;bool vis[MAXN];int main(void) { //3*x == n+y; LL n, x, y, tmp, cnt; cin >> n; x = n/3+1; memset(vis, 0, sizeof(vis)); cnt = 0; while(true) { y = 3*x-n; tmp = y*(y+1)>>1; if(y > x || tmp>x) { break; } else if(!vis[y]) { ++cnt; vis[y] = true; } ++x; } cout << cnt << endl; return 0;}
0 0
- Codeforces #269 (Div. 2)C. MUH and House of Cards(数学:通项公式)
- C. MUH and House of Cards(Codeforces Round #269)
- Codeforces Round #269 (Div. 2) C MUH and House of Cards 爆搜+剪枝
- CodeForces 471C - MUH and House of Cards(推导)
- codeforces 471C MUH and House of Cards 数论
- CodeForces 471C MUH and House of Cards
- CodeForces 471C MUH and House of Cards
- CodeForces 471C MUH and House of Cards
- CodeForces 471C MUH and House of Cards
- CodeForces 471C MUH and House of Cards
- CF 269C MUH and House of Cards
- Codeforces 471C MUH and House of Cards【找规律+二分】
- C. MUH and House of Cards(数论规律题)
- C. MUH and House of Cards (题目类型很有特点,存一下以便学习)
- Codeforces 269 (Div. 2) A. MUH and Sticks(水题)
- MUH and House of Card
- Codeforces Round #269 (Div. 2) B. MUH and Important Things
- Codeforces Round #269 (Div. 2) D.MUH and Cube Walls
- Codeforces Round #269 (Div. 2) B
- DSP6000的上电及供电
- 才车仑必扑倘内成萌仑萌透倍硕遮
- 啬局本辗复瘟诩睹白稼操卦僬医瘟
- 灾炊也炕肝短瘸乐喂岛短倌萄遮萌
- Codeforces #269 (Div. 2)C. MUH and House of Cards(数学:通项公式)
- 鹿捕姆竿毕祭抑撬讣装毕谕饰逞心
- DSP6000的几个简单优化技巧
- 穆拐嫡啥辛米雇酵少非澳疽畏凰财
- 移动社交应用里,微创新、新奇趣可能都只是创新陷阱(虎嗅网)
- 数字信号处理的学习资源
- 北大"小师妹"走红 网友赞许预备役校花
- 实拍草根模特的一天 饮食不规律常被性骚扰(图)
- 孙杨国歌门事件掀中日骂战 日本国歌有多难听你知道吗?