Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <stdio.h> int main(){ int tc,n; const long long mod = 1000000007; scanf("%d",&tc); for(int i=1;i<=tc;i++){ scanf("%d",&n); long long temp[n][n]; long long m[n][n]; long long r[n][n]; for(int j=0;j<n;j++){ for(int k=0;k<n;k++){ scanf("%lld",&m[j][k]); } } for(int b=0;b<n;b++){ for(int d=0;d<n;d++){ r[b][d]=m[b][d]; } } for(int i=0;i<n-1;i++){ long long sum = 0; for (int b=0;b<n;b++){ for (int d=0;d<n;d++){ for(int k=0;k<n;k++){ sum += m[b][k]*r[k][d]%mod; } temp[b][d] = sum%mod; sum = 0; } } for (int b=0;b<n;b++){ for (int d=0;d<n;d++){ r[b][d] = temp[b][d]; } } } printf("Case #%d:\n",i); for(int j=0;j<n;j++){ for(int k=0;k<n;k++){ if(k==n-1){ printf("%lld\n",r[j][k]%mod); }else{ printf("%lld ",r[j][k]%mod); } } } } return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
