zoukankan      html  css  js  c++  java
  • Educational Codeforces Round 7 A. Infinite Sequence 水题

    A. Infinite Sequence

    题目连接:

    http://www.codeforces.com/contest/622/problem/A

    Description

    Consider the infinite sequence of integers: 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5.... The sequence is built in the following way: at first the number 1 is written out, then the numbers from 1 to 2, then the numbers from 1 to 3, then the numbers from 1 to 4 and so on. Note that the sequence contains numbers, not digits. For example number 10 first appears in the sequence in position 55 (the elements are numerated from one).

    Find the number on the n-th position of the sequence.

    Input

    The only line contains integer n (1 ≤ n ≤ 1014) — the position of the number to find.

    Note that the given number is too large, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type.

    Output

    Print the element in the n-th position of the sequence (the elements are numerated from one).

    Sample Input

    10

    Sample Output

    4

    Hint

    题意

    数列是1,1,2,1,2,3,1,2,3,4,1,2,3,4,5这样的

    给你n,让你输出第n个数是什么

    题解:

    水题

    代码

    #include<bits/stdc++.h>
    using namespace std;
    
    int main()
    {
        long long n = 1;
        long long x;
        cin>>x;
        while(x>n)
        {
            x-=n;
            n++;
        }
        cout<<x<<endl;
    }
  • 相关阅读:
    云图小助理
    ping包的checksum校验和
    ftp相关
    初始化字符串
    安全的域名解析
    10进制转62进制
    centos6一键安装WordPress
    CEF3编译
    一次性生产KEY
    linux系统问题排查
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5187023.html
Copyright © 2011-2022 走看看