Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Good pairs
#include <bits/stdc++.h> using namespace std; int main() { int numsSize; cout<<"Enter the total size in nums:"<<endl; cin>>numsSize; int nums[numsSize]; for(int k=0;k<numsSize;k++) {cin>>nums[k];} int i,j,count=0; for(i=0;i<numsSize;i++) { for(j=0;j<numsSize;j++) { if(nums[i]==nums[j] and i<j) {count=count+1;} } } cout<<"Good pairs is: "<<count; return 0; }
run
|
edit
|
history
|
help
1
VecCrossProd
strict aliasing
1
Segmented Sieve
map_find
Days in month database using unordered_map
append
1068 - Investigation
Wipro Problem 2: determine count
Programa 3 (corregido)