Demo entry 4108226

hledani cesty v poli

   

Submitted by anonymous on Mar 20, 2016 at 16:08
Language: C++. Code size: 340 Bytes.

#include <iostream>

//Hledání nejkratší cesty v diskrétním poli

using namespace std;

int main(){

for(int i = 0; i < 987; i++){
		for(int m = 0; m < 13; m++){
			int a = pole[i+m] - '0';
			pole2[m] = a;
		}
		for(int j = 0; j < 13; j++)
		num2 *= pole2[j];
		(num < num2) ? num = num2: 0;
		num2 = 1;
	}

return 0;
}

This snippet took 0.01 seconds to highlight.

Back to the Entry List or Home.

Delete this entry (admin only).