Is this code below works on all platform with C++11 compiler?
I know that earlier we had to to use "%I64d" for Windows platform and "%lld" for linux like platforms.
long long = (long long)1e18;
printf("%lld\n", a);
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
2 | adamant | 160 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | atcoder_official | 148 |
6 | nor | 148 |
8 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Is this code below works on all platform with C++11 compiler?
I know that earlier we had to to use "%I64d" for Windows platform and "%lld" for linux like platforms.
long long = (long long)1e18;
printf("%lld\n", a);
Hello everybody, I have no idea to this problem, have you ?
Chess association decided to assign new phone numbers to all the members.
The new numbers should be produced with a knight's move on a phone keypad. 0 and 8 are not valid leading digits.
For instance, the number 340-49-27 matches the criteria.
7 8 9
4 5 6
1 2 3
0
Create a program that computes the number of different phone numbers with a length N.
1 ≤ N ≤ 56'789
It is standard problem with small N, which can be solved by dynamic programming.
I tried to solve it with Matrix Exponentiation (of size 10x10). But it also TL ( O(10 ^ 3 * logn * BigInt) ), because of the multiplying very big numbers.
Name |
---|