1 solutions
-
0
#include <bits/stdc++.h> using namespace std; #define int long long const int mod = 1e9 + 7; void solve(){ int n; cin >> n; int ans = ((n % mod) * (n % mod)) % mod; cout << ans << endl; } signed main(){ ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int T = 1; // cin >> T; while(T--){ solve(); } return 0; }
- 1
Information
- ID
- 484
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 9
- Tags
- (None)
- # Submissions
- 191
- Accepted
- 20
- Uploaded By