# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3382 | solveit | Cactus? Not cactus? (kriii1_C) | C++98 | 0 ms | 1672 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <string>
#include <math.h>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
int N, M;
int main() {
scanf("%d %d",&N, &M);
for(int i = 0;i<M;i++) {
int u, v;
scanf("%d %d",&u, &v);
}
if(M <= N)
printf("Cactus\n");
else
printf("Not cactus\n");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |