text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long d, f, n = 0;
cin >> d;
f = pow(5, d);
if (d == 1)
cout << 5 << endl;
else
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
int main() {
long long int n;
scanf("%lld", &n);
printf("%d", 25);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 25;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
printf("25");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 0) {
cout << "1" << endl;
} else if (n == 1) {
cout << "5" << endl;
} else {
cout << "25" << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
long long n;
std ::cin >> n;
std ::cout << 25 << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
long long min(long long a, long long b) {
if (a <= b)
return a;
else
return b;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long n;
cin >> n;
;
cout << "25"
<< "\n";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
printf("25");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 25;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
long long n;
cin >> n;
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 1)
cout << "5" << endl;
else
cout << "25" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
;
int n;
cin >> n;
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::cout << "25\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int modulo(int a, long long b, int n) {
long long x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y) % n;
}
y = (y * y) % n;
b /= 2;
}
return x % n;
}
int main() {
long long n;
cin >> n;
cout << modulo(5, n, 100);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() { cout << 25; }
|
#include <bits/stdc++.h>
int main() {
long long int n;
scanf("%lld", &n);
printf("25");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long a, b = 1, c, d, i, j;
double e, f;
while (scanf("%lld", &a) == 1) {
if (a == 1)
printf("5\n");
else
printf("25\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int i;
cin >> i;
cout << 25 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << "25" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << 25;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
cout << "25" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << 25;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int five = 5;
long long int n;
cin >> n;
if (n == 1) {
cout << "5";
} else
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << 25;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 25 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
long long n;
cin >> n;
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long m;
int main() {
int t, C = 1;
while (scanf("%lld", &m) != EOF) {
printf("25\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
if (n == 1)
cout << "05" << endl;
else
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n;
cin >> n;
cout << "25\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long bigmod(long long a, long long p, long long m) {
long long res = 1 % m, x = a % m;
while (p) {
if (p & 1) res = (res * x) % m;
x = (x * x) % m;
p >>= 1;
}
return res;
}
int main() {
long long n;
cin >> n;
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
printf("25");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
double n;
scanf("%lf", &n);
printf("25\n");
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
cout << "25\n" << endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::cout << "25\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << "25";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << "25" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
puts("25");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long n;
cin >> n;
cout << 25 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int p = 1, i = 1;
long n;
cin >> n;
cout << "25";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() { cout << 25 << endl; }
|
#include <bits/stdc++.h>
int main() {
long long n, p;
std::cin >> n;
std::cout << 25;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long int p(long int i) {
long int ans = 1;
for (long int j = 0; j < i; j++) ans *= 2;
return ans;
}
int main() {
long long int n;
cin >> n;
cout << 25;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() { cout << "25"; }
|
#include <bits/stdc++.h>
int main() {
std::cout << "25\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << 25 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
cout << "25";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << "25";
}
|
#include <bits/stdc++.h>
int main() {
long long n;
scanf("%lld", &n);
printf("25");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n > 1) {
cout << 25 << endl;
} else if (n == 1) {
cout << 5 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int fast_power(long long int base, long long int power) {
long long int result = 1;
while (power > 0) {
if (power & 1) {
result = (result * base) % 1000000007;
}
base = (base * base) % 1000000007;
power /= 2;
}
return result;
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long n;
scanf("%I64d", &n);
printf("25\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
unsigned long long int s;
cin >> s;
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long k, m = 100;
void in(long long &x) {
long long y = 1;
char c = getchar();
x = 0;
while (c < '0' || c > '9') {
if (c == '-') y = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
x *= y;
}
void o(long long x) {
if (x < 0) {
putchar('-');
x = -x;
}
if (x > 9) o(x / 10);
putchar(x % 10 + '0');
}
int main() {
in(k);
cout << 25;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void FAST() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long binpow(long long a, long long b) {
if (b == 0) return 1;
long long res = binpow(a, b / 2);
if (b % 2 == 0)
return (res * res);
else
return (res * res * a);
}
long long HCF(long long a, long long b) {
if (a == 0)
return b;
else
return HCF(b % a, a);
}
long long LCM(long long a, long long b) { return ((a * b) / HCF(a, b)); }
int main() {
FAST();
long long n;
cin >> n;
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long pow, on = 0, tw = 0;
cin >> pow;
cout << 25 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n;
cin >> n;
;
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << 25;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
printf("25\n");
return 0;
}
|
#include <bits/stdc++.h>
int main() { printf("25"); }
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
while (cin >> n) {
cout << "25" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long int n, x;
int c;
scanf("%lld", &n);
x = pow(5, n);
c = x % 100;
if (c < 25)
printf("25");
else
printf("%d", c);
}
|
#include <bits/stdc++.h>
unsigned Montgomery(unsigned a, unsigned b, unsigned n) {
unsigned ans = 1;
a %= n;
while (b > 1) {
if (b & 1) ans = (ans * a) % n;
a = (a * a) % n;
b >>= 1;
}
return (ans * a) % n;
}
int main() {
long long int n;
scanf("%lld", &n);
printf("%u\n", Montgomery(5, n, 100));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MAX = 1e6;
long long int a[200010], dp[200020];
long long int aa[200010];
int arr[MAX], type[MAX];
int main() {
int a, b, c;
cin >> a;
cout << "25" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << 25 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << 25;
}
|
#include <bits/stdc++.h>
int main() {
std::cout << "25\n";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::cout << "25\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long int x;
cin >> x;
cout << 25;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0) return y;
return (gcd(y % x, x));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
cout << 25 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
cout << "25";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << "25" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
puts("25");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << "25";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << "25" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
cin >> a;
if (a == 0)
cout << 1 << endl;
else if (a == 1)
cout << 5 << endl;
else
cout << 25 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n) {
int k = 0;
for (int j = 2; j < sqrt(n); j++) {
if (j > n / 2) break;
if (n % j == 0) k++;
if (k > 0) {
return false;
break;
}
}
if (k == 0) return true;
}
bool isOnSameLine(int x1, int y1, int x2, int y2, int x3, int y3) {
return (y1 - y2) * (x1 - x3) == (y1 - y3) * (x1 - x2);
}
bool visited[200001], recStack[200001];
vector<vector<int> > G;
int N;
void BFS(int Start) {
queue<int> queue;
queue.push(Start);
vector<int>::iterator i;
while (!queue.empty()) {
Start = queue.front();
visited[Start] = true;
queue.pop();
for (i = G[Start].begin(); i != G[Start].end(); i++) {
if (!visited[*i]) queue.push(*i);
if (visited[*i]) {
N = *i;
return;
}
}
}
}
void bfs(int Start) {
queue<int> queue;
queue.push(Start);
vector<int>::iterator i;
while (!queue.empty()) {
Start = queue.front();
visited[Start] = true;
queue.pop();
for (i = G[Start].begin(); i != G[Start].end(); i++) {
if (!visited[*i]) queue.push(*i);
}
}
}
int main() {
int n;
cin >> n;
cout << 25;
}
|
#include <bits/stdc++.h>
int main() {
std::cout << "25\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a;
while (cin >> a) {
cout << 25 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
cout << "25" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
return x > 0 ? x : -x;
}
int m;
int n;
int main() {
cout << 25 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long fastPower(int a, long long b, int n) {
long long res = 1;
while (b > 0) {
if ((b & 1) != 0) {
res = ((res * a) % n) % n;
}
a = (a % n * a % n) % n;
b = b >> 1;
}
return res;
}
int main() {
long long n;
cin >> n;
cout << fastPower(5, n, 100);
}
|
#include <bits/stdc++.h>
long long power(long long);
int main() {
long long n, x;
scanf("%164d", &n);
x = power(n);
printf("%2d", x);
}
long long power(long long n) {
long long x;
if (n == 1) {
return 5;
} else if (n == 0) {
return 1;
} else {
return 25;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << "25" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
cout << 25;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
puts("25");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 25 << endl;
}
|
#include <bits/stdc++.h>
int main() {
long long a;
scanf("%d", &a);
printf("25");
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1005;
int main() {
long long n;
while (~scanf("%I64d", &n)) printf("25\n");
return 0;
}
|
#include <bits/stdc++.h>
long long int x;
int main() {
scanf("%lld", &x);
printf("25");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::cout << 25;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long n) {
if (n == 1) return 5;
long long M = power(n / 2);
if (n % 2 == 0)
return (M * M) % 100;
else
return (M * M * 5) % 100;
}
int main() {
long long n;
cin >> n;
cout << power(n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() { cout << 25 << endl; }
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cout << 25;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.