Cod sursa(job #3133327)
| Utilizator | Data | 25 mai 2023 14:38:40 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int t;
class ListNode {
public:
int val;
ListNode *next;
};
unordered_map <ListNode*, int> reached;
int main() {
cin.tie(0);
ios :: sync_with_stdio(0);
cin >> t;
for (int query = 1; query <= t; ++query) {
}
ListNode *a = new ListNode;
a->val = 1;
a->next = new ListNode;
reached[a] = 1;
return 0;
}
