Cod sursa(job #656258)
| Utilizator | Data | 4 ianuarie 2012 13:19:34 | |
|---|---|---|---|
| Problema | A+B | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
#define maxn 15001
ifstream in("adunare.in");
ofstream out("adunare.out");
long n,m,i,j;
vector <short> M[maxn];
long a,b;
int main()
{
for ( i=1; i<=maxn/32; i++ )
for ( j=1; j<=256; j++ )
M[i].push_back(j);
cout<<sizeof(M) + sizeof ( short ) * 256 * (maxn/32);
in>>a>>b;
out<<a+b;
return 0;
}
