Cod sursa(job #2176260)
Utilizator | Data | 16 martie 2018 22:01:27 | |
---|---|---|---|
Problema | Distante | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <list>
#include <stack>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int a[100][100];
int main()
{
int t;
f>>t;
for(int i=1; i<=10; ++i)
for(int j=1; j<=10; ++j)
a[i][j]=i+j;
for(int i=1; i<=t; ++i)
if(i%2)
g<<"DA"<<endl;
else g<<"NU"<<endl;
return 0;
}