Cod sursa(job #1380248)
Utilizator | Data | 7 martie 2015 02:26:25 | |
---|---|---|---|
Problema | A+B | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.28 kb |
#include <fstream>
#include <algorithm>
using namespace std;
// int v[1000000];
int m;
ifstream f("adunare.in");
ofstream g("adunare.out");
int main()
{
for(int i = 0; i < 1000000; i++)
v[i] = i;
int n;
f >> n;
g << n;
return 0;
}