U E D R , A S I H C RSS

최소정수의합/허아영



~cpp 
#include <stdio.h>

int main()
{
     int n, sum;
     n = 1;
     sum = 0;
     while(sum <=3000)
     {
               sum +=n;
               n++;
     }
     printf("n = %d, sum = %d", n, sum);
     system("PAUSE");	
     return 0;
}
n ++ 하 . !! 1 큰 .
? ㅎㅎ

↓↓
~cpp 
#include <stdio.h>

int main()
{
     int n, sum;
     n = 0;
     sum = 0;
     while(sum <=3000)
     {         
               n++;
               sum +=n;
               
     }
     printf("n = %d, sum = %d", n, sum);
     system("PAUSE");	
     return 0;
}

한테 할



~cpp 
               sum +=n;
               n++;
. 행하 n 1.
~cpp 
               n++;
               sum +=n;
. n=1 n=0 . -

- ~ ^^ -



~cpp 
#include <stdio.h> 
 
int main() 
{ 
     double n, sum; 
     n = 0; 
     sum = 0; 

     while(sum <=18000000000000000000) 
     {          
               n++; 
               sum +=n; 
                
     } 
     printf("n = %f, sum = %f", n, sum);
	 system("PAUSE");
     return 0; 
} 
3000 ? int double 형 3000 18000000000000000000 . 한 행해 . . ? -

흠. -.- . 큰 .. -


Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:31:17
Processing time 0.0111 sec