SWexpertAcademy
-
7733. 치즈 도둑SWexpertAcademy 2019. 7. 14. 01:09
#include #include #include using namespace std; int test; int n; int result = 0; int a[100][100]; int d[100][100]; bool check[100][100]; int dx[] = {0,0,1,-1}; int dy[] ={1,-1,0,0}; void initial(){ for(int i = 0; i < 100; i++){ for(int j = 0; j < 100; j++){ a[i][j] = 0; d[i][j] = 0; check[i][j] = false; } } } void is(int day){ for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ if(a[i][j] = ..
-
7965. 퀴즈SWexpertAcademy 2019. 7. 12. 23:36
#include int t; unsigned long long d[1000001]; unsigned long long z(unsigned long long n, unsigned long long exp) { unsigned long long ans = 1; while (exp) { if (exp & 1) { ans = (ans * n); ans = ans % 1000000007; } n *= n; n %= 1000000007; exp >>= 1; } return ans % 1000000007; }//고속 제곱 함수 int main() { scanf("%d", &t); int n = 1; d[1] = 1; for (unsigned long long i = 2; i