oj.uz

Submission #15161

# Submission time Handle Problem Language Result Execution time Memory
15161 2015-07-12T02:11:21 Z BothEarRim 뚊 (kriii3_EE) C++
20 / 20
 0 ms 1720 KB 
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <utility>
#include <locale>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <climits>
#include <cfloat>
#include <map>
#include <functional>
using namespace std;
const double PI=acos(-1);

int main() // 제3회 kriiicon
{
	int r, c;
	char ipt[105][105], ipt2[105][105];
	scanf("%d %d", &r, &c);
	for(int i=0; i<r; i++) scanf("%s", ipt[i]);
	for(int i=0; i<r; i++) scanf("%s", ipt2[i]);

	bool ans = true;
	for(int i=0; i<r && ans; i++)
		for(int j=0; j<c; j++)
			if(ipt[i][j] != ipt2[i][2*j] || ipt[i][j] != ipt2[i][2*j+1])
			{
				ans = false;
				break;
			}

	printf("%sEyfa\n", ans? "":"Not ");

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1720 KB Output is correct
2 Correct 0 ms 1720 KB Output is correct
3 Correct 0 ms 1720 KB Output is correct
4 Correct 0 ms 1720 KB Output is correct
5 Correct 0 ms 1720 KB Output is correct
6 Correct 0 ms 1720 KB Output is correct
7 Correct 0 ms 1720 KB Output is correct
8 Correct 0 ms 1720 KB Output is correct
9 Correct 0 ms 1720 KB Output is correct
10 Correct 0 ms 1720 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1720 KB Output is correct
2 Correct 0 ms 1720 KB Output is correct
3 Correct 0 ms 1720 KB Output is correct
4 Correct 0 ms 1720 KB Output is correct
5 Correct 0 ms 1720 KB Output is correct
6 Correct 0 ms 1720 KB Output is correct
7 Correct 0 ms 1720 KB Output is correct
8 Correct 0 ms 1720 KB Output is correct
9 Correct 0 ms 1720 KB Output is correct
10 Correct 0 ms 1720 KB Output is correct