|
|
вернуться в форумStrong tests :) First , I wrote fast exponentiation for two choises of modulo but then i submited the following program : # include <bits/stdc++.h> using namespace std; # define ll long long int main(void) { ll a,b,c; ll n; cin >> n; if (n==1) cout << "1 2 3"; else if (n==2) cout << "3 4 5"; else cout << -1; return 0; } And guess what , it got AC ! :) Re: Strong tests :) It is because Fermat's Last Theorem Re: Strong tests :) Never knew this in Graduation math :( |
|
|