yes, that is true.....
but i want to find the reason for run time error............
anyway, thanks..........
Search found 5 matches
- Thu Mar 09, 2006 8:13 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10973 - Triangle Counting
- Replies: 31
- Views: 19409
- Thu Mar 09, 2006 6:34 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10973 - Triangle Counting
- Replies: 31
- Views: 19409
- Sun Mar 05, 2006 1:20 am
- Forum: Volume 109 (10900-10999)
- Topic: 10973 - Triangle Counting
- Replies: 31
- Views: 19409
10973 - Triangle Counting
can anyone tell me why am i getting RE? I cant figure it out :(
#include <cstdio>
#include <vector>
#define MAX 3002
using namespace std;
int f1[MAX], f2[MAX];
int e[MAX][2];
vector<int> a[MAX];
int main() {
int i, j, s, t, n, m, test;
long long count;
scanf("%d", &test);
while(test ...
#include <cstdio>
#include <vector>
#define MAX 3002
using namespace std;
int f1[MAX], f2[MAX];
int e[MAX][2];
vector<int> a[MAX];
int main() {
int i, j, s, t, n, m, test;
long long count;
scanf("%d", &test);
while(test ...
- Sun Feb 12, 2006 9:57 am
- Forum: Volume 8 (800-899)
- Topic: 804 - Petri Net Simulation
- Replies: 9
- Views: 8899
How to make it fast?
People are solving this within a pretty small time limit........................I could get no better idea than brute force simulation.........Any idea?
- Sun Feb 12, 2006 6:40 am
- Forum: Volume 109 (10900-10999)
- Topic: 10994 - Simple Addition
- Replies: 41
- Views: 22279