Cod sursa(job #1612974)
Utilizator | Data | 25 februarie 2016 09:53:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<vector>
using namespace std;
int n,v[100005];
vector<int> a[100005];
int main(){
cin>>n;
for(int i= 1;i<=n;i++)
cin>>v[i];
for(int i=0;i<=n;i++){
a[i].resize(v[i]);
for(int j=0;j<v[i];j++)
cin>>a[i][j];
}
}