fork download
copy 
  1. #include <queue>
  2. #include <vector>
  3. #include <list>
  4. #include <map>
  5. #include <set>
  6. #include <deque>
  7. #include <stack>
  8. #include <bitset>
  9. #include <algorithm>
  10. #include <functional>
  11. #include <numeric>
  12. #include <utility>
  13. #include <sstream>
  14. #include <iostream>
  15. #include <iomanip>
  16. #include <cstdio>
  17. #include <cmath>
  18. #include <cstdlib>
  19. #include <ctime>
  20. #include <complex>
  21. #include <fstream>
  22. #include <cstring>
  23. #include <string>
  24.  
  25. using namespace std;
  26.  
  27. //macros
  28. typedef long long ll;
  29. typedef complex<double> point;
  30. typedef pair<int,int> ii;
  31. typedef vector<int> vi;
  32. typedef vector< vector<int> > vvi;
  33.  
  34.  
  35.  
  36.  
  37. #define FOR(k,a,b) for(int k=(a); k<=(b); ++k)
  38. #define REP(k,a) for(int k=0; k<(a);++k)
  39. #define SZ(a) int((a).size())
  40. #define ALL(c) (c).begin(),(c).end()
  41. #define PB push_back
  42. #define MP make_pair
  43. #define INF 99999999
  44. #define MOD 1000000007
  45. #define MAX 100000
  46. #define ITERS 10000
  47. #define pi 3.1415926
  48.  
  49. int arr[1000][1000];
  50. int dpa[1000][1000];
  51. int dpb[1000][1000];
  52.  
  53. int main(){
  54. 	int n,m;
  55. 	cin >> n >> m;
  56.  
  57. 	REP(i,n){
  58. 		REP(j,m){
  59. 			int nxt;
  60. 			cin >> nxt;
  61. 			arr[i][j] = nxt;
  62. 		}
  63. 	}
  64.  
  65. }
  66.  
Success #stdin #stdout 0s 15128KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/FAkyZS
language:
C++14 (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!