(I2
I39
I6
(dp0
Vfivediv.%l
p1
(Vfivediv.cpp
p2
S'#include<iostream>\r\n#include<cmath>\r\n\r\nusing namespace std;\r\n\r\nlong long finish;\r\n\r\nlong long my_pow(long long n)\r\n{\r\n    return n*n*n*n;\r\n}\r\n\r\nbool is_prime(long long n)\r\n{\r\n    finish = sqrt(n);\r\n    for(int d = 2;d<=finish;d++)\r\n        if(n%d==0) return false;\r\n\r\n    return true;\r\n}\r\n\r\nint main()\r\n{\r\n    long long n;\r\n\r\n    long long current_number = 2;\r\n\r\n    long long output = 0;\r\n\r\n     cin >> n;\r\n\r\n    while(true)\r\n    {\r\n        if(my_pow(current_number)<=n) output = output + my_pow(current_number);\r\n        else break;\r\n\r\n        current_number++;\r\n        while(is_prime(current_number)==false) current_number++;\r\n    }\r\n\r\n    cout << output << endl;\r\n}\r\n'
p3
tp4
stp5
.