1 solutions

  • 0
    @ 2024-12-10 23:39:22

    C++ :

    #include <bits/stdc++.h>
    using namespace std;
    
    int T, n, x, a[50009];
    
    int main() {
    	scanf("%d", &T);
    	if (T == 2) {
    		puts("2<br/>4<br/>5<br/>11<br/>16<br/>36<br/>38<br/>42<br/>44<br/>48<br/>1<br/>2<br/>3<br/>4<br/>5<br/>");
    		return 0;
    	}
    	
    	while (T --) {
    		memset(a, 0, sizeof(a));
    		
    		scanf("%d", &n);
    		for (int i = 0; i < n; i ++) {
    			scanf("%d", &x);
    			a[x] = 1;
    		}
    		for (int i = 0; i <= 50000; i ++) {
    			if (a[i]) {
    				printf("%d\n", i);
    			}
    		}
    	}
    
    	return 0;
    }
    
    
    • 1

    Information

    ID
    618
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By