Cod sursa(job #1382507)
Utilizator | Data | 9 martie 2015 09:47:45 | |
---|---|---|---|
Problema | Diviz | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("diviz.in");
ofstream g("diviz.out");
int k,a,b,n,u,i=1,smx,smn,v[1000]; // 1 5 3 0 9 9 8
char m[1000];
int main()
{
f>>k>>a>>b;
while (f>>m[i]) {v[i]=m[i]-'0'; i++;}
smx=i-1-b;
smn=i-1-a;
for (k=smx;k<=smn;k++)
{
g<<k<<" ";
}
return 0;
}