Cod sursa(job #3268967)
Utilizator | Data | 18 ianuarie 2025 09:57:33 | |
---|---|---|---|
Problema | Cuplaj maxim in graf bipartit | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
///sortaret
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int i,j,n,m,x,y,f[500010],p,maxi,d[500010];
vector <int> v[500010];
queue <int> q;
set <int> se;
char sir1[110],sir2[110];
int main()
{
cin.tie(0);
cout.tie(0);
fin>>n;
for(i=1;i<=n;i++)
return 0;
}