(I7
I112
I150
(dp0
Vremoval.%l
p1
(Vremoval.cpp
p2
S'#include <iostream>\r\nusing namespace std;\r\nint chislo[5][1000000];\r\nint NOD(long long chislo0 , long long chislo1)\r\n{\r\n    if(chislo0 > 0 && chislo1 > 0)return NOD(min(chislo0,chislo1),(max(chislo0,chislo1)-min(chislo0,chislo1)));\r\n    return max(chislo0,chislo1);\r\n}\r\nint main()\r\n{\r\n    int n;\r\n    cin >> n;\r\n    int dulzh[n];\r\n    for(int i = 0 ; i < n ; i++)\r\n    {\r\n        cin >> dulzh[i];\r\n        for(int j = 0 ; j < dulzh[i] ; j++)cin >> chislo[i][j];\r\n    }\r\n    for(int i = 0 ; i < n ; i++)\r\n    {\r\n        int m_d = 0,seg_d;\r\n        for(int j = 0 ; j < dulzh[i] ; j++)\r\n        {\r\n            seg_d = 0;\r\n            bool bl1 = true;\r\n            for(int z = 2 ; z*z < chislo[i][j] && bl1 ; z++)\r\n            {\r\n                if(chislo[i][j] % z == 0)bl1 = false;\r\n            }\r\n            if(!bl1){\r\n                j++;\r\n            }\r\n            else{\r\n               for(int x = 0 ; x < dulzh[i] ; x++)\r\n               {\r\n                       if(chislo[i][j] > 1 && chislo[i][x]  > 1)\r\n                       {\r\n                           if(NOD(chislo[i][j],chislo[i][x]) > 1)\r\n                           {\r\n                               seg_d++;\r\n                           }\r\n                       }\r\n                   }\r\n               }\r\n           if(seg_d > m_d)m_d = seg_d;\r\n        }\r\n        cout << dulzh[i]-m_d << "\\n";\r\n    }\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.