Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <vector>
- using namespace std;
- ifstream cin("ninjago.in");
- ofstream cout("ninjago.out");
- #define maxn 1000
- int T,n,m;
- int cost[maxn],euri[maxn];
- vector<int> graf[maxn];
- int main()
- {
- int x,y;
- char s[5];
- cin>>T>>n>>m;
- for(;m--;){
- cin>>x>>y>>s;
- graf[x].push_back(y);//gandestete ca la un vector de marimi variabile
- //Pentru costuri as face ceva ce e mult prea mult pentru tine :)
- //Deci mai tarziu
- }
- for(int i=1;i<=n;++i)
- for(int j=0;j<graf[i].size();++j)
- cout<<i<<' '<<graf[i][j]<<'\n';//afisarea nodurilor
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement