zoukankan      html  css  js  c++  java
  • 数学--数论-- HDU 2601 An easy problem(约束和)

    Problem Description

    When Teddy was a child , he was always thinking about some simple math problems ,such as “What it’s 1 cup of water plus 1 pile of dough ..” , “100 yuan buy 100 pig” .etc..
    One day Teddy met a old man in his dream , in that dream the man whose name was“RuLai” gave Teddy a problem :
    
    Given an N , can you calculate how many ways to write N as i * j + i + j (0 < i <= j) ?
    
    Teddy found the answer when N was less than 10…but if N get bigger , he found it was too difficult for him to solve.
    Well , you clever ACMers ,could you help little Teddy to solve this problem and let him have a good dream ?
    

    Input

    The first line contain a T(T <= 2000) . followed by T lines ,each line contain an integer N (0<=N <= 1010).
    

    Output

    For each case, output the number of ways in one line.
    

    Sample Input

    2
    1
    3
    

    Sample Output

    0 
    1
    

    在这里插入图片描述

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    using namespace std;
    
    int main(){
    	int t;
    	long long n,i,j,ans;
    	scanf ("%d",&t);
    	while (t--){
    		ans=0;
    		scanf ("%lld",&n);
    		n++;
    		for (i=2;i*i<=n;i++){
    			if (n%i==0)
    			ans++;
    		}
    		printf ("%lld
    ",ans);
    	}
    	return 0;
    }
    
  • 相关阅读:
    C#中小写人民币转大写
    Oracle中按规定的字符截取字符串
    Oracle中table数据数据类型
    Oracle中case的第二种用法
    javascript跳转页面
    C#添加二维码带加密带logo
    Oracle
    Oracle中with关键字的使用
    jquery
    插入排序,希尔排序原理,代码及复杂度分析
  • 原文地址:https://www.cnblogs.com/lunatic-talent/p/12798466.html
Copyright © 2011-2022 走看看