Cod sursa(job #1425965)
| Utilizator | Data | 28 aprilie 2015 17:31:21 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#include <stack>
#include <bitset>
#define MAX 250001
using namespace std;
//bitset <1> viz[ 250002 ];
int main()
{
int n,m,p,q,i = 1;
// citesc cererile
/*
for(i = 0;i <= n ; i++){
cout<<i<<" : ";
for(int j = 0; j <cereri[i].size(); j++)
cout<<cereri[i][j]<<" ";
cout<<endl;
}
*/
return 0;
}
