[2016-05-10] [51nod] [1015 Daffodil Count]

• Time: 2016-05-10-16:23:29 Tuesday
• Title Number: [2016-05-10][51nod][1015 Narcissus number]
• Main topic:
  • Narcissus number refers to an n-digit (n >= 3), and the sum of the number of its digits on each bit is equal to its own. (Example: 1^3 + 5^3 + 3^3 = 153),
  • Given an integer m, the minimum number of daffodils for >= M is obtained.
• Analysis: Just figure out the first few daffodils.

  
 

   
  

  
#include<stdio.h>
   
  

  
using namespace std;
   
  

  
int main(){
   
  

  
 int m;
   
  

  
 scanf("%d",&m);
   
  

  
 if(m > 407){
   
  

  
 puts("1634");
   
  

  
 }else if(m > 371){
   
  

  
 puts("407");
   
  

  
 }else if(m > 370){
   
  

  
 puts("371");
   
  

  
 }else if(m > 153){
   
  

  
 puts("370");
   
  

  
 }else puts("153");
   
  

  
}
  
 

From for notes (Wiz)

[2016-05-10] [51nod] [1015 Daffodil Count]