Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Find Missing And Repeating
- // Date : 15.09.19
- // Link : https://practice.geeksforgeeks.org/problems/find-missing-and-repeating/0
- #include<iostream>
- #include<cstdio>
- #include<map>
- #include<vector>
- using namespace std;
- int main(){
- int t; scanf("%d", &t);
- while(t--){
- int n; scanf("%d", &n);
- vector<int> a(n+1, 0);
- for(int i = 0; i < n; i++){
- int k; scanf("%d", &k);
- a[k]++;
- }
- //int k = 1;
- //bool mising = false, repeat = false, both = false;
- int mis = 0, repet = 0;
- for(int it = 1; it <= n; it++){
- auto temp = a[it];
- if(temp == 2) {repet = it;}
- if(temp == 0) {mis = it; }
- }
- //cout << repet << ' ' << mis << endl;
- printf("%d %d\n", repet, mis);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement