Only problem is in 8's test case.Can you send me the test number and result of 8?

Задача видимо не на полный перебор... 60% лимитов((

Как она решается(именно как и что мы ищем, кодирование я сам зделаю)

61% как ее без перебора решить?(...

Как это решить!???

Could you hint me on which version of Ruby and OS do you run the submitted code on? I am running Ruby 2.5.1 on MacOS and do not receive Runtime error for all the range of k: 1..50.

31 37 47(((((((((((

Находим первые 51 простых чисел(используем решето Эратосфена), а потом перемножаем их последовательно, чтобы получить нужное число пар множителей. Например для k = 3; n = 235 = 30. И т.д.

Что пацаны, прекалк? Чот мой комп и через час 31 не выплюнул, пойду думать:(

Это самый быстрый способ

можете написать правильные n для к от 3х до 8и пожалуйста

bullcode11 (~-2) >>> ~1 [1] : = k :: = >>>1<<< [1] >>> ~2 [1] : = n ? k > 1 [ :: = (~1[1]<k> - 1) * ~1[1]<k> * 2 ] ? k = 1 [ :: = 1 ] >>> menu || ~2[1]<n> <<< вышла новая версия bullcode решил переписать

include<bits/stdc++.h>

using namespace std; int main() {

long long n,a[101];
cin>>n;
a[1] = 1;
a[2] = 4;
a[3] = 12;
a[4] = 24;
a[5] = 36;
a[6] = 60;
a[7] = 192;
a[8] = 120;
a[9] = 180;
a[10] = 240;
a[11] = 576;
a[12] = 360;
a[13] = 1296;
a[14] = 900;
a[15] = 720;
a[16] = 840;
a[17] = 9216;
a[18] = 1260;
a[19] = 786432;
a[20] = 1680;
a[21] = 2880;
a[22] = 15360;
a[23] = 3600;
a[24] = 2520;
a[25] = 6480;
a[26] = 61440;
a[27] = 6300;
a[28] = 6720;
a[29] = 2359296;
a[30] = 5040;
a[31] = 3221225472;
a[32] = 7560;
a[33] = 46080;
a[34] = 983040;
a[35] = 25920;
a[36] = 10080;
a[37] = 206158430208;
a[38] = 32400;
a[39] = 184320;
a[40] = 15120;
a[41] = 44100;
a[42] = 20160;
a[43] = 5308416;
a[44] = 107520;
a[45] = 25200;
a[46] = 2985984;
a[47] = 9663676416;
a[48] = 27720;
a[49] = 233280;
a[50] = 45360;
cout<<a[n];

}

include<bits/stdc++.h>

using namespace std; int main() { long long n,i,s[101]; cin>>n;

s[1] = 1; s[2] = 4; s[3] = 12; s[4] = 24; s[5] = 36; s[6] = 60; s[7] = 192; s[8] = 120; s[9] = 180; s[10] = 240; s[11] = 576; s[12] = 360; s[13] = 1296; s[14] = 900; s[15] = 720; s[16] = 840; s[17] = 9216; s[18] = 1260; s[19] = 786432; s[20] = 1680; s[21] = 2880; s[22] = 15360; s[23] = 3600; s[24] = 2520; s[25] = 6480; s[26] = 61440; s[27] = 6300; s[28] = 6720; s[29] = 2359296; s[30] = 5040; s[31] = 3221225472; s[32] = 7560; s[33] = 46080; s[34] = 983040; s[35] = 25920; s[36] = 10080; s[37] = 206158430208; s[38] = 32400; s[39] = 184320; s[40] = 15120; s[41] = 44100; s[42] = 20160; s[43] = 5308416; s[44] = 107520; s[45] = 25200; s[46] = 2985984; s[47] = 9663676416; s[48] = 27720; s[49] = 233280; s[50] = 45360; cout<<s[n];

}

include <bits/stdc++.h>

using namespace std;

int main() { long long n,a[101]; cin>>n; a[1] = 1; a[2] = 4; a[3] = 12; a[4] = 24; a[5] = 36; a[6] = 60; a[7] = 192; a[8] = 120; a[9] = 180; a[10] = 240; a[11] = 576; a[12] = 360; a[13] = 1296; a[14] = 900; a[15] = 720; a[16] = 840; a[17] = 9216; a[18] = 1260; a[19] = 786432; a[20] = 1680; a[21] = 2880; a[22] = 15360; a[23] = 3600; a[24] = 2520; a[25] = 6480; a[26] = 61440; a[27] = 6300; a[28] = 6720; a[29] = 2359296; a[30] = 5040; a[31] = 3221225472; a[32] = 7560; a[33] = 46080; a[34] = 983040; a[35] = 25920; a[36] = 10080; a[37] = 206158430208; a[38] = 32400; a[39] = 184320; a[40] = 15120; a[41] = 44100; a[42] = 20160; a[43] = 5308416; a[44] = 107520; a[45] = 25200; a[46] = 2985984; a[47] = 9663676416; a[48] = 27720; a[49] = 233280; a[50] = 45360; cout<<a[n]; }