Task: | Sanat |
Sender: | OOliOO |
Submission time: | 2015-12-20 20:27:03 +0200 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | OUTPUT LIMIT EXCEEDED | 0 |
test | verdict | time | score | |
---|---|---|---|---|
#1 | OUTPUT LIMIT EXCEEDED | 0.00 s | 0 | details |
Code
#include <iostream>#include <vector>#include <stack>#include <queue>#include <algorithm>#include <cmath>#include <iomanip>#include <unordered_set>#include <stdio.h>#include <string.h>#include <unordered_map>#include <map>#include <fstream>#include <set>#include <list>#define MOD 1000000007#define N (2<<17)#define ll long longusing namespace std;int main(){string v="";int asd=0;for(int i=1;;i++){cout<<"@";v+=" ";cout<<v;for(int e=0; e<10000000; e++)asd++;}cout<<asd;return 0;}