Educational Codeforces Round 7--A. Infinite Sequence
来源:互联网 发布:jira 安装 mysql 编辑:程序博客网 时间:2024/04/25 23:34
找规律的题目:
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
。。。。
输入 一个n,求出第n个位置的数。
思路:
先求出第n个数所在的行,减去第一个数就行了,第一个数显然是个累加法的数列求法.
代码如下:
#include<bits/stdc++.h>#define mem(x) memset(x,0,sizeof(x));#define mem1(x) memset(x,-1,sizeof(x));using namespace std;const double eps = 1e-8;const int INF = 1e8;const int maxn = 10000 + 10;const int maxt = 100 + 10;typedef long long ll;typedef unsigned long long llu;int main(){ ll n,k; while(cin >> k){ double det = sqrt(1 - 4*(2-2*k)); ll n = (1+det)/2; cout << k-(n-1)*n/2 << endl; } return 0;}
0 0
- Educational Codeforces Round 7--A. Infinite Sequence
- Educational Codeforces Round 7 A. Infinite Sequence
- Educational Codeforces Round 7-A. Infinite Sequence(模拟)
- Codeforces Round #353 (Div. 2)-A. Infinite Sequence(模拟)
- Codeforces Round #353 (Div. 2) A. Infinite Sequence 思维题
- Codeforces Round #353 (Div. 2) A Infinite Sequence
- Codeforces Round #353 (Div. 2) -- A. Infinite Sequence
- Codeforces Round #353 (Div. 2) A. Infinite Sequence
- Codeforces Round #353 (Div. 2) A. Infinite Sequence
- Codeforces 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A Infinite Sequence
- CodeForces 622A-Infinite Sequence
- CodeForces 622A Infinite Sequence
- codeforces 675A Infinite Sequence
- CodeForces 675 A Infinite Sequence
- 【CodeForces】675A - Infinite Sequence
- Ubuntu 安装mysql和简单操作
- LoaderManager使用详解(二)---了解LoaderManager
- Python中使用正则表达式
- Java基础 十进制转十六进制
- Oracle基础查询综合示例
- Educational Codeforces Round 7--A. Infinite Sequence
- bzoj1691 挑剔的美食家
- Centos7 实现虚拟机和主机通信
- 10、协同过滤
- Android Studio—— 关于在Android Studio中使用Assets目录下的资源的问题
- NSInvocation用法简介
- 关于fragment多次调用onCreateView的问题
- http.client模拟登陆
- phpstorm的安装