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 | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
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 |
---|