Submission #1177564


Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j;
  char a[10][11]={};
  rep(i,10)rep(j,10)a[i][j]='.';
  a[2][5]='C';
  a[8][5]='C';
  rep(i,10)
    cout<<a[i]<<endl;
}

Submission Info

Submission Time
Task B - GUARDIANS
User rika0384
Language C++14 (GCC 5.4.1)
Score 0
Code Size 776 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
WA × 1
Set Name Test Cases
All dummy.txt
Case Name Status Exec Time Memory
dummy.txt WA 1 ms 256 KB