CCF 201409-1: adjacent number pairs (100 points + problem solving ideas)

Problem description ：

Question number ：	201409-1
The title of the test question ：	Adjacent number pairs
The time limit ：	1.0s
Memory limit ：	256.0MB
Problem description ：	Problem description 　　 Given n Different integers , How many pairs of integers are there , Their values are just different 1. Input format 　　 The first line of input contains an integer n, Represents the number of given integers . 　　 The second line contains the given n It's an integer . Output format 　　 Output an integer , It means that the values are just different 1 The number of pairs of . The sample input 6 10 2 6 3 7 8 Sample output 3 Sample explanation 　　 The values are just different 1 The number of pairs includes (2, 3), (6, 7), (7, 8). Evaluate use case size and conventions 　　1<=n<=1000, The given integer is no more than 10000 Non-negative integer .

My thoughts ：

The difference is 1 The number of , So it's a two-layer loop , The number of outer loops minus the number of inner loops , Then we can get that the value is exactly different 1 The number is right .

Specific code ：

#include <iostream>
using namespace std; 

int main(int argc, char** argv) {
	int len,count=0;
	int a[1001];
	cin>>len;
	for(int i=0;i<len;i++){
		cin>>a[i];
	}
	
	for(int i=0;i<len;i++){
		for(int j=0;j<len;j++){
			if(a[i]-a[j]==1){
				count++;	
			}
		}
	}
	
	cout<<count<<endl;
	
	return 0;
}