Algorithm study notes two -

1.#include<cstdio>

Standard C ++ header files

2. The algorithm notes -p6-ch3-B1011

(1) is an integer in the range [-2 * 31 * 31,2], so with the long long A defining an integer;% lld;

(2) continuous input three integers, to intermediate comma; Example scanf ( "% lld% lld% lld", & A, & B, & C);

3. The algorithm notes -p8-ch3-B1016

Given an integer, enumeration every bit of it

method:

while(a!=0){
		if(a%10==da){
			执行的操作；
		}
		a=a/10;
	}

4. Note algorithm -p12-B1008

To add address operator input array

Example:

	for(int i=0;i<n;i++){
		scanf("%d",&a[i]);
	}

In addressing the problem right circular array, the results can be directly input, irrespective movement; direct output sequence number 1 N-NM from the number of the element to the element, then the output element number 0 to number of the element to NM-1.

The algorithm notes -p13-B1012

Decimal output, accurate to one decimal place

	printf("%.1f ",(double)a4/count4);