Category: Lightoj

02
Mar
2014

Lightoj Solutions: 1001 – Opposite Task

Problem Link : http://www.lightoj.com/volume_showproblem.php?problem=1001 Solution: #include<bits/stdc++.h> int main(){ int t,i,n; scanf(“%d”,&t); for(i=0;i<t;i++) { scanf(“%d”,&n); if(n>10) { printf(“%d %d\n”,n-10,n-(n-10));…

23
Feb
2014

Light Oj Solutions: 1000 – Greetings from LightOJ

Problem link: http://www.lightoj.com/volume_showproblem.php?problem=1000 Solution: This is a EOF related problem. #include<stdio.h> int main() { int counter,t,a,b,sum,i; counter=0;…