Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- mini=v[0]; // מספר הכי קטן
- for (i = 1; i < v.Length; i++)
- {
- if (v[i] < mini)
- mini = v[i];
- }
- public static int CountRezef(int[,]m,int k) // רצף מספרים
- {
- int i,count=0,big=0,p;
- for(i=0;i<m.GetLength(1)-1;i++)
- {
- if (m[k, i] == 1)
- {
- count++;
- p = i + 1;
- while (m[k, p] == 1)
- {
- count++;
- p++;
- }
- }
- if(count>big)
- big=count;
- count = 0;
- }
- return big;
- }
- public static int HiyuviS(int[,]m,int k)
- {
- int i; // לעבור על שורה
- for (i = 0; i < m.GetLength(1); i++)
- {
- if (m[k, i] < 0)
- return 0;
- }
- return 1;
- }
- public static int HiyuviA(int[,]m,int j)
- {
- int i; // לעבור על טור
- for (i = 0; i < m.GetLength(0); i++)
- {
- if (m[i, j] < 0)
- return 0;
- }
- return 1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement