Pagini recente » Diferente pentru tree-decompositions intre reviziile 81 si 91 | Cod sursa (job #2404365) | Cod sursa (job #1419254) | Cod sursa (job #1349234) | Cod sursa (job #2385842)
#include <iostream>
using namespace std;
int main()
{
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
while (1)
{
cout<<"xaxa";
}
return 0;
}