簡単なアルゴリズム2

#include<iostream>
#include<stdio.h>
#include<iomanip>
#include<conio.h>
using namespace std;
void main()
{
	float a=1.0f;
	cout<<(int)a<<endl;
	cout<<&a<<endl;
	cout<<(int&)a<<endl;
	cout<<boolalpha<<((int)a == (int&)a)<<endl;

	float b=0.0f;
	cout<<(int)b<<endl;
	cout<<&b<<endl;
	cout<<(int&)b<<endl;
	cout<<boolalpha<<((int)b == (int&)b)<<endl;

	float c=-0.0f;
	cout<<(int)c<<endl;
	cout<<&c<<endl;
	cout<<(int&)c<<endl;
	cout<<boolalpha<<((int)c == (int&)c)<<endl;
}


  N!
#include<iostream>
using namespace std;
int main()
{
	int N,i,j,k;
	int *p = (int*)calloc(1000,sizeof(int));
	p[1]=1;//init value is one
	int length = 1;//init length is one
	int total;//       
	int push = 0;//    
	cout<<"input"<<endl;
	cin>>N;
	
	for(i = 1 ; i<=N ; i++ ){
		for(j = 1; j<=length; j++){
			total = p[j]*i + push;
			p[j] = total%10;
			push = total/10;
			if(length == j && push!=0 )
				length++;
		}

	}
	cout<<N<<"! is as following"<<endl;
	for(k=length;k>0;k--)
		cout<<p[k];
	cout<<endl;

	return 0;

}