Cod sursa(job #2478565)
Utilizator | Data | 22 octombrie 2019 13:29:07 | |
---|---|---|---|
Problema | Algoritmul Bellman-Ford | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.19 kb |
#include <iostream>
using namespace std;
int x,i;
int main()
{
x=0;
for(i=0;i=i+2;i<1000)
{
x++;
if (x>50) break;
cout<<i;
}
return 0;
}